A note on the Erd\H{o}s distinct subset sums problem

Jacob Fox; Max Wenqiang Xu; Quentin Dubroff

REVIEW

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2006.12988 v2 pith:I5WZYIWQ submitted 2020-06-20 math.CO math.NTmath.PR

A note on the ErdH{o}s distinct subset sums problem

Quentin Dubroff , Jacob Fox , Max Wenqiang Xu This is my paper

classification math.CO math.NTmath.PR

keywords distinctsubsetsumsasymptoticbestboundelementgiving

verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved

0 comments

read the original abstract

We present two short proofs giving the best known asymptotic lower bound for the maximum element in a set of $n$ positive integers with distinct subset sums.

A note on the ErdH{o}s distinct subset sums problem

discussion (0)