{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,10]],"date-time":"2026-03-10T13:37:29Z","timestamp":1773149849239,"version":"3.50.1"},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2015,3,12]],"date-time":"2015-03-12T00:00:00Z","timestamp":1426118400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Discrete Comput Geom"],"published-print":{"date-parts":[[2015,6]]},"DOI":"10.1007\/s00454-015-9668-z","type":"journal-article","created":{"date-parts":[[2015,3,11]],"date-time":"2015-03-11T14:56:53Z","timestamp":1426085813000},"page":"783-808","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":14,"title":["The Density of Sets Avoiding Distance 1 in Euclidean Space"],"prefix":"10.1007","volume":"53","author":[{"given":"Christine","family":"Bachoc","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alberto","family":"Passuello","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alain","family":"Thiery","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,3,12]]},"reference":[{"key":"9668_CR1","doi-asserted-by":"crossref","unstructured":"Abramowitz, M., Stegun, I.A.: Handbook of Mathematical Functions with Formulas, Graphs, and Mathematical Tables. National Bureau of Standards Applied Mathematics Series, vol. 55. (1964); Reprint: Dover Publications, Mineola NY (1972)","DOI":"10.1115\/1.3625776"},{"key":"9668_CR2","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1006\/eujc.1995.0092","volume":"18","author":"R Ahlswede","year":"1997","unstructured":"Ahlswede, R., Khachatrian, L.: The complete intersection theorem for systems of finite sets. Eur. J. Comb. 18, 125\u2013136 (1997)","journal-title":"Eur. J. Comb."},{"key":"9668_CR3","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9781107325937","volume-title":"Special Functions","author":"GE Andrews","year":"1999","unstructured":"Andrews, G.E., Askey, R., Roy, R.: Special Functions. Cambridge University Press, Cambridge (1999)"},{"key":"9668_CR4","doi-asserted-by":"crossref","first-page":"521","DOI":"10.5802\/jtnb.847","volume":"25","author":"J Arias de Reyna","year":"2013","unstructured":"Arias de Reyna, J., Toulisse, J.: The $$n$$ n -th prime asymptotically. J. Th\u00e9or. nombres Bordx. 25, 521\u2013555 (2013)","journal-title":"J. Th\u00e9or. nombres Bordx."},{"key":"9668_CR5","doi-asserted-by":"crossref","first-page":"645","DOI":"10.1007\/s00039-009-0013-7","volume":"19","author":"C Bachoc","year":"2009","unstructured":"Bachoc, C., Nebe, G., de Oliveira Filho, F.M., Vallentin, F.: Lower bounds for measurable chromatic numbers. Geom. Funct. Anal. 19, 645\u2013661 (2009)","journal-title":"Geom. Funct. Anal."},{"key":"9668_CR6","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1007\/s11856-014-1070-7","volume":"202","author":"C Bachoc","year":"2014","unstructured":"Bachoc, C., Decorte, E., de Oliveira Filho, F.M., Vallentin, F.: Spectral bounds for the independence ratio and the chromatic number of an operator. Israel J. Math. 202, 227\u2013254 (2014)","journal-title":"Israel J. Math."},{"key":"9668_CR7","doi-asserted-by":"crossref","DOI":"10.1090\/gsm\/054","volume-title":"A Course in Convexity, GSM 54","author":"A Barvinok","year":"2002","unstructured":"Barvinok, A.: A Course in Convexity, GSM 54. American Mathematical Society, Providence, RI (2002)"},{"key":"9668_CR8","unstructured":"Berkelaar, M., Eikland, K., Notebaert, P.: An Open Source (Mixed-Integer) Linear Programming System. lpsolve 5.5.2.0, Licence terms: GNU LGPL. http:\/\/lpsolve.sourceforge.net\/"},{"issue":"7","key":"9668_CR9","doi-asserted-by":"crossref","first-page":"1971","DOI":"10.1016\/j.ejc.2006.08.011","volume":"28","author":"E Klerk de","year":"2007","unstructured":"de Klerk, E., Pasechnik, D.V.: A note on the stability number of an orthogonality graph. Eur. J. Comb. 28(7), 1971\u20131979 (2007)","journal-title":"Eur. J. Comb."},{"key":"9668_CR10","unstructured":"de Laat, D., Vallentin, F.: A semidefinite programming hierarchy for packing problems in discrete geometry. Math. Program. Ser. B http:\/\/arxiv.org\/abs\/1311.3789 (2013)"},{"key":"9668_CR11","unstructured":"de Oliveira Filho, F.M.: New bounds for geometric packings and colorings via harmonic analysis and optimization. Doctoral Thesis, University of Amsterdam. http:\/\/www.ime.usp.br\/~fmario\/pubs.html (2009)"},{"key":"9668_CR12","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1080\/10586458.2014.882170","volume":"23","author":"E Decorte","year":"2014","unstructured":"Decorte, E., de Laat, D., Vallentin, F.: Fourier analysis on finite groups and the Lov\u00e1sz theta-number of Cayley graphs. Exp. Math. 23, 146\u2013152 (2014)","journal-title":"Exp. Math."},{"key":"9668_CR13","first-page":"1","volume":"10","author":"P Delsarte","year":"1973","unstructured":"Delsarte, P.: An algebraic approach to the association schemes of coding theory. Philips Res. Repts Suppl. 10, 1\u201397 (1973)","journal-title":"Philips Res. Repts Suppl."},{"issue":"1","key":"9668_CR14","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1137\/0134012","volume":"34","author":"P Delsarte","year":"1978","unstructured":"Delsarte, P.: Hahn polynomials, discrete harmonics and $$t$$ t -designs. SIAM J. Appl. Math. 34(1), 157\u2013166 (1978)","journal-title":"SIAM J. Appl. Math."},{"key":"9668_CR15","volume-title":"A Course in Abstract Harmonic Analysis","author":"GB Folland","year":"1995","unstructured":"Folland, G.B.: A Course in Abstract Harmonic Analysis. CRC Press, LLC, Boca Raton (1995)"},{"key":"9668_CR16","doi-asserted-by":"crossref","first-page":"357","DOI":"10.1007\/BF02579457","volume":"1","author":"P Frankl","year":"1981","unstructured":"Frankl, P., Wilson, R.M.: Intersection theorems with geometric consequences. Combinatorica 1, 357\u2013368 (1981)","journal-title":"Combinatorica"},{"key":"9668_CR17","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1112\/S0025579300004903","volume":"19","author":"DG Larman","year":"1972","unstructured":"Larman, D.G., Rogers, C.A.: The realization of distances within sets in Euclidean space. Mathematika 19, 1\u201324 (1972)","journal-title":"Mathematika"},{"key":"9668_CR18","doi-asserted-by":"crossref","first-page":"756","DOI":"10.1137\/S1052623400380079","volume":"12","author":"JB Lasserre","year":"2002","unstructured":"Lasserre, J.B.: An explicit equivalent positive semidefinite program for nonlinear 0\u20131 programs. SIAM J. Optim. 12, 756\u2013769 (2002)","journal-title":"SIAM J. Optim."},{"key":"9668_CR19","doi-asserted-by":"crossref","first-page":"470","DOI":"10.1287\/moor.28.3.470.16391","volume":"28","author":"M Laurent","year":"2003","unstructured":"Laurent, M.: A comparison of the Sherali\u2013Adams, Lov\u00e1sz\u2013Schrijver, and Lasserre relaxations for 0\u20131 programming. Math. Oper. Res. 28, 470\u2013496 (2003)","journal-title":"Math. Oper. Res."},{"key":"9668_CR20","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1109\/TIT.1979.1055985","volume":"25","author":"L Lov\u00e1sz","year":"1979","unstructured":"Lov\u00e1sz, L.: On the Shannon capacity of a graph. IEEE Trans. Inf. Theory 25, 1\u20137 (1979)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"9668_CR21","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1109\/TIT.1977.1055688","volume":"23","author":"RJ McEliece","year":"1977","unstructured":"McEliece, R.J., Rodemich, E.R., Rumsey, H., Welch, L.: New upper bounds on the rate of a code via the Delsarte\u2013MacWilliams inequalitie. IEEE Trans. Inf. Theory 23, 157\u2013166 (1977)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"9668_CR22","doi-asserted-by":"crossref","first-page":"1417","DOI":"10.4171\/JEMS\/236","volume":"12","author":"FM Oliveira Filho de","year":"2010","unstructured":"de Oliveira Filho, F.M., Vallentin, F.: Fourier analysis, linear programming, and densities of distance avoiding sets in $${\\mathbb{R}}^{n}$$ R n . J. Eur. Math. Soc. 12, 1417\u20131428 (2010)","journal-title":"J. Eur. Math. Soc."},{"key":"9668_CR23","doi-asserted-by":"crossref","unstructured":"Raigorodskii, A.M.: On the chromatic number of a space. Uspekhi Mat. Nauk 55 147\u2013148 (2001); English translation in Russian Math. Surv. 55, 351\u2013352 (2000)","DOI":"10.4213\/rm281"},{"key":"9668_CR24","volume-title":"Fourier Analysis on Groups","author":"W Rudin","year":"1962","unstructured":"Rudin, W.: Fourier Analysis on Groups. Wiley, New York (1962)"},{"key":"9668_CR25","volume-title":"Real and Complex Analysis","author":"W Rudin","year":"1987","unstructured":"Rudin, W.: Real and Complex Analysis, 3rd edn. McGraw-Hill, New York (1987)","edition":"3"},{"issue":"4","key":"9668_CR26","doi-asserted-by":"crossref","first-page":"425","DOI":"10.1109\/TIT.1979.1056072","volume":"25","author":"A Schrijver","year":"1979","unstructured":"Schrijver, A.: A comparison of the Delsarte and Lov\u00e1sz bounds. IEEE Trans. Inf. Theory 25(4), 425\u2013429 (1979)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"9668_CR27","doi-asserted-by":"crossref","first-page":"2859","DOI":"10.1109\/TIT.2005.851748","volume":"51","author":"A Schrijver","year":"2005","unstructured":"Schrijver, A.: New code upper bounds from the Terwilliger algebra and semidefinite programming. IEEE Trans. Inf. Theory 51, 2859\u20132866 (2005)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"9668_CR28","first-page":"250","volume-title":"Topics in Algebraic Graph Theory","author":"LH Soicher","year":"2004","unstructured":"Soicher, L.H.: Computing with graphs and groups. In: Beineke, L.W., Wilson, R.J. (eds.) Topics in Algebraic Graph Theory, pp. 250\u2013266. Cambridge University Press, Cambridge (2004)"},{"key":"9668_CR29","unstructured":"Stein, W.A., et al.: Sage Mathematics Software (Version 4.7). The Sage Development Team http:\/\/www.sagemath.org (2011)"},{"key":"9668_CR30","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1016\/0012-365X(89)90099-X","volume":"75","author":"LA Sz\u00e9kely","year":"1989","unstructured":"Sz\u00e9kely, L.A., Wormald, N.C.: Bounds on the measurable chromatic number of $${\\mathbb{R}}^{n}$$ R n . Discrete Math. 75, 343\u2013372 (1989)","journal-title":"Discrete Math."},{"key":"9668_CR31","doi-asserted-by":"crossref","first-page":"545","DOI":"10.1080\/10556789908805762","volume":"11","author":"KC Toh","year":"1999","unstructured":"Toh, K.C., Todd, M.J., Tutuncu, R.H.: SDPT3-a Matlab software package for semidefinite programming. Optim. Methods Softw. 11, 545\u2013581 (1999)","journal-title":"Optim. Methods Softw."},{"key":"9668_CR32","volume-title":"A Treatise on the Theory of Bessel Functions","author":"GN Watson","year":"1966","unstructured":"Watson, G.N.: A Treatise on the Theory of Bessel Functions. Cambridge University Press, Cambridge (1966)"},{"key":"9668_CR33","doi-asserted-by":"crossref","first-page":"687","DOI":"10.1007\/978-1-4614-0769-0_24","volume-title":"Handbook on Semidefinite, Cone and Polynomial Optimization: Theory, Algorithms, Software and Applications (chapt. 24)","author":"M Yamashita","year":"2012","unstructured":"Yamashita, M., Fujisawa, K., Fukuda, M., Kobayashi, K., Nakta, K., Nakata, M.: Latest developments in the SDPA family for solving large-scale SDPs. In: Anjos, M.F., Lasserre, J.B. (eds.) Handbook on Semidefinite, Cone and Polynomial Optimization: Theory, Algorithms, Software and Applications (chapt. 24), pp. 687\u2013714. Springer, New York (2012)"}],"container-title":["Discrete & Computational Geometry"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00454-015-9668-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00454-015-9668-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00454-015-9668-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,21]],"date-time":"2019-08-21T17:57:44Z","timestamp":1566410264000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00454-015-9668-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,3,12]]},"references-count":33,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2015,6]]}},"alternative-id":["9668"],"URL":"https:\/\/doi.org\/10.1007\/s00454-015-9668-z","relation":{},"ISSN":["0179-5376","1432-0444"],"issn-type":[{"value":"0179-5376","type":"print"},{"value":"1432-0444","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,3,12]]}}}