András Recski

András Recski
Recski András
Born (1948-04-21) 21 April 1948
Budapest, Hungary
CitizenshipHungarian
EducationEötvös Loránd University (diploma, dr. rer. nat.)
Hungarian Academy of Sciences (CSc, DSc)
Known forApplications of matroids to electric networks and statics
AwardsEötvös József Prize (2013)
Farkas Gyula Memorial Prize (1977)
Grünwald Géza Memorial Prize (1975)
Scientific career
FieldsMatroid theory, combinatorial optimization, electrical network theory, rigidity theory
WorkplacesBudapest University of Technology and Economics
Eötvös Loránd University
Research Institute for Telecommunication (TKI), Budapest
Aquincum Institute of Technology
Thesis Matroidok és villamos hálózatok (Matroids and electric networks)  (1977)
Vera T. Sós
László Lovász
Doctoral students
Gyula Y. Katona
Websitewww.cs.bme.hu/~recski/

András Recski (Hungarian: [ˈrɛt͡ʃki ˈɒndraːʃ]; born 21 April 1948) is a Hungarian mathematician working in matroid theory and combinatorial optimization, and especially in their applications to the theory of electric networks and to rigidity in statics. He is professor emeritus at the Budapest University of Technology and Economics (BME), where he headed the Department of Computer Science and Information Theory from 1990 to 2011, and a Doctor of the Hungarian Academy of Sciences.[1][2] He was secretary-general of the János Bolyai Mathematical Society from 2006 to 2015.[1]

Education

Recski was born in Budapest on 21 April 1948. He studied mathematics at Eötvös Loránd University, graduating in 1971, and obtained the university doctorate (dr. rer. nat.) in 1973.[3] In 1977 he received the degree of Candidate of Sciences from the Hungarian Academy of Sciences for the dissertation Matroidok és villamos hálózatok ("Matroids and electric networks", 1976), supervised by Vera T. Sós and László Lovász,[4] and in 1984 the degree of Doctor of the Mathematical Sciences, for the dissertation Matroidok és alkalmazásaik lineáris hálózatok kvalitatív vizsgálatában ("Matroids and their applications in the qualitative analysis of linear networks", 1983).[5][3][2][6]

Career

From 1971 to 1984 Recski was a researcher at the Research Institute for Telecommunication (Távközlési Kutató Intézet, TKI) in Budapest, while also lecturing at Eötvös Loránd University from 1972. In 1984 he became a founding member of the university's new Department of Computer Science and was appointed professor there in 1988.[3][1][7][8]

In 1990 he moved to the Budapest University of Technology and Economics (BME) to head the Department of Mathematics of the Faculty of Electrical Engineering, while retaining a part-time professorship at Eötvös Loránd University.[9][7] He headed the department (later renamed Department of Computer Science and Information Theory) from 1990 until 2011.[10][11][1][9][12] He was succeeded as head by his former doctoral student Gyula Y. Katona and became professor emeritus in 2017.[1][9][6]

Since 2009 Recski has been the academic director of the Aquincum Institute of Technology.[1][12]

Recski is the co-author of three Hungarian-language university textbooks used as course texts at several Hungarian universities: A számítástudomány alapjai ("Foundations of computer science"), Rendszeroptimalizálás ("Systems optimization") and the problem collection Gráfelméleti feladatok ("Problems in graph theory").[13][14][15][16][17][18]

He was secretary-general of the János Bolyai Mathematical Society from 2006 to 2015, and was vice-chair of the Mathematics Committee of the Hungarian Academy of Sciences from 1999 to 2005.[3][1]

Research

Recski's research concerns matroid theory and combinatorial optimization and their use in engineering, in particular in the analysis of electric networks, in the design of VLSI circuits, and in the rigidity of bar-and-joint and tensegrity frameworks.[3][19]

In 1981 he conjectured that a generalization of the matroid parity problem can be solved in polynomial time. The conjecture was proved by Jácint Szabó in 2008, using Lovász's linear matroid parity algorithm and a technique on jump systems due to András Sebő, with applications to rigidity and to the unique solvability of linear networks.[20] In 1982, he conjectured that the union of graphic matroids, if it is not itself graphic, is never binary. The conjecture remains open in general, and he has returned to it in joint work with his doctoral student Csongor Csehi.[21][22][23] He co-edited with Lovász the proceedings of that colloquium, the first of the society's international colloquia devoted entirely to matroid theory.[24]

His 1989 monograph Matroid Theory and its Applications in Electric Network Theory and in Statics has been described as the most comprehensive treatment of the applications of matroid theory available.[25][26] More recently he has worked on the classification and synthesis of linear multiports.[27]

Awards and honours

  • Grünwald Géza Memorial Prize of the János Bolyai Mathematical Society (1975)[3][2]
  • Farkas Gyula Memorial Prize of the János Bolyai Mathematical Society (1977)[3][2]
  • John von Neumann Research Prize, University of Bonn (1998)[3][2]
  • Eötvös József Prize of the Minister of Human Resources (2013)[1][28]

