해피 엔딩 문제 (Korean Wikipedia)

Analysis of information sources in references of the Wikipedia article "해피 엔딩 문제" in Korean language version.

refsWebsite

Global rank Korean rank

5doi.org

2^nd place

3^rd place

1smh.com.au

132^nd place

451^st place

1numdam.org

8,650^th place

3,222^nd place

1web.archive.org

1^st place

1austms.org.au

low place

1arxiv.org

69^th place

54^th place

1semanticscholar.org

11^th place

310^th place

1jstor.org

26^th place

70^th place

arxiv.org (Global: 69^th place; Korean: 54^th place)

Suk (2016). See binomial coefficient and big O notation for notation used here and Catalan numbers or Stirling's approximation for the asymptotic expansion. Suk, Andrew (2016), “On the Erdős–Szekeres convex polygon problem”, 《J. Amer. Math. Soc.》 30 (4): 1047–1053, arXiv:1604.08657, doi:10.1090/jams/869, S2CID 15732134 .

austms.org.au (Global: low place; Korean: low place)

Szekeres & Peters (2006)에 의해 증명되었다. They carried out a computer search which eliminated all possible configurations of 17 points without convex hexagons while examining only a tiny fraction of all configurations. Szekeres, G.; Peters, L. (2006), “Computer solution to the 17-point Erdős-Szekeres problem”, 《ANZIAM Journal》 48 (2): 151–164, doi:10.1017/S144618110000300X, 2019년 12월 13일에 원본 문서에서 보존된 문서, 2022년 5월 3일에 확인함 .

doi.org (Global: 2^nd place; Korean: 3^rd place)

dx.doi.org

Szekeres & Peters (2006)에 의해 증명되었다. They carried out a computer search which eliminated all possible configurations of 17 points without convex hexagons while examining only a tiny fraction of all configurations. Szekeres, G.; Peters, L. (2006), “Computer solution to the 17-point Erdős-Szekeres problem”, 《ANZIAM Journal》 48 (2): 151–164, doi:10.1017/S144618110000300X, 2019년 12월 13일에 원본 문서에서 보존된 문서, 2022년 5월 3일에 확인함 .
Suk (2016). See binomial coefficient and big O notation for notation used here and Catalan numbers or Stirling's approximation for the asymptotic expansion. Suk, Andrew (2016), “On the Erdős–Szekeres convex polygon problem”, 《J. Amer. Math. Soc.》 30 (4): 1047–1053, arXiv:1604.08657, doi:10.1090/jams/869, S2CID 15732134 .
Horton (1983) Horton, J. D. (1983), “Sets with no empty convex 7-gons”, 《Canadian Mathematical Bulletin》 26 (4): 482–484, doi:10.4153/CMB-1983-077-8 .
Overmars (2003). Overmars, M. (2003), “Finding sets of points without empty convex 6-gons”, 《Discrete and Computational Geometry》 29 (1): 153–158, doi:10.1007/s00454-002-2829-x .
Scheinerman & Wilf (1994) Scheinerman, Edward R.; Wilf, Herbert S. (1994), “The rectilinear crossing number of a complete graph and Sylvester's "four point problem" of geometric probability”, 《American Mathematical Monthly》 (Mathematical Association of America) 101 (10): 939–943, doi:10.2307/2975158, JSTOR 2975158 .

jstor.org (Global: 26^th place; Korean: 70^th place)

Scheinerman & Wilf (1994) Scheinerman, Edward R.; Wilf, Herbert S. (1994), “The rectilinear crossing number of a complete graph and Sylvester's "four point problem" of geometric probability”, 《American Mathematical Monthly》 (Mathematical Association of America) 101 (10): 939–943, doi:10.2307/2975158, JSTOR 2975158 .

numdam.org (Global: 8,650^th place; Korean: 3,222^nd place)

Erdős & Szekeres (1935)에 따르면, 이는 E. Makai에 의해 처음 증명되었다. 처음으로 출판된 증명은 Kalbfleisch, Kalbfleisch & Stanton (1970)이다. Erdős, P.; Szekeres, G. (1935), “A combinatorial problem in geometry”, 《Compositio Mathematica》 2: 463–470 . Kalbfleisch, J.D.; Kalbfleisch, J.G.; Stanton, R.G. (1970), 〈A combinatorial problem on convex regions〉, 《Proc. Louisiana Conf. Combinatorics, Graph Theory and Computing》, Congressus Numerantium 1, Baton Rouge, La.: Louisiana State Univ., 180–188쪽 .

semanticscholar.org (Global: 11^th place; Korean: 310^th place)

api.semanticscholar.org

Suk (2016). See binomial coefficient and big O notation for notation used here and Catalan numbers or Stirling's approximation for the asymptotic expansion. Suk, Andrew (2016), “On the Erdős–Szekeres convex polygon problem”, 《J. Amer. Math. Soc.》 30 (4): 1047–1053, arXiv:1604.08657, doi:10.1090/jams/869, S2CID 15732134 .

smh.com.au (Global: 132^nd place; Korean: 451^st place)

A world of teaching and numbers - times two, Michael Cowling, The Sydney Morning Herald, 2005-11-07, cited 2014-09-04

web.archive.org (Global: 1^st place; Korean: 1^st place)

Szekeres & Peters (2006)에 의해 증명되었다. They carried out a computer search which eliminated all possible configurations of 17 points without convex hexagons while examining only a tiny fraction of all configurations. Szekeres, G.; Peters, L. (2006), “Computer solution to the 17-point Erdős-Szekeres problem”, 《ANZIAM Journal》 48 (2): 151–164, doi:10.1017/S144618110000300X, 2019년 12월 13일에 원본 문서에서 보존된 문서, 2022년 5월 3일에 확인함 .

해피 엔딩 문제 (Korean Wikipedia)

arxiv.org (Global: 69th place; Korean: 54th place)

austms.org.au (Global: low place; Korean: low place)

doi.org (Global: 2nd place; Korean: 3rd place)

dx.doi.org

jstor.org (Global: 26th place; Korean: 70th place)

numdam.org (Global: 8,650th place; Korean: 3,222nd place)

semanticscholar.org (Global: 11th place; Korean: 310th place)