2000 character limit reached
A Bijection between Necklaces and Restricted Multisets
Published 26 Jul 2025 in math.CO | (2507.19940v1)
Abstract: We present a proof of Swee Hong Chan's conjecture establishing a bijection between the set of necklaces of length $n$ with at most $q$ colors the set of periodic functions $f: \mathbb{Z}_{n}\to {0, 1, ..., q-1}$ whose weighted sum is divisible by $n$, where $q$ and $n$ are coprime positive integers.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.
