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 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.
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.
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.
Graduate Texts in Mathematics
Rajendra Bhatia;Glen Bredon;Wolfgang Walter;Joseph J. Rotman.
Using the Borsuk-Ulam theorem : lectures on topological methods in combinatorics and geometry
Jiří Matoušek;Anders Björner;Gunter M Ziegler.
Using the Borsuk-Ulam Theorem
Understanding and Using Linear Programming
Jiří Matoušek;Bernd Gärtner.
On the L 2 -discrepancy for anchored boxes
Journal of Complexity (1998)
Reporting points in halfspaces
Computational Geometry: Theory and Applications (1992)
Ray shooting and parametric search
Pankaj K. Agarwal;Jiří Matoušek.
SIAM Journal on Computing (1993)
Approximations and optimal geometric divide-and-conquer
symposium on the theory of computing (1991)
On the complexity of finding iso- and other morphisms for partial k -trees
Jiří Matoušek;Robin Thomas.
Discrete Mathematics (1992)
On embedding expanders into ℓp spaces
Israel Journal of Mathematics (1997)
If you think any of the details on this page are incorrect, let us know.
We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below: