{"title":"On Pisier Type Theorems","authors":"Jaroslav Nešetřil, Vojtěch Rödl, Marcelo Sales","doi":"10.1007/s00493-024-00115-1","DOIUrl":null,"url":null,"abstract":"<p>For any integer <span>\\(h\\geqslant 2\\)</span>, a set of integers <span>\\(B=\\{b_i\\}_{i\\in I}\\)</span> is a <span>\\(B_h\\)</span>-set if all <i>h</i>-sums <span>\\(b_{i_1}+\\ldots +b_{i_h}\\)</span> with <span>\\(i_1<\\ldots <i_h\\)</span> are distinct. Answering a question of Alon and Erdős [2], for every <span>\\(h\\geqslant 2\\)</span> we construct a set of integers <i>X</i> which is not a union of finitely many <span>\\(B_h\\)</span>-sets, yet any finite subset <span>\\(Y\\subseteq X\\)</span> contains an <span>\\(B_h\\)</span>-set <i>Z</i> with <span>\\(|Z|\\geqslant \\varepsilon |Y|\\)</span>, where <span>\\(\\varepsilon :=\\varepsilon (h)\\)</span>. We also discuss questions related to a problem of Pisier about the existence of a set <i>A</i> with similar properties when replacing <span>\\(B_h\\)</span>-sets by the requirement that all finite sums <span>\\(\\sum _{j\\in J}b_j\\)</span> are distinct.</p>","PeriodicalId":50666,"journal":{"name":"Combinatorica","volume":null,"pages":null},"PeriodicalIF":1.0000,"publicationDate":"2024-07-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Combinatorica","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.1007/s00493-024-00115-1","RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"MATHEMATICS","Score":null,"Total":0}
引用次数: 0
Abstract
For any integer \(h\geqslant 2\), a set of integers \(B=\{b_i\}_{i\in I}\) is a \(B_h\)-set if all h-sums \(b_{i_1}+\ldots +b_{i_h}\) with \(i_1<\ldots <i_h\) are distinct. Answering a question of Alon and Erdős [2], for every \(h\geqslant 2\) we construct a set of integers X which is not a union of finitely many \(B_h\)-sets, yet any finite subset \(Y\subseteq X\) contains an \(B_h\)-set Z with \(|Z|\geqslant \varepsilon |Y|\), where \(\varepsilon :=\varepsilon (h)\). We also discuss questions related to a problem of Pisier about the existence of a set A with similar properties when replacing \(B_h\)-sets by the requirement that all finite sums \(\sum _{j\in J}b_j\) are distinct.
期刊介绍:
COMBINATORICA publishes research papers in English in a variety of areas of combinatorics and the theory of computing, with particular emphasis on general techniques and unifying principles. Typical but not exclusive topics covered by COMBINATORICA are
- Combinatorial structures (graphs, hypergraphs, matroids, designs, permutation groups).
- Combinatorial optimization.
- Combinatorial aspects of geometry and number theory.
- Algorithms in combinatorics and related fields.
- Computational complexity theory.
- Randomization and explicit construction in combinatorics and algorithms.