arXiv subjects

Mathieu Dutour Sikiric

Publications and source records attributed to Mathieu Dutour Sikiric.

24 records · Page 2Linked to original sources

arXiv2008

Automorphism groups of root systems matroids

Given a root system $\mathsf{R}$, the vector system $\tilde{\mathsf{R}}$ is obtained by taking a representative $v$ in each antipodal pair $\{v, -v\}$. The matroid $M(\mathsf{R})$ is formed by all independent subsets of $\tilde{\mathsf{R}}$. The automorphism group of a matroid is the group of permutations preserving its independent subsets. We prove that the automorphism groups of all irreducible root systems matroids $M(\mathsf{R})$ are uniquely determined by their independent sets of size 3. As a corollary, we compute these groups explicitly, and thus complete the classification of the automorphism groups of root systems matroids.

math.CO↗

arXiv2008

Complexity and algorithms for computing Voronoi cells of lattices

In this paper we are concerned with finding the vertices of the Voronoi cell of a Euclidean lattice. Given a basis of a lattice, we prove that computing the number of vertices is a #P-hard problem. On the other hand we describe an algorithm for this problem which is especially suited for low dimensional (say dimensions at most 12) and for highly-symmetric lattices. We use our implementation, which drastically outperforms those of current computer algebra systems, to find the vertices of Voronoi cells and quantizer constants of some prominent lattices.

math.MG↗

arXiv2008

The decomposition of the hypermetric cone into L-domains

The hypermetric cone $\HYP_{n+1}$ is the parameter space of basic Delaunay polytopes in n-dimensional lattice. The cone $\HYP_{n+1}$ is polyhedral; one way of seeing this is that modulo image by the covariance map $\HYP_{n+1}$ is a finite union of L-domains, i.e., of parameter space of full Delaunay tessellations. In this paper, we study this partition of the hypermetric cone into L-domains. In particular, it is proved that the cone $\HYP_{n+1}$ of hypermetrics on n+1 points contains exactly {1/2}n! principal L-domains. We give a detailed description of the decomposition of $\HYP_{n+1}$ for n=2,3,4 and a computer result for n=5 (see Table \ref{TableDataHYPn}). Remarkable properties of the root system $\mathsf{D}_4$ are key for the decomposition of $\HYP_5$.

math.CO↗

arXiv2007

Polyhedral representation conversion up to symmetries

We give a short survey on computational techniques which can be used to solve the representation conversion problem for polyhedra up to symmetries. We in particular discuss decomposition methods, which reduce the problem to a number of lower dimensional subproblems. These methods have been successfully used by different authors in special contexts. Moreover, we sketch an incremental method, which is a generalization of Fourier-Motzkin elimination, and we give some ideas how symmetry can be exploited using pivots.

math.MG↗

arXiv2007

A generalization of Voronoi's reduction theory and its application

We consider Voronoi's reduction theory of positive definite quadratic forms which is based on Delone subdivision. We extend it to forms and Delone subdivisions having a prescribed symmetry group. Even more general, the theory is developed for forms which are restricted to a linear subspace in the space of quadratic forms. We apply the new theory to complete the classification of totally real thin algebraic number fields which was recently initiated by Bayer-Fluckiger and Nebe. Moreover, we apply it to construct new best known sphere coverings in dimensions 9,..., 15.

math.MG↗

arXiv2005

How to compute the rank of a Delaunay polytope

Roughly speaking, the rank of a Delaunay polytope (first introduced in \cite{DGL92}) is its number of degrees of freedom. In \cite{DL}, a method for computing the rank of a Delaunay polytope $P$ using the hypermetrics related to $P$ is given. Here a simpler more efficient method, which uses affine dependencies instead of hypermetrics is given. This method is applied to classical Delaunay polytopes. Then, we give an example of a Delaunay polytope, which does not have any affine basis.

math.CO↗