{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,11,15]],"date-time":"2024-11-15T14:40:15Z","timestamp":1731681615735,"version":"3.28.0"},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2024,7,11]],"date-time":"2024-07-11T00:00:00Z","timestamp":1720656000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2024,7,11]],"date-time":"2024-07-11T00:00:00Z","timestamp":1720656000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Combinatorica"],"published-print":{"date-parts":[[2024,12]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>For any integer <jats:inline-formula><jats:alternatives><jats:tex-math>$$h\\geqslant 2$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:mrow>\n                    <mml:mi>h<\/mml:mi>\n                    <mml:mo>\u2a7e<\/mml:mo>\n                    <mml:mn>2<\/mml:mn>\n                  <\/mml:mrow>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula>, a set of integers <jats:inline-formula><jats:alternatives><jats:tex-math>$$B=\\{b_i\\}_{i\\in I}$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:mrow>\n                    <mml:mi>B<\/mml:mi>\n                    <mml:mo>=<\/mml:mo>\n                    <mml:msub>\n                      <mml:mrow>\n                        <mml:mo>{<\/mml:mo>\n                        <mml:msub>\n                          <mml:mi>b<\/mml:mi>\n                          <mml:mi>i<\/mml:mi>\n                        <\/mml:msub>\n                        <mml:mo>}<\/mml:mo>\n                      <\/mml:mrow>\n                      <mml:mrow>\n                        <mml:mi>i<\/mml:mi>\n                        <mml:mo>\u2208<\/mml:mo>\n                        <mml:mi>I<\/mml:mi>\n                      <\/mml:mrow>\n                    <\/mml:msub>\n                  <\/mml:mrow>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula> is a <jats:inline-formula><jats:alternatives><jats:tex-math>$$B_h$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:msub>\n                    <mml:mi>B<\/mml:mi>\n                    <mml:mi>h<\/mml:mi>\n                  <\/mml:msub>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula>-set if all <jats:italic>h<\/jats:italic>-sums <jats:inline-formula><jats:alternatives><jats:tex-math>$$b_{i_1}+\\ldots +b_{i_h}$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:mrow>\n                    <mml:msub>\n                      <mml:mi>b<\/mml:mi>\n                      <mml:msub>\n                        <mml:mi>i<\/mml:mi>\n                        <mml:mn>1<\/mml:mn>\n                      <\/mml:msub>\n                    <\/mml:msub>\n                    <mml:mo>+<\/mml:mo>\n                    <mml:mo>\u2026<\/mml:mo>\n                    <mml:mo>+<\/mml:mo>\n                    <mml:msub>\n                      <mml:mi>b<\/mml:mi>\n                      <mml:msub>\n                        <mml:mi>i<\/mml:mi>\n                        <mml:mi>h<\/mml:mi>\n                      <\/mml:msub>\n                    <\/mml:msub>\n                  <\/mml:mrow>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula> with <jats:inline-formula><jats:alternatives><jats:tex-math>$$i_1&lt;\\ldots &lt;i_h$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:mrow>\n                    <mml:msub>\n                      <mml:mi>i<\/mml:mi>\n                      <mml:mn>1<\/mml:mn>\n                    <\/mml:msub>\n                    <mml:mo>&lt;<\/mml:mo>\n                    <mml:mo>\u2026<\/mml:mo>\n                    <mml:mo>&lt;<\/mml:mo>\n                    <mml:msub>\n                      <mml:mi>i<\/mml:mi>\n                      <mml:mi>h<\/mml:mi>\n                    <\/mml:msub>\n                  <\/mml:mrow>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula> are distinct. Answering a question of Alon and Erd\u0151s [2], for every <jats:inline-formula><jats:alternatives><jats:tex-math>$$h\\geqslant 2$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:mrow>\n                    <mml:mi>h<\/mml:mi>\n                    <mml:mo>\u2a7e<\/mml:mo>\n                    <mml:mn>2<\/mml:mn>\n                  <\/mml:mrow>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula> we construct a set of integers <jats:italic>X<\/jats:italic> which is not a union of finitely many <jats:inline-formula><jats:alternatives><jats:tex-math>$$B_h$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:msub>\n                    <mml:mi>B<\/mml:mi>\n                    <mml:mi>h<\/mml:mi>\n                  <\/mml:msub>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula>-sets, yet any finite subset <jats:inline-formula><jats:alternatives><jats:tex-math>$$Y\\subseteq X$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:mrow>\n                    <mml:mi>Y<\/mml:mi>\n                    <mml:mo>\u2286<\/mml:mo>\n                    <mml:mi>X<\/mml:mi>\n                  <\/mml:mrow>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula> contains an <jats:inline-formula><jats:alternatives><jats:tex-math>$$B_h$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:msub>\n                    <mml:mi>B<\/mml:mi>\n                    <mml:mi>h<\/mml:mi>\n                  <\/mml:msub>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula>-set <jats:italic>Z<\/jats:italic> with <jats:inline-formula><jats:alternatives><jats:tex-math>$$|Z|\\geqslant \\varepsilon |Y|$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:mrow>\n                    <mml:mo>|<\/mml:mo>\n                    <mml:mi>Z<\/mml:mi>\n                    <mml:mo>|<\/mml:mo>\n                    <mml:mo>\u2a7e<\/mml:mo>\n                    <mml:mi>\u03b5<\/mml:mi>\n                    <mml:mo>|<\/mml:mo>\n                    <mml:mi>Y<\/mml:mi>\n                    <mml:mo>|<\/mml:mo>\n                  <\/mml:mrow>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula>, where <jats:inline-formula><jats:alternatives><jats:tex-math>$$\\varepsilon :=\\varepsilon (h)$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:mrow>\n                    <mml:mi>\u03b5<\/mml:mi>\n                    <mml:mo>:<\/mml:mo>\n                    <mml:mo>=<\/mml:mo>\n                    <mml:mi>\u03b5<\/mml:mi>\n                    <mml:mo>(<\/mml:mo>\n                    <mml:mi>h<\/mml:mi>\n                    <mml:mo>)<\/mml:mo>\n                  <\/mml:mrow>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula>. We also discuss questions related to a problem of Pisier about the existence of a set <jats:italic>A<\/jats:italic> with similar properties when replacing <jats:inline-formula><jats:alternatives><jats:tex-math>$$B_h$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:msub>\n                    <mml:mi>B<\/mml:mi>\n                    <mml:mi>h<\/mml:mi>\n                  <\/mml:msub>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula>-sets by the requirement that all finite sums <jats:inline-formula><jats:alternatives><jats:tex-math>$$\\sum _{j\\in J}b_j$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:mrow>\n                    <mml:msub>\n                      <mml:mo>\u2211<\/mml:mo>\n                      <mml:mrow>\n                        <mml:mi>j<\/mml:mi>\n                        <mml:mo>\u2208<\/mml:mo>\n                        <mml:mi>J<\/mml:mi>\n                      <\/mml:mrow>\n                    <\/mml:msub>\n                    <mml:msub>\n                      <mml:mi>b<\/mml:mi>\n                      <mml:mi>j<\/mml:mi>\n                    <\/mml:msub>\n                  <\/mml:mrow>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula> are distinct.<\/jats:p>","DOI":"10.1007\/s00493-024-00115-1","type":"journal-article","created":{"date-parts":[[2024,7,11]],"date-time":"2024-07-11T16:02:17Z","timestamp":1720713737000},"page":"1211-1232","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["On Pisier Type Theorems"],"prefix":"10.1007","volume":"44","author":[{"given":"Jaroslav","family":"Ne\u0161et\u0159il","sequence":"first","affiliation":[]},{"given":"Vojt\u011bch","family":"R\u00f6dl","sequence":"additional","affiliation":[]},{"given":"Marcelo","family":"Sales","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,7,11]]},"reference":[{"issue":"3\u20134","key":"115_CR1","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1007\/BF02574042","volume":"13","author":"N Alon","year":"1995","unstructured":"Alon, N., Kalai, G.: Bounding the piercing number. Discret. Comput. Geom. 13(3\u20134), 245\u2013256 (1995)","journal-title":"Discret. Comput. Geom."},{"issue":"3","key":"115_CR2","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1016\/S0195-6698(85)80027-5","volume":"6","author":"N Alon","year":"1985","unstructured":"Alon, N., Erd\u0151s, P.: An application of graph theory to additive number theory. Eur. J. Comb. 6(3), 201\u2013203 (1985)","journal-title":"Eur. J. Comb."},{"issue":"1","key":"115_CR3","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1016\/0001-8708(92)90052-M","volume":"96","author":"N Alon","year":"1992","unstructured":"Alon, N., Kleitman, D.J.: Piercing convex sets and the Hadwiger\u2013Debrunner $$(p, q)$$-problem. Adv. Math. 96(1), 103\u2013112 (1992)","journal-title":"Adv. Math."},{"issue":"1","key":"115_CR4","doi-asserted-by":"publisher","first-page":"137","DOI":"10.5802\/aif.1003","volume":"35","author":"J Bourgain","year":"1985","unstructured":"Bourgain, J.: Sidon sets and Riesz products. Ann. Inst. Fourier (Grenoble) 35(1), 137\u2013148 (1985)","journal-title":"Ann. Inst. Fourier (Grenoble)"},{"key":"115_CR5","volume-title":"Linear Programming, A Series of Books in the Mathematical Sciences","author":"V Chv\u00e1tal","year":"1983","unstructured":"Chv\u00e1tal, V.: Linear Programming, A Series of Books in the Mathematical Sciences. W. H. Freeman and Company, New York (1983)"},{"key":"115_CR6","doi-asserted-by":"crossref","first-page":"369","DOI":"10.1016\/S1385-7258(51)50052-5","volume":"54","author":"NG de Bruijn","year":"1951","unstructured":"de Bruijn, N.G., Erd\u00f6s, P.: A colour problem for infinite graphs and a problem in the theory of relations. Nederl. Akad. Wetensch. Proc. Ser. A. 54, 369\u2013373 (1951)","journal-title":"Nederl. Akad. Wetensch. Proc. Ser. A."},{"key":"115_CR7","doi-asserted-by":"crossref","unstructured":"Erd\u0151s, P., Hajnal, A., Szemer\u00e9di, E.: On almost bipartite large chromatic graphs. In: Theory and Practice of Combinatorics, pp. 117\u2013123 (1982)","DOI":"10.1016\/S0304-0208(08)73497-2"},{"key":"115_CR8","unstructured":"Erd\u0151s, P., Ne\u0161et\u0159il, J., R\u00f6dl, V.: A remark on Pisier type theorems, pp. 101\u2013109. Festschrift for C. St. J. A. Nash-Williams (1996)"},{"key":"115_CR9","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1007\/978-3-642-72905-8_15","volume-title":"Mathematics of Ramsey Theory","author":"P Erd\u0151s","year":"1990","unstructured":"Erd\u0151s, P., Ne\u0161et\u0159il, J., R\u00f6d, V.: On Pisier type problems and results (combinatorial applications to number theory). In: Mathematics of Ramsey Theory, pp. 214\u2013231. Springer, Berlin (1990)"},{"key":"115_CR10","doi-asserted-by":"publisher","first-page":"212","DOI":"10.1112\/jlms\/s1-16.4.212","volume":"16","author":"P Erd\u0151s","year":"1941","unstructured":"Erd\u0151s, P., Tur\u00e1n, P.: On a problem of Sidon in additive number theory, and on some related problems. J. Lond. Math. Soc. 16, 212\u2013215 (1941)","journal-title":"J. Lond. Math. Soc."},{"issue":"1","key":"115_CR11","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1090\/S0002-9947-1987-0896015-8","volume":"303","author":"J Ne\u0161et\u0159il","year":"1987","unstructured":"Ne\u0161et\u0159il, J., R\u00f6dl, V.: Strong Ramsey theorems for Steiner systems. Trans. Am. Math. Soc. 303(1), 183\u2013192 (1987)","journal-title":"Trans. Am. Math. Soc."},{"issue":"1","key":"115_CR12","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1090\/S0273-0979-1983-15092-9","volume":"8","author":"G Pisier","year":"1983","unstructured":"Pisier, G.: Arithmetic characterizations of Sidon sets. Bull. Am. Math. Soc. (N.S.) 8(1), 87\u201389 (1983)","journal-title":"Bull. Am. Math. Soc. (N.S.)"},{"key":"115_CR13","doi-asserted-by":"publisher","first-page":"337","DOI":"10.4153\/CJM-1949-031-1","volume":"1","author":"R Rado","year":"1949","unstructured":"Rado, R.: Axiomatic treatment of rank in infinite sets. Can. J. Math. 1, 337\u2013343 (1949)","journal-title":"Can. J. Math."},{"issue":"1","key":"115_CR14","doi-asserted-by":"publisher","first-page":"536","DOI":"10.1007\/BF01455900","volume":"106","author":"S Sidon","year":"1932","unstructured":"Sidon, S.: Ein Satz\u00fcber trigonometrische Polynome und seine Anwendung in der Theorie der Fourier\u2013Reihen. Math. Ann. 106(1), 536\u2013539 (1932)","journal-title":"Math. Ann."}],"container-title":["Combinatorica"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-024-00115-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00493-024-00115-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-024-00115-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,15]],"date-time":"2024-11-15T14:03:27Z","timestamp":1731679407000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00493-024-00115-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,7,11]]},"references-count":14,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2024,12]]}},"alternative-id":["115"],"URL":"https:\/\/doi.org\/10.1007\/s00493-024-00115-1","relation":{},"ISSN":["0209-9683","1439-6912"],"issn-type":[{"type":"print","value":"0209-9683"},{"type":"electronic","value":"1439-6912"}],"subject":[],"published":{"date-parts":[[2024,7,11]]},"assertion":[{"value":"17 April 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 April 2024","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 June 2024","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 July 2024","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors have no conflict of interest to declare that are relevant to the content of this paper.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}