Related papers: Computing automorphism groups of shifts using atyp…

Let $G$ be a finite $p$-group such that $x\Z(G) \subseteq x^G$ for all $x \in G- \Z(G)$, where $x^G$ denotes the conjugacy class of $x$ in $G$. Then $|G|$ divides $|\Aut(G)|$, where $\Aut(G)$ is the group of all automorphisms of $G$.

We introduce two refinements of the class of $5/2$-groups, inspired by the classes of automorphism groups of configurations and automorphism groups of unit circulant digraphs. We show that both of these classes have the property that any…

Given positive integers $p$ and $m$, where $p$ is assumed to be an odd prime, we determine the automorphism groups of $p$-groups $J$, $H$, and $K$ of orders $p^{7m}$, $p^{6m}$, and $p^{5m}$, and nilpotency classes 5, 4, and 3, respectively,…

In this paper we study the shifts, which are the shift-invariant and topologically closed sets of configurations over a finite alphabet in $\mathbb{Z}^d$. The minimal shifts are those shifts in which all configurations contain exactly the…

We initiate the study of Hamiltonian cycles up to symmetries of the underlying graph. Our focus lies on the extremal case of Hamiltonian-transitive graphs, i.e., Hamiltonian graphs where, for every pair of Hamiltonian cycles, there is a…

Let $G$ be a finite solvable group, given through a refined consistent polycyclic presentation, and $\alpha$ an automorphism of $G$, given through its images of the generators of $G$. In this paper, we discuss algorithms for computing the…

The symmetric group on a set acts transitively on its subsets of a given size. We define homomorphisms between the corresponding permutation modules, defined over a field of characteristic two, which generalize the boundary maps from…

We show that for a finite group $G$, the commuting probability of $G$ can be explicitly bounded from below in a nontrivial way by a function in the maximum fraction of elements inverted resp. squared by an automorphism of $G$. Using these…

Extending earlier work of Guralnick and of Cai and Zhang, we classify the almost simple groups which have transitive permutation representations of prime power degree $p^k$, and those which have $p$-complements (stabilisers of order coprime…

Universal coverings of the orthogonal groups and their extensions are studied in terms of Clifford-Lipschitz groups. An algebraic description of basic discrete symmetries (space inversion $P$, time reversal $T$, charge conjugation $C$ and…

We study a class of finite groups $G$ which behave similarly to elementary abelian $p$-groups with $p$ prime, that is, there exists a subgroup $N$ such that all elements of $G\setminus N$ are conjugate or inverse-conjugate under $\Aut(G)$.…

The Johnson filtration of the automorphism group of a free group is composed of those automorphisms which act trivially on nilpotent quotients of the free group. We compute cohomology classes as follows: (i) we analyze analogous classes for…

The groups of order 64p without a normal sylow p-subgroup are listed, and their automorphism groups are also determined. As a by-product of our original effort to get these groups, we needed to determine the automorphism groups of those…

A graph is edge-transitive if its automorphism group acts transitively on the edge set. In this paper, we investigate the automorphism groups of edge-transitive graphs of odd order and twice prime valency. Let $\Gamma$ be a connected graph…

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 provide isomorphism results for Hopf algebras that are obtained as graded twistings of function algebras on finite groups by cocentral actions of cyclic groups. More generally , we also consider the isomorphism problem for…

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…

Evidences have suggested that counting representations are sometimes tractable even when the corresponding classification problem is almost impossible, or "wild" in a precise sense. Such counting problems are directly related to matrix…

For a coefficient free cluster algebra $\mathcal{A}$, we study the cluster automorphism group $Aut(\mathcal{A})$ and the automorphism group $Aut(E_{\mathcal{A}})$ of its exchange graph $E_{\mathcal{A}}$. We show that these two groups are…

Counting homomorphisms between cyclic groups is a common exercise in a first course in abstract algebra. A similar problem, accessible at the same level, is to count the number of group homomorphisms from a dihedral group of order $2m$ into…