Related papers: On the structure of a poly-$\mathbb{Z}$ group

Given a composition of Bely\u{\i} maps $\beta \circ \gamma: X \rightarrow Z$, paths between edges of $\beta$ are extended to form loops, then lifted by $\gamma$. These liftings are then studied to understand how loops in $Z$ act on edges of…

The subgroup pattern of a finite groups $G$ is the table of marks of $G$ together with a list of representatives of the conjugacy classes of subgroups of $G$. In this article we present an algorithm for the computation of the subgroup…

We define a 3-loop group $\Omega^3G$ as a subgroup of smooth maps from a 3-ball to a Lie group $G$, and then construct a 2-group based on an automorphic action on the Mickelsson-Faddeev extension of $\Omega^3G$. In this we follow the…

The present article constitutes the third part of our study of the large scale geometry of metrisable groups, the first two part appearing in the companion paper "Large scale geometry of metrisable groups". In this third part, we present a…

Let $m_n(G)$ denote the number of maximal subgroups of $G$ of index $n$. An upper bound is given for the degree of maximal subgroup growth of all polycyclic metabelian groups $G$ (i.e., for $\limsup \frac{\log m_n(G)}{\log n}$, the degree…

We show that all permutations in $S_n$ can be generated by affine unicritical polynomials. We use the $\operatorname{PGL}$ group structure to compute the cycle structure of permutations with low Carlitz rank. The tree structure of the group…

We describe new combinatorial methods for constructing an explicit free resolution of Z by ZG-modules when G is a group of fractions of a monoid where enough least common multiples exist (``locally Gaussian monoid''), and, therefore, for…

In this paper we introduce poly-Poisson structures as a higher-order extension of Poisson structures. It is shown that any poly-Poisson structure is endowed with a polysymplectic foliation. It is also proved that if a Lie group acts…

Generalising an example by Girondo and Wolfart, we use finite group theory to construct Riemann surfaces admitting two or more regular dessins (i.e. orientably regular hypermaps) with automorphism groups of the same order, and in many cases…

This paper investigates the finite generation of cluster automorphism groups. By applying the pseudo $\mathbb{N}$-grading introduced in our previous work, we establish a sufficient condition for a cluster automorphism group to be finitely…

We derive a formula connecting the orders of the automorphism groups of a finite group and of its covering groups.

Let $G$ be a finite non-cyclic $p$-group of order at least $p^3$. If $G$ has an abelian maximal subgroup, or if $G$ has an elementary abelian centre with $C_G(Z(\Phi(G))) \ne \Phi(G)$, then $|G|$ divides $|\text{Aut}(G)|$.

Let $G$ be a group and $q$ a non-negative integer. We denote by $\nu^q(G)$ a certain extension of the $q$-tensor square $G \otimes^q G$ by $G \times G$. In this paper we derive a polycyclic presentation for $G \otimes^q G$, when $G$ is…

In this paper we look at the automorphisms of the multiplicative group of finite nearfields. We find partial results for the actual automorphism groups. We find counting techniques for the size of all finite nearfields. We then show that…

Assuming G\"{o}del's axiom of constructibility $\bold V=\bold L,$ we present a characterization of those groups $L$ for which there exist arbitrarily large groups $H$ such that $aut(H) \cong L$. In particular, we show that it suffices to…

The mapping class group of a surface with one boundary component admits numerous interesting representations including as a group of automorphisms of a free group and as a group of symplectic transformations. Insofar as the mapping class…

A general method for finding subgroups of a totally disconnected, locally compact groups having flat-rank greater than 1 is described. This method uses the internal structure of the group, notably the Levi subgroup of a given flat group, in…

Toward the complete classification of poly-$\mathbb{Z}$ group actions on Kirchberg algebras, we prove several fundamental theorems that are used in the classification. In addition, as an application of them, we classify outer actions of…

We give a general construction of topological groups from combinatorial structures such as trees, towers, gaps, and subadditive functions. We connect topological properties of corresponding groups with combinatorial properties of these…

We determine a reasonable upper bound for the complexity of collection from the left to multiply two elements of a finite soluble, or polycyclic, group by restricting attention to certain polycyclic presentations of the group.