Related papers: On the Automorphism Groups and Equivalence of Cycl…

The polynomial automorphisms of the affine plane over a field K form a group which has the structure of an amalgamated free product. This well-known algebraic structure can be used to determine some key results about the symmetry and…

This paper exploits adjacencies between the orbits of an ordered set P and a consequence of the classification of finite simple groups to, in many cases, exponentially bound the number of automorphisms. Results clearly identify the…

We compute the automorphism groups of the Torelli complex and the complex of separating curves for all but finitely many compact orientable surfaces. As an application, we show that the abstract commensurators of the Torelli group and the…

New criteria for which Cayley graphs of cyclic groups of any order can be completely determined--up to isomorphism--by the eigenvalues of their adjacency matrices is presented. Secondly, a new construction for pairs of nonisomorphic Cayley…

In this paper we obtain the automorphism groups of the token graphs of some graphs. In particular we obtain the automorphism group of the $k$-token graph of the path graph $P_n$, for $n\neq 2k$. Also, we obtain the automorphism group of the…

The automorphism group of a binary doubly-even self-dual code is always contained in the alternating group. On the other hand, given a permutation group $G$ of degree $n$ there exists a doubly-even self-dual $G$-invariant code if and only…

We describe the conjugacy classes of the elements of the free product of two groups and their centralizers and, as a consequence, we correct the calculation of the cyclic and periodic cyclic homology of the group ring of the free product of…

We describe the automorphism groups of elliptic Poisson algebras on polynomial algebras in three variables and give an explicit set of generators and defining relations for this group.

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…

Cyclic words are equivalence classes of cyclic permutations of ordinary words. When a group is given by a rewriting relation, a rewriting system on cyclic words is induced, which is used to construct algorithms to find minimal length…

Every indefinite binary form occurs as the Picard lattice of some K3-surface. The group of its isometries, or automorphs, coincides with the automorphism group of the K3-surface, but only up to finite groups. The classical theory of…

It is well known that the graph isomorphism problem is polynomial-time reducible to the graph automorphism problem (in fact these two problems are polynomial-time equivalent). We show that, analogously, the group isomorphism problem is…

We study automorphism groups and birational automorphism groups of compact complex surfaces. We show that the automorphism group of such surface $X$ is always Jordan, and the birational automorphism group is Jordan unless $X$ is birational…

We classify those 2-groups G which factorise as a product of two disjoint cyclic subgroups A and B, transposed by an automorphism of order 2. The case where G is metacyclic having been dealt with elsewhere, we show that for each e>2 there…

Let $p$ be an odd prime and let $\mathbf{B}$ be a $p$-block of a finite group, such that $\mathbf{B}$ has cyclic defect groups. We describe the self-dual indecomposable $\mathbf{B}$-modules and for each such module determine whether it is…

We determine the eigenvalues with multiplicity of each element of an alternating group in any irreducible representation. This is equivalent to determining the decomposition of cyclic representations of alternating groups into irreducibles.…

We give an account on what is known on the subject of permutation matchings, which are bijections of a finite regular semigroup that map each element to one of its inverses. This includes partial solutions to some open questions, including…

The monography examines the problem of constructing a group of automorphisms of a graph. A graph automorphism is a mapping of a set of vertices onto itself that preserves adjacency. The set of such automorphisms forms a vertex group of a…

In this article we consider square permutations, a natural subclass of permutations defined in terms of geometric conditions, that can also be described in terms of pattern avoiding permutations, and convex permutoninoes, a related subclass…

The paper concerns the automorphism groups of Cayley graphs over cyclic groups which have a rational spectrum (rational circulant graphs for short). With the aid of the techniques of Schur rings it is shown that the problem is equivalent to…