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)

Related topics

Related topics

4 relations
Ergodic Ramsey theoryErgodic theoryInteger-valued polynomialShapley–Folkman lemma

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
Topics in metric geometry, combinatorial geometry, extremal combinatorics and additive combinatorics
I would like to thank Trinity College and Department of Pure Mathematics and Mathematical Statistics for their generous… 
2017
2017
Higher Distance Energies and Expanders with Structure
We adapt the idea of higher moment energies, originally used in Additive Combinatorics, so that it would apply to problems in… 
2017
2017
Advances in Cryptology – CRYPTO 2017
We construct a functional encryption scheme for circuits which simultaneously achieves and improves upon the security of the… 
2015
2015
The Ruzsa divergence for random elements in locally compact abelian groups
Over the past few years, a family of interesting new inequali ties for the entropies of sums and differences of random variables… 
2014
2014
LDPC codes for partial-erasure channels in multi-level memories
In this paper, we develop a new channel model, which we name the q-ary partial erasure channel (QPEC). QPEC has a q-ary input… 
Review
2013
Review
2013
Finite Fields and Their Applications: Character Sums and Polynomials
Finite fields play important roles in many application areas such as coding theory, cryptography, Monte Carlo and quasi-Monte… 
2013
2013
2 Induced forests in sparse bipartite graphs
We prove several results from different areas of extremal combinatorics, giving complete or partial solutions to a number of open… 
2010
2010
EXPANSION OF ORBITS OF SOME DYNAMICAL SYSTEMS OVER FINITE FIELDS
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… 
2008
2008
An improved estimate on sums of product sets
In a recent paper \cite{Gl} A. Glibichuk proved that if $A,B$ are subsets of an arbitrary finite filed $\F_q$, such that $|A||B… 
2007
2007
Topics in arithmetic combinatorics
E-thesis pagination differs from approved hard bound copy, Cambridge University Library classmark: PhD.30726 
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)