✦ LIBER ✦

Monotone subsequences in (0, 1)-matrices

✍ Scribed by F. R. K. Chung; P. C. Fishburn; V. K. Wei

Publisher: Springer Japan
Year: 1986
Tongue: English
Weight: 298 KB
Volume: 2
Category: Article
ISSN: 0911-0119
DOI: 10.1007/bf01788074

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Monotone Subsequences in Any Dimension

✍ Ryan Siders 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 147 KB

We exhibit sequences of n points in d dimensions with no long monotone subsequences, by which we mean when projected in a general direction, our sequence has no monotone subsequences of length -n+d or more. Previous work proved that this function of n would lie betweenn and 2 -n; this paper establis

Monotonic subsequences in random sequenc

Monotonic subsequences in random sequences

✍ John D. Dixon 📂 Article 📅 1975 🏛 Elsevier Science 🌐 English ⚖ 502 KB

Best monotone approximations in L1[0, 1]

✍ Robert Huotari; Aaron D. Meyerowitz; Michael Sheard 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 327 KB

Best monotone approximation in L∞[0, 1]

✍ David Legg; Douglas Townsend 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 238 KB

On the 0–1 matrices whose squares are 0–

On the 0–1 matrices whose squares are 0–1 matrices

✍ Honglin Wu 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 247 KB

Ideal 0, 1 Matrices

✍ G. Cornuejols; B. Novick 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 533 KB

We define a 0,1 matrix \(M\) to be ideal if all vertices of the polyhedron \(\{x: M x \geqslant 1\), \(x \geqslant 0\}\) have only 0,1 components. We expand the list of known minor minimal nonideal matrices by several thousand. Many of these examples are obtained polyhedrally, by constructing new mi