Lonely runner conjecture (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "Lonely runner conjecture" in English language version.

refsWebsite

Global rank English rank

22doi.org

2^nd place

7semanticscholar.org

11^th place

8^th place

1srce.hr

1,922^nd place

1dauphine.fr

low place

1sfu.ca

3,413^th place

2,445^th place

1arxiv.org

69^th place

59^th place

1warwick.ac.uk

4,378^th place

2,689^th place

arxiv.org

Czerwiński 2012, p. 2. Czerwiński, Sebastian (2012). "Random runners are very lonely". Journal of Combinatorial Theory, Series A. 119 (6): 1194–1199. arXiv:1102.4464. doi:10.1016/j.jcta.2012.02.002. S2CID 26415692.

dauphine.fr

basepub.dauphine.fr

Cusick & Pomerance 1984, p. 133; Bohman, Holzman & Kleitman 2001; Barajas & Serra 2008a; Renault 2004. Renault gives an elementary proof for $n=6$ . ——; Pomerance, Carl (1984). "View-obstruction problems, III". Journal of Number Theory. 19 (2): 131–139. doi:10.1016/0022-314X(84)90097-0. Bohman, Tom; Holzman, Ron; Kleitman, Dan (February 2001). "Six lonely runners". The Electronic Journal of Combinatorics. 8 (2): R3. doi:10.37236/1602. Renault, J. (2004). "View-obstruction: A shorter proof for 6 lonely runners". Discrete Mathematics. 287 (1–3): 93–101. doi:10.1016/j.disc.2004.06.008.

doi.org

Bohman, Holzman & Kleitman 2001, p. 1. Bohman, Tom; Holzman, Ron; Kleitman, Dan (February 2001). "Six lonely runners". The Electronic Journal of Combinatorics. 8 (2): R3. doi:10.37236/1602.
Bienia et al. 1998, p. 3. Bienia, Wojciech; Goddyn, Luis; Gvozdjak, Pavol; Sebő, András; Tarsi, Michael (January 1998). "Flows, view obstructions, and the lonely runner". Journal of Combinatorial Theory, Series B. 72 (1): 1–9. doi:10.1006/jctb.1997.1770.
Wills 1967; Bienia et al. 1998. Wills, Jörg M. (1967). "Zwei sätze über inhomogene diophantische approximation von irrationalzehlen". Monatshefte für Mathematik. 71 (3): 263–269. doi:10.1007/BF01298332. S2CID 122754182. Bienia, Wojciech; Goddyn, Luis; Gvozdjak, Pavol; Sebő, András; Tarsi, Michael (January 1998). "Flows, view obstructions, and the lonely runner". Journal of Combinatorial Theory, Series B. 72 (1): 1–9. doi:10.1006/jctb.1997.1770.
Wills 1967. Wills, Jörg M. (1967). "Zwei sätze über inhomogene diophantische approximation von irrationalzehlen". Monatshefte für Mathematik. 71 (3): 263–269. doi:10.1007/BF01298332. S2CID 122754182.
Tao 2018. Tao, Terence (31 December 2018). "Some remarks on the lonely runner conjecture". Contributions to Discrete Mathematics. 13: No 2 (2018). doi:10.11575/cdm.v13i2.62728.
Bohman, Holzman & Kleitman 2001, p. 2. Bohman, Tom; Holzman, Ron; Kleitman, Dan (February 2001). "Six lonely runners". The Electronic Journal of Combinatorics. 8 (2): R3. doi:10.37236/1602.
Wills 1967; Betke & Wills 1972. Wills, Jörg M. (1967). "Zwei sätze über inhomogene diophantische approximation von irrationalzehlen". Monatshefte für Mathematik. 71 (3): 263–269. doi:10.1007/BF01298332. S2CID 122754182. Betke, U.; Wills, J. M. (1972). "Untere schranken für zwei diophantische approximations-funktionen". Monatshefte für Mathematik. 76 (3): 214. doi:10.1007/BF01322924. S2CID 122549668.
Cusick 1974, p. 1. —— (1974). "View-obstruction problems in n-dimensional geometry". Journal of Combinatorial Theory, Series A. 16 (1): 1–11. doi:10.1016/0097-3165(74)90066-1.
Barajas & Serra 2009, p. 5688. ——; —— (September 2009). "On the chromatic number of circulant graphs". Discrete Mathematics. 309 (18): 5687–5696. doi:10.1016/j.disc.2008.04.041.
Bienia et al. 1998. Bienia, Wojciech; Goddyn, Luis; Gvozdjak, Pavol; Sebő, András; Tarsi, Michael (January 1998). "Flows, view obstructions, and the lonely runner". Journal of Combinatorial Theory, Series B. 72 (1): 1–9. doi:10.1006/jctb.1997.1770.
Perarnau & Serra 2016. Perarnau, Guillem; Serra, Oriol (March 2016). "Correlation among runners and some results on the lonely runner conjecture". The Electronic Journal of Combinatorics. 23 (1): P1.50. doi:10.37236/5123. S2CID 7039062.
Tao 2018, pp. 2–3. Tao, Terence (31 December 2018). "Some remarks on the lonely runner conjecture". Contributions to Discrete Mathematics. 13: No 2 (2018). doi:10.11575/cdm.v13i2.62728.
Bohman, Holzman & Kleitman 2001, pp. 12–13. Bohman, Tom; Holzman, Ron; Kleitman, Dan (February 2001). "Six lonely runners". The Electronic Journal of Combinatorics. 8 (2): R3. doi:10.37236/1602.
Czerwiński 2018, p. 1302. —— (May 2018). "The lonely runner problem for lacunary sequences". Discrete Mathematics. 341 (5): 1301–1306. doi:10.1016/j.disc.2018.02.002.
Dubickas 2011, p. 27. Dubickas, A. (2011). "The lonely runner problem for many runners". Glasnik Matematicki. 46: 25–30. doi:10.3336/gm.46.1.05.
Barajas & Serra 2009. ——; —— (September 2009). "On the chromatic number of circulant graphs". Discrete Mathematics. 309 (18): 5687–5696. doi:10.1016/j.disc.2008.04.041.
Betke & Wills 1972, pp. 215–216; Cusick 1974, p. 5. Cusick's paper independently proves this result. Betke, U.; Wills, J. M. (1972). "Untere schranken für zwei diophantische approximations-funktionen". Monatshefte für Mathematik. 76 (3): 214. doi:10.1007/BF01322924. S2CID 122549668. —— (1974). "View-obstruction problems in n-dimensional geometry". Journal of Combinatorial Theory, Series A. 16 (1): 1–11. doi:10.1016/0097-3165(74)90066-1.
Cusick & Pomerance 1984, p. 133; Bohman, Holzman & Kleitman 2001; Barajas & Serra 2008a; Renault 2004. Renault gives an elementary proof for $n=6$ . ——; Pomerance, Carl (1984). "View-obstruction problems, III". Journal of Number Theory. 19 (2): 131–139. doi:10.1016/0022-314X(84)90097-0. Bohman, Tom; Holzman, Ron; Kleitman, Dan (February 2001). "Six lonely runners". The Electronic Journal of Combinatorics. 8 (2): R3. doi:10.37236/1602. Renault, J. (2004). "View-obstruction: A shorter proof for 6 lonely runners". Discrete Mathematics. 287 (1–3): 93–101. doi:10.1016/j.disc.2004.06.008.
Bohman, Holzman & Kleitman 2001, p. 3. Bohman, Tom; Holzman, Ron; Kleitman, Dan (February 2001). "Six lonely runners". The Electronic Journal of Combinatorics. 8 (2): R3. doi:10.37236/1602.
Czerwiński 2012, p. 2. Czerwiński, Sebastian (2012). "Random runners are very lonely". Journal of Combinatorial Theory, Series A. 119 (6): 1194–1199. arXiv:1102.4464. doi:10.1016/j.jcta.2012.02.002. S2CID 26415692.
Czerwiński & Grytczuk 2008. ——; Grytczuk, Jarosław (September 2008). "Invisible runners in finite fields". Information Processing Letters. 108 (2): 64–67. doi:10.1016/j.ipl.2008.03.019.
Chow & Rimanić 2019. Chow, Sam; Rimanić, Luka (January 2019). "Lonely runners in function fields" (PDF). Mathematika. 65 (3): 677–701. doi:10.1112/S002557931900007X. S2CID 118621899.

semanticscholar.org

api.semanticscholar.org

Wills 1967; Bienia et al. 1998. Wills, Jörg M. (1967). "Zwei sätze über inhomogene diophantische approximation von irrationalzehlen". Monatshefte für Mathematik. 71 (3): 263–269. doi:10.1007/BF01298332. S2CID 122754182. Bienia, Wojciech; Goddyn, Luis; Gvozdjak, Pavol; Sebő, András; Tarsi, Michael (January 1998). "Flows, view obstructions, and the lonely runner". Journal of Combinatorial Theory, Series B. 72 (1): 1–9. doi:10.1006/jctb.1997.1770.
Wills 1967. Wills, Jörg M. (1967). "Zwei sätze über inhomogene diophantische approximation von irrationalzehlen". Monatshefte für Mathematik. 71 (3): 263–269. doi:10.1007/BF01298332. S2CID 122754182.
Wills 1967; Betke & Wills 1972. Wills, Jörg M. (1967). "Zwei sätze über inhomogene diophantische approximation von irrationalzehlen". Monatshefte für Mathematik. 71 (3): 263–269. doi:10.1007/BF01298332. S2CID 122754182. Betke, U.; Wills, J. M. (1972). "Untere schranken für zwei diophantische approximations-funktionen". Monatshefte für Mathematik. 76 (3): 214. doi:10.1007/BF01322924. S2CID 122549668.
Perarnau & Serra 2016. Perarnau, Guillem; Serra, Oriol (March 2016). "Correlation among runners and some results on the lonely runner conjecture". The Electronic Journal of Combinatorics. 23 (1): P1.50. doi:10.37236/5123. S2CID 7039062.
Betke & Wills 1972, pp. 215–216; Cusick 1974, p. 5. Cusick's paper independently proves this result. Betke, U.; Wills, J. M. (1972). "Untere schranken für zwei diophantische approximations-funktionen". Monatshefte für Mathematik. 76 (3): 214. doi:10.1007/BF01322924. S2CID 122549668. —— (1974). "View-obstruction problems in n-dimensional geometry". Journal of Combinatorial Theory, Series A. 16 (1): 1–11. doi:10.1016/0097-3165(74)90066-1.
Czerwiński 2012, p. 2. Czerwiński, Sebastian (2012). "Random runners are very lonely". Journal of Combinatorial Theory, Series A. 119 (6): 1194–1199. arXiv:1102.4464. doi:10.1016/j.jcta.2012.02.002. S2CID 26415692.
Chow & Rimanić 2019. Chow, Sam; Rimanić, Luka (January 2019). "Lonely runners in function fields" (PDF). Mathematika. 65 (3): 677–701. doi:10.1112/S002557931900007X. S2CID 118621899.

sfu.ca

people.math.sfu.ca

Goddyn & Wong 2006. Goddyn, L.; Wong, Erick B. (2006). "Tight instances of the lonely runner" (PDF). Integers. 6 (A38). Retrieved 1 May 2022.

srce.hr

hrcak.srce.hr

Dubickas 2011, p. 27. Dubickas, A. (2011). "The lonely runner problem for many runners". Glasnik Matematicki. 46: 25–30. doi:10.3336/gm.46.1.05.

warwick.ac.uk

wrap.warwick.ac.uk

Chow & Rimanić 2019. Chow, Sam; Rimanić, Luka (January 2019). "Lonely runners in function fields" (PDF). Mathematika. 65 (3): 677–701. doi:10.1112/S002557931900007X. S2CID 118621899.