Related papers: Automorphism groups of root systems matroids
We study the stabilized automorphism group of minimal and, more generally, certain transitive dynamical systems. Our approach involves developing new algebraic tools to extract information about the rational eigenvalues of these systems…
We prove that the isomorphism problem for finitely generated fully residually free groups is decidable. We also show that each finitely generated fully residually free group G has a decomposition that is invariant under automorphisms of G,…
We investigate the class of root systems $R$ obtained by extending an $A_1$-type irreducible root system by a free abelian group $G$. In this context there is a Weyl group $W$ and a group $U$ with the presentation by conjugation. Both…
Let Lambda be a tiled R-order. We give a description of Aut_R(Lambda) as the semidirect product of Inn(Lambda) and a certain subgroup of Aut(Q(Lambda)), where Q(Lambda) is the link graph of Lambda. Additionally, we give criteria for…
This is the first in a sequence of papers that will develop the theory of automorphisms of nonsolvable finite groups. The sequence will culminate in a new proof of McBride's Nonsolvable Signalizer Functor Theorem, which is one of the…
By an {\em isotropy group} of a tensor $t\in V_1 \otimes V_2\otimes V_3=\widetilde V$ we mean the group of all invertible linear transformations of $\widetilde V$ that leave $t$ invariant and are compatible (in an obvious sense) with the…
The group $\rG_n$ of automorphisms of the algebra $\mI_n:=K< x_1, >..., x_n, \frac{\der}{\der x_1}, ... ,\frac{\der}{\der x_n}, \int_1, >..., \int_n>$ of polynomial integro-differential operators is found: $$ \rG_n=S_n\ltimes \mT^n\ltimes…
We compute an explicit representation of the (topological) automorphism group or a particular Toeplitz subshift. The automorphism group is a (non-finitely generated) subgroup of rational numbers under addition and the shift map corresponds…
Trinomial hypersurfaces form a natural class of affine algebraic varieties closely connected with varieties admitting a torus action of complexity one. We investigate orbits of the automorphism group on these hypersurfaces. We prove that…
The main theorem of this document emulates, in the context of Out(F_r) theory, a mapping class group theorem (by H. Masur and J. Smillie) that determines precisely which index lists arise from pseudo-Anosov mapping classes. Since the ideal…
A rigid automorphism of a linking system is an automorphism which restricts to the identity on the Sylow subgroup. A rigid inner automorphism is conjugation by an element in the center of the Sylow subgroup. At odd primes, it is known that…
We show that the group of bounded automatic automorphisms of a rooted tree is amenable, which implies amenability of numerous classes of groups generated by finite automata. The proof is based on reducing the problem to showing amenability…
We make progress towards characterizing the algebraic matroid of the determinantal variety defined by the minors of fixed size of a matrix of variables. Our main result is a novel family of base sets of the matroid, which characterizes the…
While vector-valued automorphic forms can be defined for an arbitrary Fuchsian group $\Gamma$ and an arbitrary representation $R$ of $\Gamma$ in GL$(n,{\mathbb C})$, their existence has been established in the literature only when…
It has been proven by Schupp and Bergman that the inner automorphisms of groups can be characterized purely categorically as those group automorphisms that can be coherently extended along any outgoing homomorphism. One is thus motivated to…
Studying algorithms admitting nontrivial symmetries is a prospective way of constructing new short algorithms of matrix multiplication. The main result of the article is that if there exists an algorithm of multiplicative length $l\leq22$…
We show how the set of Dyck paths of length 2n naturally gives rise to a matroid, which we call the "Catalan matroid" C_n. We describe this matroid in detail; among several other results, we show that C_n is self-dual, it is representable…
At present, practical application and theoretical discussion of rough sets are two hot problems in computer science. The core concepts of rough set theory are upper and lower approximation operators based on equivalence relations. Matroid,…
We study endomorphisms of a free group of finite rank by means of their action on specific sets of elements. In particular, we prove that every endomorphism of the free group of rank 2 which preserves an automorphic orbit (i.e., acts ``like…
This paper investigates the relationship between strata of abelian differentials and various mapping class groups afforded by means of the topological monodromy representation. Building off of prior work of the authors, we show that the…