Discrete Analysis
| Created: | 2011-01-11 09:08 |
|---|---|
| Institution: | Isaac Newton Institute for Mathematical Sciences |
| Description: | During the past decade or so there have been dramatic developments in the interaction between analysis, combinatorial number theory and theoretical computer science: specifically between harmonic analysis and combinatorial number theory and between geometric functional analysis and the theory of algorithms.
Not only have discoveries in one area been used in others but, even more strikingly, there has emerged a commonality of methods and ideas among these apparently diverse areas of mathematics. The use of harmonic analysis in number theory is at least a century old, but in the recent works of Gowers, Green and Tao and others on the existence of arithmetic progressions in subsets of the integers, and in particular the sequence of primes, it has developed into an entire area: additive combinatorics. Classical inequalities of harmonic analysis, such as the isoperimetric inequality, have discrete analogues that are often more subtle than the continuous versions and have wide-ranging applications: for example the discrete isoperimetric inequality of Talagrand, which inspired his work on spin-glass models. Read more at: http://www.newton.ac.uk/programmes/DAN/ |
Media items
This collection contains 92 media items.
Media items
3-terms arithmetic progressions in finite fields (I)
Bateman, M (University of California, Los Angeles)
Tuesday 03 May 2011, 14:00-15:00
Collection: Discrete Analysis
Institution: Isaac Newton Institute for Mathematical Sciences
Created: Fri 6 May 2011
3-terms arithmetic progressions in finite fields (III)
Katz, N (Indiana)
Monday 09 May 2011, 14:00-15:00
Collection: Discrete Analysis
Institution: Isaac Newton Institute for Mathematical Sciences
Created: Fri 3 Jun 2011
3-terms arithmetic progressions in finite fields (IV)
Bateman, M (UCLA)
Thursday 12 May 2011, 14:00-15:00
Collection: Discrete Analysis
Institution: Isaac Newton Institute for Mathematical Sciences
Created: Fri 3 Jun 2011
A curved Brunn-Minkowski inequality in the discrete cube
Ollivier, Y (Universite Paris-Sud)
Thursday 19 May 2011, 14:00-15:00
Collection: Discrete Analysis
Institution: Isaac Newton Institute for Mathematical Sciences
Created: Thu 19 May 2011
A new definition of influences of Boolean functions
Sen, A (Cambridge)
Wednesday 09 March 2011, 15:15-16:15
Collection: Discrete Analysis
Institution: Isaac Newton Institute for Mathematical Sciences
Created: Thu 17 Mar 2011
A non-linear lower bound for planar epsilon-nets
Alon, N (Tel Aviv University and IAS, Princeton)
Tuesday 11 January 2011, 15:30-16:30
Collection: Discrete Analysis
Institution: Isaac Newton Institute for Mathematical Sciences
Created: Wed 12 Jan 2011
A quantitative version of the Gibbard-Satterthwaite theorem
Kindler, G (HUJI)
Friday 01 April 2011, 11:30-12:30
Collection: Discrete Analysis
Institution: Isaac Newton Institute for Mathematical Sciences
Created: Mon 4 Apr 2011
A survey on random walks on groups
Saloff-Coste, L (Cornell)
Wednesday 12 January 2011, 11:30-12:30
Collection: Discrete Analysis
Institution: Isaac Newton Institute for Mathematical Sciences
Created: Wed 12 Jan 2011
Applications of Discrete Analysis in Inapproximability of NP-hard Problems
Austrin, P (University of Toronto)
Wednesday 02 February 2011, 14:00-15:00
Collection: Discrete Analysis
Institution: Isaac Newton Institute for Mathematical Sciences
Created: Tue 8 Feb 2011
Applications of Discrete Harmonic Analysis, Probabilistic Method and Linear Algebra in Fixed-Parameter Tractability and...
Gutin, G (Royal Holloway)
Tuesday 21 June 2011, 14:00-15:00
Collection: Discrete Analysis
Institution: Isaac Newton Institute for Mathematical Sciences
Created: Fri 24 Jun 2011
Arithmetic complexity and the sum of squares problem (I)
Wigderson, A (IAS Princeton)
Tuesday 05 April 2011, 14:00-15:00
Collection: Discrete Analysis
Institution: Isaac Newton Institute for Mathematical Sciences
Created: Tue 12 Apr 2011
Arithmetic complexity and the sum of squares problem (II)
Wigderson, A (IAS Princeton)
Thursday 07 April 2011, 15:15-16:15
Collection: Discrete Analysis
Institution: Isaac Newton Institute for Mathematical Sciences
Created: Wed 13 Apr 2011
Behaviour of Hilbert compression for groups, under group constructions
Valette, A (Neuchâtel)
Tuesday 11 January 2011, 16:30-17:30
Collection: Discrete Analysis
Institution: Isaac Newton Institute for Mathematical Sciences
Created: Wed 12 Jan 2011
Coarse Lipschitz embeddings and asymptotic structure of Banach Spaces
Lancien, G (Franche-Comte)
Wednesday 16 March 2011, 15:15-16:15
Collection: Discrete Analysis
Institution: Isaac Newton Institute for Mathematical Sciences
Created: Thu 17 Mar 2011
Coarse Lipschitz embeddings of expander graphs and cotype
Baudier, F (Texas A&M)
Friday 14 January 2011, 16:30-17:30
Collection: Discrete Analysis
Institution: Isaac Newton Institute for Mathematical Sciences
Created: Mon 17 Jan 2011
Coarse non-amenability and coarse embeddings
Arzhantseva, G (Vienna)
Wednesday 12 January 2011, 14:00-15:00
Collection: Discrete Analysis
Institution: Isaac Newton Institute for Mathematical Sciences
Created: Wed 12 Jan 2011
Complexity of spatial embeddings of graphs
Bukh, B (Cambridge)
Monday 10 January 2011, 10:00-11:00
Collection: Discrete Analysis
Institution: Isaac Newton Institute for Mathematical Sciences
Created: Tue 11 Jan 2011
Computability and Complexity of Julia Sets
Braverman, M (Toronto)
Wednesday 01 June 2011, 15:15-16:15
Collection: Discrete Analysis
Institution: Isaac Newton Institute for Mathematical Sciences
Created: Fri 3 Jun 2011
Concentration inequalities for log-concave measures
Guedon, O (Marne-la-Vallée)
Monday 21 February 2011, 14:00-15:00
Collection: Discrete Analysis
Institution: Isaac Newton Institute for Mathematical Sciences
Created: Thu 24 Feb 2011
Convex decay of entropy in interacting systems
Dai Pra, P (Padova)
Wednesday 30 March 2011, 11:30-12:30
Collection: Discrete Analysis
Institution: Isaac Newton Institute for Mathematical Sciences
Created: Mon 4 Apr 2011