相关论文: Automorphism Properties of Adinkras
The group scheme of ternary automorphisms of a perfect finite dimensional evolution algebra A is computed. The main advantage of using group schemes is that it allows to apply the Lie functor to determine the Lie algebra of ternary…
The main purpose of this paper is to describe some published results and outline corresponding approaches which when applied to automorphism groups of algebras or groups establish that these groups are linear or non-linear.
An ordering of colours in an Adinkra leads to an embedding of this Adinkra into a Riemann surface $X$, and a branched covering map $\beta_X:X\to\mathbb{CP}^1$. This paper shows how the dashing of edges in an Adinkra determines a signed…
We study the groups of automorphisms of rational algebraic surfaces that admit a relatively minimal pencil of curves of arithmetic genus one over an algebraically closed field of arbitrary characteristic. In particular, we classify such…
The automorphisms groups and derivation algebras of all two-dimensional algebras over algebraically closed fields are described.
Heisenberg groups over algebras with central involution and their automorphism groups are constructed. The complex quaternion group algebra over a prime field is used as an example. Its subspaces provide finite models for each of the real…
This is a systematic exposition of recent results which completely describe the group of automorphisms and the group of autoequivalences of generic analytic K3 surfaces. These groups, hard to determine in the algebraic case, admit a good…
We introduce group crosscoders, an extension of crosscoders that systematically discover and analyse symmetrical features in neural networks. While neural networks often develop equivariant representations without explicit architectural…
We consider tilings of Euclidean spaces by polygons or polyhedra, in particular, tilings made by a substitution process, such as the Penrose tilings of the plane. We define an isomorphism invariant related to a subgroup of rotations and…
We generalize the enhanced power graph by replacing elements with classes under automorphisms. We show that the connectivity and diameter of this graph is similar to that of the enhanced power graph. We consider the universal vertices of…
We construct k-parameter families of rational surface automorphisms for any k. These are automorphisms of surfaces X, which are constructed from iterated blowups over the projective plane. In certain cases: we are able to determine the…
A new class of isospectral graphs is presented. These graphs are isospectral with respect to both the normalised Laplacian on the discrete graph and the standard differential Laplacian on the corresponding metric graph. The new class of…
We study the basic relation between skew-symmetric Lotka-Volterra systems and graphs, both at the level of objects and morphisms, and derive a classification from it of skew-symmetric Lotka-Volterra systems in terms of graphs as well as in…
We characterize in terms of characteristic sequences the semigroups corresponding to branches at infinity of plane affine curves $\Gamma$ for which there exists a polynomial automorphism mapping $\Gamma$ onto the axis $x=0$.
The purpose of this paper is to study the structure of Lotka-Volterra algebras, the set of their idempotent elements and their group of automorphisms. These algebras are defined through antisymmetric matrices and they emerge in connection…
Hierarchical graph clustering is a common technique to reveal the multi-scale structure of complex networks. We propose a novel metric for assessing the quality of a hierarchical clustering. This metric reflects the ability to reconstruct…
We investigate automorphism groups of planar graphs. The main result is a complete recursive description of all abstract groups that can be realized as automorphism groups of planar graphs. The characterization is formulated in terms of…
These lecture notes provide an introduction to automorphism groups of graphs. Some special families of graphs are then discussed, especially the families of Cayley graphs generated by transposition sets.
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…
We consider symmetric d-linear forms of dimension n over an algebraically closed field k of characteristic 0. The "center" of a form is the analogous of the space of symmetric matrices of a bilinear form. For d>2 the center is a commutative…