English

Quantifying Noninvertibility in Discrete Dynamical Systems

Combinatorics 2020-09-29 v4

Abstract

Given a finite set XX and a function f:XXf:X\to X, we define the degree of noninvertibility of ff to be deg(f)=1XxXf1(f(x))\displaystyle\text{deg}(f)=\frac{1}{|X|}\sum_{x\in X}|f^{-1}(f(x))|. This is a natural measure of how far the function ff is from being bijective. We compute the degrees of noninvertibility of some specific discrete dynamical systems, including the Carolina solitaire map, iterates of the bubble sort map acting on permutations, bubble sort acting on multiset permutations, and a map that we call "nibble sort." We also obtain estimates for the degrees of noninvertibility of West's stack-sorting map and the Bulgarian solitaire map. We then turn our attention to arbitrary functions and their iterates. In order to compare the degree of noninvertibility of an arbitrary function f:XXf:X\to X with that of its iterate fkf^k, we prove that maxf:XXX=ndeg(fk)deg(f)γ=Θ(n11/2k1)\max_{\substack{f:X\to X\\ |X|=n}}\frac{\text{deg}(f^k)}{\text{deg}(f)^\gamma}=\Theta(n^{1-1/2^{k-1}}) for every real number γ21/2k1\gamma\geq 2-1/2^{k-1}. We end with several conjectures and open problems.

Keywords

Cite

@article{arxiv.2002.07144,
  title  = {Quantifying Noninvertibility in Discrete Dynamical Systems},
  author = {Colin Defant and James Propp},
  journal= {arXiv preprint arXiv:2002.07144},
  year   = {2020}
}

Comments

18 pages, 1 figure

R2 v1 2026-06-23T13:44:23.761Z