{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,3,22]],"date-time":"2024-03-22T00:40:31Z","timestamp":1711068031786},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2023,11,1]],"date-time":"2023-11-01T00:00:00Z","timestamp":1698796800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2023,11,1]],"date-time":"2023-11-01T00:00:00Z","timestamp":1698796800000},"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,4]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Let <jats:italic>A<\/jats:italic> be a subset of the cyclic group <jats:inline-formula><jats:alternatives><jats:tex-math>$${\\textbf{Z}}\/p{\\textbf{Z}}$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:mrow>\n                    <mml:mi>Z<\/mml:mi>\n                    <mml:mo>\/<\/mml:mo>\n                    <mml:mi>p<\/mml:mi>\n                    <mml:mi>Z<\/mml:mi>\n                  <\/mml:mrow>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula> with <jats:italic>p<\/jats:italic> prime. It is a well-studied problem to determine how small |<jats:italic>A<\/jats:italic>| can be if there is no unique sum in <jats:inline-formula><jats:alternatives><jats:tex-math>$$A+A$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:mrow>\n                    <mml:mi>A<\/mml:mi>\n                    <mml:mo>+<\/mml:mo>\n                    <mml:mi>A<\/mml:mi>\n                  <\/mml:mrow>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula>, meaning that for every two elements <jats:inline-formula><jats:alternatives><jats:tex-math>$$a_1,a_2\\in A$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:mrow>\n                    <mml:msub>\n                      <mml:mi>a<\/mml:mi>\n                      <mml:mn>1<\/mml:mn>\n                    <\/mml:msub>\n                    <mml:mo>,<\/mml:mo>\n                    <mml:msub>\n                      <mml:mi>a<\/mml:mi>\n                      <mml:mn>2<\/mml:mn>\n                    <\/mml:msub>\n                    <mml:mo>\u2208<\/mml:mo>\n                    <mml:mi>A<\/mml:mi>\n                  <\/mml:mrow>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula>, there exist <jats:inline-formula><jats:alternatives><jats:tex-math>$$a_1',a_2'\\in A$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:mrow>\n                    <mml:msubsup>\n                      <mml:mi>a<\/mml:mi>\n                      <mml:mn>1<\/mml:mn>\n                      <mml:mo>\u2032<\/mml:mo>\n                    <\/mml:msubsup>\n                    <mml:mo>,<\/mml:mo>\n                    <mml:msubsup>\n                      <mml:mi>a<\/mml:mi>\n                      <mml:mn>2<\/mml:mn>\n                      <mml:mo>\u2032<\/mml:mo>\n                    <\/mml:msubsup>\n                    <mml:mo>\u2208<\/mml:mo>\n                    <mml:mi>A<\/mml:mi>\n                  <\/mml:mrow>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula> such that <jats:inline-formula><jats:alternatives><jats:tex-math>$$a_1+a_2=a_1'+a_2'$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:mrow>\n                    <mml:msub>\n                      <mml:mi>a<\/mml:mi>\n                      <mml:mn>1<\/mml:mn>\n                    <\/mml:msub>\n                    <mml:mo>+<\/mml:mo>\n                    <mml:msub>\n                      <mml:mi>a<\/mml:mi>\n                      <mml:mn>2<\/mml:mn>\n                    <\/mml:msub>\n                    <mml:mo>=<\/mml:mo>\n                    <mml:msubsup>\n                      <mml:mi>a<\/mml:mi>\n                      <mml:mn>1<\/mml:mn>\n                      <mml:mo>\u2032<\/mml:mo>\n                    <\/mml:msubsup>\n                    <mml:mo>+<\/mml:mo>\n                    <mml:msubsup>\n                      <mml:mi>a<\/mml:mi>\n                      <mml:mn>2<\/mml:mn>\n                      <mml:mo>\u2032<\/mml:mo>\n                    <\/mml:msubsup>\n                  <\/mml:mrow>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula> and <jats:inline-formula><jats:alternatives><jats:tex-math>$$\\{a_1,a_2\\}\\ne \\{a_1',a_2'\\}$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:mrow>\n                    <mml:mrow>\n                      <mml:mo>{<\/mml:mo>\n                      <mml:msub>\n                        <mml:mi>a<\/mml:mi>\n                        <mml:mn>1<\/mml:mn>\n                      <\/mml:msub>\n                      <mml:mo>,<\/mml:mo>\n                      <mml:msub>\n                        <mml:mi>a<\/mml:mi>\n                        <mml:mn>2<\/mml:mn>\n                      <\/mml:msub>\n                      <mml:mo>}<\/mml:mo>\n                    <\/mml:mrow>\n                    <mml:mo>\u2260<\/mml:mo>\n                    <mml:mrow>\n                      <mml:mo>{<\/mml:mo>\n                      <mml:msubsup>\n                        <mml:mi>a<\/mml:mi>\n                        <mml:mn>1<\/mml:mn>\n                        <mml:mo>\u2032<\/mml:mo>\n                      <\/mml:msubsup>\n                      <mml:mo>,<\/mml:mo>\n                      <mml:msubsup>\n                        <mml:mi>a<\/mml:mi>\n                        <mml:mn>2<\/mml:mn>\n                        <mml:mo>\u2032<\/mml:mo>\n                      <\/mml:msubsup>\n                      <mml:mo>}<\/mml:mo>\n                    <\/mml:mrow>\n                  <\/mml:mrow>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula>. Let <jats:italic>m<\/jats:italic>(<jats:italic>p<\/jats:italic>) be the size of a smallest subset of <jats:inline-formula><jats:alternatives><jats:tex-math>$${\\textbf{Z}}\/p{\\textbf{Z}}$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:mrow>\n                    <mml:mi>Z<\/mml:mi>\n                    <mml:mo>\/<\/mml:mo>\n                    <mml:mi>p<\/mml:mi>\n                    <mml:mi>Z<\/mml:mi>\n                  <\/mml:mrow>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula> with no unique sum. The previous best known bounds are <jats:inline-formula><jats:alternatives><jats:tex-math>$$\\log p \\ll m(p)\\ll \\sqrt{p}$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:mrow>\n                    <mml:mo>log<\/mml:mo>\n                    <mml:mi>p<\/mml:mi>\n                    <mml:mo>\u226a<\/mml:mo>\n                    <mml:mi>m<\/mml:mi>\n                    <mml:mrow>\n                      <mml:mo>(<\/mml:mo>\n                      <mml:mi>p<\/mml:mi>\n                      <mml:mo>)<\/mml:mo>\n                    <\/mml:mrow>\n                    <mml:mo>\u226a<\/mml:mo>\n                    <mml:msqrt>\n                      <mml:mi>p<\/mml:mi>\n                    <\/mml:msqrt>\n                  <\/mml:mrow>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula>. In this paper we improve both the upper and lower bounds to <jats:inline-formula><jats:alternatives><jats:tex-math>$$\\omega (p)\\log p \\leqslant m(p)\\ll (\\log p)^2$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:mrow>\n                    <mml:mi>\u03c9<\/mml:mi>\n                    <mml:mrow>\n                      <mml:mo>(<\/mml:mo>\n                      <mml:mi>p<\/mml:mi>\n                      <mml:mo>)<\/mml:mo>\n                    <\/mml:mrow>\n                    <mml:mo>log<\/mml:mo>\n                    <mml:mi>p<\/mml:mi>\n                    <mml:mo>\u2a7d<\/mml:mo>\n                    <mml:mi>m<\/mml:mi>\n                    <mml:mrow>\n                      <mml:mo>(<\/mml:mo>\n                      <mml:mi>p<\/mml:mi>\n                      <mml:mo>)<\/mml:mo>\n                    <\/mml:mrow>\n                    <mml:mo>\u226a<\/mml:mo>\n                    <mml:msup>\n                      <mml:mrow>\n                        <mml:mo>(<\/mml:mo>\n                        <mml:mo>log<\/mml:mo>\n                        <mml:mi>p<\/mml:mi>\n                        <mml:mo>)<\/mml:mo>\n                      <\/mml:mrow>\n                      <mml:mn>2<\/mml:mn>\n                    <\/mml:msup>\n                  <\/mml:mrow>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula> for some function <jats:inline-formula><jats:alternatives><jats:tex-math>$$\\omega (p)$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:mrow>\n                    <mml:mi>\u03c9<\/mml:mi>\n                    <mml:mo>(<\/mml:mo>\n                    <mml:mi>p<\/mml:mi>\n                    <mml:mo>)<\/mml:mo>\n                  <\/mml:mrow>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula> which tends to infinity as <jats:inline-formula><jats:alternatives><jats:tex-math>$$p\\rightarrow \\infty $$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:mrow>\n                    <mml:mi>p<\/mml:mi>\n                    <mml:mo>\u2192<\/mml:mo>\n                    <mml:mi>\u221e<\/mml:mi>\n                  <\/mml:mrow>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula>. In particular, this shows that for any <jats:inline-formula><jats:alternatives><jats:tex-math>$$B\\subset {\\textbf{Z}}\/p{\\textbf{Z}}$$<\/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>\u2282<\/mml:mo>\n                    <mml:mi>Z<\/mml:mi>\n                    <mml:mo>\/<\/mml:mo>\n                    <mml:mi>p<\/mml:mi>\n                    <mml:mi>Z<\/mml:mi>\n                  <\/mml:mrow>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula> of size <jats:inline-formula><jats:alternatives><jats:tex-math>$$|B|&lt;\\omega (p)\\log p$$<\/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>B<\/mml:mi>\n                    <mml:mo>|<\/mml:mo>\n                    <mml:mo>&lt;<\/mml:mo>\n                    <mml:mi>\u03c9<\/mml:mi>\n                    <mml:mo>(<\/mml:mo>\n                    <mml:mi>p<\/mml:mi>\n                    <mml:mo>)<\/mml:mo>\n                    <mml:mo>log<\/mml:mo>\n                    <mml:mi>p<\/mml:mi>\n                  <\/mml:mrow>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula>, its sumset <jats:inline-formula><jats:alternatives><jats:tex-math>$$B+B$$<\/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:mi>B<\/mml:mi>\n                  <\/mml:mrow>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula> contains a unique sum. We also obtain corresponding bounds on the size of the smallest subset of a general Abelian group having no unique sum.<\/jats:p>","DOI":"10.1007\/s00493-023-00069-w","type":"journal-article","created":{"date-parts":[[2023,11,1]],"date-time":"2023-11-01T15:47:42Z","timestamp":1698853662000},"page":"269-298","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["On Unique Sums in Abelian Groups"],"prefix":"10.1007","volume":"44","author":[{"given":"Benjamin","family":"Bedert","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,11,1]]},"reference":[{"issue":"3, Special Issu","key":"69_CR1","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1007\/PL00009351","volume":"19","author":"YF Bilu","year":"1998","unstructured":"Bilu, Y.F., Lev, V.F., Ruzsa, I.Z.: Rectification principles in additive number theory. Discrete Comput. Geom. 19(3, Special Issue), 343\u2013353 (1998)","journal-title":"Discrete Comput. Geom."},{"issue":"4","key":"69_CR2","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1007\/BF01540597","volume":"82","author":"J Browkin","year":"1976","unstructured":"Browkin, J., Divi\u0161, B., Schinzel, A.: Addition of sequences in general fields. Monatsh. Math. 82(4), 261\u2013268 (1976)","journal-title":"Monatsh. Math."},{"issue":"2","key":"69_CR3","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/s00493-015-3282-9","volume":"37","author":"T Do Duc","year":"2017","unstructured":"Do Duc, T., Schmidt, B.: Unique differences in symmetric subsets of $${\\mathbb{F} }_p$$. Combinatorica 37(2), 167\u2013182 (2017)","journal-title":"Combinatorica"},{"issue":"2","key":"69_CR4","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1016\/S0195-6698(82)80025-5","volume":"3","author":"P Frankl","year":"1982","unstructured":"Frankl, P.: An extremal problem for two families of sets. Euro. J. Combin. 3(2), 125\u2013127 (1982)","journal-title":"Euro. J. Combin."},{"key":"69_CR5","unstructured":"Green, B.: 100 open problems. Manuscript"},{"issue":"1","key":"69_CR6","doi-asserted-by":"publisher","first-page":"N, 23, 8","DOI":"10.37236\/1024","volume":"14","author":"M Ja\u0144czak","year":"2007","unstructured":"Ja\u0144czak, M.: A note on a problem of Hilliker and Straus. Electron. J. Combin. 14(1), N, 23, 8 (2007)","journal-title":"Electron. J. Combin."},{"key":"69_CR7","doi-asserted-by":"publisher","first-page":"370","DOI":"10.1016\/j.jnt.2021.06.014","volume":"233","author":"KH Leung","year":"2022","unstructured":"Leung, K.H., Schmidt, B.: Unique sums and differences in finite abelian groups. J. Number Theory 233, 370\u2013388 (2022)","journal-title":"J. Number Theory"},{"issue":"4","key":"69_CR8","doi-asserted-by":"publisher","first-page":"491","DOI":"10.1007\/s00493-008-2299-8","volume":"28","author":"VF Lev","year":"2008","unstructured":"Lev, V.F.: The rectifiability threshold in abelian groups. Combinatorica 28(4), 491\u2013497 (2008)","journal-title":"Combinatorica"},{"issue":"2","key":"69_CR9","doi-asserted-by":"publisher","first-page":"101","DOI":"10.4064\/aa134-2-1","volume":"134","author":"T Luczak","year":"2008","unstructured":"Luczak, T., Schoen, T.: On a problem of Konyagin. Acta Arith. 134(2), 101\u2013109 (2008)","journal-title":"Acta Arith."},{"issue":"268","key":"69_CR10","doi-asserted-by":"publisher","first-page":"2259","DOI":"10.1090\/S0025-5718-09-02237-6","volume":"78","author":"Z Nedev","year":"2009","unstructured":"Nedev, Z.: An algorithm for finding a nearly minimal balanced set in $${\\mathbb{F} }_p$$. Math. Comp. 78(268), 2259\u20132267 (2009)","journal-title":"Math. Comp."},{"issue":"4","key":"69_CR11","doi-asserted-by":"publisher","first-page":"705","DOI":"10.1515\/integers-2011-0132","volume":"12","author":"M Radziejewska","year":"2012","unstructured":"Radziejewska, M.: A note on the minimal number of representations in $$A+A$$. Integers 12(4), 705\u2013708 (2012)","journal-title":"Integers"},{"key":"69_CR12","unstructured":"Scheinermann, D.: Several problems in linear algebraic and additive combinatorics. PhD thesis, Rutgers University (2019)"},{"issue":"1","key":"69_CR13","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1017\/S1446788715000324","volume":"100","author":"T Schoen","year":"2016","unstructured":"Schoen, T., Shkredov, I.D.: Additive dimension and a theorem of Sanders. J. Aust. Math. Soc. 100(1), 124\u2013144 (2016)","journal-title":"J. Aust. Math. Soc."},{"issue":"3","key":"69_CR14","doi-asserted-by":"publisher","first-page":"1086","DOI":"10.1016\/j.jcta.2010.11.001","volume":"118","author":"ID Shkredov","year":"2011","unstructured":"Shkredov, I.D., Yekhanin, S.: Sets with large additive energy and symmetric sets. J. Combin. Theory Ser. A 118(3), 1086\u20131093 (2011)","journal-title":"J. Combin. Theory Ser. A"},{"issue":"1","key":"69_CR15","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1016\/0022-314X(76)90019-6","volume":"8","author":"EG Straus","year":"1976","unstructured":"Straus, E.G.: Differences of residues $$({\\rm mod} p)$$. J. Number Theory 8(1), 40\u201342 (1976)","journal-title":"J. Number Theory"}],"container-title":["Combinatorica"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-023-00069-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00493-023-00069-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-023-00069-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,21]],"date-time":"2024-03-21T22:02:01Z","timestamp":1711058521000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00493-023-00069-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,11,1]]},"references-count":15,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2024,4]]}},"alternative-id":["69"],"URL":"https:\/\/doi.org\/10.1007\/s00493-023-00069-w","relation":{},"ISSN":["0209-9683","1439-6912"],"issn-type":[{"value":"0209-9683","type":"print"},{"value":"1439-6912","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,11,1]]},"assertion":[{"value":"27 March 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 August 2023","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 September 2023","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 November 2023","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}