Related papers: Self-similar groups, automatic sequences, and unit…
We develop the rudiments of a finite-dimensional representation theory of groups over idempotent semifields by considering linear actions on tropical linear spaces. This can be considered a tropical representation theory, a characteristic…
We give a survey on results regarding self-similar and automaton presentations of free groups and semigroups and related products. Furthermore, we discuss open problems and results with respect to algebraic decision problems in this area.
In this paper we consider some classical varieties of linear algebras over the field which has characteristic 0. For every considered variety we take a category of the finite generated free algebras of this variety. And for every this…
We study fixed subgroups of automorphisms of any large-type Artin group $A_{\Gamma}$. We define a natural subgroup $\mathrm{Aut}_\Gamma(A_\Gamma)$ of $\mathrm{Aut}(A_{\Gamma})$, and for every $\gamma \in \mathrm{Aut}_\Gamma(A_\Gamma)$ we…
We introduce a new constructive recognition algorithm for finite special linear groups in their natural representation. Given a group $G$ generated by a set of $d\times d$ matrices over a finite field $\mathbb{F}_q$, known to be isomorphic…
In this paper we consider some classical varieties of linear algebras over the field which has characteristic 0. For every considered variety we take a category of the finite generated free algebras of this variety. And for every this…
This article presents a machinery based on polyhedral products that produces faithful representations of graph products of finite groups and direct products of finite groups into automorphisms of free groups $\rm Aut(F_n)$ and outer…
Let $\varphi:V\times V\to W$ be a bilinear map of finite vector spaces $V$ and $W$ over a finite field $\mathbb{F}_q$. We present asymptotic bounds on the number of isomorphism classes of bilinear maps under the natural action of…
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…
We show that on groups generated by bounded activity automata, every symmetric, finitely supported probability measure has the Liouville property. More generally we show this for every group of automorphisms of bounded type of a rooted…
In this paper, we determine precise formulas for the diameters, the number of perfect matchings, and the Tutte polynomials for an infinite family of finite graphs, namely the Schreier graphs of tree automaton groups, also called tree graph…
To any free group automorphism, we associate a universal (cone of) limit tree(s) with three defining properties: first, the tree has a minimal isometric action of the free group with trivial arc stabilizers; second, there is a unique…
We investigate the problem of when big mapping class groups are generated by involutions. Restricting our attention to the class of self-similar surfaces, which are surfaces with self-similar ends space, as defined by Mann and Rafi, and…
We present a new type of equivalence for representable matroids that uses the automorphisms of the underlying matroid. Two $r\times n$ matrices $A$ and $A'$ representing the same matroid $M$ over a field $F$ are {\it geometrically…
We generalize the peak-reduction algorithm (Whitehead's theorem) for free groups to a theorem about a general right-angled Artin group A_Gamma. As an application, we find a finite presentation for the automorphism group Aut A_Gamma that…
We describe an underlying right angled building structure of any graph product of buildings. We describe the automorphism group of the graph product of buildings. We show that the notion of generalized graph product of a collection of…
We show that any free product of two countable groups, one of them being infinite, admits a faithful and homogeneous action on the Random Graph. We also show that a large class of HNN extensions or free products, amalgamated over a finite…
We present a uniform methodology for computing with finitely generated matrix groups over any infinite field. As one application, we completely solve the problem of deciding finiteness in this class of groups. We also present an algorithm…
Tree sets are abstract structures that can be used to model various tree-shaped objects in combinatorics. Finite tree sets can be represented by finite graph-theoretical trees. We extend this representation theory to infinite tree sets.…
In this note the smooth (i.e. with open stabilizers) linear and {\sl semilinear} representations of certain permutation groups (such as infinite symmetric group or automorphism group of an infinite-dimensional vector space over a finite…