25 search results - page 3 / 5 » A Combinatorial Proof of Kneser's Conjecture |
82
Voted
JAL
2006
15 years 6 days ago
2006
Egecioglu and Remmel [2] gave an interpretation for the entries of the inverse Kostka matrix K-1 in terms of special rim-hook tableaux. They were able to use this interpretation to...
APAL
2010
15 years 10 days ago
2010
Classical proof forests are a proof formalism for first-order classical logic based on Herbrand's Theorem and backtracking games in the style of Coquand. First described by M...
TCS
1998
14 years 12 months ago
1998
Abstract. We show that Turyn’s conjecture, arising from the Theory of Error Correcting Codes, has an equivalent formulation in Dynamical Systems Theory. In particular, Turyn’s ...
95
Voted
COMBINATORICS
2006
15 years 8 days ago
2006
In this paper we study inversions within restricted fillings of Young tableaux. These restricted fillings are of interest because they describe geometric properties of certain sub...
93
Voted
FOCS
2008
IEEE
15 years 6 months ago
2008
IEEE
We show that the combinatorial complexity of the union of n infinite cylinders in R3 , having arbitrary radii, is O(n2+ε ), for any ε > 0; the bound is almost tight in the w...