544 citations
- S. Malik3 profiles113 · h 96
- D. Schaile10 profiles88 · h 87
- A. Meyer4 profiles84 · h 142
- H. Fox4 profiles84 · h 84
- A. Bean2 profiles83 · h 120
- A. Khanov11 profiles83 · h 94
- A. Melnitchouk9 profiles83 · h 45
- A. Quadt11 profiles83 · h 86
- B. Åsman8 profiles83 · h 98
- B. Quinn9 profiles83 · h 57
- C. Bélanger-Champagne2 profiles83 · h 92
- D. Karmanov6 profiles83 · h 51
- University of MichiganUS119 papers
- Centre National de la Recherche ScientifiqueFR118 papers
- Joint Institute for Nuclear ResearchRU117 papers
- Michigan State UniversityUS117 papers
- Fermi National Accelerator LaboratoryUS116 papers
- Northwestern UniversityUS116 papers
- Sorbonne UniversitéFR115 papers
- University of RochesterUS115 papers
- Laboratoire de Physique Nucléaire et de Hautes ÉnergiesFR114 papers
- Institute for High Energy PhysicsES111 papers
- Institute for Theoretical and Experimental PhysicsRU109 papers
- Institut National de Physique Nucléaire et de Physique des ParticulesFR109 papers
Showing 2011 · math.COShow all
2 papers · 2 filters
math.CO2011
Approximations of additive squares in infinite words
Tom Brown
We show that every infinite word on a finite subset of must contain arbitrarily large factors which are "close" to being \textit{additive squares}. We als…
math.CO2011
On abelian and additive complexity in infinite words
Hayri Ardal, Tom Brown, Veselin Jungić +1
The study of the structure of infinite words having bounded abelian complexity was initiated by G. Richomme, K. Saari, and L. Q. Zamboni. In this note we define bounded additive co…