Skip to content
DraconiticResearch
Search Sources API
197,761 studies31 sourcesUpdated 20 min ago
PreprintPublisher termsHAL

Return-Growth Sequences: Euler Enumeration and Pattern Avoidance

  • Igor Kleiner
Open at sourcePDFCite

Related

  1. Pattern avoidance in alternating sign rectangles I: Extended avoidance
    Hans Höngesberg, Matjaž Konvalinka, Svante Linusson
    arXivPreprintCC BY 4.0Full textCombinatorics & discrete mathematicsarXiv
  2. Pattern avoidance classes of parking permutations with fixed lucky sets
    Melanie Ferreri, Lucy Martinez
    arXivPreprintCC BY 4.0Full textCombinatorics & discrete mathematicsarXiv
  3. Staircase diagrams, pattern avoidance, and smooth permutations
    Faqruddin Ali Azam, Edward Richmond
    arXivPreprintCC BY 4.0Full textCombinatorics & discrete mathematicsarXiv
  4. Protected tails and polynomial-time enumeration of permutations avoiding a direct sum of an increasing pattern and 231
    Henning Arnór Skeggi Úlfarsson
    arXivPreprintCC BY 4.0Full textCombinatorics & discrete mathematicsarXiv
  5. Vocabulary Growth Fundamentals: Bernstein Functions and Hausdorff Sequences
    Łukasz Dębowski
    arXivPreprintarXiv licenceFull textProbabilityarXiv

Cite

BibTeXRIS
BibTeX
@misc{kleiner2026returngrowth,
  title = {{Return-Growth Sequences: Euler Enumeration and Pattern Avoidance}},
  author = {Igor Kleiner},
  howpublished = {HAL},
  year = {2026},
  month = sep,
  url = {https://hal.science/hal-05736430v1},
}
RIS
TY  - UNPB
TI  - Return-Growth Sequences: Euler Enumeration and Pattern Avoidance
AU  - Igor Kleiner
PY  - 2026
DA  - 2026/09/02
PB  - HAL
UR  - https://hal.science/hal-05736430v1
ER  -