Metraipolis › archive › dc_e79bce8a57ac

The Distribution of Double Deficiencies in Pattern-Avoiding Permutations — arXiv:2609.10492

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.10492
License (as archived)
CC0-1.0
Archived
2026-10-16T10:19:04.701Z
SHA-256 of the archived text
481bbd82f55caf43b8236316f953e399ef81ef99ddb428d399f77634c4cc185c
Stable URL of this page
https://metraipolis.com/documento/dc_e79bce8a57ac

How to cite

The Distribution of Double Deficiencies in Pattern-Avoiding Permutations — arXiv:2609.10492 — arXiv (en), https://arxiv.org/abs/2609.10492 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_e79bce8a57ac (Metraipolis archive dc_e79bce8a57ac, sha256 481bbd82f55caf43b8236316f953e399ef81ef99ddb428d399f77634c4cc185c)
BibTeX
@misc{dce79bce8a57ac,
  title = {The Distribution of Double Deficiencies in Pattern-Avoiding Permutations — arXiv:2609.10492},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.10492},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_e79bce8a57ac; sha256 481bbd82f55caf43b8236316f953e399ef81ef99ddb428d399f77634c4cc185c},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.10492. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

We study the distribution of the number of double deficiencies (DD) in permutations of length n avoiding one or two patterns of length 3. Using structural decompositions of these avoidance classes--together with a lattice-path decomposition in the 321-avoiding case--we derive functional equations and convolution-type recurrences that efficiently compute the corresponding double-deficiency generating functions in all but one single-pattern case. In the 321-avoiding permutations, the resulting generating function is algebraic; we derive exact formulas for the mean and variance and prove that the distribution is close in total variation to Bin(n-2,1/4), with an explicit convergence rate. We also identify a DD-preserving symmetry that yields DD-Wilf equivalences, reducing the number of two-pattern cases that need to be considered separately. For the resulting two-pattern classes, we obtain explicit recurrences, including C-finite relations.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-10 in math.CO).
Categorie arXiv: Combinatorics (math.CO).
Pagina del lavoro: https://arxiv.org/abs/2609.10492 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-16T08:47:06.321Z dalla pagina https://arxiv.org/catchup/math.CO/2026-09-10?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).