What is good mathematics?
From MaRDI portal
Publication:5452356
DOI10.1090/S0273-0979-07-01168-8zbMath1132.00303arXivmath/0702396OpenAlexW2003149186MaRDI QIDQ5452356
Publication date: 26 March 2008
Published in: Bulletin of the American Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/math/0702396
Related Items
Approximating dependent rare events, Structurally Stable Symmetric Tilings on the Plane, Discrete quantum subgroup asymptotically fixing a sequence of finite subsets, Learning and teaching ``what is mathematics, The surveyability of long proofs, Arithmetic progressions in self-similar sets, Explanation in mathematical conversations: an empirical investigation, Algebraic characterizations of some relative notions of size, Data science vs. statistics: two cultures?, From harmonic analysis to arithmetic combinatorics
Cites Work
- Roth's theorem in the primes
- Small gaps between primes exist.
- A quantitative ergodic theory proof of Szemerédi's theorem
- Roth's theorem on progressions revisited
- Ergodic behavior of diagonal measures and a theorem of Szemeredi on arithmetic progressions
- A new proof of Szemerédi's theorem for arithmetic progressions of length four
- Lower bounds of tower type for Szemerédi's uniformity lemma
- On triples in arithmetic progression
- Nonconventional ergodic averages and nilmanifolds
- The primes contain arbitrarily long arithmetic progressions
- Irregularities of sequences relative to arithmetic progressions. IV
- A Szemerédi-type regularity lemma in abelian groups, with applications
- Über Summen von Primzahlen und Primzahlquadraten
- The ergodic theoretical proof of Szemerédi’s theorem
- The unreasonable effectiveness of mathematics in the natural sciences. Richard courant lecture in mathematical sciences delivered at New York University, May 11, 1959
- Quasirandomness, Counting and Regularity for 3-Uniform Hypergraphs
- Universal characteristic factors and Furstenberg averages
- Primitive Recursive Bounds for Van Der Waerden Numbers
- Regularity and Positional Games
- Three Primes and an Almost-Prime in Arithmetic Progression
- On sets of integers containing k elements in arithmetic progression
- Regularity Lemma for k-uniform hypergraphs
- Arithmetic progressions of length three in subsets of a random set
- Higher correlations of divisor sums related to primes III: small gaps between primes
- Regular Partitions of Hypergraphs: Regularity Lemmas
- The counting lemma for regular k‐uniform hypergraphs
- Applications of the regularity lemma for uniform hypergraphs
- On sets of integers containing no four elements in arithmetic progression
- On Certain Sets of Integers
- On Sets of Integers Which Contain No Three Terms in Arithmetical Progression
- A new proof of Szemerédi's theorem
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
