{"id":105,"date":"2013-11-11T12:14:28","date_gmt":"2013-11-11T11:14:28","guid":{"rendered":"http:\/\/www.mi.uni-koeln.de\/opt\/?page_id=105"},"modified":"2026-09-16T16:20:45","modified_gmt":"2026-09-16T14:20:45","slug":"publications","status":"publish","type":"page","link":"https:\/\/www.mi.uni-koeln.de\/opt\/frank-vallentin\/publications\/","title":{"rendered":"Publications"},"content":{"rendered":"<p><span style=\"color: #ff0000;\"><strong>preprints<br \/>\n<\/strong><\/span><a title=\"http:\/\/arxiv.org\/abs\/1206.2608\" href=\"https:\/\/arxiv.org\/abs\/2503.22895\" target=\"_blank\" rel=\"nofollow noopener noreferrer\">[S4]<\/a> A. Joharian, <span style=\"color: #333333;\">F. Vallentin, M.C. Zimmermann, Critical modular lattices in the Gaussian core model, 31 pages<\/span><br \/>\n<a title=\"http:\/\/arxiv.org\/abs\/1206.2608\" href=\"https:\/\/arxiv.org\/abs\/2502.08819\" target=\"_blank\" rel=\"nofollow noopener noreferrer\">[S3]<\/a> C. Bachoc, P. Moustrou, <span style=\"color: #333333;\">F. Vallentin, M.C. Zimmermann, Polarization of lattices: Stable cold spots and spherical designs, 32 pages<\/span><br \/>\n<a title=\"http:\/\/arxiv.org\/abs\/1206.2608\" href=\"https:\/\/arxiv.org\/abs\/2312.11267\" target=\"_blank\" rel=\"nofollow noopener noreferrer\">[S2]<\/a> C. Riener, J. Rolfes<span style=\"color: #333333;\">, F. Vallentin, A semidefinite programming hierarchy for covering problems in discrete geometry, 14 pages, <\/span>accepted in Numerical Algebra, Control and Optimization (NACO), special issue on &#8222;POP23 &#8211; Future Trends in Polynomial Optimization&#8220;<br \/>\n<a title=\"http:\/\/arxiv.org\/abs\/1206.2608\" href=\"https:\/\/arxiv.org\/abs\/2210.11952\" target=\"_blank\" rel=\"nofollow noopener noreferrer\">[S1]<\/a>\u00a0<span style=\"color: #333333;\">A. Heimendahl, M. L\u00fccke, F. Vallentin, M.C. Zimmermann, A semidefinite program for least distortion embeddings of flat tori into Hilbert spaces, 23 pages<\/span><\/p>\n<p><strong style=\"color: #ff0000;\">papers in journals<br \/>\n<\/strong><a title=\"http:\/\/arxiv.org\/abs\/1206.2608\" href=\"https:\/\/arxiv.org\/abs\/2407.03513\" target=\"_blank\" rel=\"nofollow noopener noreferrer\">[J44]<\/a> <span style=\"color: #333333;\">F. Vallentin, S. Wei\u00dfbach, M.C. Zimmermann, The chromatic number of 4-dimensional lattices, Indag. Math. (N.S.) 36 (2025) 988-1004.<\/span><br \/>\n<a title=\"http:\/\/arxiv.org\/abs\/1206.2608\" href=\"https:\/\/arxiv.org\/abs\/2402.09914\" target=\"_blank\" rel=\"nofollow noopener noreferrer\">[J43]<\/a> K. Leipold, <span style=\"color: #333333;\">F. Vallentin, Computing the EHZ capacity is NP-hard, Proc. Amer. Math. Soc. Ser. B 11 (2024), 603\u2013611.<\/span><br \/>\n<a title=\"http:\/\/arxiv.org\/abs\/1206.2608\" href=\"https:\/\/arxiv.org\/abs\/2206.03929\" target=\"_blank\" rel=\"nofollow noopener noreferrer\">[J42]<\/a> D. Castro-Silva, F.M. de Oliveira Filho, L. Slot, F. Vallentin &#8211; A recursive theta body for hypergraphs, 23 pages, Combinatorica 43 (2023), 909-938.<br \/>\n<a title=\"http:\/\/arxiv.org\/abs\/1206.2608\" href=\"https:\/\/arxiv.org\/abs\/2105.07868\" target=\"_blank\" rel=\"nofollow noopener noreferrer\">[J41]<\/a>\u00a0<span style=\"color: #333333;\">A. Heimendahl, A. Marafioti, A. Thiemeyer, F. Vallentin, M.C. Zimmermann, Critical even unimodular lattices in the Gaussian core model, IMRN (2023), 5352-5396<br \/>\n<\/span><span style=\"color: #ff0000;\"><a title=\"http:\/\/arxiv.org\/abs\/1206.2608\" href=\"https:\/\/arxiv.org\/abs\/1812.06045\" target=\"_blank\" rel=\"nofollow noopener noreferrer\">[J40]<\/a><\/span>\u00a0D. de Laat, F.C.Machado, F.M. de Oliveira Filho, F. Vallentin, k-point semidefinite programming bounds for equiangular lines, Math. Program. 194 (2022), 533-567.<br \/>\n<a title=\"http:\/\/arxiv.org\/abs\/1206.2608\" href=\"https:\/\/arxiv.org\/abs\/2106.09360\" target=\"_blank\" rel=\"nofollow noopener noreferrer\">[J39]<\/a> D. Castro-Silva, F.M. de Oliveira Filho, L. Slot, F. Vallentin &#8211; A\u00a0recursive Lov\u00e1sz theta number for simplex-avoiding sets, Proc. AMS 150 (2022), 3307-3322.<br \/>\n<a title=\"http:\/\/arxiv.org\/abs\/1206.2608\" href=\"https:\/\/arxiv.org\/abs\/1804.09099\" target=\"_blank\" rel=\"nofollow noopener noreferrer\">[J38]<\/a>\u00a0E. DeCorte, F.M. de Oliveira Filho, F. Vallentin, Complete positivity and distance avoiding sets, Math. Program. 191 (2022), 487-558.<br \/>\n<span style=\"color: #ff0000;\"><a title=\"http:\/\/arxiv.org\/abs\/1206.2608\" href=\"https:\/\/arxiv.org\/abs\/2004.07574\" target=\"_blank\" rel=\"nofollow noopener noreferrer\">[J37]<\/a> <\/span>S.T. McCormick, B. Peis, R. Scheidweiler, F. Vallentin, A polynomial\u00a0time algorithm for solving the closest vector problem in zonotopal\u00a0lattices, SIAM J. Discrete Math. 35 (2021), 2345\u20132356.<br \/>\n<span style=\"color: #ff0000;\"><a title=\"http:\/\/arxiv.org\/abs\/1206.2608\" href=\"https:\/\/arxiv.org\/abs\/1907.09751\" target=\"_blank\" rel=\"nofollow noopener noreferrer\">[J36] <\/a><\/span>M. Dutour Sikiri\u0107, D. Madore, P. Moustrou, F. Vallentin, Coloring the Voronoi tessellation of lattices, J. Lond. Math. Soc. (2) 104 (2021) 1135-1171.<strong style=\"color: #ff0000;\"><span style=\"color: #ff0000;\"><br \/>\n<\/span><\/strong><a href=\"https:\/\/arxiv.org\/abs\/1807.01382\">[J35]<\/a> M. Dutour Sikiri\u0107, A. Sch\u00fcrmann, F. Vallentin, A simplex algorithm for rational CP-factorization, Math. Program. 187 (2021), 25-45.<br \/>\n<span style=\"color: #ff0000;\"><a title=\"http:\/\/arxiv.org\/abs\/1206.2608\" href=\"https:\/\/arxiv.org\/abs\/2007.04363\" target=\"_blank\" rel=\"nofollow noopener noreferrer\">[J34]<\/a> <\/span>A. Heimendahl, F. Montealegre-Mora, F. Vallentin, D. Gross &#8211; Stabilizer extent is not multiplicative, Quantum 5, 400 (2021), 15 pages.<strong style=\"color: #ff0000;\"><br \/>\n<\/strong><a href=\"https:\/\/arxiv.org\/abs\/1806.10878\">[J33]<\/a>\u00a0M. Dostert, F. Vallentin, New dense superball packings in three dimensions, Adv. Geom. 20 (2020), 473-482.<strong style=\"color: #ff0000;\"><br \/>\n<\/strong><span style=\"color: #ff0000;\"><a title=\"http:\/\/arxiv.org\/abs\/1206.2608\" href=\"https:\/\/arxiv.org\/abs\/1808.02346\" target=\"_blank\" rel=\"nofollow noopener noreferrer\">[J32]<\/a><strong>\u00a0<\/strong><\/span>F.M. de Oliveira Filho, F. Vallentin, On the integrality gap of the maximum-cut semidefinite programming relaxation in fixed dimension, Discrete Analysis, 2020:10, 17 pages<br \/>\n<a title=\"http:\/\/arxiv.org\/abs\/1206.2608\" href=\"https:\/\/arxiv.org\/abs\/1808.07299\" target=\"_blank\" rel=\"nofollow noopener noreferrer\">[J31]<\/a>\u00a0F.M. de Oliveira Filho, F. Vallentin, A counterexample to a conjecture of Larman and Rogers on sets avoiding distance 1, Mathematika 65 (2019), 785-787.<br \/>\n<a href=\"https:\/\/arxiv.org\/abs\/1710.06002\">[J30]<\/a>\u00a0J.H. Rolfes, F. Vallentin, Covering compact metric spaces greedily, Acta Mathematica Hungarica 155 (2018), 130-140.<strong style=\"color: #ff0000;\"><br \/>\n<\/strong><a title=\"http:\/\/arxiv.org\/abs\/1510.02331\" href=\"http:\/\/arxiv.org\/abs\/1510.02331\" target=\"_blank\" rel=\"nofollow noopener noreferrer\">[J29]<\/a><strong style=\"color: #ff0000;\">\u00a0<\/strong>M. Dostert, C. Guzman, F.M. de Oliveira Filho, F. Vallentin, New upper bounds for the density of translative packings of three-dimensional convex bodies with tetrahedral symmetry,\u00a0Discrete Comput. Geom. 58 (2017), 449-481.<strong style=\"color: #ff0000;\"><br \/>\n<\/strong><span style=\"color: #ff0000;\"><a title=\"http:\/\/arxiv.org\/abs\/1510.02331\" href=\"http:\/\/arxiv.org\/abs\/1701.03148\" target=\"_blank\" rel=\"nofollow noopener noreferrer\">[J28]<\/a>\u00a0<\/span>M. Dutour Sikiri\u0107, A. Sch\u00fcrmann, F. Vallentin, Rational factorizations of completely positive matrices,\u00a0Linear Algebra and Appl. 523 (2017) 46-51.<strong style=\"color: #ff0000;\"><br \/>\n<\/strong><a title=\"http:\/\/arxiv.org\/abs\/1206.2608\" href=\"http:\/\/arxiv.org\/abs\/1305.1819\" target=\"_blank\" rel=\"nofollow noopener noreferrer\">[J27]<\/a>\u00a0C. Dobre, M.E. D\u00fcr, L. Frerick, F. Vallentin, A copositive formulation of the stability number of infinite graphs,\u00a0Math. Program., Ser. A 160 (2016), 65-83.<br \/>\n<a title=\"http:\/\/arxiv.org\/abs\/1507.03549\" href=\"http:\/\/arxiv.org\/abs\/1507.03549\" target=\"_blank\" rel=\"nofollow noopener noreferrer\">[J26]<\/a>\u00a0E. de Klerk, F. Vallentin, On the Turing model complexity of interior point methods for semidefinite programming, SIAM J. Optim. 26 (2016), 1944-1961.<br \/>\n<span style=\"color: #808080;\"><a href=\"http:\/\/arxiv.org\/abs\/1311.3789\" target=\"_blank\" rel=\"nofollow noopener noreferrer\">[J25]<\/a>\u00a0<\/span><span style=\"color: #333333;\">D. de Laat, F. Vallentin,\u00a0A semidefinite programming hierarchy for packing problems in discrete geometry,\u00a0Math. Program., Ser. B 151 (2015), 529-553.<br \/>\n<\/span><a title=\"http:\/\/arxiv.org\/abs\/1206.2608\" href=\"http:\/\/arxiv.org\/abs\/1301.1054\" rel=\"nofollow\">[J24]<\/a>\u00a0C. Bachoc, P.E.B. DeCorte, F.M. de Oliveira Filho, F. Vallentin, Spectral bounds for the independence ratio and the chromatic number of an operator, Israel J. Math. 202 (2014), 227-254.<br \/>\n<a title=\"http:\/\/arxiv.org\/abs\/1206.2608\" href=\"http:\/\/arxiv.org\/abs\/1206.2608\" rel=\"nofollow\">[J23]<\/a>\u00a0<span style=\"color: #333333;\">D. de Laat, F.M. de Oliveira Filho, F. Vallentin, Upper bounds for packings of spheres of several radii, Forum Math. Sigma 2 (2014), e23 (42 pages).<\/span><br \/>\n<a title=\"http:\/\/arxiv.org\/abs\/1206.2608\" href=\"http:\/\/arxiv.org\/abs\/1307.5703\" target=\"_blank\" rel=\"nofollow noopener noreferrer\">[J22]<\/a>\u00a0<span style=\"color: #333333;\">P.E.B. DeCorte, D. de Laat, F. Vallentin, Fourier analysis on finite groups and the Lov\u00e1sz theta-number of Cayley graphs, Experiment. Math. 23 (2014), 146-152.<\/span><strong style=\"color: #ff0000;\"><span style=\"color: #333333;\"><br \/>\n<\/span><\/strong><a title=\"http:\/\/arxiv.org\/abs\/1011.1754\" href=\"http:\/\/arxiv.org\/abs\/1011.1754\" rel=\"nofollow\">[J21]<\/a>\u00a0<span style=\"color: #333333;\">J. Briet, F.M. de Oliveira Filho, F. Vallentin, Grothendieck inequalities for semidefinite programs with rank constraint, Theory of Computing 10 (2014), 77-105.<br \/>\n<\/span><a href=\"http:\/\/arxiv.org\/abs\/1005.0471\" target=\"_blank\" rel=\"noopener noreferrer\">[J20]<\/a> F.M. de Oliveira Filho, F. Vallentin, A quantitative version of Steinhaus\u2019 theorem for compact, connected, rank-one symmetric spaces, Geometriae Dedicata 167 (2013), 295-307.<br \/>\n<a href=\"http:\/\/arxiv.org\/abs\/1205.6406\" target=\"_blank\" rel=\"noopener noreferrer\">[J19<\/a><a href=\"http:\/\/arxiv.org\/abs\/1205.6406\" target=\"_blank\" rel=\"noopener noreferrer\"><span style=\"color: #444444;\">]<\/span><\/a><span style=\"color: #444444;\">\u00a0C. Bachoc, A. Passuello, F. Vallentin, Bounds for projective codes from semidefinite programming, Advances in Mathematics of Communications 7 (2013), 127-145.<br \/>\n<\/span><span style=\"color: #444444;\"><a title=\"http:\/\/arxiv.org\/abs\/1008.4751\" href=\"http:\/\/arxiv.org\/abs\/1008.4751\" rel=\"nofollow\">[J18]<\/a>\u00a0M. Dutour Sikiri\u0107, A. Sch\u00fcrmann, F. Vallentin, Inhomogeneous extreme forms, Annales de l\u2019Institut Fourier 62 (2012), 2227-2255.<br \/>\n<\/span><a title=\"http:\/\/arxiv.org\/abs\/0906.1427\" href=\"http:\/\/arxiv.org\/abs\/0906.1427\" rel=\"nofollow\">[J17]<\/a>\u00a0M. Dutour Sikiri\u0107, A. Sch\u00fcrmann, F. Vallentin, The contact polytope of the Leech lattice, Discr. Comp. Geom. 44 (2010), 904-911.<br \/>\n<a title=\"http:\/\/arxiv.org\/abs\/0808.1822\" href=\"http:\/\/arxiv.org\/abs\/0808.1822\" rel=\"nofollow\">[J16]<\/a><span style=\"color: #444444;\">\u00a0F.M. de Oliveira Filho, F. Vallentin, Fourier analysis, linear programming, and densities of distance avoiding sets in R^n, J. Eur. Math. Soc. 12 (2010), 1417-1428.<br \/>\n<\/span><span style=\"color: #444444;\"><a title=\"http:\/\/arxiv.org\/abs\/0902.1105\" href=\"http:\/\/arxiv.org\/abs\/0902.1105\" rel=\"nofollow\">[J15]<\/a>\u00a0H.D. Mittelmann. F. Vallentin, High accuracy semidefinite programming bounds for kissing numbers, Experiment. Math. 19 (2010), 174-178.<br \/>\n<\/span><span style=\"color: #444444;\"><a title=\"http:\/\/arxiv.org\/abs\/0801.1059\" href=\"http:\/\/arxiv.org\/abs\/0801.1059\" rel=\"nofollow\">[J14]<\/a>\u00a0C. Bachoc, G. Nebe, F.M. de Oliveira Filho, F. Vallentin, Lower bounds for measurable chromatic numbers, Geom. Funct. Anal. 19 (2009), 645-661.<br \/>\n<\/span><span style=\"color: #444444;\"><a title=\"http:\/\/arxiv.org\/abs\/0804.0036\" href=\"http:\/\/arxiv.org\/abs\/0804.0036\" rel=\"nofollow\">[J13]<\/a>\u00a0M. Dutour Sikiri\u0107, A. Sch\u00fcrmann, F. Vallentin, Complexity and algorithms for computing Voronoi cells of lattice, Math. Comput. 78 (2009), 1713-1731.<br \/>\n<\/span><span style=\"color: #444444;\"><a title=\"http:\/\/arxiv.org\/abs\/math\/0610856\" href=\"http:\/\/arxiv.org\/abs\/math\/0610856\" rel=\"nofollow\">[J12]<\/a>\u00a0C. Bachoc, F. Vallentin, Semidefinite programming, multivariate orthogonal polynomials, and codes in spherical caps, European J. Combin. 30 (2009), 625-637. (special issue dedicated to the 60th birthday of Eiichi Bannai)<br \/>\n<\/span><span style=\"color: #444444;\"><a title=\"http:\/\/arxiv.org\/abs\/0712.3079\" href=\"http:\/\/arxiv.org\/abs\/0712.3079\" rel=\"nofollow\">[J11]<\/a>\u00a0N. Gvozdenovi\u0107, M. Laurent, F. Vallentin, Block-diagonal semidefinite programming hierarchies for 0\/1 programming, Oper. Res. Lett. 37 (2009), 27-31.<br \/>\n<\/span><span style=\"color: #444444;\"><a title=\"http:\/\/arxiv.org\/abs\/0708.3947\" href=\"http:\/\/arxiv.org\/abs\/0708.3947\" rel=\"nofollow\">[J10]<\/a>\u00a0C. Bachoc, F. Vallentin, Optimality and uniqueness of the (4,10,1\/6) spherical code, J. Comb. Theory Ser. A 116 (2009), 195-204.<br \/>\n<\/span><span style=\"color: #444444;\"><a title=\"http:\/\/arxiv.org\/abs\/0706.4233\" href=\"http:\/\/arxiv.org\/abs\/0706.4233\" rel=\"nofollow\">[J9]<\/a>\u00a0F. Vallentin, Symmetry in semidefinite programs, Linear Algebra and Appl. 430 (2009), 360-369.<br \/>\n<\/span><span style=\"color: #444444;\"><a title=\"http:\/\/arxiv.org\/abs\/0709.2587\" href=\"http:\/\/arxiv.org\/abs\/0709.2587\" rel=\"nofollow\">[J8]<\/a>\u00a0M.A. Hernandez Cifre, A. Sch\u00fcrmann, F. Vallentin, The isodiametric problem with lattice-point constraints, Monatsh. Math. 155 (2008), 125-134.<br \/>\n<\/span><span style=\"color: #444444;\"><a title=\"http:\/\/arxiv.org\/abs\/math\/0608426\" href=\"http:\/\/arxiv.org\/abs\/math\/0608426\" rel=\"nofollow\">[J7]<\/a>\u00a0C. Bachoc, F. Vallentin, New upper bounds for kissing numbers from semidefinite programming, J. Amer. Math. Soc. 21 (2008), 909-924.<br \/>\n<\/span><span style=\"color: #444444;\"><a title=\"http:\/\/arxiv.org\/abs\/math\/0601084\" href=\"http:\/\/arxiv.org\/abs\/math\/0601084\" rel=\"nofollow\">[J6]<\/a>\u00a0M. Dutour Sikiri\u0107, A. Sch\u00fcrmann, F. Vallentin, A generalization of Voronoi&#8217;s reduction theory and its applications,\u00a0 Duke Math. J. 142 (2008), 127-164.<br \/>\n<\/span><span style=\"color: #444444;\"><a title=\"http:\/\/arxiv.org\/abs\/math\/0509716\" href=\"http:\/\/arxiv.org\/abs\/math\/0509716\" rel=\"nofollow\">[J5]<\/a>\u00a0F. Vallentin, Optimal embeddings of distance transitive graphs into Euclidean spaces, J. Comb. Theory Ser. B 98 (2008), 95-104.<br \/>\n<\/span><span style=\"color: #444444;\"><a title=\"http:\/\/arxiv.org\/abs\/math\/0609388\" href=\"http:\/\/arxiv.org\/abs\/math\/0609388\" rel=\"nofollow\">[J4]<\/a>\u00a0M. Dutour Sikiri\u0107, A. Sch\u00fcrmann, F. Vallentin, Classification of eight dimensional perfect forms,\u00a0 Electron. Res. Announc. Amer. Math. Soc. 13 (2007), 21-32.<br \/>\n<\/span><span style=\"color: #444444;\"><a title=\"http:\/\/arxiv.org\/abs\/math\/0507119\" href=\"http:\/\/arxiv.org\/abs\/math\/0507119\" rel=\"nofollow\">[J3]<\/a>\u00a0F. Santos, A. Sch\u00fcrmann, F. Vallentin, Lattice Delone simplices with super-exponential volume, Europ. J. Comb. 28 (2007), 801-806.<br \/>\n<\/span><span style=\"color: #444444;\"><a title=\"http:\/\/arxiv.org\/abs\/math\/0403272\" href=\"http:\/\/arxiv.org\/abs\/math\/0403272\" rel=\"nofollow\">[J2]<\/a>\u00a0A. Sch\u00fcrmann, F. Vallentin, Computational approaches to lattice packing and covering problems, Discr. Comp. Geom. 35 (2006), 73-116.<br \/>\n<\/span><span style=\"color: #444444;\"><a title=\"http:\/\/arxiv.org\/abs\/math\/0405441\" href=\"http:\/\/arxiv.org\/abs\/math\/0405441\" rel=\"nofollow\">[J1]<\/a>\u00a0A. Sch\u00fcrmann, F. Vallentin, Local covering optimality of lattices: Leech lattice versus root lattice E_8, Int. Math. Res. Notices 32 (2005), 1937-1955.<\/span><\/p>\n<p><span style=\"color: #ff0000;\"><strong>papers in refereed proceedings<br \/>\n<\/strong><\/span>[PR5] P. Moustrou, F. Vallentin, <span style=\"font-size: inherit;\">Least distortion Euclidean embeddings of flat tori. Proceedings <\/span><span style=\"font-size: inherit;\">of the International Symposium on Symbolic &amp; Algebraic Computation (ISSAC 2023, July <\/span><span style=\"font-size: inherit;\">24\u201327, 2023, Troms\u00f8, Norway), 13\u201323, ACM, 2023.<br \/>\n<\/span><span style=\"color: #444444;\"><a title=\"http:\/\/arxiv.org\/abs\/0910.5765\" href=\"http:\/\/arxiv.org\/abs\/0910.5765\" rel=\"nofollow\">[PR4]<\/a>\u00a0J. Briet, F.M. de Oliveira Filho, F. Vallentin, The positive semidefinite Grothendieck problem with rank constraint, pages 31-42 in Proceedings of the 37th International\u00a0<\/span>Colloquium on Automata, Languages and Programming, ICALP 2010 (S. Abramsky et al. eds.), Part I, LNCS 6198, 2010.<br \/>\n<span style=\"color: #444444;\"><a href=\"http:\/\/www.mi.uni-koeln.de\/opt\/wp-content\/uploads\/2013\/11\/PR03.pdf\">[PR3]<\/a>\u00a0J. Briet, F.M. de Oliveira Filho, F. Vallentin, The Grothendieck problem with rank constraint, in Proceedings of the 19th International Symposium on Mathematical Theory of Networks and Systems (MTNS 2010), Budapest, Hungary, 5-9 July 2010, 3 pages.<br \/>\n<\/span><span style=\"color: #444444;\"><a href=\"http:\/\/www.mi.uni-koeln.de\/opt\/wp-content\/uploads\/2013\/11\/PR02.pdf\">[PR2]<\/a>\u00a0C. Bachoc, F. Vallentin, Semidefinite programming bounds for spherical codes (extended abstract), pages 1801-1805 in Proceedings of &#8222;2007 IEEE International Symposium on Information Theory&#8220;, June 2007, Nice, France.<br \/>\n<\/span><span style=\"color: #444444;\"><a title=\"http:\/\/arxiv.org\/abs\/math\/0401191\" href=\"http:\/\/arxiv.org\/abs\/math\/0401191\" rel=\"nofollow\">[PR1]<\/a>\u00a0M. Dutour, F. Vallentin, Some six-dimensional rigid forms, pages 102-108 in Voronoi&#8217;s Impact on Modern Science, Book 3 (H. Syta, A. Yurachivsky, P. Engel eds.; Institute of Math., Kyiv 2005 = Vol.55 of Proc. Inst. Math. Nat. Acad. Sci.).<\/span><\/p>\n<p><span style=\"color: #ff0000;\"><strong>book chapters<br \/>\n<\/strong><a title=\"http:\/\/arxiv.org\/abs\/1206.2608\" href=\"https:\/\/arxiv.org\/abs\/1902.01253\" target=\"_blank\" rel=\"nofollow noopener noreferrer\">[BC3]<\/a> <\/span>F. Vallentin, Semidefinite programming bounds for error-correcting codes, pages 267-281 in Concise Encyclopedia of Coding Theory (W.C. Huffman, J.-L. Kim, P. Sol\u00e9 (ed.)), CRC Press, 2021<span style=\"color: #ff0000;\"><strong><a title=\"http:\/\/arxiv.org\/abs\/1206.2608\" href=\"https:\/\/arxiv.org\/abs\/1902.01253\" target=\"_blank\" rel=\"nofollow noopener noreferrer\"><br \/>\n<\/a><\/strong><\/span><a title=\"http:\/\/arxiv.org\/abs\/1206.2608\" href=\"http:\/\/arxiv.org\/abs\/1308.4893\" target=\"_blank\" rel=\"nofollow noopener noreferrer\">[BC2]<\/a>\u00a0F.M. de Oliveira Filho, F. Vallentin, Computing upper bounds for packing densities of congruent copies of a convex body, pages 155-188 in New Trends in Intuitive Geometry (G. Ambrus, I. Barany, K.J. B\u00f6roczky, G. Fejes Toth, J. Pach (ed.)), Springer, 2018.<br \/>\n<a title=\"http:\/\/arxiv.org\/abs\/1007.2905\" href=\"http:\/\/arxiv.org\/abs\/1007.2905\" rel=\"nofollow\">[BC1]<\/a> C. Bachoc, D.C. Gijswijt, A. Schrijver, F. Vallentin, Invariant semidefinite programs, pages 219-269 in Handbook on Semidefinite, Conic and Polynomial Optimization (M.F. Anjos, J.B. Lasserre (ed.)), Springer, 2012.<\/p>\n<p><span style=\"color: #ff0000;\"><strong>papers in other proceedings<br \/>\n<\/strong><\/span>[PN15]\u00a0F. Vallentin, LP and SDP bounds for packing and energy minimization, In: &#8222;Real Algebraic Geometry with a View Toward Hyperbolic Programming and Free Probability&#8220;. Abstracts from the workshop held March 1-7, 2020. Organized by D. Henrion, S. Kuhlmann, R. Speicher, V. Vinnikov, Oberwolfach Rep. (2020).<br \/>\n[PN14]\u00a0F. Vallentin, Sums-of-squares for extremal discrete geometry on the unit sphere, In: &#8222;Mixed-integer Nonlinear Optimization: A Hatchery for Modern Mathematics&#8220;. Abstracts from the workshop held June 2-8, 2019. Organized by L. Liberti, S.Sager,\u00a0A. Wiegele, Oberwolfach Rep. (2019).<br \/>\n[PN13]\u00a0F. Vallentin, New upper bounds for the density of translative packings of three-dimensional convex bodies, In: &#8222;Discrete Geometry&#8220;. Abstracts from the workshop held April 9-15, 2017. Organized by I. Barany, X. Goaoc, G. Rote, Oberwolfach Rep. (2017).<br \/>\n[PN12]\u00a0F. Vallentin, MINLP from a discrete geometry point of view, In: &#8222;Mixed-integer Nonlinear Optimization: A Hatchery for Modern Mathematics&#8220;. Abstracts from the workshop held October 18-24, 2015. Organized by L. Liberti, S.Sager,\u00a0A. Wiegele, Oberwolfach Rep. (2015).<br \/>\n[PN11]\u00a0F. Vallentin, Invariant SOS, In: &#8222;Real Algebraic Geometry With A View Toward Systems Control and Free Positivity&#8220;. Abstracts from the workshop held April 6-12, 2014. Organized by D. Henrion, S. Kuhlmann, V. Vinnikov, Oberwolfach Rep. 11 (2014), 1037-1038.<br \/>\n[PN10]\u00a0F. Vallentin, Linear and semidefinite programming bounds, In: &#8222;Optimal and near optimal configurations on lattices and manifolds&#8220;. Abstracts from the workshop held August 19-25, 2012. Organized by C. Bachoc, P. Grabner, E.B. Saff, A. Sch\u00fcrmann, Oberwolfach Rep. 9 (2012), 2477-2480.<br \/>\n<span style=\"color: #444444;\">[PN9]\u00a0F. Vallentin, Triangulations and subdivisions in the geometry of numbers, In: \u201cTriangulations\u201d. Abstracts from the workshop held April 29-May 5, 2012. Organized by W.H. Jaco, F.H. Lutz, F. Santos, J.H. Sullivan, Oberwolfach Rep. 9 (2012), 1417-1419.<br \/>\n<\/span><span style=\"color: #444444;\">[PN8]\u00a0F. Vallentin, Applications of semidefinite programming and harmonic analysis, In: \u201cCombinatorial Optimization\u201d. Abstracts from the workshop held November 13-19, 2011. Organized by M. Goemans, M. Laurent, J. Vygen, Oberwolfach Rep. 8 (2011), 3063-3066.<br \/>\n<\/span><span style=\"color: #444444;\">[PN7]\u00a0F. Vallentin, Upper bounds for densest packings with congruent copies of convex bodies, In: \u201cDiscrete Geometry\u201d. Abstracts from the workshop held September 4-10, 2011. Organized by J. Matousek, G. Rote, I. Barany, Oberwolfach Rep. 8 (2011), 2527-2530.<br \/>\n<\/span><span style=\"color: #444444;\">[PN6]\u00a0F. Vallentin, Infinite-dimensional semidefinite programs, In: \u201cExploiting symmetry in optimization\u201d. Abstracts from the workshop held August 22-28, 2010. Organized by V. Kaibel, L. Liberti, A. Sch\u00fcrmann, R. Sotirov. Oberwolfach Rep. 7 (2010), 2273-2274.<br \/>\n<\/span><span style=\"color: #444444;\">[PN5]\u00a0F. Vallentin, Fourier analysis, linear programming, and densities of distance avoiding sets in R^n, In: \u201cDiscrete Geometry\u201d. Abstracts from the workshop held September 21-27, 2008. Organized by M. Henk, J. Matousek, E. Welzl. Oberwolfach Rep. 5 (2008), 2484-2487.<br \/>\n<\/span><span style=\"color: #444444;\">[PN4]\u00a0C. Bachoc, F. Vallentin, Optimality and uniqueness of the (4,10,1\/6) spherical code (extended abstract), pages 133-136 in Proceedings &#8222;DMHF 2007: COE Conference on the Development of Dynamic Mathematics with High Functionality&#8220;, October 2007, Fukuoka, Japan.<br \/>\n<\/span><span style=\"color: #444444;\">[PN3]\u00a0C. Bachoc, F. Vallentin, More semidefinite programming bounds (extended abstract), pages 129-132 in Proceedings &#8222;DMHF 2007: COE Conference on the Development of Dynamic Mathematics with High Functionality&#8220;, October 2007, Fukuoka, Japan.<br \/>\n<\/span><span style=\"color: #444444;\">[PN2]\u00a0F. Vallentin, Sphere Coverings in dimensions 1-24, In: \u201cGitter und Anwendungen\u201d. Abstracts from the workshop held January 2-8, 2005. Organized by C. Bachoc, E. Bayer-Fluckiger, G. Nebe. Oberwolfach Rep. 2 (2005) 1, 48-51.<br \/>\n<\/span><span style=\"color: #444444;\"><a title=\"http:\/\/arxiv.org\/abs\/math\/0412320\" href=\"http:\/\/arxiv.org\/abs\/math\/0412320\" rel=\"nofollow\">[PN1]<\/a>\u00a0A. Sch\u00fcrmann, F. Vallentin, Methods in the local theory of packing and covering lattices, pages 122-136 in Proceedings of &#8222;COE Workshop on Sphere Packings&#8220;, November 2004, Fukuoka, Japan.<\/span><\/p>\n<p><strong><span style=\"color: #ff0000;\">expositions<br \/>\n<\/span><\/strong>[POP9] [ddownload id=&#8220;6738&#8243;] F. \u00a0Vallentin, Why I became a professional mathematician, to appear in Proofs and Prompts<br \/>\n<a href=\"https:\/\/onlinelibrary.wiley.com\/iucr\/doi\/10.1107\/S2053273324011513\">[POP8]<\/a> F. Vallentin, Scientific commentary: A milestone for the solution to the lattice covering problem in dimension n = 6, Acta. Cryst. (2025) A81.<br \/>\n<span style=\"color: #ff0000;\"><a href=\"http:\/\/arxiv.org\/abs\/1607.02111\" target=\"_blank\" rel=\"nofollow noopener noreferrer\">[POP7]<\/a><\/span><span style=\"color: #ff0000;\">\u00a0<\/span><a href=\"http:\/\/www.mi.uni-koeln.de\/opt\/wp-content\/uploads\/2016\/09\/naw5-2016-17-3-184.pdf\">[pdf]<\/a><span style=\"color: #ff0000;\">\u00a0<\/span>D. de Laat, F. Vallentin, A Breakthrough in Sphere Packing: The Search for Magic Functions, Nieuw Archief voor Wiskunde (17) 2016, 184-192.<strong><span style=\"color: #ff0000;\"><br \/>\n<\/span><\/strong><a href=\"http:\/\/www.mathopt.org\/Optima-Issues\/optima100.pdf\">[POP6]<\/a> F. Vallentin, Optimization in discrete geometry, Optima 100, Mathematical Optimization Society Newsletter, May, 2016<br \/>\n<a href=\"https:\/\/arxiv.org\/abs\/1403.1166\">[POP5]<\/a> F.M. de Oliveira Filho, F. Vallentin, Mathematical optimization for packing problems,\u00a0SIAG\/OPT Views and News, Volume 23 Number 2, December 2015, 5-14<br \/>\n<span style=\"color: #444444;\"><a href=\"http:\/\/www.mi.uni-koeln.de\/opt\/wp-content\/uploads\/2013\/11\/POP04.pdf\">[POP4]<\/a>\u00a0F. Vallentin, The continuing story of the kissing number problem, Quadraad, TU Delft, 2011.<br \/>\n<\/span><a href=\"http:\/\/www.mi.uni-koeln.de\/opt\/wp-content\/uploads\/2013\/11\/POP03.pdf\">[POP3]<\/a>\u00a0F. Vallentin, Semidefinite programming and Fourier analysis, het proefschrift, TU Delft, 2010.<br \/>\n<span style=\"color: #444444;\"><a href=\"http:\/\/www.mi.uni-koeln.de\/opt\/wp-content\/uploads\/2013\/11\/POP02.pdf\">[POP2]<\/a>\u00a0A. Sch\u00fcrmann, F. Vallentin, Computational paths to discovery with optimization, MaCHazine, studievereniging Christaan Huygens, TU Delft, 2009<br \/>\n<\/span><span style=\"color: #444444;\">[POP1]\u00a0F. Vallentin, Nieuwe bovengrens voor kusgetal, pages 84-85 in Wetenschap in Nederland: Op onderzoek, Redactie M. Senten (Boom, Amsterdam\/Den Haag 2007).<\/span><\/p>\n<p><span style=\"color: #ff0000;\"><strong>technical reports &amp; lecture notes<br \/>\n<\/strong><\/span><span style=\"color: #444444;\"><a title=\"http:\/\/arxiv.org\/abs\/0809.2017\" href=\"http:\/\/arxiv.org\/abs\/0809.2017\" rel=\"nofollow\">[T3]<\/a>\u00a0F. Vallentin, Lecture notes: Semidefinite programing and harmonic analysis, 31 pages.<br \/>\n<\/span><span style=\"color: #444444;\"><a title=\"http:\/\/arxiv.org\/abs\/math\/0402053\" href=\"http:\/\/arxiv.org\/abs\/math\/0402053\" rel=\"nofollow\">[T2]<\/a>\u00a0F. Vallentin, A note on space-tiling zonotopes, arXiv:math\/0402053v1 [math.MG], 7 pages.<br \/>\n<\/span><span style=\"color: #444444;\"><a title=\"http:\/\/arxiv.org\/abs\/math\/0604320\" href=\"http:\/\/arxiv.org\/abs\/math\/0604320\" rel=\"nofollow\">[T1]<\/a>\u00a0B. Hemkemeier, F. Vallentin, On the decomposition of lattices, Electronic Colloquium on Computational Complexity, 1998.\u00a0 (Revision &#8222;Incremental Algorithms For Lattice Problems&#8220;)<\/span><\/p>\n<p><strong><span style=\"color: #ff0000;\">reviews<br \/>\n<\/span><\/strong><a href=\"http:\/\/www.mi.uni-koeln.de\/opt\/wp-content\/uploads\/2013\/11\/R02.pdf\">[R2]<\/a>\u00a0A. Sch\u00fcrmann, F. Vallentin, Neue B\u00fccher aus Oberwolfach, Mitteilungen der DMV 20(3) 2012.<br \/>\n<span style=\"color: #444444;\"><a href=\"http:\/\/www.mi.uni-koeln.de\/opt\/wp-content\/uploads\/2013\/11\/R01.pdf\">[R1]<\/a>\u00a0F. Rendl, F. Vallentin, Neue B\u00fccher aus Oberwolfach, Mitteilungen der DMV 18(2): 72, 2010.<\/span><\/p>\n<p><strong><span style=\"color: #ff0000;\">thesis<br \/>\n<\/span><\/strong><span style=\"color: #444444;\"><a href=\"https:\/\/nbn-resolving.org\/urn:nbn:de:bvb:91-diss2003112600173\" rel=\"nofollow\">[D3]<\/a>\u00a0F. Vallentin, Sphere coverings, lattices, and tilings (in low dimensions), Ph.D. thesis, Technical University Munich, Germany, 2003, 128 pages, written under the supervision of J. Richter-Gebert<br \/>\n<\/span><span style=\"color: #444444;\"><a href=\"http:\/\/www.mi.uni-koeln.de\/opt\/wp-content\/uploads\/2013\/11\/D2.pdf\">[D2]<\/a>\u00a0F. Vallentin, \u00dcber die Paralleloeder-Vermutung von Voronoi, Diploma thesis, University of Dormtund, 2000, 73 pages, written under the supervision of R. Scharlau<br \/>\n<\/span><span style=\"color: #444444;\"><a href=\"http:\/\/www.mi.uni-koeln.de\/opt\/wp-content\/uploads\/2013\/11\/D1.pdf\">[D1]<\/a>\u00a0F. Vallentin, Zur Komplexit\u00e4t des &#8222;Shortest Vector Problem&#8220; und seine Anwendungen in der Kryptographie, Diploma thesis, University of Dortmund, 1999, 89 pages, written under the supervision of I. Wegener<\/span><\/p>\n","protected":false},"excerpt":{"rendered":"<p>preprints [S4] A. Joharian, F. Vallentin, M.C. Zimmermann, Critical modular lattices in the Gaussian core model, 31 pages [S3] C. Bachoc, P. Moustrou, F. Vallentin, M.C. Zimmermann, Polarization of lattices: Stable cold spots and spherical designs, 32 pages [S2] C. Riener, J. Rolfes, F. Vallentin, A semidefinite programming hierarchy for covering problems in discrete geometry, &hellip; <a href=\"https:\/\/www.mi.uni-koeln.de\/opt\/frank-vallentin\/publications\/\" class=\"more-link\"><span class=\"screen-reader-text\">&#8222;Publications&#8220; <\/span>weiterlesen<\/a><\/p>\n","protected":false},"author":3,"featured_media":0,"parent":42,"menu_order":0,"comment_status":"closed","ping_status":"closed","template":"","meta":{"footnotes":""},"class_list":["post-105","page","type-page","status-publish","hentry"],"_links":{"self":[{"href":"https:\/\/www.mi.uni-koeln.de\/opt\/wp-json\/wp\/v2\/pages\/105","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/www.mi.uni-koeln.de\/opt\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/www.mi.uni-koeln.de\/opt\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/www.mi.uni-koeln.de\/opt\/wp-json\/wp\/v2\/users\/3"}],"replies":[{"embeddable":true,"href":"https:\/\/www.mi.uni-koeln.de\/opt\/wp-json\/wp\/v2\/comments?post=105"}],"version-history":[{"count":111,"href":"https:\/\/www.mi.uni-koeln.de\/opt\/wp-json\/wp\/v2\/pages\/105\/revisions"}],"predecessor-version":[{"id":6744,"href":"https:\/\/www.mi.uni-koeln.de\/opt\/wp-json\/wp\/v2\/pages\/105\/revisions\/6744"}],"up":[{"embeddable":true,"href":"https:\/\/www.mi.uni-koeln.de\/opt\/wp-json\/wp\/v2\/pages\/42"}],"wp:attachment":[{"href":"https:\/\/www.mi.uni-koeln.de\/opt\/wp-json\/wp\/v2\/media?parent=105"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}