Related papers: Algorithms and Classification in Groups of Piecewi…

Dualities are hidden symmetries that map seemingly unrelated physical systems onto each other. The goal of this work is to systematically construct families of Hamiltonians endowed with a given duality and to provide a universal description…

This article focuses on the study of cut groups, i.e., the groups which have only trivial central units in their integral group ring. We provide state of art for cut groups. The results are compiled in a systematic manner and have also been…

We design new deterministic and randomized algorithms for computational problems in free solvable groups. In particular, we prove that the word problem and the power problem can be solved in quasi-linear time and the conjugacy problem can…

Computing the autotopism group of a partial Latin rectangle can be performed in a variety of ways. This pilot study has two aims: (a) to compare these methods experimentally, and (b) to identify the design goals one should have in mind for…

The algebraic diversity framework generalizes temporal averaging over multiple observations to algebraic group action on a single observation for second-order statistical estimation. The central open problem in this framework is…

The goal of the present paper is to push forward the frontiers of computations on Farrell-Tate cohomology for arithmetic groups. The conjugacy classification of cyclic subgroups is reduced to the classification of modules of group rings…

We construct an algorithm that, given a pair of homomorphisms between polycyclic-by-finite groups, determines whether their Reidemeister number is finite, and if so returns a set of representatives of the twisted conjugacy classes.…

The central problem in computational algebraic topology is the computation of the homotopy groups of a given space, represented as a simplicial set. Algorithms have been found which achieve this, but the running times depend on the size of…

We describe some of the geometric properties of the automorphism group Aut(F) of Thompson's group F. We give realizations of Aut(F) geometrically via periodic tree pair diagrams, which lead to natural presentations and give effective…

For any odd prime $p$ we consider representations of a group of order $p$ in the symplectic group $Sp(p-1,Z[1/n])$ of $(p-1)\times(p-1)$-matrices over the ring $Z[1/n]$, $0\neq n\in N$. We construct a relation between the conjugacy classes…

We give new polynomial-time algorithms for testing isomorphism of a class of groups given by multiplication tables (GpI). Two results (Cannon & Holt, J. Symb. Comput. 2003; Babai, Codenotti & Qiao, ICALP 2012) imply that GpI reduces to the…

This is a survey of recent progress in several areas of combinatorial algebra. We consider combinatorial problems about free groups, polynomial algebras, free associative and Lie algebras. Our main idea is to study automorphisms and, more…

Let $T$ be a tree and $e$ an edge in $T$. If $C$ is a component of $T\setminus e$ and both $C$ and its complement are infinite we say that $C$ is a half-tree. The main result of this paper is that if $G$ is a closed subgroup of the…

Let $\mathscr{C}$ be a classical group defined over a finite field. We present comprehensive theoretical solutions to the following closely related problems: 1) List a representative for each conjugacy class of $\mathscr{C}$. 2) Given $x…

We prove that the tree almost automorphism groups admit exactly three commensurability classes of closed commensurated subgroups. Our proof utilizes an independently interesting characterization of subgroups of the tree almost automorphism…

We study actions of groups by homeomorphisms on $\mathbf{R}$ (or an interval) that are minimal, have solvable germs at $\pm \infty$ and contain a pair of elements of a certain type. We call such actions coherent. We establish that such an…

The set of all centralizers of elements in a finite group $G$ is denoted by $Cent(G)$ and $G$ is called $n-$centralizer if $|Cent(G)| = n$. In this paper, the structure of centralizers in a non-abelian finite group $G$ with this property…

In this paper, we explore the behaviour of the fixed subgroups of endomorphisms of free-abelian times free (FATF) groups. We exhibit an algorithm which, given a finitely generated subgroup $\mathcal{H}$ of a FATF group $\mathcal{G}$,…

Joint diagonalization, the process of finding a shared set of approximate eigenvectors for a collection of matrices, arises in diverse applications such as multidimensional harmonic analysis or quantum information theory. This task is…

Recently, the influence of potentially present symmetries has begun to be studied in complex networks. A typical way of studying symmetries is via the automorphism group of the corresponding graph. Since complex networks are often subject…