scientific article; zbMATH DE number 3941545
From MaRDI portal
Publication:3714084
Recommendations
Cited in
(40)- scientific article; zbMATH DE number 6269007 (Why is no real title available?)
- On TDP permutations
- Permutations Fixing ak-set
- scientific article; zbMATH DE number 2077075 (Why is no real title available?)
- Enumerating Row Arrangements of Three Species
- scientific article; zbMATH DE number 786166 (Why is no real title available?)
- Computing cardinalities of subsets on \(S_n\) with \(k\) adjacencies
- scientific article; zbMATH DE number 1875779 (Why is no real title available?)
- Enumerating Nondegenerate Permutations
- Enumeration of restricted permutation triples
- On generalized Fibonacci permutations
- scientific article; zbMATH DE number 3929102 (Why is no real title available?)
- Cayley permutations
- Counting special permutations
- Characteristic Numbers of Permutations
- scientific article; zbMATH DE number 3946133 (Why is no real title available?)
- scientific article; zbMATH DE number 6521429 (Why is no real title available?)
- scientific article; zbMATH DE number 3961613 (Why is no real title available?)
- scientific article; zbMATH DE number 6960762 (Why is no real title available?)
- Enumerating permutations by their run structure
- scientific article; zbMATH DE number 2186865 (Why is no real title available?)
- \(q\)-enumeration of Salié permutations
- scientific article; zbMATH DE number 653247 (Why is no real title available?)
- Enumeration of snakes and cycle-alternating permutations
- scientific article; zbMATH DE number 3908439 (Why is no real title available?)
- An arithmetic of complete permutations with constraints. II: Case studies
- scientific article; zbMATH DE number 3857113 (Why is no real title available?)
- Ménage numbers, bijections and P-recursiveness
- Counting of even and odd restricted permutations
- On the average number of \(k\)-sets
- Algorithms and Properties on Balanced Permutations
- Permutations with Restricted Displacement
- Counting permutations where the difference between entries located \(r\) places apart can never be \(s\) (for any given positive integers \(r\) and \(s\))
- Permutations avoiding runs of \(i\), \(i+1\), \(i+2\) or \(i\), \(i-1\), \(i-2\)
- Some properties of roller coaster permutations
- On the number of certain types of strongly restricted permutations
- Enumeration of bigrassmannian permutations below a permutation in Bruhat order
- Generating Countable Sets of Permutations
- Enumeration of the permutations under \((1,n)\) in the Bruhat order.
- A combinatorial interpretation of punctured partitions
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3714084)