Searcharxiv⌕ Search

arXiv subjects

Andrei Vesnin

Publications and source records attributed to Andrei Vesnin.

At least 37 records · Page 2Linked to original sources
arXiv2018

An Unknotting Index for Virtual Links

Given a virtual link diagram $D$, we define its unknotting index $U(D)$ to be minimum among $(m, n)$ tuples, where $m$ stands for the number of crossings virtualized and $n$ stands for the number of classical crossing changes, to obtain a trivial link diagram. By using span of a diagram and linking number of a diagram we provide a lower bound for unknotting index of a virtual link. Then using warping degree of a diagram, we obtain an upper bound. Both these bounds are applied to find unknotting index for virtual links obtained from pretzel links by virtualizing some crossings

math.GT↗
arXiv2018

Density of roots of the Yamada polynomial of spatial graphs

We survey the construction and properties of the Yamada polynomial of spatial graphs and present the Yamada polynomial formulae for some classes of graphs. Then we construct an infinite family of spatial graphs for which roots of Yamada polynomials are dense in the complex plane.

math.GT↗
arXiv2018

Two-variable polynomial invariants of virtual knots arising from flat virtual knot invariants

We introduce two sequences of two-variable polynomials $\{ L^n_K (t, \ell)\}_{n=1}^{\infty}$ and $\{ F^n_K (t, \ell)\}_{n=1}^{\infty}$, expressed in terms of index value of a crossing and $n$-dwrithe value of a virtual knot $K$, where $t$ and $\ell$ are variables. Basing on the fact that $n$-dwrithe is a flat virtual knot invariant we prove that $L^n_K$ and $F^n_K$ are virtual knot invariants containing Kauffman affine index polynomial as a particular case. Using $L^n_K$ we give sufficient conditions when virtual knot does not admit cosmetic crossing change.

math.GT↗
arXiv2018

On Yamada polynomial of spatial graphs obtained by edge replacements

We present formulae for computing the Yamada polynomial of spatial graphs obtained by replacing edges of plane graphs, such as cycle-graphs, theta-graphs, and bouquet-graphs, by spatial parts. As a corollary, it is shown that zeros of Yamada polynomials of some series of spatial graphs are dense in a certain region in the complex plane, described by a system of inequalities. Also, the relation between Yamada polynomial of graphs and the chain polynomial of edge-labelled graphs is obtained.

math.GT↗
arXiv2017

Brieskorn manifolds, generalised Sieradski groups, and coverings of lens spaces

The Brieskorn manifolds $B(p,q,r)$ are the $r$-fold cyclic coverings of the 3-sphere $S^{3}$ branched over the torus knot $T(p,q)$. The generalised Sieradski groups $S(m,p,q)$ are groups with $m$-cyclic pre\-sen\-tation $G_{m}(w)$, where defining word $w$ has a special form, depending of $p$ and $q$. In particular, $S(m,3,2) = G_{m}(w)$ is the group with $m$ generators $x_{1}, \ldots, x_{m}$ and $m$ defining relations $w(x_{i}, x_{i+1}, x_{i+2})=1$, where $w(x_{i}, x_{i+1}, x_{i+2}) = x_{i} x_{i+2} x_{i+1}^{-1}$. Presentations of $S(2n,3,2)$ in a certain form $G_{n}(w)$ were investigated by Howie and Williams. They proved that the $n$-cyclic presentations are geometric, i.e., correspond to the spines of closed orientable 3-manifolds. We establish an analogous result for the groups $S(2n,5,2)$. It is shown that in both cases the manifolds are $n$-fold cyclic branched coverings of lens spaces. To classify some of constructed manifolds we used the Matveev's computer program "Recognizer".

math.GT↗
arXiv2016

Complexity of virtual 3-manifolds

Virtual $3$-manifolds were introduced by S.V. Matveev in 2009 as natural generalizations of the classical $3$-manifolds. In this paper, we introduce a notion of complexity of a virtual $3$-manifold. We investigate the values of the complexity for virtual 3-manifolds presented by special polyhedra with one or two $2$-components. On the basis of these results, we establish the exact values of the complexity for a wide class of hyperbolic $3$-manifolds with totally geodesic boundary.

math.GT↗
arXiv2015

A census of tetrahedral hyperbolic manifolds

We call a cusped hyperbolic 3-manifold tetrahedral if it can be decomposed into regular ideal tetrahedra. Following an earlier publication by three of the authors, we give a census of all tetrahedral manifolds and all of their combinatorial tetrahedral tessellations with at most 25 (orientable case) and 21 (non-orientable case) tetrahedra. Our isometry classification uses certified canonical cell decompositions (based on work by Dunfield, Hoffman, Licata) and isomorphism signatures (an improvement of dehydration sequences by Burton). The tetrahedral census comes in Regina as well as SnapPy format, and we illustrate its features.

math.GT↗
arXiv2015

Three-dimensional manifolds with poor spines

