Cyclic permutations realized by signed shifts

DOI10.4310/JOC.2014.v5.n1.a1zbMath1290.05008arXiv1304.7790MaRDI QIDQ2448249

Sergi Elizalde, Kassie Archer

Publication date: 30 April 2014

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

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

zbMATH Keywords

periodic orbitperiodic patterndescentpattern avoidancecyclic permutationsigned shiftreverse shift

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Time series analysis of dynamical systems (37M10)

Related Items

Descents of \(\lambda\)-unimodal cycles in a character formula, The number of cycles with a given descent set, Unweighted linear congruences with distinct coordinates and the Varshamov-Tenengolts codes, Unimodal permutations and almost-increasing cycles, Enumerating two permutation classes by the number of cycles, Exact and asymptotic enumeration of cyclic permutations according to descent set, Pattern-avoiding permutation powers, Allowed Patterns of Symmetric Tent Maps via Commuter Functions, Characterization of the allowed patterns of signed shifts, Schur-positive sets of permutations via products and grid classes, An upper bound on the number of \((132, 213)\)-avoiding cyclic permutations, Permutations and Negative Beta-Shifts, Stable characters from permutation patterns, Characterizations and enumerations of patterns of signed shifts, Pattern avoidance in permutations and their squares, Cyclic pattern containment and avoidance