Enumeration of Carlitz Multipermutations
Abstract
A multipermutation with k copies each of 1… n is Carlitz if neighbours are different. We enumerate these objects for k=2,3,4 and derive recurrences. In particular, we prove and improve a conjectured recurrence for k=3, stated in OEIS, the Online Encyclopedia of Integer Sequences.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.