A Pascal-like bound for the number of necklaces with fixed density

DOI10.1016/j.tcs.2019.01.030zbMath1425.05005arXiv1801.09516OpenAlexW2964155167WikidataQ128449502 ScholiaQ128449502MaRDI QIDQ2420574

Yanyan Li

Publication date: 6 June 2019

Published in: Theoretical Computer Science (Search for Journal in Brave)

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

zbMATH Keywords

Nichols algebrasnecklacesLyndon wordfixed-densityPascal's identity

Mathematics Subject Classification ID

Combinatorics on words (68R15) Permutations, words, matrices (05A05)

Related Items (1)

A characterization of Nichols algebras of diagonal type which are free algebras

Uses Software

• FXT
• hfloat

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Symmetry types of periodic sequences
• Root multiplicities for Nichols algebras of diagonal type of rank two
• Factorizing words over an ordered alphabet
• Fast Algorithms to Generate Necklaces, Unlabeled Necklaces, and Irreducible Polynomials over GF(2)
• Matters Computational
• An Efficient Algorithm for Generating Necklaces with Fixed Density

This page was built for publication: A Pascal-like bound for the number of necklaces with fixed density