On the Automorphism Tower of Free Nilpotent Groups Martin Dimitrov Kassabov 2003 In this thesis I study the automorphism tower of free nilpo-tent groups. Our main tool in studying the automorphism tower is to embed every group as a lattice in some Lie group. Using known rigidity results the automorphism group of the discrete group can be embedded into the automorphism group of the Lie group. Th...

The concept of graph symmetry is explained in terms of the vertex automorphism group, which is a subgroup of the complete vertex permutation group. The automorphism group can be deduced from the automorphism partition of graph vertices. An algorithm is described which constructs the automorphism group of a graph from the automorphism vertex partitioning. The algorithm is useful especially for g...

Automorphism groupS of Hadamard matrices are related to automorphism groups of de.Jigns, and the automorphism groups of the Paley-Hadamard matrices are determined .

In this paper we use orderly algorithms to enumerate (perfect) one-factorizations of complete graphs, the automorphism groups of which contain certain prescribed subgroups. We showed that, for the complete graph Ki2, excluding those one-factorizations containing exactly one automorphism of six disjoint cycles of length two, there are precisely 56391 nonisomorphic one-factorizations of Ki2 with ...

The present paper deals with permutations induced by tame automorphisms over finite fields. The first main result is a formula for determining the sign of the permutation induced by a given elementary automorphism over a finite field. The second main result is a formula for determining the sign of the permutation induced by a given affine automorphism over a finite field. We also give a combini...

In this paper we investigate when the generic member of a family of complex K3 surfaces admitting a non–symplectic automorphism of finite order admits also a symplectic automorphism of the same order. We give a complete answer to this question if the order of the automorphism is a prime number and we provide several examples and partial results otherwise. Moreover we prove that, under certain c...

In this paper we shall present a natural generalisation of the notion of automorphism of a graph or digraph G, namely a two-fold automorphism. This is a pair (α, β) of permutations of the vertex set V(G) which acts on ordered pairs of vertices of G in the natural way. The action of (α, β) on all such ordered pairs gives a graph which is two-fold isomorphic to G. When α = β the two-fold automorp...

Scmicomplctc nilpotcnt groups, that is, nilpotent groups with no outer automorphisms, have been of interest for many years. In this paper pscudocomplete nilpotent groups, that is, nilpotent groups in which the automorphism group and the inner automorphism group arc isomorphic (not equal), are constructed. When suitable conditions are placed on the pseudocomplete nilpotent group, the quotient of...