Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

8

COMBINATORICS
2000

favoriteEmaildiscussreport

88views more COMBINATORICS 2000»

An Infinite Antichain of Permutations

13 years 4 months ago

An Infinite Antichain of Permutations

Download www.combinatorics.org

We constructively prove that the partially ordered set of finite permutations ordered by deletion of entries contains an infinite antichain. In other words, there exists an infinite collection of permutations no one of which contains another as a pattern.

Daniel A. Spielman, Miklós Bóna

Real-time Traffic

COMBINATORICS 2000 | Infinite Antichain | Permutations |

claim paper

Related Content

» Infinite antichains of matroids with characteristic set p

» Antichains in Products of Linear Orders

» How To Split Antichains In Infinite Posets

» Descending Chains and Antichains of the Unary Linear and Monotone Subfunction Relations

» Some Algebraic Properties of Machine Poset of Infinite Words

» Partially WellOrdered Closed Sets of Permutations

» Simple permutations Decidability and unavoidable substructures

» Permutations Generated by a Stack of Depth 2 and an Infinite Stack in Series

» Maximal Contiguous Degrees

Post Info
More Details (n/a)

Added	17 Dec 2010
Updated	17 Dec 2010
Type	Journal
Year	2000
Where	COMBINATORICS
Authors	Daniel A. Spielman, Miklós Bóna

Comments (0)