Related papers: Algorithms for twisted conjugacy classes of polycy…

The conjugacy problem belongs to algorithmic group theory. It is the following question: given two words x, y over generators of a fixed group G, decide whether x and y are conjugated, i.e., whether there exists some z such that zxz^{-1} =…

Let U be the group of units of an infinite twisted group algebra K_\lambda G over a field K. We describe the maximal FC-subgroup of U and give a characterization of U with finitely conjugacy classes. In the case of group algebras we obtain…

We consider two basic algorithmic problems concerning tuples of (skew-)symmetric matrices. The first problem asks to decide, given two tuples of (skew-)symmetric matrices $(B_1, \dots, B_m)$ and $(C_1, \dots, C_m)$, whether there exists an…

We show that the question whether a term is typable is decidable for type systems combining inclusion polymorphism with parametric polymorphism provided the type constructors are at most unary. To prove this result we first reduce the…

The Alexander method is a combinatorial tool used to determine when two elements of the mapping class group are equal. We extend the Alexander method to include the case of infinite-type surfaces. Versions of the Alexander method was proven…

We prove that centralizers of elements in [f.g. free]-by-cyclic groups are computable. As a corollary we get that, given two conjugate elements in a [f.g. free]-by-cyclic group, the set of conjugators can be computed and that the conjugacy…

We give explicit formulas for the adjoint twisted Alexander polynomial and the nonabelian Reidemeister torsion of genus one two-bridge knots.

Let G be a word-hyperbolic group with given finite generating set, for which various standard structures and constants have been pre-computed. A (non-practical) algorithm is described that, given as input two lists A and B, each composed of…

We present a solution to the conjugacy decision problem and the conjugacy search problem in Garside groups, which is theoretically simpler than the usual one, with no loss of efficiency. This is done by replacing the well known cycling and…

Group testing algorithms are very useful tools for DNA library screening. Building on recent work by Levenshtein (2003) and Tonchev (2008), we construct in this paper new infinite classes of combinatorial structures, the existence of which…

A combing is a set of normal forms for a finitely generated group. This article investigates the language-theoretic and geometric properties of combings for nilpotent and polycyclic groups. It is shown that a finitely generated class 2…

In this paper, we discuss twisted Alexander polynomials of a knot for group extensions of a finite group in two directions. Firstly, we provide a mod $p$ formula for the twisted Alexander polynomial of a knot in the $3$-sphere associated…

We classify those 2-groups G which factorise as a product of two disjoint cyclic subgroups A and B, transposed by an automorphism of order 2. The case where G is metacyclic having been dealt with elsewhere, we show that for each e>2 there…

The asymptotic study of the conjugacy classes of a random element of the finite affine group leads one to define a probability measure on the set of all partitions of all positive integers. Four different probabilistic understandings of…

In this paper we study topological invariants of a class of random groups. Namely, we study right angled Artin groups associated to random graphs and investigate their Betti numbers, cohomological dimension and topological complexity. The…

A system of nested dichotomies is a method of decomposing a multi-class problem into a collection of binary problems. Such a system recursively splits the set of classes into two subsets, and trains a binary classifier to distinguish…

We give analogues of the Auslander correspondence for two classes of triangulated categories satisfying certain finiteness conditions. The first class is triangulated categories with additive generators and we consider their endomorphism…

We define the twisted doubling zeta integrals of Cai-Friedberg-Ginzburg-Kaplan in the setting of algebraic families. We then prove a rationality result and a functional equation for these zeta integrals. This allows us to define an…

We examine a class of geometric theorems on cyclic 2n-gons. We prove that if we take n disjoint pairs of sides, each pair separated by an even number of polygon sides, then there is a linear combination of the angles between those sides…

We consider, for complete bipartite graphs, the convex hulls of characteristic vectors of all matchings, extended by a binary entry indicating whether the matching contains two specific edges. These polytopes are associated to the quadratic…