A Logarithmic Connection for Circular Permutation Enumeration
From MaRDI portal
Recommendations
Cites work
- A Formal Calculus for the Enumerative System of Sequences-I. Combinatorial Theorems
- A Formal Calculus for the Enumerative System of Sequences-II. Applications
- A Formal Calculus for the Enumerative System of Sequences-III. Further Developments
- Algebraic methods for permutations with prescribed patterns
- An Inversion Theorem for Cluster Decompositions of Sequences with Distinguished Subsequences
- Binomial posets, Möbius inversion, and permutation enumeration
- Decomposition Based Generating Functions for Sequences
- Enumeration Of Labelled Graphs
- Enumeration of permutations of \((1, \ldots, n)\) by number of maxima
- For How Many Edges is a Digraph Almost Certainly Hamiltonian?
- scientific article; zbMATH DE number 3345454 (Why is no real title available?)
- On the problème des ménages
- Permutations and successions
- The enumeration of sequences with respect to structures on a bipartition
This page was built for publication: A Logarithmic Connection for Circular Permutation Enumeration
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3322106)