Structural approach to subset sum problems

DOI10.1007/S10208-016-9326-8MaRDI QIDQ506621zbMATH OpenOpenAlexFDO

Authors Endre Szemerédi

Publication date 1 February 2017

Published in Foundations of Computational Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10208-016-9326-8

zbMATH Keywords

densitymodularityarithmetic progressionssumsetscomplete and subcomplete sequencesgeneralized arithmetic progressionsinverse theorems

Mathematics Subject Classification ID

Other combinatorial number theory (11B75) Arithmetic progressions (11B25) Inverse problems of additive number theory, including sumsets (11P70)

Recommendations

• Long arithmetic progressions in sumsets: Thresholds and bounds
• New analytical results in subset-sum problem
• Blocks and progressions in subset sum sets
• Finite addition theorems. II
• Finite and infinite arithmetic progressions in sumsets

Cites work

• scientific article; zbMATH DE number 4177149 (Why is no real title available?)
• scientific article; zbMATH DE number 3425719 (Why is no real title available?)
• scientific article; zbMATH DE number 3577263 (Why is no real title available?)
• scientific article; zbMATH DE number 1315258 (Why is no real title available?)
• scientific article; zbMATH DE number 3345481 (Why is no real title available?)
• scientific article; zbMATH DE number 5181747 (Why is no real title available?)
• An addition theorem modulo p
• Arithmetic progressions in sumsets
• Arithmetic progressions in sumsets
• Asymptotically tight bounds on subset sums
• Cyclic Spaces for Grassmann Derivatives and Additive Theory
• Finite addition theorems. I
• Finite and infinite arithmetic progressions in sumsets
• Generalized arithmetical progressions and sumsets
• Integer Sum Sets Containing Long Arithmetic Progressions
• Long arithmetic progressions in sum-sets and the number x-sum-free sets
• Long arithmetic progressions in sumsets: Thresholds and bounds
• On complete subsets of the cyclic group
• On subset sums of a fixed set
• On the Addition of Residue Classes
• On the Representation of Integers as Sums of Distinct Terms from a Fixed Sequence
• On the addition of residue classes mod p
• On the maximal density of sum-free sets
• On the representation of integers as sums of distinct terms from a fixed set
• On the representation of large integers as sums of distinct summands taken from a fixed set
• Some new results on subset sums
• Sums of sets of group elements

Cited in

(6)

• The Modular Subset-Sum Problem and the size of deletion correcting codes
• Subset sum problems with digraph constraints
• Finite and infinite arithmetic progressions in sumsets
• Faster Pseudopolynomial Time Algorithms for Subset Sum
• New analytical results in subset-sum problem
• A Structural Approach to Subset-Sum Problems

This page was built for publication: Structural approach to subset sum problems

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