EUVIMEDEUVIMED entdecken
Crossref

Pattern avoidance in compositions and powers of permutations

Kassie Archer, Noel Bourne

Discrete Mathematics & Theoretical Computer Science · 19.05.2026 · vol. 28:1, Permutation... (Special issues)

DOI: 10.46298/dmtcs.17199 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Discrete Mathematics & Theoretical Computer Science, online erschienen am 19.05.2026. Verfasst von Kassie Archer und 1 weiteren Autor:innen.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

A permutation $π$ is said to avoid a chain $(σ:τ)$ of patterns if $π$ avoids $σ$ and $π^2$ avoids $τ.$ In this paper, we define a notion of pattern avoidance for compositions of positive integers and use that idea to enumerate permutations of length $n$ that avoid the chain $(312,321:σ)$ for any pattern $σ\in \bigcup_{m\geq 1} S_m$. We also enumerate those permutations that avoid the chain $(312,4321:σ)$ for any $σ\in S_3.$

Zitieren

APA

Archer, K., & Bourne, N. (2026). Pattern avoidance in compositions and powers of permutations. Discrete Mathematics & Theoretical Computer Science, vol. 28:1, Permutation...(Special issues). https://doi.org/10.46298/dmtcs.17199

Vancouver

Archer K, Bourne N. Pattern avoidance in compositions and powers of permutations. Discrete Mathematics & Theoretical Computer Science. 2026;vol. 28:1, Permutation...(Special issues). doi:10.46298/dmtcs.17199

BibTeX
@article{Archer2026,
  author = {Archer, Kassie and Bourne, Noel},
  title = {Pattern avoidance in compositions and powers of permutations},
  journal = {Discrete Mathematics & Theoretical Computer Science},
  year = {2026},
  volume = {vol. 28:1, Permutation...},
  number = {Special issues},
  doi = {10.46298/dmtcs.17199}
}
Kostenlos starten →