scientific article; zbMATH DE number 3882435
[For the entire collection see Zbl 0546.00008.] Let \(M(\alpha,n)=1/n\sum_{d| n}\mu (n/d)\alpha^ d\) be the classical Moebius function; the cyclotomic identity is given by \(\sum^{\infty}_{n=0}(\alpha z)^ n=\prod_{n\geq 1}(1/1-z^ n)^{M(\alpha,n)}\) and is analogous to the well-known exponential identity: \(\sum^{\infty}_{n=0}(\alpha z)^ n/n!=\lim_{n\to \infty}(1+\alpha z/n)^ n\). The author gives a bijective proof of the cyclotomic identity, by specifying six elementary algorithms relating linear orders, partitions, permutations and placements (a placement is a generalization of a permutation, consisting of a pair (f,\(\pi)\), where f is a function with specified domain and range, and \(\pi\) is a permutation of the domain). A clever and elegant argument!
- Counting permutations with given cycle structure and descent set
- Decomposable functors and the exponential principle
- The cyclotomic identity and the cyclic group
- A generalized cyclotomic identity
- Riffle shuffles, cycles, and descents
- Cyclotomic exponent sequences of numerical semigroups
- A multiset version of determinants and the coin arrangements lemma
- Erratum: Verschiebung and Frobenius operators
- Aperiodic rings, necklace rings, and Witt vectors
- Witt vectors. I
- A natural proof of the cyclotomic identity
- scientific article; zbMATH DE number 540114 (Why is no real title available?)
- The Burnside ring of the infinite cyclic group and its relations to the necklace algebra, -rings, and the universal ring of Witt vectors
- On counting of periodic words
- Necklaces, MSS sequences, and DNA sequences
- Cyclotomic enumeration of polynomials
- A bijection for ordered factorizations
- Verschiebung and Frobenius operators
- \(q\)-analog of the Möbius function and the cyclotomic identity associated to a profinite group.
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3216657)