What is he best known for?
The fields of study he is best known for:
- Combinatorics
- Geometry
- Real number
Jiří Matoušek mainly investigates Combinatorics, Discrete mathematics, Upper and lower bounds, Bounded function and Computational geometry.
He combines subjects such as Measure and Point with his study of Combinatorics.
His Discrete mathematics study integrates concerns from other disciplines, such as Simplex, Simple and Plane.
His research in Upper and lower bounds intersects with topics in Embedding and Metric space.
His Bounded function study combines topics from a wide range of disciplines, such as Subdivision, Algebraic curve, Crossing number, Polynomial and Spanning tree.
His study in Computational geometry is interdisciplinary in nature, drawing from both Computational complexity theory and Deterministic algorithm.
His most cited work include:
- Graduate Texts in Mathematics (7753 citations)
- Using the Borsuk-Ulam Theorem (509 citations)
- On the L 2 -discrepancy for anchored boxes (231 citations)
What are the main themes of his work throughout his whole career to date?
His primary scientific interests are in Combinatorics, Discrete mathematics, Upper and lower bounds, Regular polygon and Plane.
His research on Combinatorics frequently links to adjacent areas such as Bounded function.
His Discrete mathematics research incorporates elements of Linear programming and Convex set.
His study in Upper and lower bounds is interdisciplinary in nature, drawing from both Measure and Integer.
He works mostly in the field of Plane, limiting it down to concerns involving Computational geometry and, occasionally, Deterministic algorithm.
Jiří Matoušek usually deals with Simplicial complex and limits it to topics linked to Embedding and Metric space.
He most often published in these fields:
- Combinatorics (80.40%)
- Discrete mathematics (46.00%)
- Upper and lower bounds (24.40%)
What were the highlights of his more recent work (between 2009-2018)?
- Combinatorics (80.40%)
- Discrete mathematics (46.00%)
- Upper and lower bounds (24.40%)
In recent papers he was focusing on the following fields of study:
Jiří Matoušek mainly focuses on Combinatorics, Discrete mathematics, Upper and lower bounds, Disjoint sets and Simplicial complex.
He works on Combinatorics which deals in particular with Time complexity.
In his study, Fixed point and Voronoi diagram is inextricably linked to Metric space, which falls within the broad field of Time complexity.
As part of the same scientific family, Jiří Matoušek usually focuses on Discrete mathematics, concentrating on Homotopy and intersecting with Undecidable problem.
His Upper and lower bounds study which covers Measure that intersects with Venn diagram.
His Disjoint sets research incorporates elements of Pointwise and Square.
Between 2009 and 2018, his most popular works were:
- Hardness of embedding simplicial complexes in Rd (74 citations)
- Simple Proofs of Classical Theorems in Discrete Geometry via the Guth–Katz Polynomial Partitioning Technique (62 citations)
- Lower bounds for weak epsilon-nets and stair-convexity (47 citations)
In his most recent research, the most cited papers focused on:
- Combinatorics
- Geometry
- Mathematical analysis
Jiří Matoušek spends much of his time researching Combinatorics, Discrete mathematics, Upper and lower bounds, Simplicial complex and Disjoint sets.
Jiří Matoušek studies Combinatorics, focusing on Dimension in particular.
His Discrete mathematics study integrates concerns from other disciplines, such as Structure, Homotopy and Minor.
His Upper and lower bounds research is multidisciplinary, incorporating perspectives in Plane, Graph of a function and Convex set.
His Simplicial complex study incorporates themes from Novikov self-consistency principle, Piecewise linear function, Decidability and Graph.
His research in Disjoint sets intersects with topics in Geometric proof, Cardinality, Pointwise and Existential quantification.
This overview was generated by a machine learning system which analysed the scientist’s
body of work. If you have any feedback, you can
contact us
here.
