Metraipolis › archive › dc_89efe5f94085

Distinct flattened partitions avoiding a pattern of length four — arXiv:2610.11271

Source
arXiv (en)
Original
https://arxiv.org/abs/2610.11271
License (as archived)
CC0-1.0
Archived
2026-10-09T06:29:02.379Z
SHA-256 of the archived text
aace54e2a1bfc09e0ce6fe7ae04851e9bbb4942cb4c14d37c8c9bb755474698d
Stable URL of this page
https://metraipolis.com/documento/dc_89efe5f94085

How to cite

Distinct flattened partitions avoiding a pattern of length four — arXiv:2610.11271 — arXiv (en), https://arxiv.org/abs/2610.11271 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_89efe5f94085 (Metraipolis archive dc_89efe5f94085, sha256 aace54e2a1bfc09e0ce6fe7ae04851e9bbb4942cb4c14d37c8c9bb755474698d)
BibTeX
@misc{dc89efe5f94085,
  title = {Distinct flattened partitions avoiding a pattern of length four — arXiv:2610.11271},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2610.11271},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_89efe5f94085; sha256 aace54e2a1bfc09e0ce6fe7ae04851e9bbb4942cb4c14d37c8c9bb755474698d},
  year = {2026}
}

Archived text

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

Let $\mathcal{P}_n$ denote the set of distinct permutations of length $n$ that arise from the flattening process applied to the partitions of $[n]=\{1,\ldots,n\}$. In this paper, we consider the problem of avoidance of a single classical pattern of length four by members of $\mathcal{P}_n$. Let $p_n(\tau)$ denote the number of members of $\mathcal{P}_n$ that avoid the pattern $\tau$. We show that $p_n(\tau)=C_{n-1}$ for all $n \geq 1$ for seven patterns of length four yielding new combinatorial interpretations of the Catalan number sequence. Further, we show that $p_n(\tau)$ corresponds to the binomial transform of Catalan numbers for three other patterns. To establish our results, we suitably refine the counting sequence $p_n(\tau)$ in each case so as to obtain a system of functional equations satisfied by the corresponding generating functions. These functional equations may then be solved explicitly leading to a determination of $p_n(\tau)$ in each case.

Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.CO, nuovi lavori del giorno).
Categorie arXiv: Combinatorics (math.CO).
Pagina del lavoro: https://arxiv.org/abs/2610.11271 — 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-09T05:53:57.189Z dalla pagina https://arxiv.org/list/math.CO/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).