Abraham Ginzburg
Abraham Ginzburg (Born 1926) is a Emeritus Professor of Computer Science. He served as Vice President of the Technion Institute[1], and President of the Open University of Israel[1]
Abraham Ginzburg | |
---|---|
אברהם גינזבורג | |
Born | Navahrudak, Belarus | August 1, 1926
Nationality | Israeli |
Known for | |
Title |
|
Biography
Ginzburg was born on August 1st, 1926 in Navahrudak, Belarus, he began acquiring his education during World War 2, after which he tutored the children of Sh'erit ha-Pletah Mathematics. In 1949 Ginzburg immigrated to Israel, and began studying in the Technion Faculty of Electrical Engineering where he received his B.Sc. summa cum laude. 3 years later he acquired a Master's degree in electrical engineering and 3 years later, in 1959 he received his Doctorate in mathematics, and was appointed lecturer in the faculty of mathematics of the Technion.
During 1965-1967 he served as a Visiting Lecturer in Carnegie Mellon University, in Pittsburg, Pennsylvania.[2] Upon returning to Israel in 1967 he was appointed Associate Professor of Mathematics in the Technion Institute, And in 1971 to a Professor of Computer Science. Ginzburg founded the Department of Computer Science in the Technion, and served as its first department head[3], and later he served as vice president of development of the university.[1]
In 1976 Ginzburg took part in the formation of the Open University of Israel as it's Vice president[4], and from 1977 until 1987 served as it's President[5]
Ginzburg received an Honorary degree form the UK Open University in 1988, an Honorary PhD from The Weizmann Institute in 1990,[6] and, in 2002 was awarded a Rotary Prize for the promotion of higher education in Israel.[5]
Ginzburg is married to Pnina, and is a father of 5.
Research
Ginzburg completed his PhD. in Mathematics in the year 1959. The thesis title was "Multiplicative systems as homomorphic images of square sets" and was done under the supervision of Prof. Dov Tamari.[7]
During the early 60's, Ginzburg did some research in basic Group Theory, Graph Theory and Automata, and frequently collaborated with M. Yoeli.[8][9][10][11]
In 1961, Ginzburg, in collaboration with Paul Erdős, and Abraham Ziv, proved the Theorem known as the Erdos-Ginzburg-Ziv Theorem[12]. This Theorem is an important result in finite abelian group theory and is cited to this day.
In 1968 Ginzburg published his book "Algebraic theory of automata".[13]
Ginzburg also invested a lot of time in writing several textbooks in mathematics, for high school and first degree Mathematics and Engineering students.[14]
References
- ^ a b c Gross, Ronald (1979-01-07). "Israel's Everyman - A Second Chance to Go to College". The New York Times. ISSN 0362-4331. Retrieved 2020-10-03.
- ^ Ginzburg, Abraham (1966-01-01). "Six lectures on algebraic theory of automata". figshare. doi:10.1184/R1/6560897.v1.
- ^ "A Graduates conference of the 1970s in the Faculty of Computer Science, Technion". 2002.
{{cite web}}
: CS1 maint: url-status (link) - ^ https://in.bgu.ac.il/bgi/iyunim/31/Uri-Cohen.pdf Page 116
- ^ a b "פרופ' אברהם גינזבורג". www.openu.ac.il. Retrieved 2020-10-03.
- ^ "Ph.D. Honoris Causa". Academic Affairs Office. 2015-07-01. Retrieved 2020-10-03.
- ^ Tamari, D.; Ginzburg, A. (1969-03-01). "Representation of binary systems by families of binary relations". Israel Journal of Mathematics. 7 (1): 21–32. doi:10.1007/BF02771743. ISSN 1565-8511.
- ^ Ginzburg, A.; Yoeli, M. (1980-06-01). "Vector addition systems and regular languages". Journal of Computer and System Sciences. 20 (3): 277–284. doi:10.1016/0022-0000(80)90009-4. ISSN 0022-0000.
- ^ Yoeli, Michael; Ginzburg, Abraham (1964-11-01). "On homomorphic images of transition graphs". Journal of the Franklin Institute. 278 (5): 291–296. doi:10.1016/S0016-0032(64)90583-6. ISSN 0016-0032.
- ^ Ginzburg, Abraham; Yoeli, Michael (1965). "Products of automata and the problem of covering". Transactions of the American Mathematical Society. 116: 253–266. doi:10.1090/S0002-9947-1965-0201228-X. ISSN 0002-9947.
- ^ Martin, Alain J. (1990-06-18). "Asynchronous Circuits for Token-Ring Mutual Exclusion".
{{cite journal}}
: Cite journal requires|journal=
(help) - ^ Ziv, A. "Theorem in the Additive Number Theory". www.semanticscholar.org. Retrieved 2020-10-03.
- ^ Ginzburg, Abraham (2014-06-25). Algebraic Theory of Automata. Academic Press. ISBN 978-1-4832-2516-6.
- ^ "Calculus: Problems and Solutions". store.doverpublications.com. Retrieved 2020-10-03.
- Geroldinger, Alfred (2009). "Additive group theory and non-unique factorizations". In Geroldinger, Alfred; Ruzsa, Imre Z. (eds.). Combinatorial number theory and additive group theory. Advanced Courses in Mathematics CRM Barcelona. Elsholtz, C.; Freiman, G.; Hamidoune, Y. O.; Hegyvári, N.; Károlyi, G.; Nathanson, M.; Solymosi, J.; Stanchescu, Y. With a foreword by Javier Cilleruelo, Marc Noy and Oriol Serra (Coordinators of the DocCourse). Basel: Birkhäuser. pp. 1–86. ISBN 978-3-7643-8961-1. Zbl 1221.20045.
- Nathanson, Melvyn B. (1996). Additive Number Theory: Inverse Problems and the Geometry of Sumsets. Graduate Texts in Mathematics. Vol. 165. Springer-Verlag. ISBN 0-387-94655-1. Zbl 0859.11003.