A Pascal-like Bound for the Number of Necklaces with Fixed Density
Heckenberger, I. · Sawada, J.
Original · EN
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.
English translation
This paper has no Arabic translation yet. Be the first: it takes a few seconds, and the result is stored for every future reader.