Suballowable sequences and geometric permutations

DOI10.1016/j.disc.2007.08.086zbMath1173.05002OpenAlexW2038647726MaRDI QIDQ942103

Andrei Asinowski

Publication date: 4 September 2008

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2007.08.086

zbMATH Keywords

geometric permutationconfiguration of pointsallowable sequence of permutationssuballowable sequence of permutations

Mathematics Subject Classification ID

Permutations, words, matrices (05A05)

Related Items (2)

Monotone Simultaneous Embeddings of Paths in d Dimensions ⋮ Arrangements of approaching pseudo-lines

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The maximum number of ways to stab n convex nonintersecting sets in the plane is 2n-2
• Teilungen der Ebenen durch Geraden oder topologische Geraden
• The number of small semispaces of a finite set of points in the plane
• Geometric permutations and common transversals
• On the combinatorial classification of nondegenerate configurations in the plane
• 2N noncollinear points determine at least 2N directions
• Proof of Grünbaum's conjecture on common transversals for translates
• Forbidden subsequences
• Permutations which are the union of an increasing and a decreasing subsequence
• On neighbors in geometric permutations.
• Geometric permutations for convex sets

This page was built for publication: Suballowable sequences and geometric permutations