Möbius polynomials

DOI10.4169/MATH.MAG.85.5.376MaRDI QIDQ2859032zbMATH OpenOpenAlexFDO

Authors Will Murray

Publication date 6 November 2013

Published in Mathematics Magazine (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1312.3848

zbMATH Keywords

braceletsEuler's totient theoremirreducible polynomialsMöbius polynomials

Mathematics Subject Classification ID

Arithmetic functions; related numbers; inversion formulas (11A25) Sequences (mod (m)) (11B50) Polynomials (irreducibility, etc.) (11R09) Number theory (educational aspects) (97F60)

Abstract: We introduce the M"obius polynomial $M_n(x)=su{m}_{d|n}muleft(fracndight)x^d$, which gives the number of aperiodic bracelets of length $n$ with $x$ possible types of gems, and therefore satisfies $M_n(x)equiv0$ (mod $n$) for all $xinmathbbZ$. We derive some key properties, analyze graphs in the complex plane, and then apply M"obius polynomials combinatorially to juggling patterns, irreducible polynomials over finite fields, and Euler's totient theorem.

Recommendations

• scientific article; zbMATH DE number 4075225
• Some number-theoretic combinatorial problems
• Möbius polynomial species
• Möbius polynomials of face posets of convex polytopes
• scientific article; zbMATH DE number 3946129

Cited in

(3)

• Some number-theoretic combinatorial problems
• scientific article; zbMATH DE number 4027488 (Why is no real title available?)
• A non-associative incidence near-ring with a generalized Möbius function

This page was built for publication: Möbius polynomials

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2859032)