Additive combinatorics: with a view towards computer science and cryptography -- an exposition

DOI10.1007/978-1-4614-6642-0_4MaRDI QIDQ2840793zbMATH OpenOpenAlexFDO

Authors Khodakhast Bibak

Publication date 23 July 2013

Published in Springer Proceedings in Mathematics & Statistics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1108.3790

zbMATH Keywords

additive combinatoricscomputer sciencerandomnesssum productssumsets

Mathematics Subject Classification ID

Additive bases, including sumsets (11B13) Arithmetic combinatorics; higher degree uniformity (11B30) Other combinatorial number theory (11B75) Cryptography (94A60)

Abstract: Recently, additive combinatorics has blossomed into a vibrant area in mathematical sciences. But it seems to be a difficult area to define - perhaps because of a blend of ideas and techniques from several seemingly unrelated contexts which are used there. One might say that additive combinatorics is a branch of mathematics concerning the study of combinatorial properties of algebraic objects, for instance, Abelian groups, rings, or fields. This emerging field has seen tremendous advances over the last few years, and has recently become a focus of attention among both mathematicians and computer scientists. This fascinating area has been enriched by its formidable links to combinatorics, number theory, harmonic analysis, ergodic theory, and some other branches; all deeply cross-fertilize each other, holding great promise for all of them! In this exposition, we attempt to provide an overview of some breakthroughs in this field, together with a number of seminal applications to sundry parts of mathematics and some other disciplines, with emphasis on computer science and cryptography.

Recommendations

• Additive combinatorics
• Additive combinatorics over finite fields: new results and applications
• Non-commutative methods in additive combinatorics and number theory
• Combinatorial designs and cryptography, revisited
• Structural additive theory. Based on courses given at Karl-Franzens-Universität Graz, Austria, 2008--2012

Cites work

Cited in

(8)

• Deletion correcting codes meet the Littlewood-Offord problem
• scientific article; zbMATH DE number 5127201 (Why is no real title available?)
• An improved lower bound for finite additive 2-bases
• On the communication complexity of high-dimensional permutations
• Additive combinatorics over finite fields: new results and applications
• Sumsets in the hypercube
• Parameterized algorithms on integer sets with small doubling: integer programming, subset sum and k-SUM
• Testing sumsets is hard

This page was built for publication: Additive combinatorics: with a view towards computer science and cryptography -- an exposition

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2840793)