Metraipolis › archive › dc_8fcf5e6ebef5

Matchings and shape-Wilf-Equivalence of sets of patterns of length three I: Triples — arXiv:2609.08562

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.08562
License (as archived)
CC0-1.0
Archived
2026-10-16T14:49:00.744Z
SHA-256 of the archived text
272bc68de212f63ddb6e9f141ac2fd834d01f5065329b534f6003b5eb944b3d4
Stable URL of this page
https://metraipolis.com/documento/dc_8fcf5e6ebef5

How to cite

Matchings and shape-Wilf-Equivalence of sets of patterns of length three I: Triples — arXiv:2609.08562 — arXiv (en), https://arxiv.org/abs/2609.08562 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_8fcf5e6ebef5 (Metraipolis archive dc_8fcf5e6ebef5, sha256 272bc68de212f63ddb6e9f141ac2fd834d01f5065329b534f6003b5eb944b3d4)
BibTeX
@misc{dc8fcf5e6ebef5,
  title = {Matchings and shape-Wilf-Equivalence of sets of patterns of length three I: Triples — arXiv:2609.08562},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.08562},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_8fcf5e6ebef5; sha256 272bc68de212f63ddb6e9f141ac2fd834d01f5065329b534f6003b5eb944b3d4},
  year = {2026}
}

Archived text

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

Permutation pattern avoidance on Ferrers boards has become a central topic in enumerative combinatorics with important connections to matchings, set partitions, and other combinatorial structures as it allows one to build families of Wilf-equivalent patterns. While shape-Wilf-equivalence classes have been completely determined for individual patterns and pairs of patterns of length three, the corresponding classification for larger pattern sets has remained open. In this paper, we provide a complete classification of the shape-Wilf-equivalence classes of triples of patterns of length three. Our proofs use a bijective encoding of pattern avoiding transversals to establish all equivalence classes. As an application, we enumerate matchings avoiding triples of patterns of length three for all but two equivalence classes, extending previous results of Bloom and Elizalde. These enumerative results identify additional families of combinatorial objects counted by the Fuss-Catalan numbers and by other integer sequences appearing in the OEIS.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-09 in math.CO).
Categorie arXiv: Combinatorics (math.CO).
Pagina del lavoro: https://arxiv.org/abs/2609.08562 — 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-16T14:32:29.858Z dalla pagina https://arxiv.org/catchup/math.CO/2026-09-09?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).