Searcharxiv⌕ Search

arXiv subjects

Alexander Kolpakov

Publications and source records attributed to Alexander Kolpakov.

At least 55 records · Page 3Linked to original sources
arXiv2020

A hyperbolic counterpart to Rokhlin's cobordism theorem

The purpose of the present paper is to prove existence of super-exponentially many compact orientable hyperbolic arithmetic $n$-manifolds that are geometric boundaries of compact orientable hyperbolic $(n+1)$-manifolds, for any $n \geq 2$, thereby establishing that these classes of manifolds have the same growth rate with respect to volume as all compact orientable hyperbolic arithmetic $n$-manifolds. An analogous result holds for non-compact orientable hyperbolic arithmetic $n$-manifolds of finite volume that are geometric boundaries, for $n \geq 2$.

math.GT↗
arXiv2020

Semidefinite programming bounds for the average kissing number

The average kissing number of $\mathbb{R}^n$ is the supremum of the average degrees of contact graphs of packings of finitely many balls (of any radii) in $\mathbb{R}^n$. We provide an upper bound for the average kissing number based on semidefinite programming that improves previous bounds in dimensions $3, \ldots, 9$. A very simple upper bound for the average kissing number is twice the kissing number; in dimensions $6, \ldots, 9$ our new bound is the first to improve on this simple upper bound.

math.MG↗
arXiv2020

Kissing number in hyperbolic space

This paper provides upper and lower bounds on the kissing number of congruent radius $r > 0$ spheres in $\mathbb{H}^n$, for $n\geq 2$. For that purpose, the kissing number is replaced by the kissing function $κ(n, r)$ which depends on the radius $r$. After we obtain some theoretical lower and upper bounds for $κ(n, r)$, we study their asymptotic behaviour and show, in particular, that $\lim_{r\to \infty} \frac{\log κ(n,r)}{r} = n-1$. Finally, we compare them with the numeric upper bounds obtained by solving a suitable semidefinite program.

math.MG↗
arXiv2020

Kissing number in spherical space

This paper investigates the behaviour of the kissing number $κ(n, r)$ of congruent radius $r > 0$ spheres in $\mathbb{S}^n$, for $n\geq 2$. Such a quantity depends on the radius $r$, and we plot the approximate graph of $κ(n, r)$ with relatively high accuracy by using new upper and lower bounds that are produced via semidefinite programming and by using spherical codes, respectively.

math.MG↗
arXiv2020

Geodesic growth of right-angled Coxeter groups based on trees

In this paper we exhibit two infinite families of trees $\{T^1_n\}_{n \geq 17}$ and $\{T^2_n\}_{n \geq 17}$ on $n$ vertices, such that $T^1_n$ and $T^2_n$ are non-isomorphic, co-spectral, and the right-angled Coxeter groups (RACGs) based on $T^1_n$ and $T^2_n$ have the same geodesic growth with respect to the standard generating set. We then show that the spectrum of a tree does is not sufficient to determine the geodesic growth of the RACG based on that tree, by providing two infinite families of trees $\{S^1_n\}_{n \geq 11}$ and $\{S^2_n\}_{n \geq 11}$, on $n$ vertices, such that $S^1_n$ and $S^2_n$ are non-isomorphic, co-spectral, and the right-angled Coxeter groups (RACGs) based on $S^1_n$ and $S^2_n$ have distinct geodesic growth. Asymptotically, as $n\rightarrow \infty$, each set $T^i_n$, or $S^i_n$, $i=1,2$, has the cardinality of the set of all trees on $n$ vertices. Our proofs are constructive and use two families of trees previously studied by B. McKay and C. Godsil.

math.GR↗
arXiv2020

Telescopic groups and symmetries of combinatorial maps

In the present paper, we show that many combinatorial and topological objects, such as maps, hypermaps, three-dimensional pavings, constellations and branched coverings of the two--sphere admit any given finite automorphism group. This enhances the already known results by Frucht, Cori -- Machì, Širáň -- Škoviera, and other authors. We also provide a more universal technique for showing that ``any finite automorphism group is possible'', that is applicable to wider classes or, in contrast, to more particular sub-classes of said combinatorial and geometric objects. Finally, we show that any given finite automorphism group can be realised by sufficiently many non-isomorphic such entities (super-exponentially many with respect to a certain combinatorial complexity measure).

math.CO↗
arXiv2019

Volume of a doubly truncated hyperbolic tetrahedron

The present paper regards the volume function of a doubly truncated hyperbolic tetrahedron. Starting from the previous results of J. Murakami, U. Yano and A. Ushijima, we have developed a unified approach to express the volume in different geometric cases via dilogarithm functions and to treat properly the many analytic strata of the latter. Finally, several numeric examples are given.

