Pattern-avoiding Cayley permutations via combinatorial species
From MaRDI portal
Cites work
- A combinatorial analysis of higher order generalised geometric polynomials: a generalisation of barred preferential arrangements
- An analogue of covering space theory for ranked posets
- Avoiding patterns of length three in compositions and multiset permutations
- Barred preferential arrangements
- Bialgebras for Stanley symmetric functions
- Caylerian polynomials
- Cayley permutations
- Classification of bijections between 321- and 132-avoiding permutations
- Combinatorial Compression and Partitioning of Large Dictionaries
- Combinatorial Gray codes -- an updated survey
- Combinatorial Hopf Algebras and K-Homology of Grassmanians
- Combinatorics of \(K\)-theory via a \(K\)-theoretic Poirier-Reutenauer bialgebra
- Combinatorics of permutations
- Combinatory analysis. Vol. 1
- Enumerating \((2 + 2)\)-free posets by indistinguishable elements
- Fishburn trees
- From Hertzsprung's problem to pattern-rewriting systems
- Generalized ordinal patterns allowing for ties and their applications in hydrology
- Generating Gray codes for weak orders in constant amortized time
- Gray code for Cayley permutations
- scientific article; zbMATH DE number 5674726 (Why is no real title available?)
- scientific article; zbMATH DE number 1111371 (Why is no real title available?)
- scientific article; zbMATH DE number 3303655 (Why is no real title available?)
- Linear compactness and combinatorial bialgebras
- Modified ascent sequences and Bell numbers
- Modified difference ascent sequences and Fishburn structures
- On multiple pattern avoiding set partitions
- On the number of special permutation-invariant orbits and terms
- Ordered partitions avoiding a permutation pattern of length 3
- Packed words and quotient rings
- Pattern avoidance in ascent sequences
- Pattern avoidance in compositions and multiset permutations
- Pattern avoidance in ordered set partitions
- Pattern avoidance in ordered set partitions and words
- Pattern avoidance in set partitions.
- Pattern-avoiding ascent sequences of length 3
- Pattern-avoiding modified ascent sequences
- Patterns in permutations and words.
- Polynomial realizations of some combinatorial Hopf algebras
- Preferential Arrangements
- Races with Ties
- Restricted generating trees for weak orderings
- Restricted permutations
- Some canonical sequences of integers
- Some results on superpatterns for preferential arrangements
- Sorting Cayley permutations with pattern-avoiding machines
- Stirling polynomials
- Systems of Numeration
- The hypercube of resistors, asymptotic expansions, and preferential arrangements
- The number of weak orderings of a finite set
- Torus link homology and the nabla operator
- Transport of patterns by Burge transpose
- Universal cycles for weak orders
- Updown categories: generating functions and universal covers
- Wilf-equivalence on \(k\)-ary words, compositions, and parking functions
- Yoke-chains and multipartite compositions in connexion with the analytical forms called ``trees.
This page was built for publication: Pattern-avoiding Cayley permutations via combinatorial species
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6839555)
