Pattern avoidance in "flattened" partitions

Simple item page
dc.creatorCallan, David
dc.date2008-02-15
dc.date.accessioned2026-07-07T09:21:15Z
dc.date.available2026-07-07T09:21:15Z
dc.descriptionTo flatten a set partition (with apologies to Mathematica) means to form a permutation by erasing the dividers between its blocks. Of course, the result depends on how the blocks are listed. For the usual listing--increasing entries in each block and blocks arranged in increasing order of their first entries--we count the partitions of [n] whose flattening avoids a single 3-letter pattern. Five counting sequences arise: a null sequence, the powers of 2, the Fibonacci numbers, the Catalan numbers, and the binomial transform of the Catalan numbers.
dc.description8 pages
dc.identifierhttps://arxiv.org/abs/0802.2275
dc.identifierhttp://arxiv.org/abs/0802.2275
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/154958
dc.subjectCombinatorics
dc.subject05A15
dc.titlePattern avoidance in "flattened" partitions
dc.typetext

Files

Collections

arXiv