173 search results - page 8 / 35 » A Proof of the Two-path Conjecture |
COCO
1995
Springer
15 years 3 months ago
1995
Springer
The instance complexity of a string x with respect to a set A and time bound t, ict (x : A), is the length of the shortest program for A that runs in time t, decides x correctly, ...
ISVD
2007
IEEE
15 years 6 months ago
2007
IEEE
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...
JSC
2008
14 years 11 months ago
2008
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...
COMBINATORICS
2004
14 years 11 months ago
2004
Haglund and Loehr previously conjectured two equivalent combinatorial formulas for the Hilbert series of the Garsia-Haiman diagonal harmonics modules. These formulas involve weigh...
COMBINATORICS
2004
14 years 11 months ago
2004
A graph G is well-covered if every maximal independent set has the same cardinality. Let sk denote the number of independent sets of cardinality k, and define the independence pol...