Related papers: Conjugacy of real diffeomorphisms. A survey
We propose an inverse approach for dealing with interval maps based on the manner whereby their branches are related (folding property), instead of addressing the map equations as a whole. As a main result, we provide a symmetry-breaking…
Let F be a field of characteristic not 2 and assume all algebras are over F. We establish several conjugacy theorems for the special linear Lie algebra sl_2 over an F-algebra which is a UFD. We find the structure of the full automorphism…
In the group of polynomial automorphisms of the plane, the conjugacy class of an element is closed if and only if the element is diagonalisable. In this article, we show that this does not hold for the group of special automorphisms, giving…
Mapping class groups of locally finite graphs are the analogue of those of infinite-type surfaces, and serve as a "big" version of $\text{Out}(F_n)$. In this paper, we investigate which of these mapping class groups have a dense conjugacy…
Let $f:G\rightarrow H$ be a homomorphism of groups, we construct a topological space $X_f$ such that its group of homeomorphisms is isomorphic to $G$, its group of homotopy classes of self-homotopy equivalences is isomorphic to $H$ and the…
A homomorphism from a graph $G$ to a graph $H$ is an edge-preserving mapping from $V(G)$ to $V(H)$. For a fixed graph $H$, in the list homomorphism problem, denoted by LHom($H$), we are given a graph $G$, whose every vertex $v$ is equipped…
A family T of digraphs is a complete set of obstructions for a digraph H if for an arbitrary digraph G the existence of a homomorphism from G to H is equivalent to the non-existence of a homomorphism from any member of T to G. A digraph H…
In this paper, we study the graph classification problem from the graph homomorphism perspective. We consider the homomorphisms from $F$ to $G$, where $G$ is a graph of interest (e.g. molecules or social networks) and $F$ belongs to some…
Determining the number G of components in a finite mixture distribution is an important and difficult inference issue. This is a most important question, because statistical inference about the resulting model is highly sensitive to the…
We prove that the conjugacy problem in Out(Fm) is solvable for the class of outer automorphisms whose restrictions to their polynomial subgroups are of finite order. To do this, we first investigate the structure of suspensions of free…
Part 1 : We remark that the conjugacy problem for pairs of hyperbolic au- tomorphisms of a finitely presented group (typically a free group) is decidable. The solution that we propose uses the isomorphism problem for the suspensions, and…
We investigate the group of large diffeomorphisms fixing a frame at a point for general closed 3-manifolds. We derive some general structural properties of these groups which relate to the picture of the manifold as being composed of…
We construct a class of finitely generated groups which have arbitrarily large conjugacy separability function, but in which the conjugacy problem can be solved in polynomial time, demonstrating that the McKinsey algorithm for the conjugacy…
Let G be a connected reductive group (over $\mathbb{C}$) and H a connected semisimple subgroup. The dimension data of H (realative to its given embedding in G) is the collection of the numbers $\{{\rm dim} V^{H}\}$, where V runs over all…
Let $G$ be a finite group and $N$ a normal subgroup of $G$. We determine the structure of $N$ when the diameter of the graph associated to the $G$-conjugacy classes contained in $N$ is as large as possible, that is, is equal to three.
Let $H$ be an undirected graph. In the List $H$-Homomorphism Problem, given an undirected graph $G$ with a list constraint $L(v) \subseteq V(H)$ for each variable $v \in V(G)$, the objective is to find a list $H$-homomorphism $f:V(G) \to…
We prove that if a finite group $G$ contains a conjugacy class $K$ whose square is of the form $1 \cup D$, where $D$ is a conjugacy class of $G$, then $\langle K \rangle$ is a solvable proper normal subgroup of $G$ and we completely…
This paper introduces gluing diagrams a combinatorial tool to construct homomorphisms between the shift pseudogroups of directed graphs and thus also their full groups of shifts. We will establish which of these diagrams produce…
A semigroup conjugacy is an equivalence relation that equals group conjugacy when the semigroup is a group. In this note, we answer five open problems related to semigroup conjugacy. (Problem One) We say a conjugacy ~ is partition-covering…
We study conjugacy classes of germs of non-flat diffeomorphisms of the real line fixing the origin. Based on the work of Takens and Yoccoz, we establish results that are sharp in terms of differentiability classes and order of tangency to…