Related papers: Equations and fully residually free groups
We explain and generalise a construction due to Gromov to realise geometric small cancellation groups over graphs of groups as fundamental groups of non-positively curved 2-dimensional complexes of groups. We then give conditions so that…
The dominant theme of this thesis is the construction of matrix representations of finite solvable groups using a suitable system of generators. For a finite solvable group $G$ of order $N = p_{1}p_{2}\dots p_{n}$, where $p_{i}$'s are…
The aim of this thesis is to present the notion of spaces whose curvature is bounded above, and to give some of its application in the context of Combinatorial Algebra. The thesis is made of two parts, one of theoretic purpose, and the…
We prove a factorization theorem for Fuchsian groups similar to those proved by Agol and Liu for 3-manifold groups. As an application, we build Makanin-Razborov diagrams, which parametrize the collection of all discrete representations from…
This is an expository article on recent developments in the theory of group relaxations in integer programming from an algebraic perspective.
This is an extended version of summary of the talk at the International Conference on Group Theory in honor of Victor Mazurov on the occasion of his 80th birthday. The concise version of this report can be found in the talks and…
Invited lecture at the International Congress of Mathematicians, Zuerich, August 3-11, 1994 (extended version), reviews free field realizations of affine Kac-Moody and W-algebras and their applications.
To follow up on the results of [1], we propose a computationally efficient explicit cyclic decomposition of the maximal tori in the groups $SL_n(q)$ and $SU_n(q)$ and their projective images. We also derive some corollaries to simplify…
Self-similar groups provide a rich source of groups with interesting properties; e.g., infinite torsion groups (Burnside groups) and groups with an intermediate word growth. Various self-similar groups can be described by a recursive…
The Gauss-Jordan elimination algorithm is extended to reduce a row-finite $\omega\times\omega$ matrix to lower row-reduced form, founded on a strategy of rightmost pivot elements. Such reduced matrix form preserves row equivalence, unlike…
This paper is a follow-up to our joint paper with I. Agol, P. Storm and K. Whyte "Finiteness of arithmetic hyperbolic reflection groups". The main purpose is to investigate the effective side of the method developed there and its possible…
The Petrov solution (for $\Lambda=0$) and the Kaigorodov-Ozsv\'ath solution (for $\Lambda<0$) provide examples of vacuum solutions of the Einstein equations with simply-transitive isometry groups. We calculate the boundary stress-tensor for…
We present a survey of results on word equations in simple groups, as well as their analogues and generalizations, which were obtained over the past decade using various methods, group-theoretic and coming from algebraic and arithmetic…
The aim of this paper is to present a PSPACE algorithm which yields a finite graph of exponential size and which describes the set of all solutions of equations in free groups as well as the set of all solutions of equations in free monoids…
A new class of groups $\mathcal{C}$, containing all coherent RAAGs and all toral relatively hyperbolic groups, is defined. It is shown that, for a group $G$ in the class $\mathcal{C}$, the $\mathbb{Z}[t]$-exponential group…
Gaussian elimination is used in special linear groups to solve the word problem. In this paper, we extend Gaussian elimination to unitary groups. These algorithms have an application in building a public-key cryptosystem, we demonstrate…
We study automaton structures, i.e. groups, monoids and semigroups generated by an automaton, which, in this context, means a deterministic finite-state letter-to-letter transducer. Instead of considering only complete automata, we…
Utilizing an embedding theorem of Obraztsov we construct groups as described in the title. This provides an affirmative answer to a problem of D. O. Revin. The constructed groups also provide a negative answer to a question highlighted by…
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…
We show that the deletion theorem of a free arrangement is combinatorial, i.e., whether we can delete a hyperplane from a free arrangement keeping freeness depends only on the intersection lattice. In fact, we give an explicit sufficient…