math.MG↗
arXiv2019

Spherical tetrahedra with rational volume, and spherical Pythagorean triples

We study spherical tetrahedra with rational dihedral angles and rational volumes. Such tetrahedra occur in the Rational Simplex Conjecture by Cheeger and Simons, and we supply vast families, discovered by computational efforts, of positive examples that confirm this conjecture. As a by-product, we also obtain a classification of all spherical Pythagorean triples, previously found by Smith.

math.MG↗
arXiv2019

Many cusped hyperbolic 3-manifolds do not bound geometrically

In this note, we show that there exist cusped hyperbolic $3$-manifolds that embed geodesically, but cannot bound geometrically. Thus, being a geometric boundary is a non-trivial property for such manifolds. Our result complements the work by Long and Reid on geometric boundaries of compact hyperbolic $4$-manifolds, and by Kolpakov, Reid and Slavich on embedding arithmetic hyperbolic manifolds.

math.GT↗
arXiv2019

Free subgroups of free products and combinatorial hypermaps

We derive a generating series for the number of free subgroups of finite index in $Δ^+ = \mathbb{Z}_p*\mathbb{Z}_q$ by using a connection between free subgroups of $Δ^+$ and certain hypermaps (also known as ribbon graphs or "fat" graphs), and show that this generating series is transcendental. We provide non-linear recurrence relations for the above numbers based on differential equations that are part of the Riccati hierarchy. We also study the generating series for conjugacy classes of free subgroups of finite index in $Δ^+$, which correspond to isomorphism classes of hypermaps. Asymptotic formulas are provided for the numbers of free subgroups of given finite index, conjugacy classes of such subgroups, or, equivalently, various types of hypermaps and their isomorphism classes.

math.CO↗
arXiv2018

Embedding arithmetic hyperbolic manifolds

We prove that any arithmetic hyperbolic $n$-manifold of simplest type can either be geodesically embedded into an arithmetic hyperbolic $(n+1)$-manifold or its universal $\mathrm{mod}~2$ Abelian cover can.

math.GT↗
arXiv2016

The dual Jacobian of a generalised tetrahedron, and volumes of prisms

We derive an analytic formula for the dual Jacobian matrix of a generalised hyperbolic tetrahedron. Two cases are considered: a mildly truncated and a prism truncated tetrahedron. The Jacobian for the latter arises as an analytic continuation of the former, that falls in line with a similar behaviour of the corresponding volume formulae. Also, we obtain a volume formula for a hyperbolic $n$-gonal prism: the proof requires the above mentioned Jacobian, employed in the analysis of the edge lengths behaviour of such a prism, needed later for the Schläfli formula.

math.MG↗
arXiv2016

Combinatorial decompositions, Kirillov-Reshetikhin invariants and the Volume Conjecture for hyperbolic polyhedra

We suggest a method of computing volume for a simple polytope $P$ in three-dimensional hyperbolic space $\mathbb{H}^3$. This method combines the combinatorial reduction of $P$ as a trivalent graph $Γ$ (the $1$-skeleton of $P$) by $I-H$, or Whitehead, moves (together with shrinking of triangular faces) aligned with its geometric splitting into generalised tetrahedra. With each decomposition (under some conditions) we associate a potential function $Φ$ such that the volume of $P$ can be expressed through a critical values of $Φ$. The results of our numeric experiments with this method suggest that one may associated the above mentioned sequence of combinatorial moves with the sequence of moves required for computing the Kirillov-Reshetikhin invariants of the trivalent graph $Γ$. Then the corresponding geometric decomposition of $P$ might be used in order to establish a link between the volume of $P$ and the asymptotic behaviour of the Kirillov-Reshetikhin invariants of $Γ$, which is colloquially know as the Volume Conjecture.

math.GT↗
arXiv2013

Hyperbolic four-manifolds with one cusp

We introduce a simple algorithm which transforms every four-dimensional cubulation into a cusped finite-volume hyperbolic four-manifold. Combinatorially distinct cubulations give rise to topologically distinct manifolds. Using this algorithm we construct the first examples of finite-volume hyperbolic four-manifolds with one cusp. More generally, we show that the number of $k$-cusped hyperbolic four-manifolds with volume smaller than V grows like $C^{V log V}$ for any fixed $k$. As a corollary, we deduce that the 3-torus bounds geometrically a hyperbolic manifold.

math.GT↗
arXiv2012

On the optimality of the ideal right-angled 24-cell

We prove that among four-dimensional ideal right-angled hyperbolic polytopes the 24-cell is of minimal volume and of minimal facet number. As a corollary, a dimension bound for ideal right-angled hyperbolic polytopes is obtained.

math.MG↗