✦ LIBER ✦

Onn-column 0, 1-matrices with allk-projections surjective

✍ Scribed by Hongzhong Wu

Publisher: Springer-Verlag
Year: 1994
Tongue: English
Weight: 595 KB
Volume: 31
Category: Article
ISSN: 0001-5903
DOI: 10.1007/bf01218407

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Singular (0,1) matrices with constant ro

Singular (0,1) matrices with constant row and column sums

✍ Norman J. Pullman; Miriam Stanford 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 696 KB

On asymmetric (0, 1)-matrices with given

On asymmetric (0, 1)-matrices with given row and column sum vectors

✍ Kevin McDougal 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 163 KB

A condition is provided which ensures that a class of (0, 1)-matrices with given row and column sum vectors must contain an asymmetric matrix.

Depth of (0, 1)-matrices with the same r

Depth of (0, 1)-matrices with the same row and same column sums

✍ V. E. Tarakanov 📂 Article 📅 1983 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 600 KB

Asymptotic enumeration of 0–1 matrices w

Asymptotic enumeration of 0–1 matrices with equal row sums and equal column sums

✍ Brendan D. McKay; Xiaoji Wang 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 158 KB

Let s, t, m, n be positive integers such that sm = tn. Define N (s, t; m, n) to be the number of m × n matrices with entries from {0, 1}, such that each row sum is s and each column sum is t. Equivalently, N(s, t; m, n) is the number of labelled semiregular bipartite graphs, where one colour class c