Sciweavers

25 search results - page 1 / 5
» A Combinatorial Proof of Kneser's Conjecture
Sort
View
COMBINATORICA
2004
100views more  COMBINATORICA 2004»
13 years 10 months ago
A Combinatorial Proof of Kneser's Conjecture
Jirí Matousek
ISVD
2007
IEEE
14 years 5 months ago
From the Kneser-Poulsen conjecture to ball-polyhedra via Voronoi diagrams
A very fundamental geometric problem on finite systems of spheres was independently phrased by Kneser (1955) and Poulsen (1954). According to their well-known conjecture if a fi...
Károly Bezdek
FOCS
2002
IEEE
14 years 3 months ago
The Hardness of 3 - Uniform Hypergraph Coloring
We prove that coloring a 3-uniform 2-colorable hypergraph with c colors is NP-hard for any constant c. The best known algorithm [20] colors such a graph using O(n1/5 ) colors. Our...
Irit Dinur, Oded Regev, Clifford D. Smyth
JCT
2006
55views more  JCT 2006»
13 years 10 months ago
A proof of the q, t-square conjecture
We prove a combinatorial formula conjectured by Loehr and Warrington for the coefficient of the sign character in (pn). Here denotes the Bergeron-Garsia nabla operator, and pn is a...
Mahir Can, Nicholas A. Loehr
COMBINATORICS
2004
96views more  COMBINATORICS 2004»
13 years 10 months ago
Conjectured Combinatorial Models for the Hilbert Series of Generalized Diagonal Harmonics Modules
Haglund and Loehr previously conjectured two equivalent combinatorial formulas for the Hilbert series of the Garsia-Haiman diagonal harmonics modules. These formulas involve weigh...
Nicholas A. Loehr, Jeffrey B. Remmel