Knowledge (XXG)

Erdős sumset conjecture

Source 📝

355: 136: 70: 185: 156: 114: 94: 45: 415: 396: 200: 430: 389: 425: 420: 20: 220:
Di Nasso, Mauro; Goldbring, Isaac; Jin, Renling; Leth, Steven; Lupini, Martino; Mahlburg, Karl (2015),
382: 119: 53: 324: 316: 298: 254: 236: 366: 308: 246: 320: 286: 191:, and was proven in 2019 in a paper by Joel Moreira, Florian Richter and Donald Robertson. 73: 164: 141: 99: 79: 48: 30: 409: 362: 328: 188: 354: 271: 258: 312: 221: 250: 159: 16:
Conjecture in additive combinations about subsets of natural numbers
303: 241: 370: 167: 144: 122: 102: 82: 56: 33: 179: 150: 130: 108: 88: 64: 39: 285:Moreira, Joel; Richter, Florian (March 2019). 27:is a conjecture which states that if a subset 390: 8: 397: 383: 302: 240: 166: 143: 124: 123: 121: 101: 81: 58: 57: 55: 32: 212: 7: 351: 349: 76:then there are two infinite subsets 369:. You can help Knowledge (XXG) by 14: 416:Conjectures that have been proved 222:"On a sumset conjecture of Erdős" 201:List of conjectures by Paul Erdős 353: 287:"A proof of a sumset conjecture" 229:Canadian Journal of Mathematics 1: 131:{\displaystyle \mathbb {N} } 65:{\displaystyle \mathbb {N} } 321:10.4007/annals.2019.189.2.4 313:10.4007/annals.2019.189.2.4 447: 348: 272:"Erdős Sumset conjecture" 25:Erdős sumset conjecture 365:-related article is a 251:10.4153/CJM-2014-016-0 181: 152: 132: 110: 90: 66: 41: 21:additive combinatorics 291:Annals of Mathematics 182: 153: 133: 111: 91: 72:has a positive upper 67: 42: 165: 142: 120: 100: 80: 54: 31: 431:Combinatorics stubs 180:{\displaystyle B+C} 187:. It was posed by 177: 148: 128: 106: 86: 62: 37: 378: 377: 274:. 20 August 2017. 151:{\displaystyle A} 109:{\displaystyle C} 89:{\displaystyle B} 40:{\displaystyle A} 438: 399: 392: 385: 357: 350: 340: 339: 337: 335: 306: 282: 276: 275: 268: 262: 261: 244: 226: 217: 186: 184: 183: 178: 157: 155: 154: 149: 137: 135: 134: 129: 127: 115: 113: 112: 107: 95: 93: 92: 87: 71: 69: 68: 63: 61: 46: 44: 43: 38: 446: 445: 441: 440: 439: 437: 436: 435: 406: 405: 404: 403: 346: 344: 343: 333: 331: 284: 283: 279: 270: 269: 265: 224: 219: 218: 214: 209: 197: 163: 162: 140: 139: 118: 117: 98: 97: 78: 77: 52: 51: 49:natural numbers 29: 28: 17: 12: 11: 5: 444: 442: 434: 433: 428: 423: 418: 408: 407: 402: 401: 394: 387: 379: 376: 375: 358: 342: 341: 297:(2): 605–652. 277: 263: 235:(4): 795–809, 211: 210: 208: 205: 204: 203: 196: 193: 176: 173: 170: 147: 126: 105: 85: 60: 36: 15: 13: 10: 9: 6: 4: 3: 2: 443: 432: 429: 427: 426:Combinatorics 424: 422: 419: 417: 414: 413: 411: 400: 395: 393: 388: 386: 381: 380: 374: 372: 368: 364: 363:combinatorics 359: 356: 352: 347: 330: 326: 322: 318: 314: 310: 305: 300: 296: 292: 288: 281: 278: 273: 267: 264: 260: 256: 252: 248: 243: 238: 234: 230: 223: 216: 213: 206: 202: 199: 198: 194: 192: 190: 174: 171: 168: 161: 158:contains the 145: 103: 83: 75: 50: 34: 26: 22: 371:expanding it 360: 345: 332:. Retrieved 294: 290: 280: 266: 232: 228: 215: 24: 18: 421:Paul Erdős 410:Categories 304:1803.00498 189:Paul Erdős 138:such that 329:119158401 242:1307.0767 259:15626732 195:See also 334:16 July 74:density 47:of the 327:  319:  257:  160:sumset 23:, the 361:This 325:S2CID 317:JSTOR 299:arXiv 255:S2CID 237:arXiv 225:(PDF) 207:Notes 367:stub 336:2020 96:and 309:doi 295:189 247:doi 116:of 19:In 412:: 323:. 315:. 307:. 293:. 289:. 253:, 245:, 233:67 231:, 227:, 398:e 391:t 384:v 373:. 338:. 311:: 301:: 249:: 239:: 175:C 172:+ 169:B 146:A 125:N 104:C 84:B 59:N 35:A

Index

additive combinatorics
natural numbers
density
sumset
Paul Erdős
List of conjectures by Paul Erdős
"On a sumset conjecture of Erdős"
arXiv
1307.0767
doi
10.4153/CJM-2014-016-0
S2CID
15626732
"Erdős Sumset conjecture"
"A proof of a sumset conjecture"
arXiv
1803.00498
doi
10.4007/annals.2019.189.2.4
JSTOR
10.4007/annals.2019.189.2.4
S2CID
119158401
Stub icon
combinatorics
stub
expanding it
v
t
e

Text is available under the Creative Commons Attribution-ShareAlike License. Additional terms may apply.