Related papers: Minimal odd order automorphism groups

A longstanding conjecture asserts that every non-abelian finite $p$-group $G$ admits a non-inner automorphism of order $p$. The conjecture is valid for finite $p$-groups of class 2. Here, we prove every finite non-abelian $p$-group $G$ of…

We characterize the finite groups of minimal order that admit an irreducible complex character of degree $p$ or $p^2$, where $p$ is a prime.

In this paper, we prove that the group $\mathrm{Aut}_\mathbb{Q}(X)$ of numerically trivial automorphisms are uniformly bounded for smooth projective threefolds $X$ of general type which either satisfy $q(X)\geq 3$ or have a Gorenstein…

Using only undergraduate-level methods, we classify all groups of order $p^4$, where $p$ is an odd prime.

We enumerate central and medial quasigroups of order less than $128$ up to isomorphism, with the exception of those quasigroups that are isotopic to $C_4\times C_2^4$, $C_2^6$, $C_3^4$ or $C_5^3$. We give an explicit formula for the number…

Finite groups with very few character values are characterized. The following is the main result of this article: a finite non-abelian group has precisely four character values if and only if it is the generalized dihedral group of a…

We describe $\{2,3\}$-groups in which the order of a product of any two elements of orders at most $4$ does not exceed $9$ and the centralizer of every involution is a locally cyclic $2$-subgroup. In particular, we will prove that these…

In our previous work, we introduced the notion of the twisted Alexander vanishing order of knots, defined as the order of the smallest finite group for which the corresponding twisted Alexander polynomial vanishes. In this paper, we explore…

We prove that every finite group $G$ can be realized as the automorphism group of a poset with $4|G|$ points. We also provide bounds for the minimum number of points of a poset with cyclic automorphism group of a given prime power order.

The `odd cover number' of a complete graph is the smallest size of a family of complete bipartite graphs that covers each edge an odd number of times. For $n$ odd, Buchanan, Clifton, Culver, Nie, O'Neill, Rombach and Yin showed that the odd…

The graph complexity of a compact 3-manifold is defined as the minimum order among all 4-colored graphs representing it. Exact calculations of graph complexity have been already performed, through tabulations, for closed orientable…

The minimal faithful permutation degree $\mu(G)$ of a finite group $G$ is the least integer $n$ such that $G$ is isomorphic to a subgroup of the symmetric group $S_n$. If $G$ has a normal subgroup $N$ such that $\mu(G/N) > \mu(G)$, then $G$…

We construct $(P_2)$-closed groups acting on $T_3$ in which all edge inversions have infinite order. This provides a negative answer to a question posed by Tornier. We also construct a family of $(P_2)$-closed groups for which the smallest…

In 1869, Jordan proved that the set $\mathcal{T}$ of all finite group that can be represented as the automorphism group of a tree is containing the trivial group and it is closed under taken direct product of groups of lower order in…

We refer to the set of the orders of elements of a finite group as its spectrum and say that finite groups are isospectral if their spectra coincide. In the paper we determine all finite groups isospectral to the simple groups $S_6(q)$,…

We determine two new infinite families of Cayley graphs that admit colour-preserving automorphisms that do not come from the group action. By definition, this means that these Cayley graphs fail to have the CCA (Cayley Colour Automorphism)…

We determine all posible orders of automorphisms of finite order of complex K3 surfaces or of K3 surfaces in characteristic $p>3$. E.g., a positive integer $N$ is the order of an automorphism of a complex K3 surface if and only if…

Let $G$ be a group. The orbits of the natural action of $\mbox{Aut}(G)$ on $G$ are called "automorphism orbits" of $G$, and the number of automorphism orbits of $G$ is denoted by $\omega(G)$. In this paper the finite nonsolvable groups $G$…

In a finite group, a subset is called a Lagrange subset if its size divides the group order, and a factor if it admits a complementary subset. We provide a new and comparatively direct proof of the classification of groups in which every…

For any finite group $G$, a natural question to ask is the order of the smallest possible automorphism group for a Cayley graph on $G$. A particular Cayley graph whose automorphism group has this order is referred to as an MRR (Most Rigid…