Related papers: Conjugacy problem in T-RAAGs
Many complex questions in biology, physics, and mathematics can be mapped to the graph isomorphism problem and the closely related graph automorphism problem. In particular, these problems appear in the context of network visualization,…
We define an operation on finite graphs, called co-contraction. By showing that co-contraction of a graph induces an injective map between right-angled Artin groups, we exhibit a family of graphs, without any induced cycle of length at…
We investigate the NP-Complete problem SAT and the geometry of its instances. For a particular type that we call {\it non-interlaced formulas}, we propose a polynomial time algorithm for their resolution using graphs and matrices.
The twin group $T_n$ is a right angled Coxeter group generated by $n- 1$ involutions and having only far commutativity relations. These groups can be thought of as planar analogues of Artin braid groups. In this note, we study some…
In this paper, we prove the rationality of the gluing relation of edge replacement systems, which were introduced for studying rearrangement groups of fractals. More precisely, we describe an algorithmic procedure for building a finite…
We identify the complexity of the classification problem for automorphisms of a given countable regularly branching tree up to conjugacy. We consider both the rooted and unrooted cases. Additionally, we calculate the complexity of the…
We solve generalizations of Hubbard's twisted rabbit problem for analogues of the rabbit polynomial of degree $d\geq 2$. The twisted rabbit problem asks: when a certain quadratic polynomial, called the Douady Rabbit polynomial, is twisted…
This paper presents iterative methods for solving tensor equations involving the T-product. The proposed approaches apply tensor computations without matrix construction. For each initial tensor, these algorithms solve related problems in a…
We characterize $k$--colorability of a simplicial graph via the intrinsic algebraic structure of the associated right-angled Artin group. As a consequence, we show that a certain problem about the existence of homomorphisms from…
The existing algorithm to compute and verify the automata associated with an automatic group deals only with the subclass of shortlex automatic groups. This paper describes the extension of the algorithm to deal with automatic groups…
We prove the strong Atiyah conjecture for right-angled Artin groups and right-angled Coxeter groups. More generally, we prove it for groups which are certain finite extensions or elementary amenable extensions of such groups.
We demonstrate that the submonoid membership problem and the rational subset membership problem are equivalent in Artin groups. Both these problem are undecidable in a given Artin group if and only if the group embeds the right-angled Artin…
Given a system of equations in a "random" finitely generated subgroup of the braid group, we show how to find a small ordered list of elements in the subgroup, which contains a solution to the equations with a significant probability.…
The weighted $\mathcal{T}$-free $2$-matching problem is the following problem: given an undirected graph $G$, a weight function on its edge set, and a set $\mathcal{T}$ of triangles in $G$, find a maximum weight $2$-matching containing no…
We prove a new version of the classical peak-reduction theorem for automorphisms of free groups in the setting of right-angled Artin groups. We use this peak-reduction theorem to prove two important corollaries about the action of the…
We consider families of coded systems that contain the Dyck shifts and that are closed under topological conjugacy. We introduce a notion of hyposynchronization of subshifts. We introduce a notion of restricted complexity of…
We show that for any countable homogeneous ordered graph $G$, the conjugacy problem for automorphisms of $G$ is Borel complete. In fact we establish that each such $G$ satisfies a strong extension property called ABAP, which implies that…
We present a solution to the Conjugacy Problem in the group of outer-automorphisms of $F_3$, a free group of rank 3. We distinguish according to several computable invariants, such as irreducibility, subgroups of polynomial growth, and…
Twisted homomorphisms of bialgebras are bialgebra homomorphisms from the first into Drinfeld twistings of the second. They possess a composition operation extending composition of bialgebra homomorphisms. Gauge transformations of twists,…
Gracefully degrading algorithms [Biely \etal, TCS 2018] are designed to circumvent impossibility results in dynamic systems by adapting themselves to the dynamics. Indeed, such an algorithm solves a given problem under some dynamics and,…