Related papers: On $T$-avoiding spherical codes and designs in $\m…
Consider the problem of constructing an experimental design, optimal for estimating parameters of a given statistical model with respect to a chosen criterion. To address this problem, the literature usually provides a single solution.…
Let $G$ be a simply connected simple algebraic group over an algebraically closed field $k$ of characteristic $p>0$. The category of rational $G$-modules is not semisimple. We consider the question of when the tensor product of two simple…
Let K be a finite field and let X be a subset of a projective space, over the field K, which is parameterized by monomials arising from the edges of a clutter. We show some estimates for the degree-complexity, with respect to the revlex…
We construct Euclidean lattices whose sets of minimal vectors support some large equiangular families of lines, using notably reduction modulo~$2$ of lattices. %as considered in \cite{Ma1} and \cite{Ma2}. We also consider some related…
The paper narrows down the possible automorphisms of extremal even unimodular lattices of dimension 72. With extensive computations in {\sc Magma} using the very sophisticated algorithm for computing class groups of algebraic number fields…
Codes in finite projective spaces equipped with the subspace distance have been proposed for error control in random linear network coding. Here we collect the present knowledge on lower and upper bounds for binary subspace codes for…
We introduce in this article a new method to estimate the minimum distance of codes from algebraic surfaces. This lower bound is generic, i.e. can be applied to any surface, and turns out to be ``liftable'' under finite morphisms, paving…
We investigate several antipodal spherical designs on whether we can choose half of the points, one from each antipodal pair, such that they are balanced at the origin. In particular, root systems of type A, D and E, minimal points of Leech…
We describe a unified and computationally tractable framework for finding outliers in, and maximum-diversity subsets of, finite metric spaces of strict negative type. Examples of such spaces include finite subsets of Euclidean space and…
Given a polarization of an even unimodular lattice and integer $k\ge 1$, we define a family of unimodular lattices $L(M,N,k)$. Of special interest are certain $L(M,N,3)$ of rank 72. Their minimum norms lie in $\{4, 6, 8\}$. Norms 4 and 6 do…
There are many results on the minimum distance of a cyclic code of the form that if a certain set T is a subset of the defining set of the code, then the minimum distance of the code is greater than some integer t. This includes the BCH,…
In this paper, we prove existence of optimal complementary dual codes (LCD codes) over large finite fields. We also give methods to generate orthogonal matrices over finite fields and then apply them to construct LCD codes. Construction…
Observations suggest that our universe is spatially flat on the largest observable scales. Exactly six different compact orientable three-dimensional manifolds admit flat metrics. These six manifolds are therefore the most natural choices…
A min-max formula is proved for the minimum of an integer-valued separable discrete convex function where the minimum is taken over the set of integral elements of a box total dual integral (box-TDI) polyhedron. One variant of the theorem…
The maximal index of a Euclidean lattice L of dimension n is the maximal index of the sub-lattices of L spanned by n independent minimal vectors of L. In this paper, we prove that a perfect lattice of maximal index two not provided by a…
Ring epimorphisms often induce silting modules and cosilting modules, termed minimal silting or minimal cosilting. The aim of this paper is twofold. Firstly, we determine the minimal tilting and minimal cotilting modules over a tame…
A spherical three-distance set is a finite collection $X$ of unit vectors in $\mathbb{R}^{n}$ such that for each pair of distinct vectors has three inner product values. We use the semidefinite programming method to improve the upper bounds…
Over an algebraically closed field we classify all minimal representation-infinite algebras where the lattice of two-sided ideals is not distributive. As a consequence there are only finitely many isomorphism classes of minimal…
The capacity to randomly pick a unitary across the whole unitary group is a powerful tool across physics and quantum information. A unitary $t$-design is designed to tackle this challenge in an efficient way, yet constructions to date rely…
A popular approach in combinatorial optimization is to model problems as integer linear programs. Ideally, the relaxed linear program would have only integer solutions, which happens for instance when the constraint matrix is totally…