Related papers: Conjugacy for homogeneous ordered graphs

A classification is given of all the countable homogeneous ordered bipartite graphs.

Let $G$ be a simple algebraic group of adjoint type over the field $\mathbb{C}$ of complex numbers. Let $B$ be a Borel subgroup of $G$ containing a maximal torus $T$ of $G$. Let $w$ be an element of the Weyl group $W$ and let $X(w)$ be the…

A homomorphism from a graph G to a graph H is locally bijective, surjective, or injective if its restriction to the neighborhood of every vertex of G is bijective, surjective, or injective, respectively. We prove that the problems of…

We study the problem of computing the parity of the number of homomorphisms from an input graph $G$ to a fixed graph $H$. Faben and Jerrum [ToC'15] introduced an explicit criterion on the graph $H$ and conjectured that, if satisfied, the…

We show that the unitary conjugacy relation for unitary representations of a second countable locally compact group on a separable Hilbert space is a Borel equivalence relation.

Let $G$ and $H$ be locally compact groups and consider their associate spaces of almost periodic functions $AP(G)$ and $AP(H)$. We investigate the continuous group homomorphisms induced by isometries of $AP(G)$ into $AP(H)$. Among others,…

The complexity of the graph isomorphism problem for trapezoid graphs has been open over a decade. This paper shows that the problem is GI-complete. More precisely, we show that the graph isomorphism problem is GI-complete for comparability…

A classical result due to Lovasz (1967) shows that the isomorphism type of a graph is determined by homomorphism counts. That is, graphs G and H are isomorphic whenever the number of homomorphisms from K to G is the same as the number of…

It is known that a graph isomorphism testing algorithm is polynomially equivalent to a detecting of a graph non-trivial automorphism algorithm. The polynomiality of the latter algorithm, is obtained by consideration of symmetry properties…

Let $G$ be a finite $p$-group such that $x\Z(G) \subseteq x^G$ for all $x \in G- \Z(G)$, where $x^G$ denotes the conjugacy class of $x$ in $G$. Then $|G|$ divides $|\Aut(G)|$, where $\Aut(G)$ is the group of all automorphisms of $G$.

We consider the graph whose vertex set is a conjugacy class ${\mathcal C}$ consisting of finite-rank self-adjoint operators on a complex Hilbert space $H$. The dimension of $H$ is assumed to be not less than $3$. In the case when operators…

In this note we prove that every finite collection of connected algebraic subgroups of the group of triangular automorphisms of the affine space generates a connected solvable algebraic subgroup.

We show that the isomorphism of ergodic measure-preserving transformations is not Borel reducible to the relation induced by the conjugacy action of the full group of an ergodic measure-preserving transformation on itself. This answers a…

We focus on the algorithm underlying the main result of [A. Mestre, R. Oeckl, Generating loop graphs via Hopf algebra in quantum field theory. J. Math. Phys., 47, 122302, 2006]. This is an algebraic formula to generate all connected graphs…

An amorphic association scheme has the property that any of its fusion is also an association scheme. In this paper we generalize the property to be amorphic to an arbitrary C-algebra and prove that any amorphic C-algebra is determined up…

In this paper, we analyze the Borel complexity of the topological conjugacy relation on Toeplitz subshifts. More specifically, we prove that topological conjugacy of Toeplitz subshifts with separated holes is hyperfinite. Indeed, we show…

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…

We prove that for a free product $G$ with free factor system $\mathcal{G}$, any automorphism $\phi$ preserving $\mathcal{G}$, atoroidal (in a sense relative to $\mathcal{G}$) and none of whose power send two different conjugates of…

There exist combable groups in which the conjugacy problem is unsolvable. The isomorphism problem is unsolvable for certain recursive sequences of finite presentations of combable groups.

This paper is devoted to the study of analytic equivalence relations which are Borel graphable, i.e. which can be realized as the connectedness relation of a Borel graph. Our main focus is the question of which analytic equivalence…