Szemerédi, Endre (2016) Structural Approach to Subset Sum Problems. FOUNDATIONS OF COMPUTATIONAL MATHEMATICS, 16 (6). pp. 1737-1749. ISSN 1615-3375
![[img]](http://real.mtak.hu/style/images/fileicons/text.png) |
Text
art3A10.10072Fs10208_016_9326_8_u.pdf Restricted to Registered users only Download (600kB) | Request a copy |
Official URL: http://dx.doi.org/10.1007/s10208-016-9326-8
Abstract
We discuss results obtained jointly with Van Vu on the length of arithmetic progressions in ℓ-fold sumsets of the form ∓A = {a1 +・ ・ ・+a∓ | ai ∈ A} and ∓A = {a1 +・ ・ ・+a∓ | ai ∈ A all distinct},where A is a set of integers. Applications are also discussed. © 2016, SFoCM.
| Item Type: | Article |
|---|---|
| Uncontrolled Keywords: | Mathematical techniques; Subset sum problems; Structural approach; nocv1; Computational methods; Sumsets; Inverse theorems; Generalized arithmetic progressions; Complete and subcomplete sequences; Arithmetic progressions |
| Subjects: | Q Science / természettudomány > QA Mathematics / matematika |
| SWORD Depositor: | MTMT SWORD |
| Depositing User: | MTMT SWORD |
| Date Deposited: | 03 Jan 2017 15:06 |
| Last Modified: | 03 Jan 2017 15:06 |
| URI: | http://real.mtak.hu/id/eprint/44175 |
Actions (login required)
 |
Edit Item |
