相关论文: On the automorphisms of designs constructed from f…

In this paper we construct structures from Mathieu group $M_{11}$. We classify transitive $t$-designs with 11, 12 and 22 points admitting a transitive action of Mathieu group $M_{11}$. Thereby we proved the existence of designs with…

We introduce a strategy to study irreducible representations of automorphism groups of finite modules over local rings. We prove that these automorphism groups fit in a hierarchy that facilitates a stratification of their irreducible…

We find a set of generators for the automorphism group of a graph product of finitely generated abelian groups entirely from a certain labeled graph. In addition, we find generators for the important subgroup of star-automorphisms defined…

Two mappings in a finite field, the Frobenius mapping and the cyclic shift mapping, are applied on lines in PG($n,p$) or codes in the Grassmannian, to form automorphisms groups in the Grassmanian and in its codes. These automorphisms are…

To each supersimple $2-(n,4,\lambda)$ design $\mathcal{D}$ one associates a `Conway groupoid,' which may be thought of as a natural generalisation of Conway's Mathieu groupoid associated to $M_{13}$ which is constructed from $\mathbb{P}_3$.…

In this paper new Steiner systems $S(2,6,111)$, $S(2,6,121)$, $S(2,6,126)$, $S(2,7,169)$, $S(2,7,175)$ and possibly others with point-transitive (commutative except $S(2,6,111)$ case) automorphism groups are introduced.

In this paper we generalize the construction of binary self-orthogonal codes obtained from weakly self-orthogonal designs described by Tonchev in [12] in order to obtain self-orthogonal codes over an arbitrary field. We extend construction…

In this work we employ machine learning to understand structured mathematical data involving finite groups and derive a theorem about necessary properties of generators of finite simple groups. We create a database of all 2-generated…

We study the automorphisms of a graph product of finitely-generated abelian groups W. More precisely, we study a natural subgroup Aut* W of Aut W, with Aut* W = Aut W whenever vertex groups are finite and in a number of other cases. We…

We study the stabilized automorphism group of minimal and, more generally, certain transitive dynamical systems. Our approach involves developing new algebraic tools to extract information about the rational eigenvalues of these systems…

We compute explicitly the automorphism and outer automorphism group of all large-type free-of-infinity Artin groups. Our strategy involves reconstructing the associated Deligne complexes in a purely algebraic manner, i.e. in a way that is…

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 give estimates on the number of combinatorial designs, which prove (and generalise) a conjecture of Wilson from 1974 on the number of Steiner Triple Systems. This paper also serves as an expository treatment of our recently developed…

As a consequence of the classification of the finite simple groups, it has been possible in recent years to characterize Steiner t-designs, that is t-(v,k,1) designs, mainly for t = 2, admitting groups of automorphisms with sufficiently…

We present the construction of Inoue surfaces of type $S^{(+)}/S^{(-)}$ in terms of data arising from real quadratic number fields. We then describe the automorphism group of such surfaces in terms of this data.

We study a construction of the Mathieu group $M_{12}$ using a game reminiscent of Loyd's ``15-puzzle''. The elements of $M_{12}$ are realized as permutations on~12 of the~13 points of the finite projective plane of order~3. There is a…

The point of this paper is to use affine automorphisms from algebraic geometry to build cryptographic multivariate mappings. We will construct groups G,H, both isomorphic to the cyclic group with a prime number of elements and multilinear…

A detailed proof is given of a theorem describing the centraliser of a transitive permutation group, with applications to automorphism groups of objects in various categories of maps, hypermaps, dessins, polytopes and covering spaces, where…

We describe under a variety of conditions abelian subgroups of the automorphism group A of the regular n-ary tree T which are normalized by the n-ary adding machine t=(e,...,e,t)s where s is the n-cycle (0,1,...,n-1). As an application, for…

The paper is an investigation of the structure of block-transitive automorphism groups of a 3-design with small block size. Let $G$ be a block-transitive automorphism group of a nontrivial $3$-$(v,k,\lambda)$ design $\mathcal{D}$ with $k\le…