Searcharxiv⌕ Search

arXiv subjects

Mathieu Dutour Sikirić

Publications and source records attributed to Mathieu Dutour Sikirić.

At least 19 recordsLinked to original sources
arXiv2026

A non-lattice periodic point set beating the optimal lattice packing-covering constant in dimension five

The packing-covering constant of a point set $X\subseteq\mathbb{R}^d$ is $γ(X)=μ(X)/ρ(X)$, the covering radius divided by the packing radius. Among lattices, its minimum $γ_d$ is known for $d\leq 5$, attained by $\mathsf{A}_2^*$, $\mathsf{A}_3^*$, and Horváth's lattices $\mathsf{Ho}_4$, $\mathsf{Ho}_5$; Böröczky proved that $γ_3$ is optimal without the lattice restriction, but for $d=4,5$ the non-lattice problem was open. We exhibit a $2$-periodic non-lattice point set of $\mathbb{R}^5$ with $γ= 9/\sqrt{40} = 1.423024\ldots < γ_5 = \sqrt{3/2+\sqrt{13}/6} = 1.4494568\ldots$, so that in dimension five the packing-covering problem is not solved by lattices.

math.MG↗
arXiv2026

Corrigendum to "The Mori fan of the Dolgachev-Nikulin-Voisin family in genus $2$" by K. Hulek and C. Liese

In this note, we correct some of the results of the paper ``The Mori fan of the Dolgachev--Nikulin--Voisin family in genus $2$'' by K.~Hulek and C.~Liese concerning the number of maximal cones in the Mori fan of the Dolgachev--Nikulin--Voisin fan in genus $2$. The errors in the original paper concern the correct enumeration of cones. The method and the main theoretical results are not affected.

math.AG↗
arXiv2026

The lattice packing problem in dimension 9 by Voronoi's algorithm

In 1908, Voronoi introduced an algorithm that solves the lattice packing problem in any dimension in finite time. Voronoi showed that any lattice with optimal packing density must be a so-called perfect lattice, and his algorithm enumerates the finitely many perfect lattices up to similarity in a fixed dimension. However, due to the high complexity of the algorithm this enumeration had, until now, only been completed up to dimension 8. In this work we compute all 2237251040 perfect lattices in dimension 9 via Voronoi's algorithm. As a corollary, this shows that the laminated lattice $Λ_9$ gives the densest lattice packing in dimension 9. Equivalently, we show that the Hermite constant $γ_9$ in dimension 9 equals $2$. Furthermore, we extend a result by Watson (1971) and show that the set of possible kissing numbers in dimension 9 is precisely $2 \cdot \{ 1, \ldots, 91, 99, 120, \ldots, 129, 136 \}$.

math.NT↗
arXiv2023

Moduli of polarized Enriques surfaces -- computational aspects

Moduli spaces of (polarized) Enriques surfaces can be described as open subsets of modular varieties of orthogonal type. It was shown by Gritsenko and Hulek that there are, up to isomorphism, only finitely many different moduli spaces of polarized Enriques surfaces. Here we investigate the possible arithmetic groups and show that there are exactly $87$ such groups up to conjugacy. We also show that all moduli spaces are dominated by a moduli space of polarized Enriques surfaces of degree $1240$. Ciliberto, Dedieu, Galati, and Knutsen have also investigated moduli spaces of polarized Enriques surfaces in detail. We discuss how our enumeration relates to theirs. We further compute the Tits building of the groups in question. Our computation is based on groups and indefinite quadratic forms and the algorithms used are explained.

math.AG↗
arXiv2022

Extreme Divisors on $\bar{M}_{0,7}$ and Differences over Characteristic 2

