A Pascal-like bound for the number of necklaces with fixed density (Q2420574): Difference between revisions
From MaRDI portal
Changed an Item |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Matters Computational / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Fast Algorithms to Generate Necklaces, Unlabeled Necklaces, and Irreducible Polynomials over GF(2) / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Factorizing words over an ordered alphabet / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Symmetry types of periodic sequences / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Root multiplicities for Nichols algebras of diagonal type of rank two / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4529547 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q2949152 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3134850 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: An Efficient Algorithm for Generating Necklaces with Fixed Density / rank | |||
Normal rank |
Revision as of 11:05, 19 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A Pascal-like bound for the number of necklaces with fixed density |
scientific article |
Statements
A Pascal-like bound for the number of necklaces with fixed density (English)
0 references
6 June 2019
0 references
Lyndon word
0 references
necklaces
0 references
fixed-density
0 references
Pascal's identity
0 references
Nichols algebras
0 references
0 references