Related papers: Deciding Isomorphy using Dehn fillings, the splitt…

A Hamiltonian decomposition of a regular graph is a partition of its edge set into Hamiltonian cycles. The problem of finding edge-disjoint Hamiltonian cycles in a given regular graph has many applications in combinatorial optimization and…

This article proposes an effective criterion for lifting automorphisms along regular coverings of graphs, with the covering transformation group being any finite abelian group.

We consider a Hamiltonian decomposition problem of partitioning a regular graph into edge-disjoint Hamiltonian cycles. It is known that verifying vertex non-adjacency in the 1-skeleton of the symmetric and asymmetric traveling salesperson…

By a map we mean a $2$-cell decomposition of a closed compact surface, i.e., an embedding of a graph such that every face is homeomorphic to an open disc. Automorphism of a map can be thought of as a permutation of the vertices which…

We prove that any knot or link in any 3-manifold can be nicely decomposed (splitted) by a filling Dehn sphere. This has interesting consequences in the study of branched coverings over knots and links. We give an algorithm for computing…

McCarthy's Theorem for the mapping class group of a closed hyperbolic surface states that for any two mapping classes $\sigma,\tau \in \mathrm{Mod}(S)$ there is some power $N$ such that the group $\langle \sigma^N,\tau^N\rangle$ is either…

We show that the problem to decide whether two (convex) polytopes, given by their vertex-facet incidences, are combinatorially isomorphic is graph isomorphism complete, even for simple or simplicial polytopes. On the other hand, we give a…

The presented material is devoted to the equivalent conversion from the vertex graphs to the edge graphs. We suggest that the proved theorems solve the problem of the isomorphism of graphs, the problem of the graph's enumeration with the…

This arXived paper has two independant parts, that are improved and corrected versions of different parts of a single paper once named "On equations in relatively hyperbolic groups". The first part is entitled "Existential questions in…

We present an algorithm to construct the JSJ decomposition of one-ended hyperbolic groups which are fundamental groups of graphs of free groups with cyclic edge groups. Our algorithm runs in double exponential time, and is the first…

We construct the first examples of finitely presented groups with quadratic Dehn function containing a finitely generated infinite torsion subgroup. These examples are "optimal" in the sense that the Dehn function of any such finitely…

Beginning with a $3$-manifold $M$ having a single torus boundary component, there are several computational techniques in the literature that use a presentation of the fundamental group of $M$ to produce infinite families of Dehn fillings…

Let $\Sigma$ be a compact oriented surface. The Dehn twist along every simple closed curve $\gamma \subset \Sigma$ induces an automorphism of the fundamental group $\pi$ of $\Sigma$. There are two possible ways to generalize such…

Let $\Gamma$ be the fundamental group of a closed, orientable, hyperbolic surface $S$. The $n$-power quotient, $\Gamma(n)$, is the quotient of $\Gamma$ by the $n$th powers of simple closed curves. We prove an analogue of the…

We study the quasi-isometric rigidity of a large family of finitely generated groups that split as graphs of groups with virtually free vertex groups and two-ended edge groups. Let $G$ be a group that is one-ended, hyperbolic relative to…

Fix an ordinary abelian variety defined over a finite field. The ideal class group of its endomorphism ring acts freely on the set of isogenous varieties with same endomorphism ring, by complex multiplication. Any subgroup of the class…

Folding of ADE-Dynkin diagrams according to graph automorphisms yields irreducible Dynkin diagrams of ABCDEFG-types. This folding procedure allows to trace back the properties of the corresponding simple Lie algebras or groups to those of…

By an automorphism of a topological group G we mean an isomorphism of G onto itself which is also a homeomorphism. In this article, we study the automorphism group Aut(G) of a dense subgroup G of R^n, n>=1. We show that Aut(G) can be…

The isomorphism problem is known to be efficiently solvable for interval graphs, while for the larger class of circular-arc graphs its complexity status stays open. We consider the intermediate class of intersection graphs for families of…

Subgraph Isomorphism is a very basic graph problem, where given two graphs $G$ and $H$ one is to check whether $G$ is a subgraph of $H$. Despite its simple definition, the Subgraph Isomorphism problem turns out to be very broad, as it…