Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 218,250,725 papers from all fields of science
Search
Sign In
Create Free Account
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)
Create Alert
Alert
Related topics
Related topics
4 relations
Ergodic Ramsey theory
Ergodic theory
Integer-valued polynomial
Shapley–Folkman lemma
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
Fast Modular Subset Sum using Linear Sketching
Kyriakos Axiotis
,
A. Backurs
,
Christos Tzamos
ACM-SIAM Symposium on Discrete Algorithms
2018
Corpus ID: 49744254
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…
Expand
Highly Cited
2016
Highly Cited
2016
Structure of Protocols for XOR Functions
Hamed Hatami
,
Kaave Hosseini
,
Shachar Lovett
IEEE Annual Symposium on Foundations of Computer…
2016
Corpus ID: 3878878
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…
Expand
2016
2016
Prescribing the binary digits of squarefree numbers and quadratic residues
R. Dietmann
,
Christian Elsholtz
,
I. Shparlinski
2016
Corpus ID: 119304051
We study the equidistribution of multiplicatively defined sets, such as the squarefree integers, quadratic non-residues or…
Expand
2015
2015
An Exposition of Sanders' Quasi-Polynomial Freiman-Ruzsa Theorem
Shachar Lovett
Theory of Computing
2015
Corpus ID: 6119800
The polynomial Freiman-Ruzsa conjecture is one of the most important conjec- tures in additive combinatorics. It asserts that one…
Expand
Highly Cited
2015
Highly Cited
2015
Super-linear gate and super-quadratic wire lower bounds for depth-two and depth-three threshold circuits
D. Kane
,
Ryan Williams
Symposium on the Theory of Computing
2015
Corpus ID: 1146395
In order to formally understand the power of neural computing, we first need to crack the frontier of threshold circuits with two…
Expand
Review
2013
Review
2013
Algebraic combinatorial geometry: the polynomial method in arithmetic combinatorics, incidence combinatorics, and number theory
T. Tao
2013
Corpus ID: 54624238
Arithmetic combinatorics is often concerned with the problem of bounding the behaviour of arbitrary finite sets in a group or…
Expand
Highly Cited
2012
Highly Cited
2012
Some new inequalities in additive combinatorics
I. Shkredov
2012
Corpus ID: 117846784
In the paper we find new inequalities involving the intersections $A\cap (A-x)$ of shifts of some subset $A$ from an abelian…
Expand
2010
2010
EXPANSION OF ORBITS OF SOME DYNAMICAL SYSTEMS OVER FINITE FIELDS
J. Gutierrez
,
I. Shparlinski
Bulletin of the Australian Mathematical Society
2010
Corpus ID: 12605101
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…
Expand
Highly Cited
2009
Highly Cited
2009
The Degrees-of-Freedom of the $K$-User Gaussian Interference Channel Is Discontinuous at Rational Channel Coefficients
R. Etkin
,
E. Ordentlich
IEEE Transactions on Information Theory
2009
Corpus ID: 1832923
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
Review
2009
Review
2009
Approximate groups and their applications: work of Bourgain, Gamburd, Helfgott and Sarnak
B. Green
2009
Corpus ID: 115173068
This is a survey of several exciting recent results in which techniques originating in the area known as additive combinatorics…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE
or Only Accept Required