Quantifying noninvertibility in discrete dynamical systems

DOI10.37236/9475zbMath1475.37045arXiv2002.07144OpenAlexW3083469310MaRDI QIDQ2200430

Colin Defant, James Propp

Publication date: 21 September 2020

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2002.07144

zbMATH Keywords

Bulgarian solitaire mapCarolina solitaire mapdegree of noninvertibility

Mathematics Subject Classification ID

Combinatorial aspects of partitions of integers (05A17) Permutations, words, matrices (05A05) Iteration theory, iterative and composite equations (39B12) Combinatorial dynamics (types of periodic orbits) (37E15) Random iteration (37H12)

Related Items (6)

Fertilitopes ⋮ The minimal sum of squares over partitions with a nonnegative rank ⋮ The expected degree of noninvertibility of compositions of functions and a related combinatorial identity ⋮ Troupes, cumulants, and stack-sorting ⋮ Preimages under the bubblesort operator ⋮ Troupes, cumulants, and stack-sorting

Uses Software

• OEIS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The biHecke monoid of a finite Coxeter group and its representations.
• Descent polynomials for permutations with bounded drop size
• Random mappings with constraints on coalescence and number of origins
• The cycling of partitions and composition under repeated shifts
• A survey of stack-sorting disciplines
• Counting 3-stack-sortable permutations
• Preimages under the stack-sorting algorithm
• Combinatorics of Permutations
• 30 Years of Bulgarian Solitaire
• Postorder Preimages
• Asymptotic formulae for partition ranks

This page was built for publication: Quantifying noninvertibility in discrete dynamical systems