Jiří Matoušek

Jiří Matoušek at the Mathematical Research Institute Oberwolfach , 2005

Jiří Matoušek (born March 10, 1963 in Prague ; † March 9, 2015 ) was a Czech mathematician .

Live and act

Matousek was a professor of computer science at the Charles University in Prague . He dealt with discrete and algorithmic (computational) geometry and was the author of several textbooks.

In 1996 he received the EMS Prize . In the laudation, among other things, "best results" in some key problems of combinatorial geometry and optimization (such as algorithms of linear programming and range search) were highlighted and the solution of some long-standing problems, for example in the theory of geometric discrepancies of half-planes and arithmetic progressions and the solution a problem by W. Johnson and Joram Lindenstrauss on the embedding of finite metric spaces in Banach spaces . He also dealt with mathematical logic and, with Martin Loebl, tightened a theorem on undecidability in Peano arithmetic (first found by Harvey Friedman ) of a finite variant of Joseph Kruskal's (1960) theorem on the ordering of sets of finite trees .

In 2000 he received the scientist award of the Societas Scientiarum Bohemica. He was invited speaker at the ICM 1998 in Berlin ( Mathematical Snapshots from the computational geometry landscape ) and at the European Congress of Mathematicians in Budapest 1996. In 2006 he became a member of the learned society of the Czech Republic and in 2012 of the Academia Europaea .

Fonts

With Jaroslav Nešetřil : Invitation to Discrete Mathematics. Oxford University Press 1998 (PDF).
German: Discrete Mathematics. A journey of discovery. Springer, 2nd edition 2007 (also translated into Czech and Spanish, Italian, French).
Geometric discrepancy. An illustrated guide. Springer, 1999.
Lectures on Discrete Geometry. Graduate Texts in Mathematics, 2002 (PDF); also translated into Japanese.
With Bernd Gärtner: Understanding and using linear programming. Springer, Universitext, 2007 (PDF).
Using the Borsuk-Ulam theorem. Lectures on Topological Methods in Combinatorics and Geometry. Springer-Verlag, 2003, 2nd edition 2007.
With Bernd Gärtner: Approximation Algorithms and Semidefinite Programming. Springer, 2012.
Thirty-three miniatures (mathematical and algorithmic applications of linear algebra). Amer. Math. Soc., 2010 (PDF); also translated into Japanese.

Web links

Literature by and about Jiří Matoušek in the catalog of the German National Library
Literature and other media by and about Jiří Matoušek in the catalog of the National Library of the Czech Republic
Homepage

Individual evidence

↑ January Kratochvil: oznámení Smuteční. Charles University, Prague, March 12, 2015, accessed on March 13, 2015 .
↑ Laudation for EMS Awards 1996
↑ In every infinite sequence of finite trees there are two, one of which can be embedded in the other. ${\ displaystyle T_ {i}}$
↑ Loebl, Matousek: On undecidability of the weakened Kruskal theorem. In: Stephen G. Simpson (Editor): Logic and Combinatorics. Arcata 1985, Contemporary Mathematics, Vol. 65, 1987, pp. 275-280.

personal data
SURNAME	Matoušek, Jiří
ALTERNATIVE NAMES	Matousek, Jiri
BRIEF DESCRIPTION	Czech mathematician
DATE OF BIRTH	March 10, 1963
PLACE OF BIRTH	Prague
DATE OF DEATH	March 9, 2015

[1] January Kratochvil: oznámení Smuteční. Charles University, Prague, March 12, 2015, accessed on March 13, 2015 .

[2] Laudation for EMS Awards 1996

[3] In every infinite sequence of finite trees there are two, one of which can be embedded in the other. ${\ displaystyle T_ {i}}$

[4] Loebl, Matousek: On undecidability of the weakened Kruskal theorem. In: Stephen G. Simpson (Editor): Logic and Combinatorics. Arcata 1985, Contemporary Mathematics, Vol. 65, 1987, pp. 275-280.