All binary self-dual [44, 22, 8] codes with an automorphism of order 3 or 7 are classified. In this way we complete the classification of extremal self-dual codes of length 44 having an automorphism of odd prime order.

H"{o}lder in 1893 characterized all groups of order $pqr$ where  $p>q>r$ are prime numbers. In this paper,  by using new presentations of these groups, we compute their full automorphism group.

We define the automorphism spectrum of a computable structure M, a measurement of the complexity of the symmetries of M, and prove that certain sets of Turing degrees can be realized as automorphism spectra, while certain others cannot.

In the present paper, we study simple algebras, which do not belong to well-known classes of algebras (associative alternative Lie Jordan etc.). The finite-dimensional over a field characteristic 0 without finite basis identities, constructed by Kislitsin, are such algebras. consider two algebras: seven-dimensional anticommutative algebra \(\mathcal{D}\) and central commutative \(\mathcal{C}\)....

Any finite group can be encoded as the automorphism group of an unlabeled simple graph. Recently Hartke, Kolb, Nishikawa, and Stolee (2010) demonstrated a construction that allows any ordered pair of finite groups to be represented as the automorphism group of a graph and a vertexdeleted subgraph. In this note, we describe a generalized scenario as a game between a player and an adversary: an a...

Suppose (X,σ) is a subshift, PX(n) is the word complexity function of X, and Aut(X) is the group of automorphisms of X. We show that if PX(n) = o(n 2/ log n), then Aut(X) is amenable (as a countable, discrete group). We further show that if PX(n) = o(n 2), then Aut(X) can never contain a nonabelian free semigroup (and, in particular, can never contain a nonabelian free subgroup). This is in con...

Let W be a variety of groups defined by a set W of laws and G be a finite p-group in W. The automorphism α of a group G is said to bea marginal automorphism (with respect to W), if for all x ∈ G, x−1α(x) ∈ W∗(G), where W∗(G) is the marginal subgroup of G. Let M,N be two normalsubgroups of G. By AutM(G), we mean the subgroup of Aut(G) consistingof all automorphisms which centralize G/M. AutN(G) ...

By Frucht’s Theorem, every abstract finite group is isomorphic to the automorphism group of some graph. In 1975, Babai characterized which of these abstract groups can be realized as automorphism groups of planar graphs. In this paper, we give a more detailed description of these groups in two steps. First, we describe stabilizers of vertices in connected planar graphs as the class of groups cl...

Let p be a prime, P a finite non-cyclic p-gvoup and (xd)Q>(P) of the factor group P/$(P), and the map 61-+B is a homomorphism from the automorphism group Aut P of P to the automorphism group of P/$(P). When P/O(P) is regarded as a vector space over the field of order p, the restric...