Related papers: Conjugacy of real diffeomorphisms. A survey

The conjugacy problem belongs to algorithmic group theory. It is the following question: given two words x, y over generators of a fixed group G, decide whether x and y are conjugated, i.e., whether there exists some z such that zxz^{-1} =…

If $\mathcal{G}$ is the group (under composition) of diffeomorphisms $f : {\bar{D}}(0;1) \rightarrow {\bar{D}}(0;1)$ of the closed unit disc ${\bar{D}}(0;1)$ which are the identity map $id : {\bar{D}}(0;1) \rightarrow {\bar{D}}(0;1)$ on the…

We study, from a constructive computational point of view, the techniques used to solve the conjugacy problem in the "generic" lattice-ordered group Aut(R) of order automorphisms of the real line. We use these techniques in order to show…

Differentiable conjugacies link dynamical systems that share properties such as the stability multipliers of corresponding orbits. It provides a stronger classification than topological conjugacy, which only requires qualitative similarity.…

We discuss the time complexity of the word and conjugacy search problems for free products $G = A \star_C B$ of groups $A$ and $B$ with amalgamation over a subgroup $C$. We stratify the set of elements of $G$ with respect to the complexity…

Let $G$ be a group endowed with a solution to the conjugacy problem and with an algorithm which computes the centralizer in $G$ of any element of $G$. Let $H$ be a subgroup of $G$. We give some conditions on $H$, under which we provide a…

This paper is a step towards the complete topological classification of {\Omega}-stable diffeomorphisms on an orientable closed surface, aiming to give necessary and sufficient conditions for two such diffeomorphisms to be topologically…

We consider the problem of finding a homomorphism from an input digraph $G$ to a fixed digraph $H$. We show that if $H$ admits a weak-near-unanimity polymorphism $\phi$ then deciding whether $G$ admits a homomorphism to $H$ (HOM($H$)) is…

Let $G$ and $H$ be two simple graphs. A bijection $\phi:V(G)\rightarrow V(H)$ is called an isomorphism between $G$ and $H$ if $(\phi v_i)(\phi v_j)\in E(H)$ $\Leftrightarrow$ $v_i v_j\in E(G)$, $\forall v_i,v_j \in V(G)$. In the case that…

We study groups of homeomorphisms of R, each of whose elements have at most one fixed point. In particular we prove that any such group of C^2 diffeomorphisms is topologically conjugate to an affine group.

We relate the Mather invariant of diffeomorphisms of the (closed) interval to their asymptotic distortion. For maps with only parabolic fixed points, we show that the former is trivial if and only if the latter vanishes. As a consequence,…

We consider the problem of finding a homomorphism from an input digraph $G$ to a fixed digraph $H$. We show that if $H$ admits a weak near unanimity polymorphism $\phi$ then deciding whether $G$ admits a homomorphism to $H$ (HOM($H$)) is…

We introduce (weak) oddomorphisms of graphs which are homomorphisms with additional constraints based on parity. These maps turn out to have interesting properties (e.g., they preserve planarity), particularly in relation to homomorphism…

We describe the geometry of conjugation within any split subgroup $H$ of the full isometry group $G$ of $n$-dimensional Euclidean space. We prove that for any $h \in H$, the conjugacy class $[h]_H$ of $h$ is described geometrically by the…

Let G a be subgroup of SL(2,C), the group of 2x2 matrices of determinant 1 with complex entries. Let h map onto h(G) be a homomorphism. We call h a trace preserving homomorphism if tr(h(g))=tr(g) for all g in G,where tr(g) is the trace of…

Correspondence homomorphisms are both a generalization of standard homomorphisms and a generalization of correspondence colourings. For a fixed target graph $H$, the problem is to decide whether an input graph $G$, with each edge labeled by…

Let G a group of germs of analytic diffeomorphisms in (C^2,0). We find some remarkable properties supposing that G is finite, linearizable, abelian nilpotent and solvable. In particular, if the group is abelian and has a generic dicritic…

Let G be a word-hyperbolic group with given finite generating set, for which various standard structures and constants have been pre-computed. A (non-practical) algorithm is described that, given as input two lists A and B, each composed of…

Let $S$ be a semigroup. The elements $a,b\in S$ are called primarily conjugate if $a=xy$ and $b=yx$ for certain $x,y\in S$. The relation of conjugacy is defined as the transitive closure of the relation of primary conjugacy. In the case…

We survey, and extend, results on the adjoint action of the homeomorphism group $H(X)$ on the space of surjective continuous maps, $C_s(X)$, where $X$ is a Cantor set. We look also at the restriction of the action to various dynamically…