Extremal Self-Dual [50, 25, 10] Codes with Automorphisms of Order 3 and Quasi-Symmetric 2-(49, 9,6) Designs

Five non-isomorphic quasi-symmetric 2-(49, 9, 6) designs are known. They arise from extremal self-dual [50, 25, 10] codes with a certain weight enumerator. Four of them have an automorphism of order 3 fixing two points. In this paper, it is shown that there are exactly 48 inequivalent extremal self-dual [50, 25, 10] code with this weight enumerator and an automorphism of order 3 fixing two points. 44 new quasi-symmetric 2-(49, 9, 6) designs with an automorphism of order 3 are constructed from these codes.     

Flag-transitive 2- $$(v,k,\lambda )$$ ( v,k , λ ) designs with $$r>\lambda (k-3)$$ r > λ ( k - 3 )

Designs, Codes and Cryptography - In this paper, we study the flag-transitive automorphism groups of 2-designs and prove that if G is a flag-transitive automorphism group of a 2-design $$\mathcal...     

The complete classification of Steiner systems S(2, 4, 25)

We describe an algorithm that was used to classify completely all Steiner systems S(2, 4, 25). The result is that in addition to the 16 nonisomorphic designs with nontrivial automorphism group already known, there are precisely two such nonisomorphic designs with a trivial automorphism group. © 1996 John Wiley & Sons, Inc.     

The correlations of finite Desarguesian planes, Part I: Generalities

The polarities of Desarguesian planes have long been known. This author has undertaken to classify the correlations of finite Desarguesian planes in general. In [6] we have presented all the correlations with identity companion automorphism which are not polarities, of these planes. In this sequence of papers, we classify the correlations of planes of order $ p^{2^{i}(2n+1)}, n \neq 0 $, with companion automorphism ( $p^{2^{i}t}$ ), p an odd prime, $ t \neq 0 $. This represents a complete classification of the correlations of planes of odd nonsquare order (i = 0). Some of the correlations of planes of odd square order ($ t \neq 0 $ ) are also covered by the present analysis.When the companion automorphism is not trivial, the problem, naturally, becomes more involved, and a great deal begins to hinge upon the order of the plane being odd or even, and also a square or a nonsquare.The correlations of planes of order $ 2^{2^{i}(2n+1)}, n \neq 0 $, with companion automorphism $ 2^{2^{i}t}, t \neq 0 $, and especially those of planes of order $ p^{2^{i}(2n+1)}, i \neq 0 $, with companion automorphism $ p^{2^{j}(2r+1)}, j > i $ require a substantially different treatment, and will be the object of separate efforts.     

非拟本原（PSU3（P），2）-弧传递图的外自同构

证明由GF（p^2）的域自同构可以产生一类非拟本原（PSU3（P），2）-弧传递图的白同构，并研究了这样的自同构与图的传递自同构群中心化予的关系。     

Line spreads of PG(5, 2)

All line spreads of PG(5, 2) are constructed and classified up to equivalence by exhaustive generation considering the specific properties of the automorphism group, and the participation of the spread lines in the subspaces of dimension 3. There are 131,044 inequivalent spreads. The orders of the automorphism groups preserving the spreads, and the 2‐ranks of the related by Rahilly's construction affine 2‐(64,16,5) designs are also computed. © 2008 Wiley Periodicals, Inc. J Combin Designs 17: 90–102, 2009     

New optimal [52, 26, 10] self-dual codes

We classify up to equivalence all optimal binary self-dual [52, 26, 10] codes having an automorphism of order 3 with 10 fixed points. We achieve this using a method for constructing self-dual codes via an automorphism of odd prime order. We study also codes with an automorphism of order 3 with 4 fixed points. Some of the constructed codes have new values β = 8, 9, and 12 for the parameter in their weight enumerator.     

关于可解区组传递的2-(56,7,1)设计

设G是设计2-(5~6,7,1)的一个可解区传递自同构群,则G是旗传递的且G■A■L(1,5~6)．     

2-Local Automorphisms on Basic Classical Lie Superalgebras

Let G be a basic classical Lie superalgebra except A(n, n) and D(2, 1, α) over the complex number field C. Using existence of a non-degenerate invariant bilinear form and root space decomposition, we prove that every 2-local automorphism on G is an automorphism. Furthermore, we give an example of a 2-local automorphism which is not an automorphism on a subalgebra of Lie superalgebra spl(3, 3).     

Constructing flag-transitive,point-imprimitive designs

We give a construction of a family of designs with a specified point-partition and determine the subgroup of automorphisms leaving invariant the point-partition. We give necessary and sufficient conditions for a design in the family to possess a flag-transitive group of automorphisms preserving the specified point-partition. We give examples of flag-transitive designs in the family, including a new symmetric 2-(1408,336,80) design with automorphism group \(2^{12}:((3\cdot \mathrm {M}_{22}):2)\) and a construction of one of the families of the symplectic designs (the designs \(S^-(n)\)) exhibiting a flag-transitive, point-imprimitive automorphism group.     