We find 101,052 new extreme divisors on $\bar{M}_{0,7}$ (in 31 $S_7$-orbits) and millions of extreme nef curves over characteristic 0. Over characteristic 2, we identify two more $S_7$-orbits of extreme divisors, and prove $\bar{\text{Eff}}^k (\bar{M}_{0,n})$ is strictly larger over characteristic 2 than it is over characteristic 0, for all $1\leq k \leq n-6$. For each such $k$ we provide explicit cycles which are extreme in $\text{Eff}^k(\bar{M}_{0,n})$ over characteristic 2 but external to $\bar{\text{Eff}}^k(\bar{M}_{0,n})$ over characteristic 0. We apply our method of finding new extreme divisors to compute $\text{Eff}(\bar{M}_{0,\mathcal{A}})$ for $\mathcal{A}=(\frac{1}{3}, \frac{1}{3}, \frac{1}{3}, \frac{1}{3}, \frac{1}{3}, \frac{1}{3}, 1)$, proving it is polyhedral over any field, and conjecture a description of $\text{Eff}(\text{Bl}_e \bar{LM}_7)$.

math.AG↗
arXiv2021

Iso Edge Domains

Iso-edge domains are a variant of the iso-Delaunay decomposition introduced by Voronoi. They were introduced by Baranovskii & Ryshkov in order to solve the covering problem in dimension $5$. In this work we revisit this decomposition and prove the following new results: $\bullet$ We review the existing theory and give a general mass-formula for the iso-edge domains. $\bullet$ We prove that the associated toroidal compactification of the moduli space of principally polarized abelian varieties is projective. $\bullet$ We prove the Conway--Sloane conjecture in dimension $5$. $\bullet$ We prove that the quadratic forms for which the conorms are non-negative are exactly the matroidal ones in dimension $5$.

math.MG↗
arXiv2021

Coloring the Voronoi tessellation of lattices

In this paper we define the chromatic number of a lattice: It is the least number of colors one needs to color the interiors of the cells of the Voronoi tessellation of a lattice so that no two cells sharing a facet are of the same color. We compute the chromatic number of the root lattices, their duals, and of the Leech lattice, we consider the chromatic number of lattices of Voronoi's first kind, and we investigate the asymptotic behaviour of the chromatic number of lattices when the dimension tends to infinity. We introduce a spectral lower bound for the chromatic number of lattices in spirit of Hoffman's bound for finite graphs. We compute this bound for the root lattices and relate it to the character theory of the corresponding Lie groups.

math.CO↗
arXiv2020

A variation on the Rubik's cube

The Rubik's cube is a famous puzzle in which faces can be moved and the corresponding movement operations define a group. We consider here a generalization to any $3$-valent map. We prove an upper bound on the size of the corresponding group which we conjecture to be tight.

math.CO↗
arXiv2020

A Canonical Form for Positive Definite Matrices

We exhibit an explicit, deterministic algorithm for finding a canonical form for a positive definite matrix under unimodular integral transformations. We use characteristic sets of short vectors and partition-backtracking graph software. The algorithm runs in a number of arithmetic operations that is exponential in the dimension $n$, but it is practical and more efficient than canonical forms based on Minkowski reduction.

math.NT↗
arXiv2020

A simplex algorithm for rational cp-factorization

In this paper we provide an algorithm, similar to the simplex algorithm, which determines a rational cp-factorization of a given matrix, whenever the matrix allows such a factorization. This algorithm can be used to show that every integral completely positive $2 \times 2$ matrix has an integral cp-factorization.

math.OC↗
arXiv2019

Voronoi complexes in higher dimensions, cohomology of $GL_N(Z)$ for $N\geq 8$ and the triviality of $K_8(Z)$

We enumerate the low dimensional cells in the Voronoi cell complexes attached to the modular groups $SL_N(Z)$ and $GL_N(Z)$ for $N=8,9,10,11$, using quotient sublattices techniques for $N=8,9$ and linear programming methods for higher dimensions. These enumerations allow us to compute some cohomology of these groups and prove that $K_8(Z) = 0$. We deduce from it new knowledge on the Kummer-Vandiver conjecture.

math.KT↗
arXiv2018

