EUVIMEDEUVIMED entdecken
Crossref

A Central Limit Theorem for Repeating Patterns

Aaron Abrams, Eric Babson, Henry Landau, Zeph Landau, James Pommersheim

The Electronic Journal of Combinatorics · 19.06.2026 · 33 (2)

DOI: 10.37236/13304 ↗

Kurz gefasst

Fachartikel in der Zeitschrift The Electronic Journal of Combinatorics, online erschienen am 19.06.2026. Verfasst von Aaron Abrams und 4 weiteren Autor:innen.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

We prove a central limit theorem for the length of the longest subsequence of a random permutation which follows one of a class of repeating patterns. This class includes every fixed pattern of ups and downs having at least one of each, such as the alternating case considered by Stanley (2008) and Widom (2006). In every case considered the convergence in the limit of long permutations is to normal with mean and variance linear in the length of the permutation.

Zitieren

APA

Abrams, A., Babson, E., Landau, H., Landau, Z., & Pommersheim, J. (2026). A Central Limit Theorem for Repeating Patterns. The Electronic Journal of Combinatorics, 33(2). https://doi.org/10.37236/13304

Vancouver

Abrams A, Babson E, Landau H, Landau Z, Pommersheim J. A Central Limit Theorem for Repeating Patterns. The Electronic Journal of Combinatorics. 2026;33(2). doi:10.37236/13304

BibTeX
@article{Abrams2026,
  author = {Abrams, Aaron and Babson, Eric and Landau, Henry and Landau, Zeph and Pommersheim, James},
  title = {A Central Limit Theorem for Repeating Patterns},
  journal = {The Electronic Journal of Combinatorics},
  year = {2026},
  volume = {33},
  number = {2},
  doi = {10.37236/13304}
}
Kostenlos starten →