Sciweavers

35 search results - page 3 / 7
» Proof of a Chromatic Polynomial Conjecture
Sort
View
DCG
1998
66views more  DCG 1998»
14 years 9 months ago
The Volume as a Metric Invariant of Polyhedra
It is proved that in R3 the volume of any polyhedron is a root of some polynomial with coefficients depending only on the combinatorial structure and the metric of the polyhedron....
Idzhad Kh. Sabitov
CCCG
2003
14 years 10 months ago
Coloring Objects Built From Bricks
We address a question posed by Sibley and Wagon. They proved that rhombic Penrose tilings in the plane can be 3colored, but a key lemma of their proof fails in the natural 3D gene...
Suzanne Gallagher, Joseph O'Rourke
JSC
2008
58views more  JSC 2008»
14 years 9 months ago
A Groebner basis approach to solve a Conjecture of Nowicki
Let k be a field of characteristic zero, n any positive integer and let n be the derivation n i=1 Xi Yi of the polynomial ring k[X1, . . . , Xn, Y1, . . . , Yn] in 2n variables o...
Joseph Khoury
DM
2010
77views more  DM 2010»
14 years 9 months ago
Hall-Littlewood polynomials and fixed point enumeration
We resolve affirmatively some conjectures of Reiner, Stanton, and White [6] regarding enumeration of various classes of matrices which are invariant under certain cyclic row and co...
Brendon Rhoades
COMBINATORICA
2008
89views more  COMBINATORICA 2008»
14 years 9 months ago
The stable set polytope of quasi-line graphs
It is a long standing open problem to find an explicit description of the stable set polytope of clawfree graphs. Yet more than 20 years after the discovery of a polynomial algori...
Friedrich Eisenbrand, Gianpaolo Oriolo, Gautier St...