On the Voronoi Conjecture for combinatorially Voronoi parallelohedra in dimension five

In a recent paper Garber, Gavrilyuk and Magazinov proposed a sufficient combinatorial condition for a parallelohedron to be affinely Voronoi. We show that this condition holds for all five-dimensional Voronoi parallelohedra. Consequently, the Voronoi conjecture in $\mathbb R^5$ holds if and only if every five-dimensional parallelohedron is combinatorially Voronoi. Here, by saying that a parallelohedron $P$ is combinatorially Voronoi, we mean that the tiling $\mathcal T(P)$ by translates of $P$ is combinatorially isomorphic to some tiling $\mathcal T(P')$, where $P'$ is a Voronoi parallelohedron, and that the isomorphism naturally induces a linear isomorphism of lattices $Λ(P)$ and $Λ(P')$. We also propose a new sufficient condition implying that a parallelohedron is affinely Voronoi. The condition is based on the new notion of the Venkov complex associated with a parallelohedron.

math.MG↗
arXiv2018

Periodic triangulations of $\mathbb{Z}^n$

We consider in this work triangulations of $\mathbb{Z}^n$ that are periodic along $\mathbb{Z}^n$. They generalize the triangulations obtained from Delaunay tessellations of lattices. Other important property is the regularity and central-symmetry property of triangulations. Full enumeration for dimension at most $4$ is obtained. In dimension $5$ several new phenomena happen: there are centrally-symmetric triangulations that are not Delaunay, there are non-regular triangulations (it could happen in dimension $4$) and a given simplex has a priori an infinity of possible adjacent simplices. We found $950$ periodic triangulations in dimension $5$ but finiteness is unknown.

math.CO↗
arXiv2017

Generalized cut and metric polytopes of graphs and simplicial complexes

Given a graph $G$ one can define the cut polytope CUTP(G) and the metric polytope METP(G) of this graph and those polytopes encode in a nice way the metric on the graph. According to Seymour's theorem, CUTP(G) = METP(G) if and only if K_5 is not a minor of G. We consider possibly extensions of this framework: a) We compute the CUTP(G) and METP(G) for many graphs. b) We define the oriented cut polytope WOMCUTP(G) and oriented multicut polytope OMCUTP(G) as well as their oriented metric version QMETP(G) and WQMETP(G). c) We define an $n$-dimensional generalization of metric on simplicial complexes.

math.MG↗
arXiv2016

The complete classification of five-dimensional Dirichlet-Voronoi polyhedra of translational lattices

In this paper we report on the full classification of Dirichlet-Voronoi polyhedra and Delaunay subdivisions of five-dimensional translational lattices. We obtain a complete list of $110244$ affine types (L-types) of Delaunay subdivisions and it turns out that they are all combinatorially inequivalent, giving the same number of combinatorial types of Dirichlet-Voronoi polyhedra. Using a refinement of corresponding secondary cones, we obtain $181394$ contraction types. We report on details of our computer assisted enumeration, which we verified by three independent implementations and a topological mass formula check.

math.MG↗
arXiv2015

The joint weight enumerator of an LCD code and its dual

A binary linear code is called {\em LCD} if it intersects its dual trivially. We show that the coefficients of the joint weight enumerator of such a code with its dual satisfy linear constraints, leading to a new linear programming bound on the size of an LCD code of given length and minimum distance. In addition, we show that this polynomial is, in general, an invariant of a matrix group of dimension $4$ and order $12$. Also, we sketch a Gleason formula for this weight enumerator.

math.MG↗
arXiv2015

Hypercube emulation of interconnection networks topologies

We address various topologies (de Bruijn, chordal ring, generalized Petersen, meshes) in various ways ( isometric embedding, embedding up to scale, embedding up to a distance) in a hypercube or a half-hypercube. Example of obtained embeddings: infinite series of hypercube embeddable Bubble Sort and Double Chordal Rings topologies, as well as of regular maps.

math.MG↗