arXiv subjects
Publications and source records attributed to Mathieu Dutour Sikiric.
We compute the set of facets of the polytope which is the convex hull of the Coxeter groups $\mathsf{F}_4$ or $\mathsf{H}_4$: For the group $\mathsf{F}_4$ we found $2$ orbits of facets which contradicts previous results published in \cite{birkhoff}. For the group $\mathsf{H}_4$ we found $1063$ orbits of facets which provides a counterexample to the conjecture of \cite{birkhoff}.
In this paper we use topological tools to investigate the structure of the algebraic K-groups K_4 (Z[i]) and K_4 (Z[rho]), where i := sqrt{-1} and rho := (1+sqrt{-3})/2. We exploit the close connection between homology groups of GL_n(R) for n <= 5 and those of related classifying spaces, then compute the former using Voronoi's reduction theory of positive definite quadratic and Hermitian forms to produce a very large finite cell complex on which GL_n(R) acts. Our main result is that K_4 (Z[i]) and K_4 (Z[rho]) have no p-torsion for p >= 5.
For a lattice $L$ of $R^n$, a sphere $S(c,r)$ of center $c$ and radius $r$ is called {\em empty} if for any $v\in L$ we have $\Vert v - c\Vert \geq r$. Then the set $S(c,r)\cap L$ is the vertex set of a {\em Delaunay polytope} $P=conv(S(c,r)\cap L)$. A Delaunay polytope is called {\em perfect} if any affine transformation $ϕ$ such that $ϕ(P)$ is a Delaunay polytope is necessarily an isometry of the space composed with an homothety. Perfect Delaunay polytopes are remarkable structure that exist only if $n=1$ or $n\geq 6$ and they have shown up recently in covering maxima studies. Here we give a general algorithm for their enumeration that relies on the Erdahl cone. We apply this algorithm in dimension 7 which allow us to find that there are only two perfect Delaunay polytopes: $3_{21}$ which is a Delaunay polytope in the root lattice $\mathsf{E}_7$ and the Erdahl Rybnikov polytope. We then use this classification in order to get the list of all types Delaunay simplices in dimension 7 and found 11 types.
We report here a computation giving the complete list of facets for the cut polytopes over several very symmetric graphs with $15-30$ edges, including $K_8$, $K_{3,3,3}$, $K_{1,4,4}$, $K_{5,5}$, some other $K_{l,m}$, $K_{1,l,m}$, $Prism_7, APrism_6$, Möbius ladder $M_{14}$, Dodecahedron, Heawood and Petersen graphs. For $K_8$, it shows that the huge lists of facets of the cut polytope $CUTP_8$ and cut cone $CUT_8$, given in [CR] is complete. We also confirm the conjecture that any facet of $CUTP_8$ is adjacent to a triangle facet. The lists of facets for $K_{1,l,m}$ with $(l,m)=(4,4),(3,5),(3,4)$ solve problems (see, for example, [Werner]) in quantum information theory.
A parallelotope $P$ is a polytope that admits a facet-to-facet tiling of space by translation copies of $P$ along a lattice. The Voronoi cell $P_V(L)$ of a lattice $L$ is an example of a parallelotope. A parallelotope can be uniquely decomposed as the Minkowski sum of a zone closed parallelotope $P$ and a zonotope $Z(U)$, where $U$ is the set of vectors used to generate the zonotope. In this paper we consider the related question: When is the Minkowski sum of a general parallelotope and a zonotope $P+Z(U)$ a parallelotope? We give two necessary conditions and show that the vectors $U$ have to be free. Given a set $U$ of free vectors, we give several methods for checking if $P + Z(U)$ is a parallelotope. Using this we classify such zonotopes for some highly symmetric lattices. In the case of the root lattice $\mathsf{E}_6$, it is possible to give a more geometric description of the admissible sets of vectors $U$. We found that the set of admissible vectors, called free vectors, is described by the well-known configuration of $27$ lines in a cubic. Based on a detailed study of the geometry of $P_V(\mathsf{e}_6)$, we give a simple characterization of the configurations of vectors $U$ such that $P_V(\mathsf{E}_6) + Z(U)$ is a parallelotope. The enumeration yields $10$ maximal families of vectors, which are presented by their description as regular matroids.
Knowing the symmetries of a polyhedron can be very useful for the analysis of its structure as well as for practical polyhedral computations. In this note, we study symmetry groups preserving the linear, projective and combinatorial structure of a polyhedron. In each case we give algorithmic methods to compute the corresponding group and discuss some practical experiences. For practical purposes the linear symmetry group is the most important, as its computation can be directly translated into a graph automorphism problem. We indicate how to compute integral subgroups of the linear symmetry group that are used for instance in integer linear programming.
Let Gamma be the group GL_N (OO_D), where OO_D is the ring of integers in the imaginary quadratic field with discriminant D<0. In this paper we investigate the cohomology of Gamma for N=3,4 and for a selection of discriminants: D >= -24 when N=3, and D=-3,-4 when N=4. In particular we compute the integral cohomology of Gamma up to p-power torsion for small primes p. Our main tool is the polyhedral reduction theory for Gamma developed by Ash and Koecher. Our results extend work of Staffeldt, who treated the case n=3, D=-4. In a sequel to this paper, we will apply some of these results to the computations with the K-groups K_4 (OO_{D}), when D=-3,-4.
Voronoi defined two polyhedral partitions of the cone of se\mi\de\fi\nite forms into L-type domains and into perfect domains. Up to equivalence, there is only one domain that is simultaneously perfect and L-type. Voronoi called this domain {\em principal}. We show that closure of the principal domain may be identified with a cone of cut submodular set functions. Parallelotopes of the closed principal domain are zonotopes that are base polyhedra related to graphic unimodular sets of vectors.
Given R\subset N, an (R,k)$-sphere is a k-regular map on the sphere whose faces have gonalities i\in R. The most interesting/useful are (geometric) fullerenes, i.e., (\{5,6\},3)$-spheres. Call κ_i=1 + \frac{i}{k} - \frac{i}{2} the curvature of i-gonal faces. (R,k)-spheres admitting κ_i<0 are much harder to study. We consider the symmetries and construction for three new instances of such spheres: ({a,b},k)-spheres with p_b\le 3 (they are listed), icosahedrites (i.e., ({3,4},5)$-spheres) and, for any c\in N, fullerene c-disks, i.e., ({5,6,c},3)-spheres with p_c=1.
G.F. Voronoi (1868-1908) wrote two memoirs in which he describes two reduction theories for lattices, well-suited for sphere packing and covering problems. In his first memoir a characterization of locally most economic packings is given, but a corresponding result for coverings has been missing. In this paper we bridge the two classical memoirs. By looking at the covering problem from a different perspective, we discover the missing analogue. Instead of trying to find lattices giving economical coverings we consider lattices giving, at least locally, very uneconomical ones. We classify local covering maxima up to dimension 6 and prove their existence in all dimensions beyond. New phenomena arise: Many highly symmetric lattices turn out to give uneconomical coverings; the covering density function is not a topological Morse function. Both phenomena are in sharp contrast to the packing problem.
We determine the integral homology of PSL4(Z) in degrees at most 5 and determine its p-part in higher degrees for the primes p>=5. Our method applies to other arithmetic groups; as illustrations we include descriptions of the integral homology of PGL3(Z[i]) and PGL3(Z[\exp(2π{i}/3)]) in degrees at most 5.
We consider here 6-regular plane graphs whose faces have size 1, 2 or 3. In Section 2 a practical enumeration method is given that allowed us to enumerate them up to 53 vertices. Subsequently, in Section 3 we enumerate all possible symmetry groups of the spheres that showed up. In Section 4 we introduce a new Goldberg-Coxeter construction that takes a 6-regular plane graph G0, two integers k and l and returns two 6-regular plane graphs. Then in the final section, we consider the notions of zigzags and central circuits for the considered graphs. We introduced the notions of tightness and weak tightness for them and we prove an upper bound on the number of zigzags and central circuits of such tight graphs. We also classify the tight and weakly tight graphs with simple zigzags or central circuits.
The contact polytope of a lattice is the convex hull of its shortest vectors. In this paper we classify the facets of the contact polytope of the Leech lattice up to symmetry. There are 1,197,362,269,604,214,277,200 many facets in 232 orbits.
In this paper, we classify the perfect lattices in dimension 8. There are 10916 of them. Our classification heavily relies on exploiting symmetry in polyhedral computations. Here we describe algorithms making the classification possible.
In his seminal 1951 paper "Extreme forms" Coxeter \cite{cox51} observed that for $n \ge 9$ one can add vectors to the perfect lattice $\sfA_9$ so that the resulting perfect lattice, called $\sfA_9^2$ by Coxeter, has exactly the same set of minimal vectors. An inhomogeneous analog of the notion of perfect lattice is that of a lattice with a perfect Delaunay polytope: the vertices of a perfect Delaunay polytope are the analogs of minimal vectors in a perfect lattice. We find a new infinite series $P(n,s)$ for $s\geq 2$ and $n+1\geq 4s$ of $n$-dimensional perfect Delaunay polytopes. A remarkable property of this series is that for certain values of $s$ and all $n \ge 13$ one can add points to the integer affine span of $P(n,s)$ in such a way that $P(n,s)$ remains a perfect Delaunay polytope in the new lattice. Thus, we have constructed an inhomogeneous analog of the remarkable relationship between $\sfA_9$ and $\sfA_9^2$.
An i-hedrite is a 4-regular plane graph with faces of size 2, 3 and 4. We do a short survey of their known properties and explain some new algorithms that allow their efficient enumeration. Using this we give the symmetry groups of all i-hedrites and the minimal representative for each. We also review the link of 4-hedrites with knot theory and the classification of 4-hedrites with simple central circuits. An i-self-hedrite is a self-dual plane graph with faces and vertices of size/degree 2, 3 and 4. We give a new efficient algorithm for enumerating them based on i-hedrites. We give a classification of their possible symmetry groups and a classification of 4-self-hedrites of symmetry T, Td in terms of the Goldberg-Coxeter construction. Then we give a method for enumerating 4-self-hedrites with simple zigzags.
We describe two methods for computing the low-dimensional integral homology of the Mathieu simple groups and use them to make computations such as $H_5(M_{23},\ZZ)=\ZZ_7$ and $H_3(M_{24},\ZZ)=\ZZ_{12}$. One method works via Sylow subgroups. The other method uses a Wythoff polytope and perturbation techniques to produce an explicit free $\ZZ M_n$-resolution. Both methods apply in principle to arbitrary finite groups.
Given a lattice L of R^n, a polytope D is called a Delaunay polytope in L if the set of its vertices is S\cap L where S is a sphere having no lattice points in its interior. D is called perfect if the only ellipsoid in R^n that contains S\cap L is exactly S. For a vector v of the Leech lattice Λ_{24} we define Λ_{24}(v) to be the lattice of vectors of Λ_{24} orthogonal to v. We studied Delaunay polytopes of L=Λ_{24}(v) for |v|^2<=22. We found some remarkable examples of Delaunay polytopes in such lattices and disproved a number of long standing conjectures. In particular, we discovered: --Perfect Delaunay polytopes of lattice width 4; previously, the largest known width was 2. --Perfect Delaunay polytopes in L, which can be extended to perfect Delaunay polytopes in superlattices of L of the same dimension. --Polytopes that are perfect Delaunay with respect to two lattices $L\subset L'$ of the same dimension. --Perfect Delaunay polytopes D for L with |Aut L|=6|Aut D|: all previously known examples had |Aut L|=|Aut D| or |Aut L|=2|Aut D|. --Antisymmetric perfect Delaunay polytopes in L, which cannot be extended to perfect (n+1)-dimensional centrally symmetric Delaunay polytopes. --Lattices, which have several orbits of non-isometric perfect Delaunay polytopes. Finally, we derived an upper bound for the covering radius of Λ_{24}(v)^{*}, which generalizes the Smith bound and we prove that it is met only by Λ_{23}^{*}, the best known lattice covering in R^{23}.