Related papers: Conjugacy for homogeneous ordered graphs

We study the isomorphism relation on Borel classes of locally compact Polish metric structures. We prove that isomorphism on such classes is always classifiable by countable structures (equivalently: Borel reducible to graph isomorphism),…

A homomorphism from a graph G to a graph H is a vertex mapping f from the vertex set of G to the vertex set of H such that there is an edge between vertices f(u) and f(v) of H whenever there is an edge between vertices u and v of G. The…

Let $\mathrm{G}$ be a subgroup of the symmetric group $\mathfrak S(U)$ of all permutations of a countable set $U$. Let $\overline{\mathrm{G}}$ be the topological closure of $\mathrm{G}$ in the function topology on $U^U$. We initiate the…

We consider the classification problem for several classes of countable structures which are "vertex-transitive", meaning that the automorphism group acts transitively on the elements. (This is sometimes called homogeneous.) We show that…

For a fixed graph $H$ and for arbitrarily large host graphs $G$, the number of homomorphisms from $H$ to $G$ and the number of subgraphs isomorphic to $H$ contained in $G$ have been extensively studied in extremal graph theory and graph…

The isomorphism problem for planar graphs is known to be efficiently solvable. For planar 3-connected graphs, the isomorphism problem can be solved by efficient parallel algorithms, it is in the class $AC^1$. In this paper we improve the…

This thesis investigates the central role of homomorphism problems (structure-preserving maps) in two complementary domains: database querying over finite, graph-shaped data, and constraint solving over (potentially infinite) structures.…

Let X=G/H be the quotient of a connected reductive algebraic C-group G defined over the field of complex numbers C by a finite subgroup H. We describe the topological fundamental group of the homogeneous space X, which is nonabelian when H…

In this note we introduce a notion of a morphism between two hyperbolic iterated function systems. We prove that the graph of a morphism is the attractor of an iterated function system, giving a Closed Graph Theorem, and show how it can be…

The computational complexity of the graph isomorphism problem is considered to be a major open problem in theoretical computer science. It is known that testing isomorphism of chordal graphs is polynomial-time equivalent to the general…

Consider a smooth connected algebraic group $G$ acting on a normal projective variety $X$ with an open dense orbit. We show that Aut($X$) is a linear algebraic group if so is $G$; for an arbitrary $G$, the group of components of Aut($X$) is…

It is known that the canonical double cover of any connected nonbipartite graph have an automorphism group of the form $H \rtimes \mathbb{Z}_2$, where $H$ is the set of automorphism which preserve bipartite parts. We construct connected…

Let $K$ be a field of characteristic $0$ and let $G$ and $H$ be connected commutative algebraic groups over $K$. Let $\text{Mor}_0(G,H)$ denote the set of morphisms of algebraic varieties $G \to H$ that map the neutral element to the…

We introduce a relation of block conjugacy for irreducible toral automorphism, and prove that block conjugacy is equivalent to weak equivalence of the ideals associated to the automorphisms. We characterize when block conjugate…

It is shown that the isomorphism relation between continuous t-norms is Borel bireducible with the relation of order isomorphism between linear orders on the set of natural numbers, and therefore, it is a Borel complete equivalence…

It is proven in the paper, that Carter subgroups of a finite group are conjugate if Carter subgroups in the group of induced automorphisms for every non-Abelian composition factor are conjugate.

In various occasions the conjugacy problem in finitely generated amalgamated products and HNN extensions can be decided efficiently for elements which cannot be conjugated into the base groups. This observation asks for a bound on how many…

A relational structure R is ultrahomogeneous if every isomorphism of finite induced substructures of R extends to an automorphism of R. We classify the ultrahomogeneous finite binary relational structures with one asymmetric binary relation…

A digraph is connected-homogeneous if any isomorphism between finite connected induced subdigraphs extends to an automorphism of the digraph. We consider locally-finite connected-homogeneous digraphs with more than one end. In the case that…

It is well known that all Borel subgroups of a linear algebraic group are conjugate. This result also holds for the automorphism group ${{\mathrm{Aut}}} (\mathbb A^2)$ of the affine plane \cite{BerestEshmatovEshmatov2016} (see also…