This paper finds the generators of the automorphism group of the group of unitriangular matrices over a field. Most of this paper is an exposition of the work of V.M. Levuchuk, part of which is in Russian. Some proofs are of my own.
We prove that the unitriangular automorphism group of a free group of rank $n$ has a faithful representation by matrices over a field, or in other words, it is a linear group, if and only if $n \leq 3.$ Thus, we have completed a description of relatively free groups with linear the unitriangular automorphism groups. This description was initiated by Erofeev and the author in \cite{Erofeev}, where proper varieties of groups have been considered.
We study some subgroups of the group of unitriangular automorphisms $U_n$ of a free associative algebra over a field of characteristic zero. We find the center of $U_n$ and describe the hypercenters of $U_2$ and $U_3$. In particular, we prove that the upper central series for $U_2$ has infinite length. As consequence, we prove that the groups $U_n$ are non-linear for all $n \geq 2$.
We study a structure of the group of unitriangular automorphisms of a free associative algebra and a polynomial algebra and prove that this group is a semi direct product of abelian groups. Using this decomposition we describe a structure of the lower central series and the series of derived subgroups for the group of unitriangular automorphisms and prove that every element from the derived subgroup is a commutator. In addition we prove that the group of unitriangular automorphisms of a free associative algebra of rang more than 2 is not linear and describe some two-generated subgroups from th…
We complete characterization of bijections preserving commutators (PC-maps) in the group of unitriangular matrices $UT(n,F)$ over a field $F$, where $n$ is a natural number or infinity. PC-maps were recently described up to almost identity PC-maps by M.Chen, D.Wang, and H.Zhai (2011) for finite $n$ and by R.Slowik (2013) for $n=\infty$. An almost identity map is a map, preserving elementary transvections. We show that an almost identity PC-map is a multiplication by a central element. In particular, if $n=\infty$, then an almost identity map is identity. Together with the result of R.Slowik th…
Let $\textrm{UT}_n (K)$ be a unitriangular group over a field $K$ and $Γ_{n,k} := \textrm{UT}_n (K)/ γ_k(\textrm{UT}_n (K))$, where $γ_k (\mathrm{UT}_n(K))$ denotes the $k$-th term of the lower central series of $\mathrm{UT}_n (K)$, $2 \le k \le n$. We prove that the group of all class preserving automorphisms of $Γ_{n,k}$ is equal to $\Inn(Γ_{n,k})$ if and only if $K$ is a prime field. Let $G_n^{(m)} := \mathrm{UT}_n (\mathbb{F}_{p^m}) / γ_3 (\mathrm{UT}_n(\mathbb{F}_{p^m}))$. We calculate the group of all class preserving automorphisms and class preserving outer automorphisms of $G_n^{(m)}$.
We study natural linear representations of self-similar groups over finite fields. In particular, we show that if the group is generated by a finite automaton, then obtained matrices are automatic. This shows a new relation between two separate notions of automaticity: groups generated by automata and automatic sequences. We also show that if the group acts on the tree by $p$-adic automorphisms, then the corresponding linear representation is a representation by infinite triangular matrices. We relate this observation with the notion of height of an automorphism of a rooted tree due to L.Kalou…
We build, from the collection of all groups of unitriangular matrices, Hopf monoids in Joyal's category of species. Such structure is carried by the collection of class function spaces on those groups, and also by the collection of superclass function spaces, in the sense of Diaconis and Isaacs. Superclasses of unitriangular matrices admit a simple description from which we deduce a combinatorial model for the Hopf monoid of superclass functions, in terms of the Hadamard product of the Hopf monoids of linear orders and of set partitions. This implies a recent result relating the Hopf algebra o…
An explicit formula for the Schur multiplier of the group of unitriangular matrices over products of cyclic rings $\ZZ/m\ZZ$ and $\ZZ$ is derived. We use it to provide presentations of the corresponding covering groups and touch upon the question of finding their nonisomorphic representatives.
We provide a new upper bound on the number of conjugacy classes in the group $U_n(q)$ of unitriangular matrices over a finite field. We also compute a similar upper bound for every group in the lower central series of $U_n(q)$.
We show that the decomposition matrix of a given group $G$ is unitriangular, whenever $G$ has a normal subgroup $N$ such that the decomposition matrix of $N$ is unitriangular, $G/N$ is abelian and certain characters of $N$ extend to their stabilizer in $G$. Using the recent result by Brunat--Dudas--Taylor establishing that unipotent blocks have a unitriangular decomposition matrix, this allows us to prove that blocks of groups of quasi-simple groups of Lie type have a unitriangular decomposition matrix, whenever they are related via Bonnafé--Dat--Rouquier's equivalence to a unipotent block. Th…
We study the pro-$p$ group $G$ whose finite quotients give the prototypical Sylow $p$-subgroup of the general linear groups over a finite field of prime characteristic $p$. In this article, we extend the known results on the subgroup structure of $G$. In particular, we give an explicit embedding of the Nottingham group as a subgroup and show that it is selfnormalising. Holubowski (\cite{holub1,holub0,holub2}) studies a free product $C_p*C_p$ as a (discrete) subgroup of $G$ and we prove that its closure is selfnormalising of infinite index in the subgroup of $2$-periodic elements of $G$. We als…
Let $R$ be an integral domain of zero characteristic. In this note we study the Reidemeister spectrum of the group ${\rm UT}_n(R)$ of unitriangular matrices over $R$. We prove that if $R^+$ is finitely generated and $n>2|R^*|$, then ${\rm UT}_n(R)$ possesses the $R_{\infty}$-property, i. e. the Reidemeister spectrum of ${\rm UT}_n(R)$ contains only $\infty$, however, if $n\leq|R^*|$, then the Reidemeister spectrum of ${\rm UT}_n(R)$ has nonempty intersection with $\mathbb{N}$. If $R$ is a field, then we prove that the Reidemeister spectrum of ${\rm UT}_n(R)$ coincides with $\{1,\infty\}$, i. e…
Let $\UT_n(q)$ denote the unitriangular group of unipotent $n\times n$ upper triangular matrices over a finite field with cardinality $q$ and prime characteristic $p$. It has been known for some time that when $p$ is fixed and $n$ is sufficiently large, $\UT_n(q)$ has ``exotic'' irreducible characters taking values outside the cyclotomic field $\QQ(ζ_p)$. However, all proofs of this fact to date have been both non-constructive and computer dependent. In a preliminary work, we defined a family of orthogonal characters decomposing the supercharacters of an arbitrary algebra group. By applying th…
In this paper we study the MOR cryptosystem. We use the group of unitriangular matrices over a finite field as the non-abelian group in the MOR cryptosystem. We show that a cryptosystem similar to the El-Gamal cryptosystem over finite fields can be built using the proposed groups and a set of automorphisms of these groups. We also show that the security of this proposed MOR cryptosystem is equivalent to the El-Gamal cryptosystem over finite fields.
Let $K$ be a field of characteristic different from 2 and let $C$ be an octonion algebra over $K$. We show that there is a seven-dimensional subspace of $7\times 7$ skew-symmetric matrices over $K$ which is invariant under the automorphism group of $C$. This subspace consists of elements of rank 6 when $C$ is a division algebra, and elements of rank 4 and 6 when $C$ is a split algebra. In the latter case, the automorphism group is the exceptional group $G_2(K)$.
Let αbe an automorphism of the totally disconnected group G. The compact open subgroup, V, if G is tidy for αif [α(V') : α(V')\cap V'] is minimised at V, where V' ranges over all compact open subgroups of G. Identifying a subgroup tidy for αis analogous to identifying a basis which puts a linear transformation into Jordan canonical form. This analogy is developed here by showing that commuting automorphisms have a common tidy subgroup of G and, conversely, that a group H of automorphisms having a common tidy subgroup V is abelian modulo the automorphisms which leave V invariant. Certain subgro…
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$ for multuplication of $3\times3$ matrices then its automorphism group is isomorphic to a subgroup of $S_l\times S_3$.
A complete description of subgroups in the general linear group over a semilocal ring containing the group of diagonal matrices was obtained by Z.I.Borewicz and N.A.Vavilov. It is shown in the present paper that a similar description holds for the intermediate subgroups of the group of all automorphisms of the lattice of right submodules of a free finite rank R-module over a simple Artinian ring containing the group consisting of those automorphisms which leave invariant an appropriate sublattice.
We study the subgroup structure of the semigroup of finitary tropical matrices under multiplication. We show that every maximal subgroup is isomorphic to the full linear automorphism group of a related tropical polytope, and that each of these groups is the direct product of the real numbers with a finite group. We also show that there is a natural and canonical embedding of each full rank maximal subgroup into the group of units of the semigroup of matrices over the tropical semiring with minus infinity. Our results have numerous corollaries, including the fact that every automorphism of a pr…
We develop a theory of average sizes of kernels of generic matrices with support constraints defined in terms of graphs and hypergraphs. We apply this theory to study unipotent groups associated with graphs. In particular, we establish strong uniformity results pertaining to zeta functions enumerating conjugacy classes of these groups. We deduce that the numbers of conjugacy classes of $\mathbf{F}_q$-points of the groups under consideration depend polynomially on $q$. Our approach combines group theory, graph theory, toric geometry, and $p$-adic integration. Our uniformity results are in line …
We introduce a group naturally acting on aperiodic necklaces of length $n$ with two colours using the 1--1 correspondences between aperiodic necklaces and irreducible polynomials over the field $\F_2$ of two elements. We notice that this group is isomorphic to the quotient group of non-degenerate circulant matrices of size $n$ over that field modulo a natural cyclic subgroup. Our groups turn out to be isomorphic to the sandpile groups for a special sequence of directed graphs.
This is the second of two papers introducing and investigating two bivariate zeta functions associated to unipotent group schemes over rings of integers of number fields. In the first part, we proved some of their properties such as rationality and functional equations. Here, we calculate such bivariate zeta functions of three infinite families of nilpotent groups of class 2 generalising the Heisenberg group of three by three unitriangular matrices over rings of integers of number fields. The local factors of these zeta functions are also expressed in terms of sums over finite hyperoctahedral …
Using Frobenius normal forms of matrices over finite fields as well as the Burnside Basis Theorem, we give a direct proof of Horoševskiĭ's result that every automorphism $α$ of a finite nilpotent group has a cycle whose length coincides with $\mathrm{ord}(α)$. Also, we give two new sufficient conditions for an automorphism $α$ of an arbitrary finite group to satisfy this property, namely when $\mathrm{ord}(α)$ is a product of at most two prime powers or when $α$ has a sufficiently large cycle. This will allow us to show that the least order of a group where this property is violated is 120. Fi…
We consider the famous Strassen algorithm for fast multiplication of matrices. We show that this algorithm has a nontrivial finite group of automorphisms of order 36 (namely the direct product of two copies of the symmetric group on 3 symbols), or even 72, if we consider "extended" Strassen algorithm. This is an indirect evidence that the (unknown at present) optimal algorithm for multiplication of two size 3 by 3 matrices also may have a large automorphism group, and this may be a fruitful idea for a search of such an algorithm. In the beginning we give a brief introduction to the subject, to…
Determinant for automorphisms of Zappa-Szép product of groups
Desh Bhagat Pandit Chetan Dev Government College of Education, Faridkot, Punjab, India(法里德科特德斯·巴哈格特·潘迪特·切坦·德夫政府教育学院);Manipal University, Jaipur, Rajasthan, India(斋浦尔马匹阿尔大学);Central University of Rajasthan, Ajmer, Rajasthan, India(阿杰梅尔拉贾斯坦中央大学)
We investigate a representation of the automorphism group of a connected graph $X$ in the group of unimodular matrices $U_β$ of dimension $β$, where $β$ is the Betti number of graph $X$. We classify the graphs for which the automorphism group does not embed into $U_β$. It follows that if $X$ has no pendant vertices and $X$ is not a simple cycle, then the representation is faithful and $\mathrm{Aut}\,X$ acts faithfully on $H_1(X,\mathbb{Z})$. The latter statement can be viewed as a discrete analogue of a classical Hurwitz's theorem on Riemann surfaces of genera greater than one.
Let K be a cyclic Galois extension of degree f over k and T a generator of the Galois group. For any v=(v_1,... , v_m)\in K^m such that v is linearly independent over k, and any 0< d < m the Gabidulin-like code C(v, T , d) is a maximum rank distance code in the space of f times m matrices over k of dimension fd. This construction unifies the ones available in the literature. We characterise the K-linear codes that are Gabidulin-like codes and determine their rank-metric automorphism group.
Let S be a compact Riemann surfaces of genus g >= 2 and G a conformal automoprhism group of order n acting on S. In this paper we give the definition of an adapted generating set and an adapted basis for the first homology group of such a compact Riemann surface. This generating set and basis reflect the action of G in as simple manner as possible. This can be seen in the matrix of the action of G which we obtain. We prove the existence of such a generating set and basis for any conformal group acting on such a surface and find the matrix. This extends our earlier results on adapted bases and …
By an automorphism of a topological group G we mean an isomorphism of G onto itself which is also a homeomorphism. In this article, we study the automorphism group Aut(G) of a dense subgroup G of R^n, n>=1. We show that Aut(G) can be naturally identified with the subgroup I(G)={A in GL(n,R): G A =G} of the group GL(n,R) of all non-degenerated (n x n)-matrices over R, where G A={g A:g in G}. We describe $I(G) for many dense subgroups G of either R or R^2. We consider also an inverse problem of which symmetric subgroups of GL(n,R) can be realized as I(G) for some dense subgroup G of R^n. For exa…
The group of 2-by-2 matrices with integer entries and determinant $\pm > 1$ can be identified either with the group of outer automorphisms of a rank two free group or with the group of isotopy classes of homeomorphisms of a 2-dimensional torus. Thus this group is the beginning of three natural sequences of groups, namely the general linear groups ${\rm{GL}}(n,\Z)$, the groups of outer automorphisms of free groups of rank $n\geq 2$, and the mapping class groups of closed orientable surfaces of genus $g\geq 1$. Much of the work on mapping class groups and automorphisms of free groups is motivate…
In this work the algorithms of fast multiplication of matrices are considered. To any algorithm there associated a certain group of automorphisms. These automorphism groups are found for some well-known algorithms, including algorithms of Hopcroft, Laderman, and Pan. The automorphism group is isomorphic to $S_3\times Z_2$ and $S_4$ for Hopcroft anf Laderman algorithms, respectively. The studying of symmetry of algorithms may be a fruitful idea for finding fast algorithms, by an analogy with well-known optimization problems for codes, lattices, and graphs. {\em Keywords}: Strassen algorithm, sy…
In this paper, we determine the automorphism group of the $p$-cones ($p\neq 2$) in dimension greater than two. In particular, we show that the automorphism group of those $p$-cones are the positive scalar multiples of the generalized permutation matrices that fix the main axis of the cone. Next, we take a look at a problem related to the duality theory of the $p$-cones. Under the Euclidean inner product it is well-known that a $p$-cone is self-dual only when $p=2$. However, it was not known whether it is possible to construct an inner product depending on $p$ which makes the $p$-cone self-dual…