A special spine of a three-manifold is said to be poor if it does not contain proper simple subpolyhedra. Using the Turaev-Viro invariants, we establish that every compact three-dimensional manifold M with connected nonempty boundary has a finite number of poor special spines. Moreover, all poor special spines of the manifold M have the same number of true vertices. We prove that the complexity of a compact hyperbolic three-dimensional manifold with totally geodesic boundary that has a poor special spine with two 2-components and n true vertices is n. Such manifolds are constructed for infinitely many values of n.

math.GT↗
arXiv2015

Some Problems on Knots, Braids, and Automorphism Groups

We present and discuss some open problems formulated by participants of the International Workshop "Knots, Braids, and Auto\-mor\-phism Groups" held in Novosibirsk, 2014. Problems are related to palindromic and commutator widths of groups; properties of Brunnian braids and two-colored braids, corresponding to an amalgamation of groups; extreme properties of hyperbolic 3-orbifold groups, relations between inner and quasi-inner automorphisms of groups; and Staic's construction of symmetric cohomology of groups.

math.GT↗
arXiv2012

Class preserving automorphisms of unitriangular groups

Let $\textrm{UT}_n (K)$ be a unitriangular group over a field $K$ and $Γ_{n,k} := \textrm{UT}_n (K)/ γ_k(\textrm{UT}_n (K))$, where $γ_k (\mathrm{UT}_n(K))$ denotes the $k$-th term of the lower central series of $\mathrm{UT}_n (K)$, $2 \le k \le n$. We prove that the group of all class preserving automorphisms of $Γ_{n,k}$ is equal to $\Inn(Γ_{n,k})$ if and only if $K$ is a prime field. Let $G_n^{(m)} := \mathrm{UT}_n (\mathbb{F}_{p^m}) / γ_3 (\mathrm{UT}_n(\mathbb{F}_{p^m}))$. We calculate the group of all class preserving automorphisms and class preserving outer automorphisms of $G_n^{(m)}$.

math.GR↗
arXiv2011

Dynnikov coordinates on virtual braid groups

We define Dynnikov coordinates on virtual braid groups. We prove that they are faithful invariants of virtual 2-braids, and present evidence that they are also very powerful invariants for general virtual braids.

math.GT↗
arXiv2011

Two-sided bounds for the volume of right-angled hyperbolic polyhedra

For a compact right-angled polyhedron $R$ in $\mathbb H^3$ denote by $\operatorname{vol} (R)$ the volume and by $\operatorname{vert} (R)$ the number of vertices. Upper and lower bounds for $\operatorname{vol} (R)$ in terms of $\operatorname{vert} (R)$ were obtained in \cite{A09}. Constructing a 2-parameter family of polyhedra, we show that the asymptotic upper bound $5 v_3 / 8$, where $v_3$ is the volume of the ideal regular tetrahedron in $\mathbb H^3$, is a double limit point for ratios $\operatorname{vol} (R) / \operatorname{vert} (R)$. Moreover, we improve the lower bound in the case $\operatorname{vert} (R) \leqslant 56$.

math.GT↗
arXiv2009

Complexity, Heegaard diagrams and generalized Dunwoody manifolds

We deal with Matveev complexity of compact orientable 3-manifolds represented via Heegaard diagrams. This lead us to the definition of modified Heegaard complexity of Heegaard diagrams and of manifolds. We define a class of manifolds which are generalizations of Dunwoody manifolds, including cyclic branched coverings of two-bridge knots and links, torus knots, some pretzel knots, and some theta-graphs. Using modified Heegaard complexity, we obtain upper bounds for their Matveev complexity, which linearly depend on the order of the covering. Moreover, using homology arguments due to Matveev and Pervova we obtain lower bounds.

math.GT↗
arXiv2007

Two-sided bounds for the complexity of cyclic branched coverings of two-bridge links

We consider closed orientable 3-dimensional hyperbolic manifolds which are cyclic branched coverings of the 3-sphere, with branching set being a two-bridge knot (or link). We establish two-sided linear bounds depending on the order of the covering for the Matveev complexity of the covering manifold. The lower estimate uses the hyperbolic volume and results of Cao-Meyerhoff and Gueritaud-Futer (who recently improved previous work of Lackenby), while the upper estimate is based on an explicit triangulation, which also allows us to give a bound on the Delzant T-invariant of the fundamental group of the manifold.

math.GT↗
arXiv2005

Strongly-cyclic branched coverings of knots via $(g,1)$-decompositions

Strongly-cyclic branched coverings of knots are studied by using their (g,1)-decompositions. Necessary and sufficient conditions for the existence and uniqueness of such coverings are obtained. It is also shown that their fundamental groups admit geometric g-words cyclic presentations.

math.GT↗
arXiv2004

Twisted conjugacy in free groups and Makanin's question

We discuss the following question of G. Makanin from ``Kourovka notebook'': does there exist an algorithm to determine is for an arbitrary pair of words $U$ and $V$ of a free group $F_n$ and an arbitrary automorphism $ϕ\in Aut(F_n)$ the equation $ϕ(X) U = V X$ solvable in $F_n$? We give the affirmative answer in the case when an automorphism is virtually inner, i.e. some its non-zero power is an inner automorphism of $F_n$.

math.GR↗