Convex sequences may have thin additive bases
| Autor: | Imre Z. Ruzsa, Dmitrii Zhelezov |
|---|---|
| Rok vydání: | 2019 |
| Předmět: |
Sequence
Algebra and Number Theory 010102 general mathematics MathematicsofComputing_GENERAL Regular polygon convex sequences Sumset 0102 computer and information sciences Construct (python library) 11B13 01 natural sciences Combinatorics Set (abstract data type) additive basis Arbitrarily large 010201 computation theory & mathematics FOS: Mathematics Mathematics - Combinatorics sumset Discrete Mathematics and Combinatorics Combinatorics (math.CO) 0101 mathematics Mathematics |
| Zdroj: | Mosc. J. Comb. Number Theory 8, no. 1 (2019), 43-46 |
| ISSN: | 2220-5438 |
| Popis: | For a fixed [math] we construct an arbitrarily large set [math] of size [math] such that its sum set [math] contains a convex sequence of size [math] , answering a question of Hegarty. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|