ECCC
2007
13 years 11 months ago
2007
Let p be a fixed prime number, and N be a large integer. The ’Inverse Conjecture for the Gowers norm’ states that if the ”d-th Gowers norm” of a function f : FN p → F i...
JCT
2006
13 years 11 months ago
2006
We prove that a conjecture of Fomin, Fulton, Li, and Poon, associated to ordered pairs of partitions, holds for many infinite families of such pairs. We also show that the bounded ...
DM
2007
13 years 11 months ago
2007
A quasigroup (Q, ∗) is called totally anti-symmetric if (c ∗ x) ∗ y = (c ∗ y) ∗ x ⇒ x = y and x∗y = y∗x ⇒ x = y. A totally anti-symmetric quasigroup can be used ...
JAPLL
2006
13 years 11 months ago
2006
A conjecture by D. Seese states that if a set of graphs has a decidable monadic second-order theory, then it is the image of a set of trees under a transformation defined by monad...
JCT
2008
13 years 11 months ago
2008
We exhibit a a counterexample to a conjecture of Thomassen stating that the number of distinct 3-colorings of every graph whose 3color matrix has full column rank is superpolynomi...
JCT
2008
13 years 11 months ago
2008
A conjecture by Bollob
DM
2006
13 years 11 months ago
2006
Berge's conjecture from 1982 on path partitions in directed graphs generalizes and extends Dilworth's Theorem and the Greene-Kleitman Theorem which are well known for pa...
DM
2006
13 years 11 months ago
2006
We conjecture new sufficient conditions for a digraph to have a Hamilton cycle. In view of applications, the conjecture is of interest in the areas where unitary matrices are of i...
ENDM
2008
13 years 11 months ago
2008
The structure of all known infinite families of crossing
EJC
2008
13 years 11 months ago
2008
Wang and Lih conjectured that for every g 5, there exists a number M(g) such that the square of a planar graph G of girth at least g and maximum degree M(g) is (+1)-colorable. ...