On the number of monochromatic close pairs of beads in a rosary (Q807623): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q126571551, #quickstatements; #temporary_batch_1719298721464 |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0012-365x(90)90295-s / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2087828090 / rank | |||
Normal rank | |||
Latest revision as of 11:16, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the number of monochromatic close pairs of beads in a rosary |
scientific article |
Statements
On the number of monochromatic close pairs of beads in a rosary (English)
0 references
1990
0 references
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\).
0 references
zero-one-sequences
0 references
enumeration
0 references
