相关论文: Automorphism Properties of Adinkras

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…

We determine the automorphism group of the zero-divisor digraph of the semiring of matrices over an antinegative commutative semiring with a finite number of zero-divisors.

We give a cohomological criterion for existence of outer automorphisms of a semisimple algebraic group over an arbitrary field. This criterion is then applied to the special case of groups of type D_2n over a global field, which completes…

We study the group of automorphisms of the affine plane preserving some given curve, over any field. The group is proven to be algebraic, except in the case where the curve is a bunch of parallel lines. Moreover, a classification of the…

In this paper we look at the automorphisms of the multiplicative group of finite nearfields. We find partial results for the actual automorphism groups. We find counting techniques for the size of all finite nearfields. We then show that…

The principal observation of the present paper is that an inner isotopy (i.e. a principal isotopy defined by an algebra endomorphism) is a very helpful instrument in constructing and studying interesting classes of nonassociative algebras.…

This article studies automorphism groups of graph products of arbitrary groups. We completely characterise automorphisms that preserve the set of conjugacy classes of vertex groups as those automorphisms that can be decomposed as a product…

Recent work on classicication of off-shell representations of N-extended worldline supersymmetry without central charges has uncovered an unexpectedly vast number--trillions of even just (chromo)topology types--of so called adinkraic…

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…

We propose unsupervised representation learning and feature extraction from dendrograms. The commonly used Minimax distance measures correspond to building a dendrogram with single linkage criterion, with defining specific forms of a level…

We compute the Whitehead groups of the associative rings in a class which includes (twisted) formal power series rings and the augmentation localizations of group rings and polynomial rings. For any associative ring A, we obtain an…

Complex Enriques surfaces with a finite group of automorphisms are classified into seven types. In this paper, we determine which types of such Enriques surfaces exist in characteristic 2. In particular we give a one dimensional family of…

Let $H$ and $K$ be groups. In this paper we introduce a concept of determinant for automorphisms of $H\times K$ and some concepts of incompatibility for group pairs as a measure of how much $H$ and $K$ are fare from being isomorphic. With…

The affine group schemes of automorphisms of the multilinear r-fold cross products on finite-dimensional vectors spaces over fields of characteristic not two are determined. Gradings by abelian groups on these structures, that correspond to…

We compute the automorphism group of the intersection graph of many large-type Artin groups. This graph is an analogue of the curve graph of mapping class groups but in the context of Artin groups. As an application, we deduce a number of…

We study the class of idempotent-generated pseudo-composition algebras, which is a subclass of the family of axial algebras. More specifically, we utilise the group-algebra correspondence, natural to the axial framework in order to study…

For any algebraically closed field $K$ and any endomorphism $f$ of $\mathbb{P}^1(K)$ of degree at least 2, the automorphisms of $f$ are the M\"obius transformations that commute with $f$, and these form a finite subgroup of…

A circulant (di)graph is a (di)graph on n vertices that admits a cyclic automorphism of order n. This paper provides a survey of the work that has been done on finding the automorphism groups of circulant (di)graphs, including the…

We study domains in complex $n$-space with automorphism group that does not depend on the full $n$ dimensions of the ambient space. A sufficient geometric condition is obtained to guarantee that a domain has such a "thin" automorphism…

Constructing complex computation from simpler building blocks is a defining problem of computer science. In algebraic automata theory, we represent computing devices as semigroups. Accordingly, we use mathematical tools like products and…