9 search results - page 2 / 2 » On a generalisation of the Dipper-James-Murphy conjecture |
106
click to vote
MKM
2007
Springer
15 years 8 months ago
2007
Springer
Abstract. In previous papers we described the implementation of a system which combines mathematical object generation, transformation and filtering, conjecture generation, provin...
133
click to vote
WCC
2005
Springer
15 years 7 months ago
2005
Springer
We relate the one- and two-variable interlace polynomials of a graph to the spectra of a quadratic boolean function with respect to a strategic subset of local unitary transforms. ...
121
click to vote
CCCG
2009
15 years 3 months ago
2009
We prove the following generalised empty pentagon theorem: for every integer 2, every sufficiently large set of points in the plane contains collinear points or an empty pentagon...
170
click to vote
FOCS
2002
IEEE
15 years 6 months ago
2002
IEEE
The Constraint Satisfaction Problem (CSP) provides a common framework for many combinatorial problems. The general CSP is known to be NP-complete; however, certain restrictions on...