Searcharxiv⌕ Search

arXiv subjects

Alexey Glazyrin

Publications and source records attributed to Alexey Glazyrin.

At least 19 recordsLinked to original sources
arXiv2026

New constructions of optimal arrangements of $2d$ lines in $\mathbb{C}^d$

In this paper we provide new constructions of equiangular tight frames of size $2d$ in $\mathbb{C}^d$. We generalize the doubling construction of Fallon and Iverson to a tensor multiplication construction based on a suitable pair consisting of a complex Hadamard matrix and an equiangular tight frame. In particular, such a pair always exists whenever there is an amicable pair of real Hadamard matrices. Most notably, amicable Hadamard pairs of order $q+1$ exist for all prime powers $q\equiv 3\pmod 4$. We also find specific constructions based on a family of pairs of order 6 and on pairs whose equiangular tight frames are defined by Paley conference matrices with $q\equiv 1\pmod 4$. Finally, we provide a power construction of equiangular tight frames that generalizes the construction of Turyn for conference matrices.

math.CO↗
arXiv2024

Extensions of polynomial plank covering theorems

We prove a complex polynomial plank covering theorem for not necessarily homogeneous polynomials. As the consequence of this result, we extend the complex plank theorem of Ball to the case of planks that are not necessarily centrally symmetric and not necessarily round. We also prove a weaker version of the spherical polynomial plank covering conjecture for planks of different widths.

math.MG↗
arXiv2023

On the total perimeter of disjoint convex bodies

In this note we introduce a pseudometric on convex planar curves based on distances between normal lines and show its basic properties. Then we use this pseudometric to give a short proof of the theorem by Pinchasi that the sum of perimeters of $k$ convex planar bodies with disjoint interiors contained in a convex body of perimeter $p$ and diameter $d$ is not greater than $p+2(k-1)d$.

math.MG↗
arXiv2023

Note on illuminating constant width bodies

Recently, Arman, Bondarenko, and Prymak constructed a constant width body in $\mathbb{R}^n$ whose illumination number is exponential in $n$. In this note, we improve their bound by generalizing the construction. In particular, we construct a constant width body in $\mathbb{R}^n$ whose illumination number is at least $(τ+o(1))^n$, where $τ\approx 1.047$.

math.MG↗
arXiv2023

Optimal Measures for Multivariate Geometric Potentials

We study measures and point configurations optimizing energies based on multivariate potentials. The emphasis is put on potentials defined by geometric characteristics of sets of points, which serve as multi-input generalizations of the well-known Riesz potentials for pairwise interaction. One of such potentials is volume squared of the simplex with vertices at the $k \ge 3$ given points: we show that the arising energy is maximized by balanced isotropic measures, in contrast to the classical two-input energy. These results are used to obtain interesting geometric optimality properties of the regular simplex. As the main machinery, we adapt the semidefinite programming method to this context and establish relevant versions of the $k$-point bounds.

math.CA↗
arXiv2023

Optimizers of three-point energies and nearly orthogonal sets

This paper is devoted to spherical measures and point configurations optimizing three-point energies. Our main goal is to extend the classic optimization problems based on pairs of distances between points to the context of three-point potentials. In particular, we study three-point analogues of the sphere packing problem and the optimization problem for $p$-frame energies based on three points. It turns out that both problems are inherently connected to the problem of nearly orthogonal sets by Erdős. As the outcome, we provide a new solution of the Erdős problem from the three-point packing perspective. We also show that the orthogonal basis uniquely minimizes the $p$-frame three-point energy when $0<p<1$ in all dimensions. The arguments make use of multivariate polynomials employed in semidefinite programming and based on the classical Gegenbauer polynomials. For $p=1$, we completely solve the analogous problem on the circle. As for higher dimensions, we show that the Hausdorff dimension of minimizers is not greater than $d-2$ for measures on $\mathbb{S}^{d-1}$. As the main ingredient of our proof, we show that the only isotropic measure without obtuse angles is the uniform distribution over an orthonormal basis.

math.CA↗
arXiv2023

Stability of optimal spherical codes

For many extremal configurations of points on a sphere, the linear programming approach can be used to show their optimality. In this paper we establish the general framework for showing stability of such configurations and use this framework to prove the stability of the two spherical codes formed by minimal vectors of the lattice $E_8$ and of the Leech lattice.

cs.IT↗
arXiv2022

On the size of maximal binary codes with 2, 3, and 4 distances

We address the maximum size of binary codes and binary constant weight codes with few distances. Previous works established a number of bounds for these quantities as well as the exact values for a range of small code lengths. As our main results, we determine the exact size of maximal binary codes with two distances for all lengths $n\ge 6$ as well as the exact size of maximal binary constant weight codes with 2,3, and 4 distances for several values of the weight and for all but small lengths.

math.CO↗
arXiv2022

Covering by planks and avoiding zeros of polynomials

We note that the recent polynomial proofs of the spherical and complex plank covering problems by Zhao and Ortega-Moreno give some general information on zeros of real and complex polynomials restricted to the unit sphere. As a corollary of these results, we establish several generalizations of the celebrated Bang plank covering theorem. We prove a tight polynomial analog of the Bang theorem for the Euclidean ball and an even stronger polynomial version for the complex projective space. Specifically, for the ball we show that for every real nonzero $d$-variate polynomial $P$ of degree $n$, there exists a point in the unit $d$-dimensional ball at distance at least $1/n$ from the zero set of the polynomial $P$. Using the polynomial approach, we also prove the strengthening of the Fejes Tóth zone conjecture on covering a sphere by spherical segments, closed parts of the sphere between two parallel hyperplanes. In particular, we show that the sum of angular widths of spherical segments covering the whole sphere is at least $π$.