References

  1. 1 2 3 4 5 6 7 8 "Recski András". iTF Adattár (in Hungarian). Neumann János Számítógép-tudományi Társaság, Informatikatörténeti Fórum. Retrieved 2026-08-22.
  2. 1 2 3 4 5 "Recski András". Köztestületi tagok (in Hungarian). Hungarian Academy of Sciences. Retrieved 2026-08-22.
  3. 1 2 3 4 5 6 7 8 "Recski András szakmai önéletrajza" (PDF) (in Hungarian). Budapest University of Technology and Economics, Doctoral School of Mathematics and Computer Science. 2006-02-28. Retrieved 2026-08-22.
  4. ↑ N. Abaffy, Csilla; Tőzsér, Ágnes (1981). Kandidátusi és doktori disszertációk (1975. február 1 – 1979. december 31.). A Magyar Tudományos Akadémia Könyvtára Kézirattárának Katalógusai (in Hungarian). Vol. 12. Budapest: Library of the Hungarian Academy of Sciences. entry D 7119. ISBN 963-7301-38-7. ISSN 0541-9492.{{cite book}}: CS1 maint: ignored ISBN errors (link)
  5. ↑ Horányi, Károly (1988). Kandidátusi és doktori disszertációk (1980. január 1 – 1984. december 31.) (D 8271 – D 10.847). A Magyar Tudományos Akadémia Könyvtára Kézirattárának Katalógusai (in Hungarian). Vol. 19. Budapest: Library of the Hungarian Academy of Sciences. entry D 10 470. ISBN 963-7302-41-7. ISSN 0541-9492.
  6. 1 2 András Recski at the Mathematics Genealogy Project
  7. 1 2 A Professzor – Recski András (Video interview). A Professzor (in Hungarian). Interviewer: Ákos Oláh; director: Géza Pál Anda. Budavári Schönherz Stúdió. 2015-02-14. Retrieved 2026-08-22.{{cite AV media}}: CS1 maint: others in cite AV media (notes) (link)
  8. ↑ "Lovász László". iTF Adattár (in Hungarian). Neumann János Számítógép-tudományi Társaság, Informatikatörténeti Fórum. Retrieved 2026-08-22.
  9. 1 2 3 "A tanszék profilja és története" (in Hungarian). Budapest University of Technology and Economics, Department of Computer Science and Information Theory. Retrieved 2026-08-22.
  10. ↑ Vajta, László, ed. (2009). A Villamosmérnöki és Informatikai Kar története 1949–2009 (PDF) (in Hungarian). Budapest University of Technology and Economics, Faculty of Electrical Engineering and Informatics. p. 134.
  11. ↑ "Az intézet története" (in Hungarian). Budapest University of Technology and Economics, Institute of Mathematics. Retrieved 2026-08-22.
  12. 1 2 "Faculty". Aquincum Institute of Technology. Retrieved 2026-08-22.
  13. ↑ "Recski András" (in Hungarian). Typotex Kiadó. Retrieved 2026-08-22.
  14. ↑ Friedl, Katalin; Recski, András; Simonyi, Gábor (2006). Gráfelméleti feladatok (PDF). Az informatika elmélete (in Hungarian). Budapest: Typotex. Front matter and preface.
  15. ↑ "Véges matematika" (in Hungarian). Eötvös Loránd University. Retrieved 2026-08-22.
  16. ↑ "Mérnökinformatikus BSc – tantárgyleírások" (PDF) (in Hungarian). John von Neumann University, GAMF Faculty. 2017. Retrieved 2026-08-22.
  17. ↑ "Optimalizálás a gyakorlatban számítógéppel – tantárgyi program" (PDF) (in Hungarian). Semmelweis University. 2020. Retrieved 2026-08-22.
  18. ↑ "Kombinatorika gyakorlat" (in Hungarian). University of Szeged. Retrieved 2026-08-22.
  19. ↑ "Dr. Andras Recski". BME Competence Map. Budapest University of Technology and Economics. Retrieved 2026-08-22.
  20. ↑ Szabó, Jácint (2008). "Matroid parity and jump systems: a solution to a conjecture of Recski". SIAM Journal on Discrete Mathematics. 22 (3): 854–860. doi:10.1137/07068494X.
  21. ↑ Recski, András (1985). "Some open problems of matroid theory, suggested by its applications". Matroid Theory (Szeged, 1982). Colloquia Mathematica Societatis János Bolyai. Vol. 40. North-Holland. pp. 311–325.
  22. ↑ Csehi, Csongor Gy.; Recski, András (2015). "The graphicity of the union of graphic matroids". European Journal of Combinatorics. 50: 38–47. doi:10.1016/j.ejc.2015.03.022.
  23. ↑ "Csehi Csongor György: Graphicity of the union of matroids". Országos Doktori Tanács (in Hungarian). Retrieved 2026-08-22.
  24. ↑ Lovász, László; Recski, András, eds. (1985). Matroid Theory. Colloquia Mathematica Societatis János Bolyai. Vol. 40. Amsterdam: North-Holland. ISBN 978-0-444-87580-8.
  25. ↑ "Review of Matroid theory and its applications in electric network theory and in statics by András Recski". zbMATH Open. Zbl 0723.05023. Retrieved 2026-08-22.
  26. ↑ Bräsel, H. (1992). "Recski, A., Matroid Theory and its Applications in Electric Network Theory and in Statics". ZAMM (Review). 72 (3). doi:10.1002/zamm.19920720321.
  27. ↑ Recski, András; Vékássy, Áron (2021). "Interconnection, Reciprocity and a Hierarchical Classification of Generalized Multiports". IEEE Transactions on Circuits and Systems I: Regular Papers. 68 (9): 3682–3692.
  28. ↑ "Balog Zoltán átadta a pedagógusnapi díjakat" (in Hungarian). Government of Hungary. 2013-06-02. Retrieved 2026-08-22.
This page is issued from Wikipedia. The text is available under Creative Commons Attribution-Share Alike 4.0 unless otherwise noted. Additional terms may apply for the media files.