activity
20012026
most citedComplexity and algorithms for computing Voronoi cells of lattices

44 citations · 182 across the 28 of their papers we have counts for

collaborators

32 papers

math.MG2026

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

Sven Ahrend, Mathieu Dutour Sikirić

The packing-covering constant of a point set is , the covering radius divided by the packing radius. Among lattices, its minimum is k…

math.CO2022

The Birkhoff polytope of the groups and

Mathieu Dutour Sikiric

We compute the set of facets of the polytope which is the convex hull of the Coxeter groups or : For the group we found orbits of fa…

math.MG2015

The joint weight enumerator of an LCD code and its dual

Adel Alahmadi, Michel Deza, Mathieu Dutour Sikirić +1

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 line…

math.MG2015★ 4 cited

Hypercube emulation of interconnection networks topologies

Adel Alahmadi, Husain Alhazmi, Shakir Ali +3

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…

math.MG2015

The seven dimensional perfect Delaunay polytopes and Delaunay simplices

Mathieu Dutour Sikiric

For a lattice of , a sphere of center and radius is called {\em empty} if for any we have . Then the set …

math.CO2015★ 1 cited

Enumeration of the facets of cut polytopes over some highly symmetric graphs

Michel Deza, Mathieu Dutour Sikiric

We report here a computation giving the complete list of facets for the cut polytopes over several very symmetric graphs with edges, including , , $K_{1,4,4…