9 search results - page 2 / 2 » On a generalisation of the Dipper-James-Murphy conjecture |
MKM
2007
Springer
13 years 11 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...
WCC
2005
Springer
13 years 10 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. ...
CCCG
2009
13 years 6 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...
FOCS
2002
IEEE
13 years 10 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...