All our words (strings) are over a fixed alphabet. A square is a subword of the form uu=u 2 , where u is a nonempty word. Two squares are distinct if they are of different shape, not just translates of each other. A word u is primitive if u cannot be written in the form u=v j for some j 2. A square
✦ LIBER ✦
How Many Conjectures Can You Stand? A Survey
✍ Scribed by H. J. Broersma; Z. Ryjáček; P. Vrána
- Publisher
- Springer Japan
- Year
- 2011
- Tongue
- English
- Weight
- 445 KB
- Volume
- 28
- Category
- Article
- ISSN
- 0911-0119
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
How Many Squares Can a String Contain?
✍
Aviezri S. Fraenkel; Jamie Simpson
📂
Article
📅
1998
🏛
Elsevier Science
🌐
English
⚖ 241 KB
How many electrons can a nucleus bind?
✍
I.M Sigal
📂
Article
📅
1984
🏛
Elsevier Science
🌐
English
⚖ 576 KB
How Many Ways Can One Draw A Graph?
✍
János Pach*; Géza Tóth†
📂
Article
📅
2006
🏛
Springer-Verlag
🌐
English
⚖ 305 KB
How Can You Mend A Broken Heart
✍
King, Asha
📂
Fiction
🏛
Phaze
🌐
English
⚖ 2 MB
How many motoric body representations ca
✍
Marjolein P. M. Kammers; Joyce A. Kootker; Hinze Hogendoorn; H. Chris Dijkerman
📂
Article
📅
2009
🏛
Springer-Verlag
🌐
English
⚖ 354 KB
How many moments can be estimated from a
✍
Abram Kagan; Sergei Nagaev
📂
Article
📅
2001
🏛
Elsevier Science
🌐
English
⚖ 88 KB
Under general conditions on a population, it is proved that the number of population moments that can be simultaneously consistently estimated by the corresponding sample moments in a large sample of size n is roughly (log n)=(2 log log n) and this order is rather sharp.