Refined restricted permutations

DOI10.1007/S000260200015MaRDI QIDQ1400794zbMATH OpenOpenAlexFDO

Authors Aaron Robertson, Dan Saracino, Doron Zeilberger

Publication date 14 August 2003

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

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

zbMATH Keywords

Dyck pathsrestricted permutationsFine's sequence

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Combinatorics on words (68R15)

Abstract: Define $S_n^k(alpha)$ to be the set of permutations of $1,2,\mathrm{...},n$ with exactly $k$ fixed points which avoid the pattern $alphain{S}_m$. Let $s_n^k(alpha)$ be the size of $S_n^k(alpha)$. We investigate $S_n^0(alpha)$ for all $alphain{S}_3$ as well as show that $s_n^k(132)=s_n^k(213)=s_n^k(321)$ and $s_n^k(231)=s_n^k(312)$ for all $0leqkleqn$.

Recommendations

• Refined restricted permutations avoiding subsets of patterns of length three
• scientific article; zbMATH DE number 2188398
• Permutations restricted by two distinct patterns of length three
• Refined restricted involutions
• Restricted 132-avoiding permutations

Cited in

(35)

• Bijections for refined restricted permutations
• Refined restricted permutations avoiding subsets of patterns of length three
• Restricted 132-avoiding permutations
• Fixed points of 321-avoiding permutations
• Crossings over permutations avoiding some pairs of patterns of length three
• Permutations restricted by two distinct patterns of length three
• Descent sets on 321-avoiding involutions and hook decompositions of partitions
• On a refinement of Wilf-equivalence for permutations
• The number of cycles with a given descent set
• Restricted permutations refined by number of crossings and nestings
• Dyck paths and restricted permutations
• scientific article; zbMATH DE number 786166 (Why is no real title available?)
• Exact and asymptotic enumeration of cyclic permutations according to descent set
• A history and a survey of lattice path enumeration
• Further refinements of Wilf-equivalence for patterns of length 4
• Counting pattern avoiding permutations by number of movable letters
• \(k\)-arrangements, statistics, and patterns
• Counting permutations with no long monotone subsequence via generating trees and the kernel method
• Two refined major-balance identities on 321-avoiding involutions
• The shape of random pattern-avoiding permutations
• Another look at bijections for pattern-avoiding permutations
• AARON
• On bijections for pattern-avoiding permutations
• Major index distribution over permutation classes
• Restricted permutations
• Refined restricted involutions
• Distributions of statistics over pattern-avoiding permutations
• Enumerating two permutation classes by the number of cycles
• A refinement of Wilf-equivalence for patterns of length 4
• Restricted Dumont permutations
• Simple permutations and algebraic generating functions
• Visibility in pattern-restricted permutations
• Statistics on pairs of permutations
• Refinement permutations of prime power order
• Pattern-avoiding stabilized-interval-free permutations

Describes a project that uses

Uses Software

• OEIS

This page was built for publication: Refined restricted permutations

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