On the Williamson type j matrices of orders 4·29, 4·41, and 4·37

Hadamard matrices of the Williamson type invariant under an automorphism of order 2 are considered. A new Hadamard matrix of order 148 of this type is obtained.     

^2F4（q2）与2-（v，k，3）对称设计

本文要证明不存在一个非平凡2-（v，k，3）对称设计，它的旗传递自同构群的基柱是^2F4（q2）     

区传递的$2-(v, k, 1)$ 设计与单群$E_6(q)$

This article is a contribution to the study of block-transitive automorphism groups of 2-（v,k,1） block designs. Let D be a 2-（v,k,1） design admitting a block-transitive, pointprimitive but not flag-transitive automorphism group G. Let kr = （k,v-1） and q = pf for prime p. In this paper we prove that if G and D are as above and q （3（krk-kr ＋ 1）f）1/3, then G does not admit a simple group E6（q） as its socle.     

On 2-(45, 12, 3) designs

Under the assumption that the incidence matrix of a 2-(45, 12, 3) design has a certain block structure, we determine completely the number of nonisomorphic designs involved. We discover 1136 such designs with trivial automorphism group. In addition we analyze all 2-(45, 12, 3) designs having an automorphism of order 5 or 11. Altogether, the total number of nonisomorphic 2-(45, 12, 3) designs found in 3752. Many of these designs are self-dual and each of these self-dual designs possess a polarity. Some have polarities with no absolute points, giving rise to strongly regular (45, 12, 3, 3) graphs. In total we discovered 58 pairwise nonisomorphic strongly regular graphs, one of which has a trivial automorphism group. Further, we analyzed completely all the designs for subdesigns with parameters 2-(12, 4, 3), 2-(9, 3, 3), and 2-(5, 4, 3). In the first case, the number of 2-(12, 4, 3) subdesigns that a design possessed, if non-zero, turned out to be a multiple of 3, whereas 2-(9, 3, 3) subdesigns were so abundant it was more unusual to find a design without them. Finally, in the case of 2-(5, 4, 3) subdesigns there is a design, unique amongst the ones discovered, that has precisely 9 such subdesigns and these form a partition of the point set of the design. This design has a transitive group of automorphisms of order 360. © 1996 John Wiley & Sons, Inc.     

2-(v,k,1)设计和PSL(3,q)(q是奇数)

§ 1　 IntroductionA2 -(v,k,1 ) design D=(S,B) consists ofa finite set Sof v points and a collection Bof some subsets of S,called blocks,such that any two points lie on exactly one blockand each block contains exactly k points.A flag of Dis a pair(α,B) such thatα∈S,B∈Bandα∈B,the set of all flags is denoted by F.We assume that2≤k≤v.An automorphism of Dis a permutation of the points which leaves the set Binvari-ant,all the automorphisms form a group Aut D.Let G be a subgroup of A…     

The Automorphism Group of the Lie Group T（D（V_N,F））

In this paper,the authors determine maximal connected automorphism group of the Lie transformation group T（D（VN,F））,which acting on the normal Siegel domain D（VN,F）is simple and transitive,and prove that the maximal connected automorphism group of T（D（VN,F））is its maximal connected inner automorphism group.     

Six signed Petersen graphs,and their automorphisms

Up to switching isomorphism, there are six ways to put signs on the edges of the Petersen graph. We prove this by computing switching invariants, especially frustration indices and frustration numbers, switching automorphism groups, chromatic numbers, and numbers of proper 1-colorations, thereby illustrating some of the ideas and methods of signed graph theory. We also calculate automorphism groups and clusterability indices, which are not invariant under switching. In the process, we develop new properties of signed graphs, especially of their switching automorphism groups.     

On the Automorphism Group of an Antipodal Tight Graph of Diameter 4 with Parameters (5, 7, r)

Mathematical Notes - It is proved that the automorphism group of every AT4(5, 7, r)-graph acts intransitively on the set of its arcs. Moreover, it is established that the automorphism group of any...     

A complete classification of symmetric (31, 10, 3) designs

In recent years several authors have determined all symmetric (31, 10, 3) designs with a nontrivial automorphism. Here we describe an algorithm for the generation by computer of all symmetric (31, 10, 3) designs and find that there are precisely 151 such nonisomorphic designs. Of these, 107 have a trivial automorphism group.     

具有一个T．I．Sylow 2-子群的有限群的类保持Coleman自同构

设G是一个有限群,它的Sylow 2-子群是T.I.集,证明了如果G的2的方幂阶类保持自同构在G任意的Sylow子群上的限制等于G的某个内自同构的限制,则它一定是一个内自同构.对这样的自同构的研究是由整群环的同构问题所引起的.