Ron Aharoni

EN Texte en anglais Pas encore d'article dans ta langue : extrait en anglais.

Ron Aharoni (Hebrew: רון אהרוני; born 1952) is an Israeli mathematician, working in finite and infinite combinatorics. Aharoni is a professor at the Technion – Israel Institute of Technology, where he received his Ph.D. in mathematics in 1979. With Nash-Williams and Shelah he generalized Hall's marriage theorem by obtaining the right transfinite conditions for infinite bipartite graphs. He subsequently proved the appropriate versions of the Kőnig theorem and the Menger theorem for infinite graphs (the latter with Eli Berger). In 2000 he proved, building on joint work with P. Haxell, a topological version of Hall's theorem. This was used to prove the first open case (that of 3-uniform hypergraphs) of a famous conjecture by Ryser: in a 3-partite hypergraph the ratio between the covering number and the matching number is at most 2. Aharoni is the author of several nonspecialist books; the most successful is Arithmetic for Parents, a book helping parents and elementary school teachers in teaching basic mathematics. He also wrote a book on the connections between Mathematics, poetry and beauty and on philosophy, The Cat That is not There. His book, "Man detaches meaning", is on a mechanism common to jokes and poetry. His last to date book is Circularity: A Common Secret to Paradoxes, Scientific Revolutions and Humor, which binds together mathematics, philosophy and the secrets of humor.