arXiv subjects

Andrei Yu. Vesnin

Publications and source records attributed to Andrei Yu. Vesnin.

4 recordsLinked to original sources

arXiv2025

On a family of hyperbolic Brunnian links and their volumes

An $n$-component link $L$ is said to be \emph{Brunnian} if it is non-trivial but every proper sublink of $L$ is trivial. The simplest and best known example of a hyperbolic Brunnian link is the 3-component link known as "Borromean rings". For $n\geq 2,$ we introduce an infinite family of $n$-component Brunnian links with positive integer parameters $Br(k_1, \ldots, k_n)$ that generalize examples constructed by Debrunner in 1964. We are interested in hyperbolic invariants of 3-manifolds $S^3 \setminus Br(k_1, \ldots, k_n)$ and we obtain upper bounds for their volumes. Our approach is based on Dehn fillings on cusped manifolds with volumes related to volumes of ideal right-angled hyperbolic antiprisms.

math.GT↗

arXiv2021

On the Wiener (r,s)-complexity of fullerene graphs

Fullerene graphs are mathematical models of fullerene molecules. The Wiener $(r,s)$-complexity of a fullerene graph $G$ with vertex set $V(G)$ is the number of pairwise distinct values of $(r,s)$-transmission $tr_{r,s}(v)$ of its vertices $v$: $tr_{r,s}(v)= \sum_{u \in V(G)} \sum_{i=r}^{s} d(v,u)^i$ for positive integer $r$ and $s$. The Wiener $(1,1)$-complexity is known as the Wiener complexity of a graph. Irregular graphs have maximum complexity equal to the number of vertices. No irregular fullerene graphs are known for the Wiener complexity. Fullerene (IPR fullerene) graphs with n vertices having the maximal Wiener $(r,s)$-complexity are counted for all $n\le 100$ ($n\le 136$) and small $r$ and $s$. The irregular fullerene graphs are also presented.

math.CO↗

arXiv2019

On the Wiener complexity and the Wiener index of fullerene graphs

Fullerenes are molecules in the form of cage-like polyhedra, consisting solely of carbon atoms. Fullerene graphs are mathematical models of fullerene molecules. The transmission of a vertex $v$ of a graph is the sum of distances from $v$ to all the other vertices. The number of different vertex transmissions is called the Wiener complexity of a graph. Some calculation results on the Wiener complexity and the Wiener index of fullerene graphs of order $n \le 216$ are presented. Structure of graphs with the maximal Wiener complexity or the maximal Wiener index is discussed and formulas for the Wiener index of several families of graphs are obtained.

math.CO↗

arXiv2016

On Gehring-Martin-Tan groups with an elliptic generator

The Gehring-Martin-Tan inequality for 2-generator subgroups of PSL(2,C) is one of the best known discreteness conditions. A Kleinian group $G$ is called a Gehring-Martin-Tan group if the equality holds for the group $G$. We give a method for constructing Gehring-Martin-Tan groups with a generator of order four and present some examples. These groups arise as groups of finite volume hyperbolic 3-orbifolds.

math.GT↗