Adjacent q-cycles in permutations
Richard A. Brualdi, Emeric Deutsch

TL;DR
This paper introduces a new permutation statistic counting q-cycles of consecutive integers, providing explicit formulas, recurrences, and generating functions, with generalizations to multiple fixed lengths.
Contribution
It defines a novel permutation statistic and derives comprehensive formulas and generating functions, extending to multiple cycle lengths.
Findings
Explicit formulas for the distribution of the new statistic
Recurrence relations and generating functions derived
Generalization to multiple fixed cycle lengths
Abstract
We introduce a new permutation statistic, namely, the number of cycles of length consisting of consecutive integers, and consider the distribution of this statistic among the permutations of . We determine explicit formulas, recurrence relations, and ordinary and exponential generating functions. A generalization to more than one fixed length is also considered.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAlgorithms and Data Compression · Advanced Combinatorial Mathematics · semigroups and automata theory
