๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Matrices of zeros and ones with the maximum jump number

โœ Scribed by Bo Cheng; Bolian Liu

Publisher
Elsevier Science
Year
1998
Tongue
English
Weight
482 KB
Volume
277
Category
Article
ISSN
0024-3795

No coin nor oath required. For personal study only.

โœฆ Synopsis

Let A : (aij) be an m x n matrix. There is a natural way to associate a poset PA with A. Let xt,... ,xm and Yl,... ,Yn be disjoint sets of m and n elements, respectively, and define x~ < y/if and only if aij ยข 0. A jump in a linear extension of PA iS a pair of consecutive elements which are incomparable in P. The maximum jump number over a class of n x n matrices of zeros and ones with constant row and column sum k, M(n, k), has been

๐Ÿ“œ SIMILAR VOLUMES

Maximum determinants of complementary ac
Maximum determinants of complementary acyclic matrices of zeros and ones
โœ Richard A Brualdi; Ernie S Solheid ๐Ÿ“‚ Article ๐Ÿ“… 1986 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 929 KB

We show that for n >~ 5 the maximum determinant of an n x n matrix of zeros and ones whose zeros form an acyclic pattern is [(n-1)/2] [(n-1)/2] and characterize the case of equality. 1 We are indebted to H.J. Ryser for some of the references in this paragraph.

Chromatic number of classes of matrices
Chromatic number of classes of matrices of zeros and ones
โœ Richard A. Brualdi; Rachel Manber ๐Ÿ“‚ Article ๐Ÿ“… 1984 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 505 KB

We investigate the chromatic number of a class of matrices of O's and l's with given row and column sum vectors, equivalently the chromatic number of hypergraphs with given degree and dual-degree sequences.