Adjacent q-cycles in permutations

DOI10.1007/S00026-012-0126-9zbMATH Open1256.05003arXiv1005.0781OpenAlexW2161359102MaRDI QIDQ1928593FDOQ1928593

Authors: Richard A. Brualdi, Emeric Deutsch 

Publication date: 3 January 2013

Published in: Annals of Combinatorics (Search for Journal in Brave)

Abstract: We introduce a new permutation statistic, namely, the number of cycles of length $q$ consisting of consecutive integers, and consider the distribution of this statistic among the permutations of $1,2,\mathrm{...},n$. We determine explicit formulas, recurrence relations, and ordinary and exponential generating functions. A generalization to more than one fixed length is also considered.

Full work available at URL: https://arxiv.org/abs/1005.0781

Recommendations

• On the adjacent cycle derangements
• Adjacent-cycle permutations of a multiset
• On the constructions of \(n\)-cycle permutations
• On cycle permutation graphs
• Two enumerative results on cycles of permutations
• ON THE NUMBER AND CYCLE STRUCTURE OF THE PERMUTATIONS IN CERTAIN CLASSES
• A graph-theoretic approach to quasigroup cycle numbers
• Enumerating cycles in the graph of overlapping permutations
• A non-trivial intersection theorem for permutations with fixed number of cycles
• \(s\)-overlap cycles for permutations

zbMATH Keywords

permutationsrecurrence relationsderangementsadjacent cyclespermutation statisticsexponential generating functionsexplicit formulasordinary generating functions

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Exact enumeration problems, generating functions (05A15) Factorials, binomial coefficients, combinatorial functions (05A10)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Adjacent \(q\)-cycles in permutations

Cited In (13)

• From Hertzsprung's problem to pattern-rewriting systems
• The concept of \(q\)-cycle and applications
• Turning cycle restrictions into mesh patterns via Foata's fundamental transformation
• Frame patterns in \(n\)-cycles
• Cycles on a multiset with only even-odd drops
• Adjacent \(q\)-cycles in permutations
• Counting permutations by the number of successions within cycles
• Adjoining Almost Disjoint Permutations
• On the adjacent cycle derangements
• Adjacent-cycle permutations of a multiset
• Permutations with interval cycles.
• Some connections between permutation cycles and Touchard polynomials and between permutations that fix a set and covers of multisets
• Integer sequences and \(k\)-commuting permutations

This page was built for publication: Adjacent \(q\)-cycles in permutations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1928593)