Sciweavers

178 search results - page 23 / 36
» combinatorics 2007
Sort
View
COMBINATORICS
2007
72views more  COMBINATORICS 2007»
13 years 11 months ago
Matrix Partitions with Finitely Many Obstructions
Each m by m symmetric matrix M over 0, 1, ∗, defines a partition problem, in which an input graph G is to be partitioned into m parts with adjacencies governed by M, in the sen...
Tomás Feder, Pavol Hell, Wing Xie
COMBINATORICS
2007
74views more  COMBINATORICS 2007»
13 years 11 months ago
Bipartite-Uniform Hypermaps on the Sphere
A hypermap is (hypervertex-) bipartite if its hypervertices can be 2-coloured in such a way that “neighbouring” hypervertices have different colours. It is bipartiteuniform i...
Antonio Breda d'Azevedo, Rui Duarte
COMBINATORICS
2007
60views more  COMBINATORICS 2007»
13 years 11 months ago
Higher Spin Alternating Sign Matrices
We define a higher spin alternating sign matrix to be an integer-entry square matrix in which, for a nonnegative integer r, all complete row and column sums are r, and all partia...
Roger E. Behrend, Vincent A. Knight
COMBINATORICS
2007
118views more  COMBINATORICS 2007»
13 years 11 months ago
On the Quantum Chromatic Number of a Graph
We investigate the notion of quantum chromatic number of a graph, which is the minimal number of colours necessary in a protocol in which two separated provers can convince a refe...
Peter J. Cameron, Ashley Montanaro, Michael W. New...
ACL
1990
14 years 2 days ago
Free Indexation: Combinatorial Analysis and a Compositional Algorithm
The principle known as 'free indexation' plays an important role in the determination of the referential properties of noun phrases in the principleand-parameters langua...
Sandiway Fong