Berger, T. and P. Charpin, The automorphism group of Generalized Reed-Muller codes, Discrete Mathematics 117 (1993) l-17. We prove that the automorphism group of Generalized Reed-Muller codes is the general linear nonhomogeneous group. The Generalized Reed-Muller codes are introduced by Kasami, Lin and Peterson. An extensive study was made by Delsarte, Goethals and Mac-Williams; our result foll...

A graph is textit{symmetric}, if its automorphism group is transitive on the set of its arcs. In this paper, we  classifyall the connected cubic symmetric  graphs of order $36p$  and $36p^{2}$, for each prime $p$, of which the proof depends on the classification of finite simple groups.

We call a Clayey graph Γ = Cay(G, S) normal for G, if the right regular representation R(G) of G is normal in the full automorphism group of Aunt(Γ). in this paper, we give a classification of all non-normal Clayey graphs of finite abelian group with valency 6. 

In this paper we give explicit descriptions of complete sets of mutually unbiased bases (MUBs) and orthogonal decompositions of special Lie algebras sln(C) obtained from commutative and symplectic semifields, and from some other non-semifield symplectic spreads. Relations between various constructions are studied as well. We showed that automorphism groups of complete sets of MUBs and correspon...

We look at AG codes associated to P1, re-examining the problem of determining their automorphism groups (originally investigated by Dür in 1987 using combinatorial techniques) using recent methods from algebraic geometry. We classify those finite groups that can arise as the automorphism group of an AG code and give an explicit description of how these groups appear. We give examples of general...

We study the complexity of the isomorphism and automorphism problems for finite rings with unity. We show that both integer factorization and graph isomorphism reduce to the problem of counting automorphisms of rings. The problem is shown to be in the complexity class AM ∩ coAM and hence is not NP-complete unless the polynomial hierarchy collapses. Integer factorization also reduces to the prob...

Recently, Shestakov-Umirbaev solved Nagata’s conjecture on an automorphism of a polynomial ring. To solve the conjecture, they defined notions called reductions of types I–IV for automorphisms of a polynomial ring. An automorphism admitting a reduction of type I was first found by Shestakov-Umirbaev. Using a computer, van den Essen–Makar-Limanov–Willems gave a family of such automorphisms. In t...

It is necessary to generate the automorphism group of a chemical graph in computer-aided structure elucidation. An Euclidean graph associated with a molecule is defined by a weighted graph with adjacency matrix M = [dij], where for i≠j, dij is the Euclidean distance between the nuclei i and j. In this matrix dii can be taken as zero if all the nuclei are equivalent. Otherwise, one may introduce...

A spread of lines is a set of lines of P G(n, q), which partition the point set. A parallelism is a partition of the set of lines by spreads. A parallelism in P G(n, q) is point-cyclic if it has an automorphism group which acts as a Singer automorphism. In P G(3, 7) no point-cyclic parallelisms have been known. We claim that such do not exist. 1. Introduction. Parallelisms of projective spaces ...