On the least exponential growth admitting uncountably many closed permutation classes

Simple item page
dc.creatorKlazar, Martin
dc.date2003-07-31
dc.date.accessioned2026-07-07T04:59:59Z
dc.date.available2026-07-07T04:59:59Z
dc.descriptionWe show that the least exponential growth of counting functions which admits uncountably many closed permutation classes lies between 2^n and (2.33529...)^n.
dc.description13 pages
dc.identifierhttps://arxiv.org/abs/math/0307399
dc.identifierhttp://arxiv.org/abs/math/0307399
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/68214
dc.subjectCombinatorics
dc.subject05A05; 05A15; 06A07
dc.titleOn the least exponential growth admitting uncountably many closed permutation classes
dc.typetext

Files

Collections

arXiv