Related papers: Graphical Cyclic Permutation Groups

The cyclic graph $\Gamma(S)$ of a semigroup $S$ is the simple graph whose vertex set is $S$ and two vertices $x, y$ are adjacent if the subsemigroup generated by $x$ and $y$ is monogenic. In this paper, we classify the semigroup $S$ such…

We define and study two structures associated to permutation groups: Dirichlet characters on permutation groups, and the "cycle form," a bilinear form on the group algebras of permutation groups. We use Dirichlet characters and the cycle…

The study of graph C*-algebras has a long history in operator algebras. Surprisingly, their quantum symmetries have never been computed so far. We close this gap by proving that the quantum automorphism group of a finite, directed graph…

Assume G is a finite group, such that |G|= 6pq or 7pq, where p and q are distinct prime numbers, and let S be a generating set of G. We prove there is a Hamiltonian cycle in the corresponding Cayley graph Cay(G;S).

In this paper, we have found the automorphism group of the Zappa-Sz\'{e}p product of two groups. Also, we have computed the automorphism group of the Zappa-Sz\'{e}p product of a cyclic group of order $m$ and a cyclic group of order $p^{2}$,…

In order to complete (and generalize) results of Gardiner and Praeger on 4-valent symmetric graphs (European J. Combin, 15 (1994)) we apply the method of lifting automorphisms in the context of elementary-abelian covering projections. In…

Every finitely generated self-similar group naturally produces an infinite sequence of finite $d$-regular graphs $\Gamma_n$. We construct self-similar groups, whose graphs $\Gamma_n$ can be represented as an iterated zig-zag product and…

We record for reference a detailed description of the automorphism groups of the groups of order $p^{2} q$, where $p$ and $q$ are distinct primes.

We study the automorphism group of an infinite minimal shift $(X,\sigma)$ such that the complexity difference function, $p(n+1)-p(n)$, is bounded. We give some new bounds on $\mbox{Aut}(X,\sigma)/\langle \sigma \rangle$ and also study the…

If every element of a matrix group is similar to a permutation matrix, then it is called a permutation-like matrix group. References [4] and [5] showed that, if a permutation-like matrix group contains a maximal cycle of length equal to a…

We describe computational results about undirected graphs having $10$ vertices and automorphism group isomorphic to $\mathbb{Z}/4\mathbb{Z}$.

The author determines the structure of automorphism groups of smooth plane curves of degree at least four. Furthermore, he gives some upper bounds for the order of automorphism groups of smooth plane curves and classifies the cases with…

We give a complete list of all the 70 class two groups of exponent p (p>2) and order p^k for k<9. For each of these groups the number of conjugacy classes is a polynomial in p, and the order of the automorphism group is a polynomial in p.…

In this paper, we initiate the study of palindromic automorphisms of groups that are free in some variety. More specifically, we define palindromic automorphisms of free nilpotent groups and show that the set of such automorphisms is a…

We study covering graphs of the Paley graph associated to a finite field of characteristic p in the case where the covering transformation group is cyclic of prime order distinct from p. When the field has q = p elements, we show that the…

In this dissertation, we explore the structure of inversion graphs of permutations--a class of graphs that naturally arises by representing each permutation as a graph, where vertices correspond to entries and edges encode inversions.…

In this paper, we prove results on the relationship between the complexity of the group and color isomorphism problems. The difficulty of color isomorphism problems is known to be closely linked to the the composition factors of the…

The endomorphism algebras of the permutation modules for transitive permutation groups, known as Hecke algebras, are fundamental objects in representation theory. While group algebras are known to be symmetric over any field, it is natural…

A group K is said to be a B-group if every permutation group containing K as a regular subgroup is either imprimitive or 2-transitive. In the second edition of his influential textbook on finite groups, Burnside published a proof that…

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.