math.MG↗
arXiv2021

Optimal measures for p-frame energies on spheres

We provide new answers about the placement of mass on spheres so as to minimize energies of pairwise interactions. We find optimal measures for the $p$-frame energies, i.e. energies with the kernel given by the absolute value of the inner product raised to a positive power $p$. Application of linear programming methods in the setting of projective spaces allows for describing the minimizing measures in full in several cases: we show optimality of tight designs and of the $600$-cell for several ranges of $p$ in different dimensions. Our methods apply to a much broader class of potential functions, those which are absolutely monotonic up to a particular order as functions of the cosine of the geodesic distance. In addition, a preliminary numerical study is presented which suggests optimality of several other highly symmetric configurations and weighted designs in low dimensions. In one case we improve the best known lower bounds on a minimal sized weighted design in $\mathbb{CP}^4$. All these results point to the discreteness of minimizing measures for the $p$-frame energy with $p$ not an even integer.

math.MG↗
arXiv2021

Contact graphs of ball packings

A contact graph of a packing of closed balls is a graph with balls as vertices and pairs of tangent balls as edges. We prove that the average degree of the contact graph of a packing of balls (with possibly different radii) in $\mathbb{R}^3$ is not greater than $13.92$. We also find new upper bounds for the average degree of contact graphs in $\mathbb{R}^4$ and $\mathbb{R}^5$.

math.MG↗
arXiv2021

Covering by homothets and illuminating convex bodies

The paper is devoted to coverings by translative homothets and illuminations of convex bodies. For a given positive number $α$ and a convex body $B$, $g_α(B)$ is the infimum of $α$-powers of finitely many homothety coefficients less than 1 such that there is a covering of $B$ by translative homothets with these coefficients. $h_α(B)$ is the minimal number of directions such that the boundary of $B$ can be illuminated by this number of directions except for a subset whose Hausdorff dimension is less than $α$. In this paper, we prove that $g_α(B)\leq h_α(B)$, find upper and lower bounds for both numbers, and discuss several general conjectures. In particular, we show that $h_α (B) > 2^{d-α}$ for almost all $α$ and $d$ when $B$ is the $d$-dimensional cube, thus disproving the conjecture from Research Problems in Discrete Geometry by Brass, Moser, and Pach.

math.MG↗
arXiv2021

Domes over curves

A closed piecewise linear curve is called integral if it is comprised of unit intervals. Kenyon's problem asks whether for every integral curve $γ$ in $\mathbb{R}^3$, there is a dome over $γ$, i.e. whether $γ$ is a boundary of a polyhedral surface whose faces are equilateral triangles with unit edge lengths. First, we give an algebraic necessary condition when $γ$ is a quadrilateral, thus giving a negative solution to Kenyon's problem in full generality. We then prove that domes exist over a dense set of integral curves. Finally, we give an explicit construction of domes over all regular $n$-gons.

math.MG↗
arXiv2021

Repeated minimizers of $p$-frame energies

For a collection of $N$ unit vectors $\mathbf{X}=\{x_i\}_{i=1}^N$, define the $p$-frame energy of $\mathbf{X}$ as the quantity $\sum_{i\neq j} |\langle x_i,x_j \rangle|^p$. In this paper, we connect the problem of minimizing this value to another optimization problem, so giving new lower bounds for such energies. In particular, for $p<2$, we prove that this energy is at least $2(N-d) p^{-\frac p 2} (2-p)^{\frac {p-2} 2}$ which is sharp for $d\leq N\leq 2d$ and $p=1$. We prove that for $1\leq m<d$, a repeated orthonormal basis construction of $N=d+m$ vectors minimizes the energy over an interval, $p\in[1,p_m]$, and demonstrate an analogous result for all $N$ in the case $d=2$. Finally, in connection, we give conjectures on these and other energies.

math.MG↗
arXiv2021

Potential theory with multivariate kernels

In the present paper we develop the theory of minimization for energies with multivariate kernels, i.e. energies, in which pairwise interactions are replaced by interactions between triples or, more generally, $n$-tuples of particles. Such objects, which arise naturally in various fields, present subtle differences and complications when compared to the classical two-input case. We introduce appropriate analogues of conditionally positive definite kernels, establish a series of relevant results in potential theory, explore rotationally invariant energies on the sphere, and present a variety of interesting examples, in particular, some optimization problems in probabilistic geometry which are related to multivariate versions of the Riesz energies.

math.CA↗
arXiv2020

Moments of isotropic measures and optimal projective codes

In this paper, we use the linear programming approach to find new upper bounds for the moments of isotropic measures. These bounds are then utilized for finding lower packing bounds and energy bounds for projective codes. We also show that the obtained energy bounds are sharp for several infinite families of codes.

math.MG↗
arXiv2019

Hexagon tilings of the plane that are not edge-to-edge

An irregular vertex in a tiling by polygons is a vertex of one tile and belongs to the interior of an edge of another tile. In this paper we show that for any integer $k\geq 3$, there exists a normal tiling of the Euclidean plane by convex hexagons of unit area with exactly $k$ irregular vertices. Using the same approach we show that there are normal edge-to-edge tilings of the plane by hexagons of unit area and exactly $k$ many $n$-gons ($n>6$) of unit area. A result of Akopyan yields an upper bound for $k$ depending on the maximal diameter and minimum area of the tiles. Our result complements this with a lower bound for the extremal case, thus showing that Akopyan's bound is asymptotically tight.

math.MG↗