English
Related papers

Related papers: On the automorphisms of designs constructed from f…

200 papers

In this paper we construct distance-regular graphs admitting a transitive action of the five sporadic simple groups discovered by E. Mathieu, the Mathieu groups $M_{11}$, $M_{12}$, $M_{22}$, $M_{23}$ and $M_{24}$. From the code spanned by…

Combinatorics · Mathematics 2021-03-09 Dean Crnkovic , Nina Mostarac , Andrea Svob

In this article we give self-contained existence proofs for the sporadic simple groups Co_2 and Fi_{22} using the second author's algorithm [10] constructing finite simple groups from irreducible subgroups of GL_n(2). These two sporadic…

Group Theory · Mathematics 2016-02-04 Hyun Kyu Kim , Gerhard O. Michler

We determine the structure of automorphism groups of finite graphs of bounded Hadwiger number. Our proof includes a structural analysis of finite edge-transitive graphs. In particular, we show that for connected, $K_{h+1}$-minor-free,…

Combinatorics · Mathematics 2025-09-24 Martin Grohe , Pascal Schweitzer , Daniel Wiebking

For a mixing shift of finite type, the associated automorphism group has a rich algebraic structure, and yet we have few criteria to distinguish when two such groups are isomorphic. We introduce a stabilization of the automorphism group,…

Dynamical Systems · Mathematics 2020-01-28 Yair Hartman , Bryna Kra , Scott Schmieding

In this work we summarized some recent results to be included in a forthcoming paper. A ternary [66,10,36]_3-code admitting the Mathieu group M_{12} as a group of automorphisms has recently been constructed by N. Pace. We give a…

Combinatorics · Mathematics 2016-06-16 Juergen Bierbrauer , Stefano Marcugini , Fernanda Pambianco

Block-transitive Steiner $t$-designs form a central part of the study of highly symmetric combinatorial configurations at the interface of several disciplines, including group theory, geometry, combinatorics, coding and information theory,…

Combinatorics · Mathematics 2010-03-10 Michael Huber

We study a certain family of simple fusion systems over finite $3$-groups, ones that involve Todd modules of the Mathieu groups $2M_{12}$, $M_{11}$, and $A_6=O^2(M_{10})$ over $\mathbb{F}_3$, and show that they are all isomorphic to the…

Group Theory · Mathematics 2022-08-18 Bob Oliver

We establish the existence of simple designs with parameters $2$-$(55,10,4)$, $3$-$(20,5,4)$, $3$-$(21,7,30)$, $4$-$(15,5,2)$, $4$-$(16,8,45)$, $5$-$(16,7,10)$, and $5$-$(17,8,40)$, which have previously been unknown. For the corresponding…

Combinatorics · Mathematics 2021-06-24 Vedran Krčadinac

The Kramer-Mesner method for constructing designs with a prescribed automorphism group $G$ has proven effective many times. In the special case of Steiner designs, the task reduces to solving an exact cover problem, with the advantage that…

We apply results proved in [Li19] to the linear order expansions of non-trivial free homogeneous structures and the universal n-linear order for $n\geq 2$, and prove the simplicity of their automorphism groups.

Group Theory · Mathematics 2020-09-08 Yibei Li

Coding theory and combinatorial $t$-designs have close connections and interesting interplay. One of the major approaches to the construction of combinatorial t-designs is the employment of error-correcting codes. As we all known, some…

Information Theory · Computer Science 2021-10-11 Can Xiang , Chunming Tang , Qi Liu

This paper studies the long-standing open problem of the reduction of Steiner 3-designs admitting a block-transitive automorphism group. We prove that if G acts as a point-primitive, block-transitive automorphism group of a nontrivial…

Combinatorics · Mathematics 2024-08-28 Yunsong Gan , Weijun Liu

In this paper we define Ordered Generating System for finite non-abelian groups, which is a generalization of the basis theorem for finite abelian groups. We prove the following: If each composition factor of a group G has Ordered…

Group Theory · Mathematics 2007-05-23 Robert Shwartz

Special functions, coding theory and $t$-designs have close connections and interesting interplay. A standard approach to constructing $t$-designs is the use of linear codes with certain regularity. The Assmus-Mattson Theorem and the…

Information Theory · Computer Science 2019-07-31 Chunming Tang , Cunsheng Ding , Maosheng Xiong

In this article we give an self contained existence proof for J. Conway's sporadic simple group Co_1 [4] using the second author's algorithm [14] constructing finite simple groups from irreducible subgroups of GL_n(2). Here n = 11 and the…

Group Theory · Mathematics 2009-08-12 Hyun Kyu Kim , Gerhard O. Michler

The paper is devoted to the study of free objects in the variety of Steiner loops and of the combinatorial structures behind them, focusing on their automorphism groups. We prove that all automorphisms are tame and the automorphism group is…

Group Theory · Mathematics 2015-05-07 A. Grishkov , D. Rasskazova , M. Rasskazova , I. Stuhl

In this paper we study the automorphism group of a possible symmetric $(81,16,3)$ design.

Combinatorics · Mathematics 2007-05-23 A. Abdollahi , H. R. Maimani , R. Torabi

Among the simplest invariants of the sporadic finite simple groups are their outer automorphism groups. For 12 of the 26 possible isomorphism types of a sporadic simple group G, the outer automorphism group Out(G) has order 2, and in the…

Group Theory · Mathematics 2011-06-21 Richard Lyons

In this work, the automorphism group schemes of finite-dimensional simple Jordan pairs of types I and IV, and of some Jordan triple systems related to them, are determined. We assume $\mathrm{char}(\mathbb{F}) \neq 2$ for the base field…

Rings and Algebras · Mathematics 2025-04-23 Diego Aranda-Orna , Alberto Daza-García

We prove that infinite definably simple locally finite groups of finite centraliser dimension are simple groups of Lie type over locally finite fields. Then, we identify conditions on automorphisms of a stable group that make it resemble…

Logic · Mathematics 2019-06-12 Ulla Karhumäki
‹ Prev 1 2 3 10 Next ›