Pattern frequency sequences and internal zeros

dc.creatorBona, Miklos
dc.creatorSagan, Bruce
dc.creatorVatter, Vincent
dc.date2001-04-08
dc.date.accessioned2026-07-07T04:41:13Z
dc.date.available2026-07-07T04:41:13Z
dc.descriptionConsider the number of permutations in the symmetric group on n letters that contain c copies of a given pattern. As c varies (with n held fixed) these numbers form a sequence whose properties we study for the monotone patterns and the patterns 1, l, l-1, ..., 2. We show that, except for the patterns 1, 2 and 2, 1 where the sequence is well-known to be log concave, there are infinitely many n where the sequence has internal zeros.
dc.description24 pages
dc.identifierhttps://arxiv.org/abs/math/0104098
dc.identifierhttp://arxiv.org/abs/math/0104098
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/61268
dc.subjectCombinatorics
dc.subject05A05 (Primary) 05A20, 05E99, 06A07 (Secondary)
dc.titlePattern frequency sequences and internal zeros
dc.typetext

Files

Collections