Cayley permutations

DOI10.1016/0012-365X(84)90136-5zbMath0537.05028OpenAlexW2913306542MaRDI QIDQ792334

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

zbMATH Keywords

Cayley treesordered rooted treespermutation with repetition

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Permutations, words, matrices (05A05) Enumeration in graph theory (05C30)

Related Items

Efficiently measuring complexity on the basis of real-world data ⋮ Non-abelian topological approach to non-locality of a hypergraph state ⋮ Fourier series of functions involving higher-order ordered Bell polynomials ⋮ Some canonical sequences of integers ⋮ The use and usefulness of numeration systems ⋮ Sorting Cayley permutations with pattern-avoiding machines ⋮ Fishburn trees ⋮ Updown categories: generating functions and universal covers ⋮ A new class of generalized Fubini polynomials and their computational algorithms ⋮ Fourier series of higher-order ordered Bell functions ⋮ Fourier series of sums of products of ordered Bell and poly-Bernoulli functions ⋮ Generating Gray codes for weak orders in constant amortized time ⋮ Transport of patterns by Burge transpose

Cites Work

• Combinatorial Compression and Partitioning of Large Dictionaries
• Preferential Arrangements
• Generating Permutations with Nondistinct Items
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Cayley permutations