Kontent qismiga oʻtish

János Pach: Versiyalar orasidagi farq

Vikipediya, ochiq ensiklopediya
Keyingi tahrir →
Kontent oʻchirildi Kontent qoʻshildi
VizualVikimatn
Alperen (munozara | hissa)
620 edits
„János Pach“ sahifasi tarjima qilib yaratildi
(Farq yoʻq)

20-Aprel 2024, 13:35 dagi koʻrinishi

János Pach (Xitoyda 3 may 1954) [1] - kombinatorlik va diskret va hisoblash geometriya sohasida ishlaydigan matematik va kompyuter olimidir.

Tarix

Pach Vengriya tug'ilib, katta bo'lgan. U taniqli akademik oiladan kelib chiqadi: uning otasi Zsigmond Pál Pach [hu] (1919-2001) taniqli tarixchi edi, onasi Klára (Sós tug'ilgan, 1925-2020) esa universitet matematikasi o'qituvchisi edi; [2] onalik tomoni Vera T. Sós va uning eri Pál Turán eng taniqli Vengriya matematiklaridan ikkitasi. [3]

Pach 1983 yilda Vengriya fanlar akademiyasi Nomzod darajasini oldi, u erda uning maslahatchisi Miklós Simonovits edi.

1977 yildan buyon u Vengriya Fanlar akademiyasining Alfréd Rényi Matematika instituti bilan bog'liq.[4]

U Nyu-York universiteti Matematika fanlari Courant institutida (1986 yildan buyon) tadqiqot professori, Nyu-Yorq shahridagi Kollejda kompyuter fanlari professorlari (1992-2011) va Smit kollejida Neilson professori (2008-2009) bo'lgan.[5]

2008 yildan 2019 yilgacha u Lausanne Federal Politexnikada kombinatsiyaviy geometriya kafedrasining professori bo'lgan.[1][6]


2004 yilda Graf chizish bo'yicha xalqaro simpozium va 2015 yilda hisoblash geometriya simpoziumi dasturining raisi edi. U "Diskret va hisoblash geometriya" jurnali bosh muharriri, shuningdek, "Kombinatoriya", "SIAM Journal on Discrete Mathematics", "Computational Geometry", "Graphs and Combinatorics", "Central European Journal of Mathematics" va "Moscow Journal of Combinatoric and Number Theory" jurnallarining muharroriy kengashlarida ishlaydi.

U 2014 yilda Seulda bo'lib o'tgan Xalqaro matematiklar kongressining kombinatorika sessiyasida taklif etilgan ma'ruzachi bo'lgan.[7]U 2021 yilgi Evropa matematik kongressida (Portorož) plenar ma'ruzachi bo'lgan. [8]

Tadqiqot

Pach bir necha kitob va 300 dan ortiq tadqiqot maqolalari muallifidir. U Pol Erdozning eng tez-tez ishlaydigan hamkorlaridan biri bo'lib, u bilan birga 20 dan ortiq maqolalar yozgan va shuning uchun uning Erdős raqami bir.[9]

Pachning tadqiqotlari kombinatorlik va diskret geometriya sohalarida qaratilgan.1981 yilda u Ulamning muammosini hal qildi va u universal planar grafik mavjud emasligini ko'rsatdi. [10]90-yillarning boshida[11] Micha Perles bilan birgalikda topologik va geometrik grafiklar bo'yicha ekstremal muammolarni tizimli o'rganishni boshladi.

Pachning eng ko'p tilga olingan tadqiqot ishlari[12] samolyotdagi egriliklarning oilalarining kombinatorik murakkabligi va ularning harakatni rejalashtirish muammolariga qo'llanilishiga taalluqli[13][14] k-setslarning maksimal soni va planar nuqtalar to'plamiga ega bo'lishi mumkin bo'lgan chiziqlarni yarimlash,[15] grafikalar sonlarini kesish,[16][17] planar grafikalarni aniq nuqtalar setlariga qo'shish,[18][19] va epsilon-to'plamlar uchun pastki chegaralar.[20][21]


Pach János Bolyai Matematika jamiyati Grünwald medalini (1982), Amerika matematik assotsiatsiyasi Ford mukofoti (1990), va Vengriya fanlar akademiyasi Alfréd Rényi mukofoti (1992) oldi.[22][23] 2005 yilda Quddusning ibroniy universiteti Erdős o'qituvchisi bo'lgan. 2011 yilda u hisoblash geometrikasida o'z tadqiqotlari uchun Kompyuter mashinalari assotsiatsiyasi a'zosi sifatida ro'yxatga olingan. 2014 yilda u Academia Europaea a'zosi etib saylandi,[3] va 2015 yilda Amerika matematik jamiyati a'zosi sifatida "diskret va kombinator geometriya va konveksiyat va kombinatorikada qo'shgan hissasi uchun".[24] 2022 yilda u Vengriya Fanlar akademiyasining muxbir a'zosi qilib saylandi.[25]

Manbalar

  1. ↑ 1,0 1,1 János Pach appointed as a full professor of mathematics, EPFL, December 12, 2007.
  2. ↑ Pach Zsigmond Pálné (Sós Klára) (1925−2020), in Hungarian
  3. ↑ Interview with János Pach (2013), in Hungarian
  4. ↑ Research Fellows, Rényi Institute
  5. ↑ Personal website of János Pach, New York University
  6. ↑ Chair of Combinatorial Geometry, EPFL
  7. ↑ List of Speakers at ICM.
  8. ↑ List of Plenary Speakers at ECM.
  9. ↑ Computing Your Erdös Number
  10. ↑ Pach, János (1981), „A problem of Ulam on planar graphs“, European Journal of Combinatorics, 2-jild, № 4, 357–361-bet, doi:10.1016/s0195-6698(81)80043-1
  11. ↑ AMS Meeting
  12. ↑ Google scholar, retrieved October 23, 2008.
  13. ↑ Kedem, Klara; Livne, Ron; Pach, János; Sharir, Micha (1986), „On the union of Jordan regions and collision-free translational motion amidst polygonal obstacles“, Discrete & Computational Geometry, 1-jild, № 1, 59–71-bet, doi:10.1007/BF02187683.
  14. ↑ Edelsbrunner, Herbert; Guibas, Leonidas J.; Pach, János; Pollack, Richard; Seidel, Raimund; Sharir, Micha, „Arrangements of curves in the plane: topology, combinatorics, and algorithms“, 15th Int. Colloq. Automata, Languages and Programming, Lecture Notes in Computer Science, 317-jild, Springer-Verlag, 214–229-bet.
  15. ↑ Pach, János; Steiger, William; Szemerédi, Endre (1992), „An upper bound on the number of planar K-sets“, Discrete & Computational Geometry, 7-jild, № 1, 109–123-bet, doi:10.1007/BF02187829.
  16. ↑ Pach, János; Tóth, Géza (1997), „Graphs drawn with few crossings per edge“, Combinatorica, 17-jild, № 3, 427–439-bet, doi:10.1007/BF01215922, S2CID 20480170.
  17. ↑ Pach, János; Tóth, Géza (2000), „Which crossing number is it, anyway?“, Journal of Combinatorial Theory, Series B, 80-jild, № 2, 225–246-bet, doi:10.1006/jctb.2000.1978.
  18. ↑ de Fraysseix, Hubert; Pach, János; Pollack, Richard (1988), „Small sets supporting Fáry embeddings of planar graphs“, Proc. 20th ACM Symp. Theory of Computing, 426–433-bet, doi:10.1145/62212.62254, S2CID 15230919.
  19. ↑ Pach, János; Wenger, Rephael (2001), „Embedding planar graphs at fixed vertex locations“, Graphs and Combinatorics, 17-jild, № 4, 717–728-bet, doi:10.1007/PL00007258, S2CID 36270095.
  20. ↑ Komlós, János; Pach, János; Woeginger, Gerhard (1992), „Almost tight bounds for ε-nets.“, Discrete & Computational Geometry, 7-jild, № 2, 163–173-bet, doi:10.1007/bf02187833.
  21. ↑ Pach, János; Tardos, Gábor (2013), „Tight lower bounds for the size of epsilon-nets“, Journal of the American Mathematical Society, 26-jild, № 3, 645–658-bet, arXiv:1012.1240, doi:10.1090/s0894-0347-2012-00759-0.
  22. ↑ Rényi-díj, Alfred Rényi Institute of Mathematics, 4 September 2012da asl nusxadan arxivlandi, qaraldi: 8 March 2010
  23. ↑ Hasani. „Academy of Europe: Pach János“. Academy of Europe. Qaraldi: 2022-yil 19-dekabr.
  24. ↑ 2016 Class of the Fellows of the AMS, American Mathematical Society, qaraldi: 2015-11-16.
  25. ↑ Corresponding members of the Hungarian Academy of Sciences, qaraldi: 2022-05-21. 
"https://uz.wikipedia.org/w/index.php?title=János_Pach&oldid=4248895" dan olindi