Related papers: Algorithms for twisted conjugacy classes of polycy…

Let phi and psi be endomorphisms of the projective line of degree at least 2, defined over a noetherian commutative ring R with unity. From a dynamical perspective, a significant question is to determine whether phi and psi are conjugate…

We provide isomorphism results for Hopf algebras that are obtained as graded twistings of function algebras on finite groups by cocentral actions of cyclic groups. More generally , we also consider the isomorphism problem for…

We define a class of finite groups based on the properties of the closed twins of their power graphs and study the structure of those groups. As a byproduct, we obtain results about finite groups admitting a partition by cyclic subgroups.

We present a deterministic linear-time algorithm for finding an odd cycle through two specified vertices in an undirected graph. This is shown in a generalized form as follows: Let $\Gamma$ be any group in which every element is of order at…

A group $G$ is said to have the property $R_\infty$ if every automorphism $\phi \in {\rm Aut}(G)$ has an infinite number of $\phi$-twisted conjugacy classes. Recent work of Gon\c{c}alves and Kochloukova uses the $\Sigma^n$…

This paper describes some algebraic properties of the species of finite topological quandles. We construct two twisted bialgebra structures on this species, one of the first kind and one of the second kind. The obstruction for the structure…

We show that all finitely generated free-by-cyclic groups are conjugacy separable: if a finitely generated group $G$ surjects onto $\mathbb{Z}$ with free kernel, then for every pair of non-conjugate elements $g,h\in G$, there exists a…

Let $G$ be a compact, simply connected Lie group. If $\mathcal{C}_1,\mathcal{C}_2$ are two $G$-conjugacy classes, then the set of elements in $G$ that can be written as products $g=g_1g_2$ of elements $g_i\in \mathcal{C}_i$ is invariant…

Let $\phi:G\to G$ be an automorphism of a group which is a free-product of finitely many groups each of which is freely indecomposable and two of the factors contain proper finite index characteristic subgroups. We show that $G$ has…

We define an invariant of tangles and framed tangles given a finite crossed module and a pair of functions, called a Reidemeister pair, satisfying natural properties. We give several examples of Reidemeister pairs derived from racks,…

We study two modifications of the Post Correspondence Problem (PCP), namely 1) the bi-infinite version, where it is asked whether there exists a bi-infinite word such that two given morphisms agree on it, and 2) the conjugate version, where…

With every family of finitely many subsets of a finite-dimensional vector space over the Galois-field with two elements we associate a cyclic transversal polytope. It turns out that those polytopes generalize several well-known polytopes…

We present an algorithmic approach to the conjugacy problems in monoids, using rewriting systems. We extend the classical theory of rewriting developed by Knuth and Bendix to a rewriting that takes into account the cyclic conjugates.

We determine which simple algebraic groups of type $^3D_4$ over arbitrary fields of characteristic different from 2 admit outer automorphisms of order 3, and classify these automorphisms up to conjugation. The criterion is formulated in…

We consider the problem of checking whether an elliptic curve defined over a given number field has complex multiplication. We study two polynomial time algorithms for this problem, one randomized and the other deterministic. The randomized…

In this paper, we describe an algorithm for computing the left, right, or 2-sided congruences of a finitely presented semigroup or monoid with finitely many classes, and an alternative algorithm when the finitely presented semigroup or…

In 2009, Crisp, Godelle and Wiest constructed a linear-time algorithm to solve the conjugacy problem in right-angled Artin groups. This algorithm has now been implemented in Python, and the code is freely available on GitHub. This document…

This thesis contains a collection of algorithms for working with the twisted groups of Lie type known as Suzuki groups, and small and large Ree groups. The two main problems under consideration are constructive recognition and constructive…

The cluster algorithm in the fully frustrated Ising model on the square lattice is essentially different from the ones used in other systems. Thus its better understanding is particularly important for finding new lines of development.…

We give an efficient, deterministic algorithm to decide if two abelian varieties over a number field are isogenous. From this, we derive an algorithm to compute the endomorphism ring of an elliptic curve over a number field.