5 search results - page 1 / 1 » On Kramer-Mesner matrix partitioning conjecture |
DM
2010
13 years 4 months ago
2010
In 1977, Ganter and Teirlinck proved that any 2t
COMBINATORICS
2002
13 years 4 months ago
2002
We consider Kasteleyn and Kasteleyn-Percus matrices, which arise in enumerating matchings of planar graphs, up to matrix operations on their rows and columns. If such a matrix is ...
JCT
2007
13 years 4 months ago
2007
A matrix A is said to be partition regular (PR) over a subset S of the positive integers if whenever S is finitely coloured, there exists a vector x, with all elements in the sam...
CORR
2011
Springer
12 years 8 months ago
2011
Springer
: The Bethe Permanent of a Non-Negative Matrix Pascal O. Vontobel HP Laboratories HPL-2011-116 Bethe approximation; Bethe permanent; graph cover; partition function; perfect ma...
JCT
2006
13 years 4 months ago
2006
Multirestricted Stirling numbers of the second kind count the number of partitions of a given set into a given number of parts, each part being restricted to at most a fixed number...