Cayley permutations
From MaRDI portal
Recommendations
Cites work
- Combinatorial Compression and Partitioning of Large Dictionaries
- Generating Permutations with Nondistinct Items
- scientific article; zbMATH DE number 3448641 (Why is no real title available?)
- scientific article; zbMATH DE number 3231892 (Why is no real title available?)
- scientific article; zbMATH DE number 3399243 (Why is no real title available?)
- scientific article; zbMATH DE number 3407692 (Why is no real title available?)
- Preferential Arrangements
Cited in
(20)- The use and usefulness of numeration systems
- Fourier series of functions involving higher-order ordered Bell polynomials
- Some canonical sequences of integers
- Transport of patterns by Burge transpose
- Efficiently measuring complexity on the basis of real-world data
- Non-abelian topological approach to non-locality of a hypergraph state
- Fourier series of higher-order ordered Bell functions
- Sorting Cayley permutations with pattern-avoiding machines
- Fourier series of sums of products of ordered Bell and poly-Bernoulli functions
- Fishburn trees
- A new class of generalized Fubini polynomials and their computational algorithms
- Generalized ordinal patterns in discrete-valued time series: nonparametric testing for serial dependence
- Caylerian polynomials
- Modified ascent sequences and Bell numbers
- Pattern-avoiding Cayley permutations via combinatorial species
- Completing the enumeration of inversion sequences avoiding one or two patterns of length 3
- Pattern-avoiding modified ascent sequences
- Generating Gray codes for weak orders in constant amortized time
- Omitting parentheses from the cyclic notation
- Updown categories: generating functions and universal covers
This page was built for publication: Cayley permutations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q792334)