Rough structure and classification
From MaRDI portal
This survey paper tries to determine the most challenging and important unsolved problems of combinatorics. The author, Fields Medalist in 1998, discusses some aspects of the mathematics of the 21st century, especially the role of computers in mathematical research. For the entire collection see [Zbl 0960.00034].
Recommendations
- Rough classification
- Classification coarser than shape
- General structures for classification
- scientific article; zbMATH DE number 754445
- Categories of rough sets and textures
- scientific article; zbMATH DE number 1014396
- Structure and classification of factors
- scientific article; zbMATH DE number 3998536
- An alternative definition of coarse structures
Cited in
(24)- On the combinatorial problems which I would most like to see solved
- Proofs and guarantees
- Measure concentration and the weak Pinsker property
- Renormalization of polygon exchange maps arising from corner percolation
- Around the Danzer problem and the construction of dense forests
- Lakatos-style collaborative mathematics through dialectical, structured and abstract argumentation
- On the complexity of matrix reduction over finite fields
- Seven open problems in applied combinatorics
- Combinatorics and algebra: A medley of problems? A medley of techniques?
- A Danzer set for axis parallel boxes
- Exploiting symmetries in polyhedral computations
- Some unsolved problems in discrete mathematics and mathematical cybernetics
- scientific article; zbMATH DE number 3928926 (Why is no real title available?)
- A family of minimal and renormalizable rectangle exchange maps
- A probability perspective to a combinatorics problem
- The critical window for the classical Ramsey-Turán problem
- Explanation in mathematical conversations: an empirical investigation
- Induced Ramsey-type theorems
- On hereditarily indecomposable Banach spaces
- Easier variants of notorious math problems
- Local-vs-global combinatorics
- A new proof of the graph removal lemma
- On the computation of geometric features of spectra of linear operators on Hilbert spaces
- Automated theorem provers: a practical tool for the working mathematician?
This page was built for publication: Rough structure and classification
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2737646)
