A Pascal-like Bound for the Number of Necklaces with Fixed Density
classification
🧮 math.CO
math.QA
keywords
fixedbounddensitynecklaceslyndonwordsalgebrasarises
read the original abstract
A bound resembling Pascal's identity is presented for binary necklaces with fixed density using Lyndon words with fixed density. The result is generalized to k-ary necklaces and Lyndon words with fixed content. The bound arises in the study of Nichols algebras of diagonal type.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.