Related papers: Conjugacy of real diffeomorphisms. A survey

Let $n\in \mathbb{N}$. Houghton's group $H_n$ is the group of permutations of $\{1,\dots, n\}\times \mathbb{N}$, that eventually act as a translation in each copy of $\mathbb{N}$. We prove the solvability of the conjugacy problem and…

We prove that if $G\subset\text{Diff}^{1}(\mathbb{R}^2)$ is an Abelian subgroup generated by a family of commuting diffeomorphisms of the plane, all of which are $C^{1}$-close to the identity in the strong $C^{1}$-topology, and if there…

For a given finite class of finite graphs H, a graph G is called a realization of H if the neighbourhood of its any vertex induces the subgraph isomorphic to a graph of H. We consider the following problem known as the Generalized…

In 1951, Higman constructed a remarkable group $$H=\left\langle a,b,c,d \, \left| \, b^a = b^2, c^b = c^2, d^c = d^2, a^d = a^2 \right. \right\rangle$$ and used it to produce the first examples of infinite simple groups. By studying fixed…

The graph isomorphism (GI) problem, which asks whether two graphs are structurally identical, occupies a unique position in computational complexity -- it is neither known to be solvable in polynomial time, nor proven to be NP-complete. We…

We study some extension of a discrete Heisenberg group coming from the theory of loop-groups and find invariants of conjugacy classes in this group. In some cases including the case of the integer Heisenberg group we make these invariants…

We consider the following problem stated by Vdovin (2010) in the "Kourovka notebook" (Problem 17.41): Let $H$ be a solvable subgroup of a finite group $G$ that has no nontrivial solvable normal subgroups. Do there always exist five…

Let $G$ be a group. We say that an element $f\in G$ is {\em reversible in} $G$ if it is conjugate to its inverse, i.e. there exists $g\in G$ such that $g^{-1}fg=f^{-1}$. We denote the set of reversible elements by $R(G)$. For $f\in G$, we…

We describe an effective version of the conjugacy problem and study it for wreath products and free solvable groups. The problem involves estimating the length of short conjugators between two elements of the group, a notion which leads to…

Fix a finite group $G$ and a conjugacy invariant subset $C\subseteq G$. Let $\Sigma$ be an oriented surface, possibly with punctures. We consider the question of when two homomorphisms $\pi_1(\Sigma) \to G$ taking punctures into $C$ are…

Counting the number of homomorphisms of a pattern graph H in a large input graph G is a fundamental problem in computer science. There are myriad applications of this problem in databases, graph algorithms, and network science. Often, we…

We introduce the subgroup identification problem, and show that there is a finitely presented group G for which it is unsolvable, and that it is uniformly solvable in the class of finitely presented locally Hopfian groups. This is done as…

The study of rational relations is fundamental to the study of formal languages and automata theory. A rational relation is conjugate if each pair of words in the relation is conjugate (or cyclic shifts of each other). The notion of…

We prove sufficient conditions for the existence of conjugate points along geodesics of a left-invariant metric on a Lie group, using a reformulation of the index form in terms of the adjoint action. In the compact semisimple case, with an…

In this paper, we study the action on C^n of any group G of holomorphic diffeomorphisms (automorphisms) of C^n fixing 0. Suppose that there is x in C^n, having an orbit which generates C^n and also E(x)=C^n, where E(x) is the vector space…

A matching $M$ in a graph $G$ is {\em connected} if $G$ has an edge linking each pair of edges in $M$. The problem to find large connected matchings in graphs $G$ with $\alpha(G)=2$ is closely related to Hadwiger's conjecture for graphs…

This paper concerns the robust vector problems \begin{equation*} \mathrm{(RVP)}\ \ {\rm Wmin}\left\{ F(x): x\in C,\; G_u(x)\in -S,\;\forall u\in\mathcal{U}\right\}, \end{equation*} where $X, Y, Z$ are locally convex Hausdorff topological…

The $H$-join of a family of graphs $\mathcal{G}=\{G_1, \dots, G_p\}$, also called the generalized composition, $H[G_1, \dots, G_p]$, where all graphs are undirected, simple and finite, is the graph obtained by replacing each vertex $i$ of…

In this note we investigate the conjugacy problem in lamplighter groups with particular interest in the role of their geometry. In particular we show that the conjugacy length function is linear.

We consider deformations of a group of circle diffeomorphisms with H\"older continuous derivatives in the framework of quasiconformal Teichm\"uller theory and show certain rigidity under conjugation by symmetric homeomorphisms of the…