What is good mathematics?
From MaRDI portal
Publication:5452356
Abstract: Some personal thoughts and opinions on what ``good quality mathematics is, and whether one should try to define this term rigorously. As a case study, the story of Szemer'edi's theorem is presented.
Recommendations
Cites work
- scientific article; zbMATH DE number 3719449 (Why is no real title available?)
- scientific article; zbMATH DE number 3609704 (Why is no real title available?)
- scientific article; zbMATH DE number 1495487 (Why is no real title available?)
- A Szemerédi-type regularity lemma in abelian groups, with applications
- A new proof of Szemerédi's theorem
- A new proof of Szemerédi's theorem for arithmetic progressions of length four
- A quantitative ergodic theory proof of Szemerédi's theorem
- Additive combinatorics
- Applications of the regularity lemma for uniform hypergraphs
- Arithmetic progressions of length three in subsets of a random set
- Ergodic behavior of diagonal measures and a theorem of Szemeredi on arithmetic progressions
- Higher correlations of divisor sums related to primes III: small gaps between primes
- Irregularities of sequences relative to arithmetic progressions. IV
- Lower bounds of tower type for Szemerédi's uniformity lemma
- Nonconventional ergodic averages and nilmanifolds
- On Certain Sets of Integers
- On Sets of Integers Which Contain No Three Terms in Arithmetical Progression
- On sets of integers containing k elements in arithmetic progression
- On sets of integers containing no four elements in arithmetic progression
- On triples in arithmetic progression
- Primitive Recursive Bounds for Van Der Waerden Numbers
- Quasirandomness, Counting and Regularity for 3-Uniform Hypergraphs
- Regular Partitions of Hypergraphs: Regularity Lemmas
- Regularity Lemma for k-uniform hypergraphs
- Regularity and Positional Games
- Roth's theorem in the primes
- Roth's theorem on progressions revisited
- Small gaps between primes exist.
- The counting lemma for regular k‐uniform hypergraphs
- The dichotomy between structure and randomness, arithmetic progressions, and the primes
- The ergodic theoretical proof of Szemerédi’s theorem
- The primes contain arbitrarily long arithmetic progressions
- The unreasonable effectiveness of mathematics in the natural sciences. Richard courant lecture in mathematical sciences delivered at New York University, May 11, 1959
- Three Primes and an Almost-Prime in Arithmetic Progression
- Universal characteristic factors and Furstenberg averages
- Über Summen von Primzahlen und Primzahlquadraten
Cited in
(14)- Explanation in mathematical conversations: an empirical investigation
- Data science vs. statistics: two cultures?
- What is a good question?
- Structurally Stable Symmetric Tilings on the Plane
- The surveyability of long proofs
- Algebraic characterizations of some relative notions of size
- Algorithm and abstraction in formal mathematics
- From harmonic analysis to arithmetic combinatorics
- Discrete quantum subgroup asymptotically fixing a sequence of finite subsets
- scientific article; zbMATH DE number 6127025 (Why is no real title available?)
- Approximating dependent rare events
- Q for qualitative mathematics. Quality in large quantities!
- Learning and teaching ``what is mathematics
- Arithmetic progressions in self-similar sets
This page was built for publication: What is good mathematics?
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5452356)
