Cayley permutations
From MaRDI portal
Publication:792334
DOI10.1016/0012-365X(84)90136-5zbMATH Open0537.05028OpenAlexW2913306542MaRDI QIDQ792334FDOQ792334
Authors: Moshe Mor, Aviezri S. Fraenkel
Publication date: 1984
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0012-365x(84)90136-5
Recommendations
Permutations, words, matrices (05A05) Exact enumeration problems, generating functions (05A15) Enumeration in graph theory (05C30)
Cites Work
Cited In (17)
- Efficiently measuring complexity on the basis of real-world data
- Omitting parentheses from the cyclic notation
- Fourier series of functions involving higher-order ordered Bell polynomials
- The use and usefulness of numeration systems
- Fishburn trees
- Modified ascent sequences and Bell numbers
- Non-abelian topological approach to non-locality of a hypergraph state
- Caylerian polynomials
- Generalized ordinal patterns in discrete-valued time series: nonparametric testing for serial dependence
- Sorting Cayley permutations with pattern-avoiding machines
- Updown categories: generating functions and universal covers
- A new class of generalized Fubini polynomials and their computational algorithms
- Generating Gray codes for weak orders in constant amortized time
- Some canonical sequences of integers
- Fourier series of higher-order ordered Bell functions
- Transport of patterns by Burge transpose
- Fourier series of sums of products of ordered Bell and poly-Bernoulli functions
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)