Searcharxiv⌕ Search

arXiv subjects

A. D. Mednykh

Publications and source records attributed to A. D. Mednykh.

10 recordsLinked to original sources
arXiv2021

On Jacobian group and complexity of the Y-graph

In the present paper we suggest a simple approach for counting Jacobian group of the $Y$-graph $Y(n; k, l, m).$ In the case $Y(n; 1, 1, 1)$ the structure of the Jacobian group will be find explicitly. Also, we obtain a closed formula for the number of spanning trees of $Y$-graph in terms of Chebyshev polynomials and give its asymtotics.

math.CO↗
arXiv2019

On the coverings of closed orientable Euclidean manifolds $\mathcal{G}_{2}$ and $\mathcal{G}_{4}$

There are only 10 Euclidean forms, that is flat closed three dimensional manifolds: six are orientable and four are non-orientable. The aim of this paper is to describe all types of $n$-fold coverings over orientable Euclidean manifolds $\mathcal{G}_{2}$ and $\mathcal{G}_{4}$, and calculate the numbers of non-equivalent coverings of each type. We classify subgroups in the fundamental groups $π_1(\mathcal{G}_{2})$ and $π_1(\mathcal{G}_{4})$ up to isomorphism and calculate the numbers of conjugated classes of each type of subgroups for index $n$. The manifolds $\mathcal{G}_{2}$ and $\mathcal{G}_{4}$ are uniquely determined among the others orientable forms by their homology groups $H_1(\mathcal{G}_{2})=\mathbb{Z}_2\times \mathbb{Z}_2 \times \mathbb{Z}$ and $H_1(\mathcal{G}_{4})=\mathbb{Z}_2 \times \mathbb{Z}$.

math.AT↗
arXiv2018

On complexity of cyclic coverings of graphs

By complexity of a finite graph we mean the number of spanning trees in the graph. The aim of the present paper is to give a new approach for counting complexity $τ(n)$ of cyclic $n$-fold coverings of a graph. We give an explicit analytic formula for $τ(n)$ in terms of Chebyshev polynomials and find its asymptotic behavior as $n\to\infty$ through the Mahler measure of the associated voltage polynomial. We also prove that $F(x)=\sum\limits_{n=1}^\inftyτ(n)x^n$ is a rational function with integer coefficients.

math.CO↗
arXiv2018

On rationality of generating function for the number of spanning trees in circulant graphs

Let $F(x)=\sum\limits_{n=1}^\inftyτ(n)x^n$ be the generating function for the number $τ(n)$ of spanning trees in the circulant graphs $C_{n}(s_1,s_2,\ldots,s_k).$ We show that $F(x)$ is a rational function with integer coefficients satisfying the property $F(x)=F(1/x).$ A similar result is also true for the circulant graphs of odd valency $C_{2n}(s_1,s_2,\ldots,s_k,n).$ We illustrate the obtained results by a series of examples.

math.CO↗
arXiv2015

On the Riemann-Hurwitz formula for graph coverings

The aim of this paper is to present a few versions of the Riemann-Hurwitz formula for a regular branched covering of graphs. By a graph, we mean a finite connected multigraph. The genus of a graph is defined as the rank of the first homology group. We consider a finite group acting on a graph, possibly with fixed and invertible edges, and the respective factor graph. Then, the obtained Riemann-Hurwitz formula relates genus of the graph with genus of the factor graph and orders of the vertex and edge stabilisers.

math.AT↗
arXiv2014

Trigonometric identities and volumes of the hyperbolic twist knot cone-manifolds

We calculate the volumes of the hyperbolic twist knot cone-manifolds using the Schläfli formula. Even though general ideas for calculating the volumes of cone-manifolds are around, since there is no concrete calculation written, we present here the concrete calculations. We express the length of the singular locus in terms of the distance between the two axes fixed by two generators. In this way the calculation becomes easier than using the singular locus directly. The volumes of the hyperbolic twist knot cone-manifolds simpler than Stevedore's knot are known. As an application, we give the volumes of the cyclic coverings over the hyperbolic twist knots.

math.GT↗
arXiv2014

The infimum of the volumes of convex polytopes of any given facet areas is 0

We prove the theorem mentioned in the title, for ${\mathbb{R}}^n$, where $n \ge 3$. The case of the simplex was known previously. Also, the case $n=2$ was settled, but there the infimum was some well-defined function of the side lengths. We also consider the cases of spherical and hyperbolic $n$-spaces. There we give some necessary conditions for the existence of a convex polytope with given facet areas, and some partial results about sufficient conditions for the existence of (convex) tetrahedra.

math.DG↗