Back to Search
Start Over
On convex permutations
- Source :
- Discrete Mathematics. 311(8-9):715-722
- Publication Year :
- 2011
- Publisher :
- Elsevier BV, 2011.
-
Abstract
- A selection of points drawn from a convex polygon, no two with the same vertical or horizontal coordinate, yields a permutation in a canonical fashion. We characterise and enumerate those permutations which arise in this manner and exhibit some interesting structural properties of the permutation class they form. We conclude with a permutation analogue of the celebrated Happy Ending Problem. Preprint
- Subjects :
- Discrete mathematics
Mathematics::Combinatorics
Insertion encoding
Algebraic generating function
Partial permutation
Bit-reversal permutation
Restricted permutation
Permutation matrix
Random permutation
Cyclic permutation
Theoretical Computer Science
Combinatorics
Derangement
Permutation
Permutation class
Permutation graph
Discrete Mathematics and Combinatorics
QA Mathematics
QA
Mathematics
Subjects
Details
- ISSN :
- 0012365X
- Volume :
- 311
- Issue :
- 8-9
- Database :
- OpenAIRE
- Journal :
- Discrete Mathematics
- Accession number :
- edsair.doi.dedup.....10a8fbfff533cce9108b2058ed66341e
- Full Text :
- https://doi.org/10.1016/j.disc.2011.01.009