Searcharxiv⌕ Search

arXiv subjects

Achill Schürmann

Publications and source records attributed to Achill Schürmann.

At least 19 recordsLinked to original sources
arXiv2026

Generalized Perfect Matrices

We generalize Voronoi's theory of perfect quadratic forms to generalized copositive matrices over a full-dimensional closed convex cone K, by introducing a K-copositive minimum and perfect K-copositive matrices. We consider a key feature of a given cone, which we call Interior Ryshkov (IR) property. Under this property the classical theory and its applications generalize nicely and we prove that rationally generated cones possess this IR property. For contrast, we give a detailed example of a simple cone without the IR property, showing various differences to the classical case. Moreover, this example yields connections to questions of number theory, in particular to Diophantine approximation and the Pell Equation. Finally, as an application, we give inner and outer polyhedral approximations for the generalized completely positive cone and a method to find rational certificates for (non-)membership in this cone.

math.MG↗
arXiv2025

On Computing the Copositive Minimum and its Representatives

Computing the copositive minimum of a strictly copositive quadratic form is a natural generalization of computing the arithmetical minimum of a positive definite one. In this paper we show that this generalized problem is NP-complete. Moreover, we describe a practical method to calculate all shortest vectors using the LDLT-decomposition in a big class of special cases. Our numerical tests show that our method performs significantly better than previous approaches.

math.NT↗
arXiv2023

Sailing League Problems

We describe a class of combinatorial design problems which typically occur in professional sailing league competitions. We discuss connections to resolvable block designs and equitable coverings and to scheduling problems in operations research. We in particular give suitable boolean quadratic and integer linear optimization problem formulations, as well as further heuristics and restrictions, that can be used to solve sailing league problems in practice. We apply those techniques to three case studies obtained from real sailing leagues and compare the results with previously used tournament plans.

math.OC↗
arXiv2023

Perfect Copositive Matrices

In this paper we give a first study of perfect copositive $n \times n$ matrices. They can be used to find rational certificates for completely positive matrices. We describe similarities and differences to classical perfect, positive definite matrices. Most of the differences occur only for $n \geq 3$, where we find for instance lower rank and indefinite perfect matrices. Nevertheless, we find for all $n$ that for every classical perfect matrix there is an arithmetically equivalent one which is also perfect copositive. Furthermore we study the neighborhood graph and polyhedral structure of perfect copositive matrices. As an application we obtain a new characterization of the cone of completely positive matrices: It is equal to the set of nonnegative matrices having a nonnegative inner product with all perfect copositive matrices.

math.MG↗
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

Local Formulas for Ehrhart Coefficients from Lattice Tiles

As shown by McMullen in 1983, the coefficients of the Ehrhart polynomial of a lattice polytope can be written as a weighted sum of facial volumes. The weights in such a local formula depend only on the outer normal cones of faces, but are far from being unique. In this paper, we develop an infinite class of such local formulas. These are based on choices of fundamental domains in sublattices and obtained by polyhedral volume computations. We hereby also give a kind of geometric interpretation for the Ehrhart coefficients. Since our construction gives us a great variety of possible local formulas, these can, for instance, be chosen to fit well with a given polyhedral symmetry group. In contrast to other constructions of local formulas, ours does not rely on triangulations of rational cones into simplicial or even unimodular ones.

math.MG↗
arXiv2018

On the toplogical computation of K4 of the Gaussian and Eisenstein integers

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.

math.KT↗
arXiv2018

Equivalence of Lattice Orbit Polytopes

Let $G$ be a finite permutation group acting on $\mathbb{R}^d$ by permuting coordinates. A core point (for $G$) is an integral vector $z\in \mathbb{Z}^d$ such that the convex hull of the orbit $Gz$ contains no other integral vectors but those in the orbit $Gz$. Herr, Rehn and Schürmann considered the question for which groups there are infinitely many core points up to translation equivalence, that is, up to translation by vectors fixed by the group. In the present paper, we propose a coarser equivalence relation for core points called normalizer equivalence. These equivalence classes often contain infinitely many vectors up to translation, for example when the group admits an irrational invariant subspace or an invariant irreducible subspace occurring with multiplicity greater than $1$. We also show that the number of core points up to normalizer equivalence is finite if $G$ is a so-called QI-group. These groups include all transitive permutation groups of prime degree. We give an example to show how the concept of normalizer equivalence can be used to simplify integer convex optimization problems.

