Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

Arithmetic combinatorics

Known as: Additive combinatorics, Multiplicative combinatorics 
In mathematics, arithmetic combinatorics is a field in the intersection of number theory, combinatorics, ergodic theory and harmonic analysis.
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
Abstract We extend a few fundamental aspects of the classical theory of non-unique factorization, as presented in Geroldinger and… Expand
Is this relevant?
2018
2018
Non-malleable codes provide a useful and meaningful security guarantee in situations where traditional error-correction (and even… Expand
Is this relevant?
2016
2016
We study a class of measures on the real line with a kind of self-similar structure, which we call dynamically driven self… Expand
Is this relevant?
Highly Cited
2015
Highly Cited
2015
We present a collection of new results on problems related to 3SUM, including: The first truly subquadratic algorithm for… Expand
Is this relevant?
2015
2015
The polynomial Freiman-Ruzsa conjecture is one of the most important conjec- tures in additive combinatorics. It asserts that one… Expand
Is this relevant?
2010
2010
Given a finite field Fp = {0, . . . , p − 1} of p elements, where p is a prime, we consider the distribution of elements in the… Expand
Is this relevant?
Highly Cited
2009
Highly Cited
2009
The degrees-of-freedom of a K-user Gaussian interference channel (GIC) has been defined to be the multiple of (1/2)log 2 P at… Expand
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
Highly Cited
2009
Highly Cited
2009
The degrees-of-freedom of a K-user Gaussian interference channel (GIFC) has been defined to be the multiple of (1/2) log2 P at… Expand
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
Highly Cited
2008
Highly Cited
2008
We prove the following inequality on the convolution of distributions over a finite group <i>G:</i> {display equation} where <i>X… Expand
Is this relevant?
Highly Cited
2007
Highly Cited
2007
  • T. Tao, V. Vu
  • Cambridge studies in advanced mathematics
  • 2007
  • Corpus ID: 195837839
2.4. Vinogradov’s three-primes theorem. Sound/Gowers spend some effort discussing Vinogradov’s result that all large odd integers… Expand
Is this relevant?