相关论文: Reading Off Kurosh Decompositions
We give an algorithm for solving equations and inequations with rational constraints in virtually free groups. Our algorithm is based on Rips classification of measured band complexes. Using canonical representatives, we deduce an algorithm…
In this paper we describe an elimination process which is a deterministic rewriting procedure that on each elementary step transforms one system of equations over free groups into a finitely many new ones. Infinite branches of this process…
The main result of this article is a refinement of the well-known subgroup separability results of Hall and Scott for free and surface groups. We show that for any finitely generated subgroup, there is a finite dimensional representation of…
This paper introduces new solvers for efficiently computing solutions to large-scale inverse problems with group sparsity regularization, including both non-overlapping and overlapping groups. Group sparsity regularization refers to a type…
A self-contained exposition is given of the topological and Galois-theoretic properties of the category of combinatorial 1-complexes, or graphs, very much in the spirit of Stallings. A number of classical, as well as some new results about…
We study finite subgroups of outer automorphisms of free products. We give upper bounds for the orders of these finite subgroups as well as bounds for the orders of individual torsion outer automorphisms under some (necessary) conditions…
We describe a procedure called panel collapse for replacing a CAT(0) cube complex $\Psi$ by a "lower complexity" CAT(0) cube complex $\Psi_\bullet$ whenever $\Psi$ contains a codimension-$2$ hyperplane that is extremal in one of the…
We show that the generation problem in Thompson group $F$ is decidable, i.e., there is an algorithm which decides if a finite set of elements of $F$ generates the whole $F$. The algorithm makes use of the Stallings $2$-core of subgroups of…
We utilize generalized moving least squares (GMLS) to develop meshfree techniques for discretizing hydrodynamic flow problems on manifolds. We use exterior calculus to formulate incompressible hydrodynamic equations in the Stokesian regime…
In this paper we review some of the fundamental properties of the free group and give a detailed account of Stallings's theory of automata, a geometric interpretation of its subgroups that has been (and still is) immensely fruitful, both as…
We use Gersten's generalization of Whitehead's algorithm to determine whether a given finitely generated subgroup of a free group $F$ is elliptic in an elementary cyclic splitting of $F$. We provide a similar result for all elementary…
We provide a new method of constructing non-quasiconvex subgroups of hyperbolic groups by utilizing techniques inspired by Stallings' foldings. The hyperbolic groups constructed are in the natural class of right-angled Coxeter groups (RACGs…
We study sets of solutions to equations over a free group, projections of such sets, and the structure of elementary sets defined over a free group. The structre theory we obtain enable us to answer some questions of A. Tarski's, and…
In this article, we study the outer automorphism group of a group G decomposed as a finite graph of group with finite edge groups and finitely generated vertex groups with at most one end. We show that Out(G) is essentially obtained by…
Let $G$ be a group hyperbolic relative to a finite collection of subgroups $\mathcal P$. Let $\mathcal F$ be the family of subgroups consisting of all the conjugates of subgroups in $\mathcal P$, all their subgroups, and all finite…
We describe an algorithm for deciding whether or not a given finitely generated torsion-free nilpotent group is decomposable as the direct product of nontrivial subgroups.
We introduce Kurosh elements in division rings based on the idea of a conjecture of Kurosh. Using this, we generalize a result of Faith in [3] and of Herstein in [6].
We present a novel construction of finite groupoids whose Cayley graphs have large girth even w.r.t. a discounted distance measure that contracts arbitrarily long sequences of edges from the same colour class (sub-groupoid), and only counts…
We develop an explicit geometric construction of automorphisms of finite fields arising from isogeny cycles. Let $k$ be a finite field, $E/k$ an elliptic curve, and $\ell$ an integer coprime to $\mathrm{char}(k)$. Let $\mathfrak{h}$ be an…
Let $F$ be a finitely generated free group. We present an algorithm such that, given a subgroup $H\leqslant F$, decides whether $H$ is the fixed subgroup of some family of automorphisms, or family of endomorphisms of $F$ and, in the…