Combinatorics of permutations
From MaRDI portal
(Redirected from Publication:5086696)
Combinatorics of permutations (scientific article; zbMATH DE number 7553990)
Combinatorics of permutations (scientific article; zbMATH DE number 7553990)
Recommendations
Cited in
(36)- The number of orthogonal permutations
- Profiles of permutations
- Permutations and Coin-Tossing Sequences
- Combinatorics of permutations
- scientific article; zbMATH DE number 4189999 (Why is no real title available?)
- Pairings and Signed Permutations
- Characteristic Numbers of Permutations
- scientific article; zbMATH DE number 3007421 (Why is no real title available?)
- scientific article; zbMATH DE number 6928814 (Why is no real title available?)
- scientific article; zbMATH DE number 2107707 (Why is no real title available?)
- Permutations and Combination Locks
- Coprime permutations
- scientific article; zbMATH DE number 5582846 (Why is no real title available?)
- Combinatorial specification of permutation classes
- Configurations of conjugate permutations
- Patterns in permutations and words.
- Gelfand-Tsetlin Modules: Canonicity and Calculations
- Sorting signed permutations by tandem duplication random loss and inverse tandem duplication random loss
- Total positivity and two inequalities by Athanasiadis and Tzanaki
- Pattern-avoiding Cayley permutations via combinatorial species
- Finding cycle types in permutation groups with few generators
- Desarrangements revisited: statistics and pattern avoidance
- Distribution of the roots of Eulerian polynomials
- Permutations with restricted cycle lengths
- Chip firing on directed k-ary trees
- Enumerating 1324-avoiders with few inversions
- Vertex degrees in grid graphs of permutations
- The likely maximum size of twin subtrees in a large random tree
- Enumeration of pattern-avoiding (0,1)-matrices and their symmetry classes
- Stack-sorting preimages and 0-1-trees
- Optimal design evaluation and selection for order-of-addition factorial experiments
- The parallel stack loading problem: polynomial solvability in the unlimited-capacity case and exact approaches for the finite-capacity case
- Boolean-Narayana numbers
- Pattern-avoiding peak functions
- From geometry to generating functions: rectangulations and permutations
- A note on the total number of cycles of even and odd permutations
This page was built for publication: Combinatorics of permutations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5086696)