On the number of monochromatic close pairs of beads in a rosary

DOI10.1016/0012-365X(90)90295-SMaRDI QIDQ807623zbMATH OpenOpenAlexWikidataFDO

Authors Oded Goldreich

Publication date 1990

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0012-365x(90)90295-s

zbMATH Keywords

enumerationzero-one-sequences

Mathematics Subject Classification ID

Permutations, words, matrices (05A05)

Review text

For integers n, m, t consider cyclic strings of m ones and n-m zeros. Count the number of pairs of equal bits which are at most t places apart. The paper gives a tight lower bound for this number. When \(m=n/2\), the answer is \(\approx (\sqrt{2}-1)nt\).

Recommendations

• On the number of antipodal bicolored necklaces
• On the Ramsey number for paths and beaded wheels
• scientific article; zbMATH DE number 4142048
• A Pascal-like bound for the number of necklaces with fixed density
• scientific article; zbMATH DE number 6470123
• On the number of necklaces whose co-periods divide a given integer
• Infinite monochromatic patterns in the integers
• scientific article; zbMATH DE number 5019924
• The number of monochromatic Schur triples

This page was built for publication: On the number of monochromatic close pairs of beads in a rosary

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q807623)