math.MG↗
arXiv2018

Local Energy Optimality of Periodic Sets

We study the local optimality of periodic point sets in $\mathbb{R}^n$ for energy minimization in the Gaussian core model, that is, for radial pair potential functions $f_c(r)=e^{-c r}$ with $c>0$. By considering suitable parameter spaces for $m$-periodic sets, we can locally rigorously analyze the energy of point sets, within the family of periodic sets having the same point density. We derive a characterization of periodic point sets being $f_c$-critical for all $c$ in terms of weighted spherical $2$-designs contained in the set. Especially for $2$-periodic sets like the family $\mathsf{D}^+_n$ we obtain expressions for the hessian of the energy function, allowing to certify $f_c$-optimality in certain cases. For odd integers $n\geq 9$ we can hereby in particular show that $\mathsf{D}^+_n$ is locally $f_c$-optimal among periodic sets for all sufficiently large~$c$.

math.MG↗
arXiv2016

Formal duality and generalizations of the Poisson summation formula

We study the notion of formal duality introduced by Cohn, Kumar, and Schürmann in their computational study of energy-minimizing particle configurations in Euclidean space. In particular, using the Poisson summation formula we reformulate formal duality as a combinatorial phenomenon in finite abelian groups. We give new examples related to Gauss sums and make some progress towards classifying formally dual configurations.

math.NT↗
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

Smoothness and singularities of the perfect form and the second Voronoi compactification of ${\mathcal A}_g$

We study the cones in the first Voronoi or perfect cone decomposition of quadratic forms with respect to the question which of these cones are basic or simplicial. As a consequence we deduce that the singular locus of the moduli stack ${\mathcal A_g^{\mathop{Perf}}}$, the toroidal compactification of the moduli space of principally polarized abelian varieties of dimension $g$ given by this decomposition, has codimension $10$ if $g \geq 4$. Moreover we describe the non-simplicial locus in codimension $10$. We also show that the second Voronoi compactification ${\mathcal A_{g}^{\mathop{Vor}}}$ has singularities in codimension $3$ for $g\geq 5$.

math.AG↗
arXiv2014

On Lattice-Free Orbit Polytopes

Given a permutation group acting on coordinates of $\mathbb{R}^n$, we consider lattice-free polytopes that are the convex hull of an orbit of one integral vector. The vertices of such polytopes are called \emph{core points} and they play a key role in a recent approach to exploit symmetry in integer convex optimization problems. Here, naturally the question arises, for which groups the number of core points is finite up to translations by vectors fixed by the group. In this paper we consider transitive permutation groups and prove this type of finiteness for the $2$-homogeneous ones. We provide tools for practical computations of core points and obtain a complete list of representatives for all $2$-homogeneous groups up to degree twelve. For transitive groups that are not $2$-homogeneous we conjecture that there exist infinitely many core points up to translations by the all-ones-vector. We prove our conjecture for two large classes of groups: For imprimitive groups and groups that have an irrational invariant subspace.

math.MG↗
arXiv2014

Exploiting Symmetries in Polyhedral Computations

In this note we give a short overview on symmetry exploiting techniques in three different branches of polyhedral computations: The representation conversion problem, integer linear programming and lattice point counting. We describe some of the future challenges and sketch some directions of potential developments.

math.OC↗
arXiv2014

Computing symmetry groups of polyhedra

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.

math.CO↗
arXiv2013

Exploiting Symmetry in Integer Convex Optimization using Core Points

We consider convex programming problems with integrality constraints that are invariant under a linear symmetry group. To decompose such problems we introduce the new concept of core points, i.e., integral points whose orbit polytopes are lattice-free. For symmetric integer linear programs we describe two algorithms based on this decomposition. Using a characterization of core points for direct products of symmetric groups, we show that prototype implementations can compete with state-of-the-art commercial solvers, and solve an open MIPLIB problem.

math.OC↗
arXiv2012

Strict Periodic Extreme Lattices

A lattice is called periodic extreme if it cannot locally be modified to yield a better periodic sphere packing. It is called strict periodic extreme if its sphere packing density is an isolated local optimum among periodic point sets. In this note we show that a lattice is periodic extreme if and only if it is extreme, that is, locally optimal among lattices. Moreover, we show that a lattice is strict periodic extreme if and only if it is extreme and non-floating.

math.MG↗