A Pascal-like Bound for the Number of Necklaces with Fixed Density
Combinatorics
2018-01-30 v1 Quantum Algebra
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.
Keywords
Cite
@article{arxiv.1801.09516,
title = {A Pascal-like Bound for the Number of Necklaces with Fixed Density},
author = {I. Heckenberger and J. Sawada},
journal= {arXiv preprint arXiv:1801.09516},
year = {2018}
}
Comments
6 pages, Lyndon words, necklaces, Nichols algebras