Skip to search formSkip to main contentSkip to account menu

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 (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
Given n positive integers, the Modular Subset Sum problem asks if a subset adds up to a given target t modulo a given integer m… 
Highly Cited
2016
Highly Cited
2016
Let f be a boolean function on n variables. Its associated XOR function is the two-party function F(x, y) = f(x xor y). We show… 
2016
2016
We study the equidistribution of multiplicatively defined sets, such as the squarefree integers, quadratic non-residues or… 
2015
2015
The polynomial Freiman-Ruzsa conjecture is one of the most important conjec- tures in additive combinatorics. It asserts that one… 
Highly Cited
2015
Highly Cited
2015
In order to formally understand the power of neural computing, we first need to crack the frontier of threshold circuits with two… 
Review
2013
Review
2013
Arithmetic combinatorics is often concerned with the problem of bounding the behaviour of arbitrary finite sets in a group or… 
Highly Cited
2012
Highly Cited
2012
In the paper we find new inequalities involving the intersections $A\cap (A-x)$ of shifts of some subset $A$ from an abelian… 
2010
2010
Abstract Given a finite field 𝔽p={0,…,p−1} of p elements, where p is a prime, we consider the distribution of elements in the… 
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… 
Review
2009
Review
2009
This is a survey of several exciting recent results in which techniques originating in the area known as additive combinatorics…