Related papers: Effective JSJ Decompositions
In this paper, we work on the pro-nilpotent group topology of a free group. First we investigate the closure of the product of finitely many subgroups of a free group in the pro-nilpotent group topology. We present an algorithm for the…
The study of the recently constructed group foliation for the geopotential forecast equation is continued. The group foliation consists of two systems, namely the automorphic and resolving systems, the analysis of which facilitates the…
First, we study a descending filtration of the ring of Fricke characters of a free group consisting of ideals on which the automorphism group of a free group acts. Then using it, we define a descending filtration of the IA-automorphism…
In this article, we study connections between representation theory and efficient solutions to the conjugacy problem on finitely generated groups. The main focus is on the conjugacy problem in conjugacy separable groups, where we measure…
We prove a finiteness result for the systolic area of groups, answering a question of M. Gromov. Namely, we show that there are only finitely many possible unfree factors of fundamental groups of~2-complexes whose systolic area is uniformly…
We study conjugacy classes of solutions to systems of equations and inequations over torsion-free hyperbolic groups, and describe an algorithm to recognize whether or not there are finitely many conjugacy classes of solutions to such a…
In this paper we prove Implicit Function Theorems (IFT) for algebraic varieties defined by regular quadratic equations and, more generally, regular NTQ systems over free groups. In the model theoretic language these results state the…
We present an exposition of our ongoing project in a new area of applicable mathematics: practical computation with finitely generated linear groups over infinite fields. Methodology and algorithms available for practical computation in…
In this article, we classify disconnected reductive groups over an algebraically closed field with a few caveats. Internal parts of our result are both a classification of finite groups and a classification of integral representations of a…
Regular chains and triangular decompositions are fundamental and well-developed tools for describing the complex solutions of polynomial systems. This paper proposes adaptations of these tools focusing on solutions of the real analogue:…
In this note, we show that the decomposition group $Dec(I)$ of a zero-dimensional radical ideal $I$ in ${\bf K}[x_1,\ldots,x_n]$ can be represented as the direct sum of several symmetric groups of polynomials based upon using Gr\"{o}bner…
We classify the groups quasi-isometric to a group generated by finite-order elements within the class of one-ended hyperbolic groups which are not Fuchsian and whose JSJ decomposition over two-ended subgroups does not contain rigid vertex…
Any finite group can be encoded as the automorphism group of an unlabeled simple graph. Recently Hartke, Kolb, Nishikawa, and Stolee (2010) demonstrated a construction that allows any ordered pair of finite groups to be represented as the…
We construct uncountably many finitely generated, pairwise non-isomorphic torsion-free groups, all of which fall into the same quasi-isometry class. This is done by considering Schur covering groups and group cohomology, with the necessary…
A new method for compiling quantum algorithms is proposed and tested for a three qubit system. The proposed method is to decompose a a unitary matrix U, into a product of simpler U j via a neural network. These U j can then be decomposed…
We present in this paper a general algorithm for solving first-order formulas in particular theories called "decomposable theories". First of all, using special quantifiers, we give a formal characterization of decomposable theories and…
An order is a commutative ring that as an abelian group is finitely generated and free. A commutative ring is reduced if it has no non-zero nilpotent elements. In this paper we use a new tool, namely, the fact that every reduced order has a…
The deletion order of a finitely generated Coxeter group W is a total order on the elements which, as is proved, is a refinement of the Bruhat order. This order is applied in [8] to construct Elnitsky tilings for any finite Coxeter group.…
We formalise, in Coq, the opening sections of Parity Complexes [Street1991] up to and including the all important excision of extremals algorithm. Parity complexes describe the essential combinatorial structure exhibited by simplexes, cubes…
In the present paper we develop a small cancellation theory for associative algebras with a basis of invertible elements. Namely, we study quotients of a group algebra of a free group and introduce three axioms for the corresponding…