86
Voted
APAL
1998
14 years 12 months ago
1998
We prove conjectures of Herrmann and Stob by showing that the dense simple sets are orbit complete w.r.t. the simple sets.
100
Voted
COMBINATORICS
2000
15 years 2 days ago
2000
We prove a conjecture of Cohn and Propp, which refines a conjecture of Bosley and Fidkowski about the symmetry of the set of alternating sign matrices (ASMs). We examine data aris...
91
Voted
COMBINATORICS
2004
15 years 3 days ago
2004
New conjectures are proposed on the numbers of FPL configurations pertaining to certain types of link patterns. Making use of the Razumov and Stroganov Ansatz, these conjectures a...
72
Voted
EJC
2010
15 years 10 days ago
2010
A graph is k-linked (k-edge-linked), k 1, if for each k pairs of vertices x1, y1,
99
Voted
ARSCOM
2008
15 years 12 days ago
2008
Let P be a polygon whose vertices have been colored (labeled) cyclically with the numbers 1, 2, . . . , c. Motivated by conjectures of Propp, we are led to consider partitions of ...
111
Voted
ECAI
2004
Springer
15 years 4 months ago
2004
Springer
We describe a flexible approach to automated reasoning, where non-theorems can be automatically altered to produce proved results which are related to the original. This is achieve...