The number of different reduced complete sets of MOLS corresponding to the Desarguesian projective planes
|
|
- Kelley Poole
- 5 years ago
- Views:
Transcription
1 The number of different reduced complete sets of MOLS corresponding to the Desarguesian projective planes Vrije Universiteit Brussel joint work with K. Hicks, G.L. Mullen and L. Storme July 22, 2013 Fq11: International Conference on Finite Fields and Applications
2 1 Definitions Latin squares Mutually orthogonal latin squares 2 Projective planes 3 On the number of (n 1)MOLS(n) 4 Computational results 5 Bibliography
3 Latin squares Latin square Definition A latin square of order n is an n n matrix in which n distinct symbols from a symbol set S are arranged, such that each symbol occurs exactly once in each row and in each column.
4 Latin squares Reduced latin square Definition We say that a latin square of order n is reduced (or in standard form), if the first row and the first column of this latin square is in the natural order of the symbol set we chose.
5 Latin squares Example Symbol set S = {0, 1, 2,..., n 1}. Example A reduced latin square of order n on the symbol set S n 2 n n n n 3 n 2
6 Mutually orthogonal latin squares Mutually orthogonal latin squares Definition Let us take two latin squares of order n, L and L, on respectively the symbol set S = {a 0, a 1,..., a n 1 } and the symbol set S = {α 0, α 1,..., α n 1 }. If we find all of the n 2 ordered pairs (i, j) S S, when these latin squares are superimposed, then we say that these two latin squares are mutually orthogonal.
7 Mutually orthogonal latin squares Sets of mutually orthogonal latin squares Definition A set of latin squares L 1, L 2,..., L k is mutually orthogonal if L i and L j are orthogonal for all 1 i < j k. Definition We say that a set of k different mutually orthogonal latin squares of order n is reduced (or in standard form), if one of the latin squares is reduced and if the first row in every other latin square in this set is in the natural order of the symbol set we chose.
8 Mutually orthogonal latin squares Sets of MOLS Notation If we have k different mutually orthogonal latin squares of order n, we will also use the notation (k)mols(n). Definition A maximal set MOLS(n) is a set (k)mols(n) such that it is impossible to extend this set to a set (k + 1)MOLS(n). Definition A set of (n 1)MOLS(n) is called a complete set of MOLS of order n.
9 Connection between MOLS and projective planes Theorem There exists a projective plane of order n if and only if there exists a complete set of mutually orthogonal latin squares of order n.
10 Construction of a set (q 1)MOLS(q) arising from the finite field F q. q = p d, p prime, d 1. define a set of (q 1)MOLS(q) arising from the finite field F q.
11 Construction of a set (q 1)MOLS(q) arising from the finite field F q. Primitive polynomial f (x) = x d + f d 1 x d f 0 of degree d over F p. Let α be a root of f (x), meaning that α is a primitive element of F q. F q = {0, 1, α, α 2,..., α q 2 }.
12 Construction of a set (q 1)MOLS(q) arising from the finite field F q. Notation We also use the following notation x 0 x 1 X =. x d 1 Fd p. corresponding to the additive notation x 0 + x 1 α x d 1 α d 1 of an element of F q.
13 Construction of a set (q 1)MOLS(q) arising from the finite field F q. Definition We denote the latin squares by A a, a F q, where for x, y F q. (A a ) x,y = ax + y,
14 Question How many different reduced (q 1)MOLS(q) are there, for q = p d a prime power, describing PG(2, q)?
15 Question How many different reduced (q 1)MOLS(q) are there, for q = p d a prime power, describing PG(2, q)? determine the group of permutations on the (q 1)MOLS(q) stabilizing the set {A 1, A 2,..., A q 1 }, describing PG(2, q).
16 Lemma A permutation on the alphabet commutes with a permutation on the rows and/or columns of the latin squares.
17 Lemma Consider the set of MOLS {A 1, A 2,..., A q 1 } of the previous definition. Suppose we apply σ 1 to A 1, σ 2 to A 2,..., and σ q 1 to A q 1, the same column permutations to all of the latin squares in the set and also the same row permutations to all of the latin squares in the set, whereby row i moves to row 0. Suppose we obtain a new reduced set of latin squares {C 1, C 2,..., C q 1 }, then σ b = σ a τ b, where τ b : y y bi + ai.
18 Lemma There are at least q permutations on the alphabet leaving the set of MOLS {A 1, A 2,..., A q 1 } invariant and these permutations on the alphabet are the same as a permutation on the columns applied on every latin square in the set.
19 Proof. How many distinct permutations are there on the field F q?
20 Proof. There are q! distinct permutations on the field F q.
21 Proof. There are q! distinct permutations on the field F q. Define the permutation γ b ((A a ) x,y ) =...? γ b : F q F q : y y + b, for b F q.
22 Proof. There are q! distinct permutations on the field F q. Define the permutation γ b : F q F q : y y + b, for b F q. γ b ((A a ) x,y ) = ax + y + b = (A a ) x,y+b.
23 Proof. There are q! distinct permutations on the field F q. Define the permutation γ b : F q F q : y y + b, for b F q. γ b ((A a ) x,y ) = ax + y + b = (A a ) x,y+b. Perform the permutation γ b : y y + b on the columns in every latin square of the set of MOLS.
24 Proof. There are q! distinct permutations on the field F q. Define the permutation γ b : F q F q : y y + b, for b F q. γ b ((A a ) x,y ) = ax + y + b = (A a ) x,y+b. Perform the permutation γ b : y y + b on the columns in every latin square of the set of MOLS. We have transformed A a in A a, so we have the same set of MOLS {A 1, A 2,..., A q 1 }.
25 Theorem There are at most (q 2)!/d different reduced complete sets of q 1 MOLS of order q, for q = p d a prime power, describing PG(2, q).
26 q(q 1)d permutations on the alphabet: AΓL 1 (q). This group is the semidirect product AGL 1 (q) Aut(F q ). Subgroup of AGL d (p). Theorem by Thierry Berger[1].
27 Theorem by Thierry Berger Let G be a permutation group on the finite field K = F p d, d 2. If the affine group AGL 1 (p m ) is a subgroup of G, then one of the following assertions holds: 1 G = Sym(p d ). 2 p = 2 and G = Alt(2 d ). 3 There exists a divisor r of d, such that AGL k (p r ) G AΓL k (p r ), where d = rk. 4 p = 3, d = 4, G AΓL 2 (9) and if G 0 is the stabilizer of 0 in G, then G 0 admits a normal subgroup N isomorphic with SL(2, 5), N = G 0 SL 2 (9) and [G 0 : N] = 8.
28 Lemma There are at least three different reduced sets of q 1 MOLS of order q representing PG(2, q) for q = p d > 4.
29 Theorem There are exactly (q 2)!/d different reduced complete sets of q 1 MOLS of order q, for q = p d a prime power, arising from the finite field F q.
30 Proof. d = 1. AGL 1 (p) is maximal in S p. S p would stabilize the set {A 1,..., A p 1 }. if q = p > 3: at least three different reduced sets of (p 1)MOLS(p) describing PG(2, p).
31 Proof. d 2. G is a larger group of permutations on the alphabet, stabilizing the set {A 1, A 2,..., A q 1 }, modulo the same permutations on the rows and the columns of the latin squares. G is described as in the previous theorem by Thierry Berger.
32 Proof. q = 4. AΓL 1 (q) = q(q 1)d = 24 = S q. q > 4. at least three different reduced complete sets of MOLS of order q, describing PG(2, q).
33 Proof. cases 3 and 4 of the previous theorem by Thierry Berger. G always has a normal subgroup of order p d (p r 1), where d = rk. G is represented by matrices, field automorphisms and translations over the subfield GF (p k ) of GF (p d ). no larger group G of permutations on the alphabet stabilizes the set {A 1, A 2,..., A q 1 }, modulo the same permutations on the rows and the columns of the latin squares.
34 Corollary For any prime p, there are (p 2)! different reduced complete sets of MOLS of order p arising from the field F p.
35 O(n, r) is the number of reduced maximal sets of MOLS of order n containing exactly r squares. S(n, r) is the number of reduced maximal sets of MOLS of order n containing exactly r distinct squares.
36 S(3, 2) = 1 = O(3, 2). S(4, 3) = 1 = O(4, 3). S(5, 4) = 6 = O(5, 4). S(7, 6) = 120 = O(7, 6). S(8, 7) = 240 = 8 O(8, 7).
37 q 7: the computational values obtained for O(q, q 1) all agree with the theoretical results for S(q, q 1). q = 8: O(8, 7) = S(8, 7)/8 = 30.
38 References I T. Berger, Classification des groupes de permutations d un corps fini contenant le groupe affine, C. R. Acad. des Sciences de Paris, Ser. I, 1994, R.C. Bose, On the application of the properties of Galois fields to the construction of hyper-graeco-latin squares, Sankhyā 3(1938), C.J. Colbourn and J.H. Dinitz, Handbook of Combinatorial Designs, CRC Press, Taylor and Francis Group, Boca Raton, Fl, 2007.
39 References II J. Deńes and A.D. Keedwell, Latin Squares and their Applications, Academic Press, New York, D.A. Drake and W. Myrvold, The non-existence of maximal sets of four mutually orthogonal latin squares of order 8, Designs, Codes and Cryptography 33(2004), D.A. Drake, G.H.J. van Rees, and W.D. Wallis, Maximal sets of mutually orthogonal latin squares, Discrete Math. 194(1999),
40 References III A. Hedayat and W.T. Federer, On embedding and enumeration of orthogonal Latin squares, Annals of Math. Statist. 42(1971), C.W.H. Lam, G. Kolesova, and L. Thiel, A computer search for finite projective planes of order 9, Discrete Math. 92(1991), C.F. Laywine and G.L. Mullen, Discrete Mathematics Using Latin Squares, Wiley, New York, 1998.
41 References IV M.W. Liebeck, C.E. Praeger, and J. Saxl, A classification of the maximal subgroups of the finite alternating and symmetric groups, J. Algebra 111(1987), B.D. McKay and I.M. Wanless, On the number of latin squares, Ann. Comb. 9(2005),
42 Thanks a lot for your attention!
Some properties of latin squares - Study of mutually orthogonal latin squares
Some properties of latin squares - Study of mutually orthogonal latin squares Jeranfer Bermúdez University of Puerto Rico, Río Piedras Computer Science Department Lourdes M. Morales University of Puerto
More informationGroup divisible designs in MOLS of order ten
Des. Codes Cryptogr. (014) 71:83 91 DOI 10.1007/s1063-01-979-8 Group divisible designs in MOLS of order ten Peter Dukes Leah Howard Received: 10 March 011 / Revised: June 01 / Accepted: 10 July 01 / Published
More informationTransversal Designs in Classical Planes and Spaces. Aiden A. Bruen and Charles J. Colbourn. Computer Science. University of Vermont
Transversal Designs in Classical Planes and Spaces Aiden A. Bruen and Charles J. Colbourn Computer Science University of Vermont Burlington, VT 05405 U.S.A. Abstract Possible embeddings of transversal
More informationSets of MOLSs generated from a single Latin square
Sets of MOLSs generated from a single Latin square Hau Chan and Dinesh G Sarvate Abstract The aim of this note is to present an observation on the families of square matrices generated by repeated application
More informationPALINDROMIC AND SŪDOKU QUASIGROUPS
PALINDROMIC AND SŪDOKU QUASIGROUPS JONATHAN D. H. SMITH Abstract. Two quasigroup identities of importance in combinatorics, Schroeder s Second Law and Stein s Third Law, share many common features that
More informationSOME PROPERTIES OF LATIN SQUARES
SOME PROPERTIES OF LATIN SQUARES Jeranfer Bermúdez, Richard García, Reynaldo López and Lourdes Morales University of Puerto Rico in Río Piedras Department of Computer Science Mentor: Prof. Ivelisse Rubio
More informationON THE CONSTRUCTION OF ORTHOGONAL BALANCED INCOMPLETE BLOCK DESIGNS
Hacettepe Journal of Mathematics and Statistics Volume 35 (2) (2006), 235 240 ON THE CONSTRUCTION OF ORTHOGONAL BALANCED INCOMPLETE BLOCK DESIGNS Hülya Bayrak and Hanife Bulut Received 20 : 02 : 2006 :
More informationSome V(12,t) vectors and designs from difference and quasi-difference matrices
AUSTRALASIAN JOURNAL OF COMBINATORICS Volume 4 (28), Pages 69 85 Some V(12,t) vectors and designs from difference and quasi-difference matrices R Julian R Abel School of Mathematics and Statistics University
More information3-Designs from PSL(2, q)
3-Designs from PSL(, q P. J. Cameron a,1 H. R. Maimani b,d G. R. Omidi b,c B. Tayfeh-Rezaie b a School of Mathematical Sciences, Queen Mary, University of London, U.K. b Institute for Studies in Theoretical
More informationA Connection Between Random Variables and Latin k-cubes
A Connection Between Random Variables and Latin k-cubes Ruben Michel Gadi Taubenfeld Andrew Berman September 28, 1993 Abstract The subject of latin squares is about 200 years old, and it abounds with many
More informationSOME SYMMETRIC (47,23,11) DESIGNS. Dean Crnković and Sanja Rukavina Faculty of Philosophy, Rijeka, Croatia
GLASNIK MATEMATIČKI Vol. 38(58)(2003), 1 9 SOME SYMMETRIC (47,23,11) DESIGNS Dean Crnković and Sanja Rukavina Faculty of Philosophy, Rijeka, Croatia Abstract. Up to isomorphism there are precisely fifty-four
More informationRepresentations of disjoint unions of complete graphs
Discrete Mathematics 307 (2007) 1191 1198 Note Representations of disjoint unions of complete graphs Anthony B. Evans Department of Mathematics and Statistics, Wright State University, Dayton, OH, USA
More informationOrthogonal diagonal sudoku solutions: an approach via linearity
AUSTRALASIAN JOURNAL OF COMBINATORICS Volume 51 (2011), Pages 139 145 Orthogonal diagonal sudoku solutions: an approach via linearity John Lorch Department of Mathematical Sciences Ball State University
More informationarxiv: v2 [math.co] 6 Apr 2016
On the chromatic number of Latin square graphs Nazli Besharati a, Luis Goddyn b, E.S. Mahmoodian c, M. Mortezaeefar c arxiv:1510.051v [math.co] 6 Apr 016 a Department of Mathematical Sciences, Payame Noor
More informationA three-factor product construction for mutually orthogonal latin squares
A three-factor product construction for mutually orthogonal latin squares Peter J. Dukes (joint work with Alan C.H. Ling, UVM) June 17, 2014 Introduction Latin squares and MOLS Product construction Main
More informationSimple 3-(q + 1, 5, 3) designs admitting an automorphism group PSL(2, q) with q 1 (mod 4)
Simple -(q + 5 ) designs admitting an automorphism group PSL( q) with q (mod 4) Weixia Li School of Mathematical Sciences Qingdao University Qingdao 667 China Dameng Deng Department of Mathematics Shanghai
More informationP. J. Cameron a,1 H. R. Maimani b,d G. R. Omidi b,c B. Tayfeh-Rezaie b
3-designs from PSL(, q P. J. Cameron a,1 H. R. Maimani b,d G. R. Omidi b,c B. Tayfeh-Rezaie b a School of Mathematical Sciences, Queen Mary, University of London, U.K. b Institute for Studies in Theoretical
More informationarxiv: v1 [math.co] 2 Dec 2015
CYCLIC ELLIPTIC SPREADS arxiv:1512.861v1 [math.co] 2 Dec 215 W. M. KANTOR Abstract. Moderately large numbers of transitive elliptic spreads are constructed in characteristic 2 and dimension 2 (mod 4).
More informationTHE MAXIMUM SIZE OF A PARTIAL 3-SPREAD IN A FINITE VECTOR SPACE OVER GF (2)
THE MAXIMUM SIZE OF A PARTIAL 3-SPREAD IN A FINITE VECTOR SPACE OVER GF (2) S. EL-ZANATI, H. JORDON, G. SEELINGER, P. SISSOKHO, AND L. SPENCE 4520 MATHEMATICS DEPARTMENT ILLINOIS STATE UNIVERSITY NORMAL,
More informationLatin Squares and Orthogonal Arrays
School of Electrical Engineering and Computer Science University of Ottawa lucia@eecs.uottawa.ca Winter 2017 Latin squares Definition A Latin square of order n is an n n array, with symbols in {1,...,
More informationNew quasi-symmetric designs constructed using mutually orthogonal Latin squares and Hadamard matrices
New quasi-symmetric designs constructed using mutually orthogonal Latin squares and Hadamard matrices Carl Bracken, Gary McGuire Department of Mathematics, National University of Ireland, Maynooth, Co.
More informationRank 3 Latin square designs
Rank 3 Latin square designs Alice Devillers Université Libre de Bruxelles Département de Mathématiques - C.P.216 Boulevard du Triomphe B-1050 Brussels, Belgium adevil@ulb.ac.be and J.I. Hall Department
More informationflag-transitive linear spaces.
Linear spaces exactly Characterisation one line incident with any One-dimensional two given points. examples Finite linear spaces can Pauley-nomials be used to make Open problem experimental designs and
More informationOn Primitivity and Reduction for Flag-Transitive Symmetric Designs
On Primitivity and Reduction for Flag-Transitive Symmetric Designs Eugenia O Reilly Regueiro Instituto de Matemáticas, Circuito Exterior, UNAM, México D.F. 04510, Mexico. Abstract We present some results
More informationUniform semi-latin squares and their Schur-optimality
Uniform semi-latin squares and their Schur-optimality Leonard H. Soicher School of Mathematical Sciences Queen Mary University of London Mile End Road, London E1 4NS, UK L.H.Soicher@qmul.ac.uk September
More informationMathematical Department, University of Bayreuth, D Bayreuth
,, {6 () c Kluwer Academic Publishers, Boston. Manufactured in The Netherlands. A Steiner 5-Design on 36 Points ANTON BETTEN anton.betten@uni-bayreuth.de REINHARD LAUE reinhard.laue@uni-bayreuth.de ALFRED
More informationSYMMETRIC (66,26,10) DESIGNS HAVING F rob 55 AUTOMORPHISM GROUP AS AN. Dean Crnković and Sanja Rukavina Faculty of Philosophy in Rijeka, Croatia
GLASNIK MATEMATIČKI Vol. 35(55)(2000), 271 281 SYMMETRIC (66,26,10) DESIGNS HAVING F rob 55 AUTOMORPHISM GROUP AS AN Dean Crnković and Sanja Rukavina Faculty of Philosophy in Rijeka, Croatia Abstract.
More informationBalanced Nested Designs and Balanced n-ary Designs
Balanced Nested Designs and Balanced n-ary Designs Ryoh Fuji-Hara a, Shinji Kuriki b, Ying Miao a and Satoshi Shinohara c a Institute of Policy and Planning Sciences, University of Tsukuba, Tsukuba, Ibaraki
More informationConstruction of latin squares of prime order
Construction of latin squares of prime order Theorem. If p is prime, then there exist p 1 MOLS of order p. Construction: The elements in the latin square will be the elements of Z p, the integers modulo
More informationPentavalent symmetric graphs of order twice a prime power
Pentavalent symmetric graphs of order twice a prime power Yan-Quan Feng Mathematics, Beijing Jiaotong University Beijing 100044, P.R. China yqfeng@bjtu.edu.cn A joint work with Yan-Tao Li, Da-Wei Yang,
More informationInteresting Examples on Maximal Irreducible Goppa Codes
Interesting Examples on Maximal Irreducible Goppa Codes Marta Giorgetti Dipartimento di Fisica e Matematica, Universita dell Insubria Abstract. In this paper a full categorization of irreducible classical
More informationAffine designs and linear orthogonal arrays
Affine designs and linear orthogonal arrays Vladimir D. Tonchev Department of Mathematical Sciences, Michigan Technological University, Houghton, Michigan 49931, USA, tonchev@mtu.edu Abstract It is proved
More informationCheck Character Systems Using Chevalley Groups
Designs, Codes and Cryptography, 10, 137 143 (1997) c 1997 Kluwer Academic Publishers, Boston. Manufactured in The Netherlands. Check Character Systems Using Chevalley Groups CLAUDIA BROECKER 2. Mathematisches
More informationMUTUALLY ORTHOGONAL FAMILIES OF LINEAR SUDOKU SOLUTIONS. 1. Introduction
MUTUALLY ORTHOGONAL FAMILIES OF LINEAR SUDOKU SOLUTIONS JOHN LORCH Abstract For a class of linear sudoku solutions, we construct mutually orthogonal families of maximal size for all square orders, and
More informationLatin squares: Equivalents and equivalence
Latin squares: Equivalents and equivalence 1 Introduction This essay describes some mathematical structures equivalent to Latin squares and some notions of equivalence of such structures. According to
More informationLatin Squares with No Small Odd Plexes
Latin Squares with No Small Odd Plexes Judith Egan, Ian M. Wanless School of Mathematical Sciences, Monash University, Victoria 3800, Australia, E-mail: judith.egan@sci.monash.edu.au; ian.wanless@sci.monash.edu.au
More informationA note on cyclic semiregular subgroups of some 2-transitive permutation groups
arxiv:0808.4109v1 [math.gr] 29 Aug 2008 A note on cyclic semiregular subgroups of some 2-transitive permutation groups M. Giulietti and G. Korchmáros Abstract We determine the semi-regular subgroups of
More informationSTEINER 2-DESIGNS S(2, 4, 28) WITH NONTRIVIAL AUTOMORPHISMS. Vedran Krčadinac Department of Mathematics, University of Zagreb, Croatia
GLASNIK MATEMATIČKI Vol. 37(57)(2002), 259 268 STEINER 2-DESIGNS S(2, 4, 28) WITH NONTRIVIAL AUTOMORPHISMS Vedran Krčadinac Department of Mathematics, University of Zagreb, Croatia Abstract. In this article
More informationIMA Preprint Series # 2066
THE CARDINALITY OF SETS OF k-independent VECTORS OVER FINITE FIELDS By S.B. Damelin G. Michalski and G.L. Mullen IMA Preprint Series # 2066 ( October 2005 ) INSTITUTE FOR MATHEMATICS AND ITS APPLICATIONS
More information1 Fields and vector spaces
1 Fields and vector spaces In this section we revise some algebraic preliminaries and establish notation. 1.1 Division rings and fields A division ring, or skew field, is a structure F with two binary
More informationOn the Classification of Splitting (v, u c, ) BIBDs
BULGARIAN ACADEMY OF SCIENCES CYBERNETICS AND INFORMATION TECHNOLOGIES Volume 18, No 5 Special Thematic Issue on Optimal Codes and Related Topics Sofia 2018 Print ISSN: 1311-9702; Online ISSN: 1314-4081
More informationTHE TRANSITIVE AND CO TRANSITIVE BLOCKING SETS IN P 2 (F q )
Volume 3, Number 1, Pages 47 51 ISSN 1715-0868 THE TRANSITIVE AND CO TRANSITIVE BLOCKING SETS IN P 2 (F q ) ANTONIO COSSIDENTE AND MARIALUISA J. DE RESMINI Dedicated to the centenary of the birth of Ferenc
More information5-Chromatic Steiner Triple Systems
5-Chromatic Steiner Triple Systems Jean Fugère Lucien Haddad David Wehlau March 21, 1994 Abstract We show that, up to an automorphism, there is a unique independent set in PG(5,2) that meet every hyperplane
More informationQuasigroups and Related Systems 9 (2002), Galina B. Belyavskaya. Abstract
Quasigroups and Related Systems 9 (2002), 1 17 Quasigroup power sets and cyclic Ssystems Galina B. Belyavskaya Abstract We give new constructions of power sets of quasigroups (latin squares) based on pairwise
More informationAbstract. the aid of a computer. The smallest parameter set found is 7-(24; 8; 4): for determining the isomorphism types. Further designs are derived
Some simple 7-designs A. Betten R. Laue A. Wassermann Abstract Some simple 7-designs with small parameters are constructed with the aid of a computer. The smallest parameter set found is 7-(24; 8; 4):
More informationClass-r hypercubes and related arrays
Class-r hypercubes and related arrays David Thomson Carleton University, Ottawa ON joint work with John Ethier, Melissa Huggan Gary L. Mullen, Daniel Panario and Brett Stevens D. Thomson (Carleton) Class-r
More informationTHE PARTITION WEIGHT ENUMERATOR AND BOUNDS ON MDS CODES. T.L. Alderson Svenja Huntemann
Atlantic Electronic http://aem.ca Journal of Mathematics http://aem.ca/rema Volume 6, Number 1, Summer 2014 pp. 1-10 THE PARTITION WEIGHT ENUMERATOR AND BOUNDS ON MDS CODES T.L. Alderson Svena Huntemann
More informationFACTORIZATIONS OF SOME SIMPLE LINEAR GROUPS
GODIXNIK NA SOFI SKI UNIVERSITET SV. KLIMENT OHRIDSKI FAKULTET PO MATEMATIKA I INFORMATIKA Tom 1 ANNUAIRE DE L UNIVERSITE DE SOFIA ST. KLIMENT OHRIDSKI FACULTE DE MATHEMATIQUES ET INFORMATIQUE Tome 1 FACTORIZATIONS
More informationBases of primitive permutation groups
Bases of primitive permutation groups Martin W. Liebeck and Aner Shalev 1 Introduction Let G be a permutation group on a finite set Ω of size n. A subset of Ω is said to be a base for G if its pointwise
More informationNormal cyclotomic schemes over a Galois ring
St.Petersburg Department of Steklov Mathematical Institute Russia (mostly joint work with Ilia Ponomarenko) The 11th International Conference on Finite Fields Friday, July 26, Magdeburg Outline Cyclotomic
More informationPermutation representations and rational irreducibility
Permutation representations and rational irreducibility John D. Dixon School of Mathematics and Statistics Carleton University, Ottawa, Canada March 30, 2005 Abstract The natural character π of a finite
More informationArc-transitive pentavalent graphs of order 4pq
Arc-transitive pentavalent graphs of order 4pq Jiangmin Pan Bengong Lou Cuifeng Liu School of Mathematics and Statistics Yunnan University Kunming, Yunnan, 650031, P.R. China Submitted: May 22, 2012; Accepted:
More informationTC10 / 3. Finite fields S. Xambó
TC10 / 3. Finite fields S. Xambó The ring Construction of finite fields The Frobenius automorphism Splitting field of a polynomial Structure of the multiplicative group of a finite field Structure of the
More informationOn Some Features of Symmetric Diagonal Latin Squares
On Some Features of Symmetric Diagonal Latin Squares Eduard Vatutin 1, Stepan Kochemazov 2, and Oleg Zaikin 2 1 Southwest State University, Kursk, Russia 2 Matrosov Institute for System Dynamics and Control
More informationPrimitive arcs in P G(2, q)
Primitive arcs in P G(2, q) L. Storme H. Van Maldeghem December 14, 2010 Abstract We show that a complete arc K in the projective plane P G(2, q) admitting a transitive primitive group of projective transformations
More informationSymmetric configurations for bipartite-graph codes
Eleventh International Workshop on Algebraic and Combinatorial Coding Theory June 16-22, 2008, Pamporovo, Bulgaria pp. 63-69 Symmetric configurations for bipartite-graph codes Alexander Davydov adav@iitp.ru
More informationThere is no 2-(22, 8, 4) Block Design
There is no 2-(22, 8, 4) Block Design Richard Bilous, Clement W. H. Lam, Larry H. Thiel, Department of Computer Science and Software Engineering Concordia University Montreal, Québec, Canada H3G 1M8 (Ben)
More informationChapter 5. Modular arithmetic. 5.1 The modular ring
Chapter 5 Modular arithmetic 5.1 The modular ring Definition 5.1. Suppose n N and x, y Z. Then we say that x, y are equivalent modulo n, and we write x y mod n if n x y. It is evident that equivalence
More informationWilson s theorem for block designs Talks given at LSBU June August 2014 Tony Forbes
Wilson s theorem for block designs Talks given at LSBU June August 2014 Tony Forbes Steiner systems S(2, k, v) For k 3, a Steiner system S(2, k, v) is usually defined as a pair (V, B), where V is a set
More informationSection VI.33. Finite Fields
VI.33 Finite Fields 1 Section VI.33. Finite Fields Note. In this section, finite fields are completely classified. For every prime p and n N, there is exactly one (up to isomorphism) field of order p n,
More informationDifference Systems of Sets and Cyclotomy
Difference Systems of Sets and Cyclotomy Yukiyasu Mutoh a,1 a Graduate School of Information Science, Nagoya University, Nagoya, Aichi 464-8601, Japan, yukiyasu@jim.math.cm.is.nagoya-u.ac.jp Vladimir D.
More informationUNIVERSITÀ DEGLI STUDI DI ROMA LA SAPIENZA. Semifield spreads
UNIVERSITÀ DEGLI STUDI DI ROMA LA SAPIENZA Semifield spreads Giuseppe Marino and Olga Polverino Quaderni Elettronici del Seminario di Geometria Combinatoria 24E (Dicembre 2007) http://www.mat.uniroma1.it/~combinat/quaderni
More informationFORMAL GROUPS OF CERTAIN Q-CURVES OVER QUADRATIC FIELDS
Sairaiji, F. Osaka J. Math. 39 (00), 3 43 FORMAL GROUPS OF CERTAIN Q-CURVES OVER QUADRATIC FIELDS FUMIO SAIRAIJI (Received March 4, 000) 1. Introduction Let be an elliptic curve over Q. We denote by ˆ
More informationFlag-Transitive Linear Spaces and Line Spreads of Projective Spaces. Michael Pauley
Flag-Transitive Linear Spaces and Line Spreads of Projective Spaces Michael Pauley April 28, 2006 Abstract A linear space is an incidence structure of points and lines having the property that there is
More informationSome aspects of codes over rings
Some aspects of codes over rings Peter J. Cameron p.j.cameron@qmul.ac.uk Galway, July 2009 This is work by two of my students, Josephine Kusuma and Fatma Al-Kharoosi Summary Codes over rings and orthogonal
More informationOn the Number of Latin Squares
Annals of Combinatorics 9 (2005) 335-344 0218-0006/05/030335-10 DOI 10.1007/s00026-005-0261-7 c Birkhäuser Verlag, Basel, 2005 Annals of Combinatorics On the Number of Latin Squares Brendan D. McKay and
More informationSome fundamental contributions of Gary Mullen to finite fields
Some fundamental contributions of Gary Mullen to finite fields School of Mathematics and Statistics, Carleton University daniel@math.carleton.ca Carleton Finite Fields Day 2017 September 29, 2017 Overview
More informationOn Pronormal Subgroups of Finite Groups
On Pronormal Subgroups of Finite Groups Natalia V. Maslova Krasovskii Institute of Mathematics and Mechanics UB RAS and Ural Federal University This talk is based on joint papers with Wenbin Guo, Anatoly
More informationQuantum LDPC Codes Derived from Combinatorial Objects and Latin Squares
Codes Derived from Combinatorial Objects and s Salah A. Aly & Latin salah at cs.tamu.edu PhD Candidate Department of Computer Science Texas A&M University November 11, 2007 Motivation for Computers computers
More informationGeometrical Constructions for Ordered Orthogonal Arrays and (T, M, S)-Nets
Geometrical Constructions for Ordered Orthogonal Arrays and (T, M, S)-Nets Ryoh Fuji-Hara and Ying Miao Institute of Policy and Planning Sciences University of Tsukuba Tsukuba 305-8573, Japan fujihara@sk.tsukuba.ac.jp
More informationPRIMITIVE BLOCK DESIGNS WITH AUTOMORPHISM GROUP PSL(2,q) University of Split, Croatia
GLASNIK MATEMATIČKI Vol. 50(70)(2015), 1 15 PRIMITIVE BLOCK DESIGNS WITH AUTOMORPHISM GROUP PSL(2,q) Snježana Braić, Joško Mandić and Tanja Vučičić University of Split, Croatia Abstract. We present the
More informationСИБИРСКИЕ ЭЛЕКТРОННЫЕ МАТЕМАТИЧЕСКИЕ ИЗВЕСТИЯ Siberian Electronic Mathematical Reports
S e R ISSN 1813-3304 СИБИРСКИЕ ЭЛЕКТРОННЫЕ МАТЕМАТИЧЕСКИЕ ИЗВЕСТИЯ Siberian Electronic athematical Reports http://semr.math.nsc.ru Том 13 стр. 1271 1282 2016 УДК 512.542.7 DOI 10.17377/semi.2016.13.099
More informationUNIVERSITÀ DEGLI STUDI DI ROMA LA SAPIENZA
UNIVERSITÀ DEGLI STUDI DI ROMA LA SAPIENZA On d-graceful labelings Anita Pasotti Quaderni Elettronici del Seminario di Geometria Combinatoria 7E (Maggio 0) http://wwwmatuniromait/~combinat/quaderni Dipartimento
More informationOn pronormal subgroups in finite groups
in finite groups IMM UB RAS and Ural Federal University This is a joint project with W. Guo, A. Kondrat ev, D. Revin, and Ch. Praeger WL2018, Pilsen, July 07, 2018 Definitions Agreement. We consider finite
More informationButson-Hadamard matrices in association schemes of class 6 on Galois rings of characteristic 4
Butson-Hadamard matrices in association schemes of class 6 on Galois rings of characteristic 4 Akihiro Munemasa Tohoku University (joint work with Takuya Ikuta) November 17, 2017 Combinatorics Seminar
More informationREPRESENTATION THEORY WEEK 5. B : V V k
REPRESENTATION THEORY WEEK 5 1. Invariant forms Recall that a bilinear form on a vector space V is a map satisfying B : V V k B (cv, dw) = cdb (v, w), B (v 1 + v, w) = B (v 1, w)+b (v, w), B (v, w 1 +
More informationALGEBRA EXERCISES, PhD EXAMINATION LEVEL
ALGEBRA EXERCISES, PhD EXAMINATION LEVEL 1. Suppose that G is a finite group. (a) Prove that if G is nilpotent, and H is any proper subgroup, then H is a proper subgroup of its normalizer. (b) Use (a)
More informationTilburg University. Strongly Regular Graphs with Maximal Energy Haemers, W. H. Publication date: Link to publication
Tilburg University Strongly Regular Graphs with Maximal Energy Haemers, W. H. Publication date: 2007 Link to publication Citation for published version (APA): Haemers, W. H. (2007). Strongly Regular Graphs
More informationButson-Hadamard matrices in association schemes of class 6 on Galois rings of characteristic 4
Butson-Hadamard matrices in association schemes of class 6 on Galois rings of characteristic 4 Akihiro Munemasa Tohoku University (joint work with Takuya Ikuta) November 17, 2017 Combinatorics Seminar
More informationMichael Giudici. on joint work with variously John Bamberg, Martin Liebeck, Cheryl Praeger, Jan Saxl and Pham Huu Tiep
3 2 -transitive permutation groups Michael Giudici Centre for the Mathematics of Symmetry and Computation on joint work with variously John Bamberg, Martin Liebeck, Cheryl Praeger, Jan Saxl and Pham Huu
More informationCONSTRUCTION OF SLICED SPACE-FILLING DESIGNS BASED ON BALANCED SLICED ORTHOGONAL ARRAYS
Statistica Sinica 24 (2014), 1685-1702 doi:http://dx.doi.org/10.5705/ss.2013.239 CONSTRUCTION OF SLICED SPACE-FILLING DESIGNS BASED ON BALANCED SLICED ORTHOGONAL ARRAYS Mingyao Ai 1, Bochuan Jiang 1,2
More informationExistence of doubly near resolvable (v, 4, 3)-BIBDs
AUSTRALASIAN JOURNAL OF COMBINATORICS Volume 47 (2010), Pages 109 124 Existence of doubly near resolvable (v, 4, 3)-BIBDs R. Julian R. Abel Nigel H. N. Chan School of Mathematics and Statistics University
More informationON ORTHOGONAL LATIN SQUARES
ON ORTHOGONAL LATIN SQUARES HENRY B. MANN 1 An m-sided Latin square is an arrangement of the numbers 1, 2,, m into m rows and m columns in such a way that no row and no column contains any number twice.
More informationAlgebraic aspects of Hadamard matrices
Algebraic aspects of Hadamard matrices Padraig Ó Catháin University of Queensland 22 February 2013 Overview Difference set Relative difference set Symmetric Design Hadamard matrix Overview 1 Hadamard matrices
More informationarxiv: v1 [math.co] 10 Nov 2016
Indecomposable 1-factorizations of the complete multigraph λk 2n for every λ 2n arxiv:1611.03221v1 [math.co] 10 Nov 2016 S. Bonvicini, G. Rinaldi November 11, 2016 Abstract A 1-factorization of the complete
More informationCodes, Designs and Graphs from the Janko Groups J 1 and J 2
Codes, Designs and Graphs from the Janko Groups J 1 and J 2 J. D. Key Department of Mathematical Sciences Clemson University Clemson SC 29634, U.S.A. J. Moori School of Mathematics, Statistics and Information
More informationFinite Fields. [Parts from Chapter 16. Also applications of FTGT]
Finite Fields [Parts from Chapter 16. Also applications of FTGT] Lemma [Ch 16, 4.6] Assume F is a finite field. Then the multiplicative group F := F \ {0} is cyclic. Proof Recall from basic group theory
More informationThe geometry of k-transvection groups
The geometry of k-transvection groups Hans Cuypers Department of Mathematics Eindhoven University of Technology P.O. Box 513 5600 MB Eindhoven The Netherlands December 8, 2005 To Professor Bernd Fischer
More informationA Block Negacyclic Bush-Type Hadamard Matrix and Two Strongly Regular Graphs
Journal of Combinatorial Theory, Series A 98, 118 126 (2002) doi:10.1006/jcta.2001.3231, available online at http://www.idealibrary.com on A Block Negacyclic Bush-Type Hadamard Matrix and Two Strongly
More informationOn m ovoids of W 3 (q)
On m ovoids of W 3 (q) A. Cossidente, C. Culbert, G. L. Ebert, and G. Marino Abstract We show that the generalized quadrangle W 3 (q) for odd q has exponentially many 1 (q+1) ovoids, thus implying that
More informationK. Tabakov, K. Tchakerian. Communicated by V. Drensky
Serdica Math. J. 37 (2011), 365 370 (2, 3)-GENERATION OF THE GROUPS PSL 6 (q) K. Tabakov, K. Tchakerian Communicated by V. Drensky Abstract. We prove that the group PSL 6 (q) is (2, 3)-generated for any
More informationOn the Existence of k-solssoms
Divulgaciones Matemáticas Vol. 8 No. 1 (000), pp. 5 9 On the Existence of k-solssoms Sobre la Existencia de k-solssoms A. R. Ashrafi (ashrafi@vax.ipm.ac.ir) A. Gordji Department of Mathematics Faculty
More informationThree-Bit Monomial Hyperovals
Timothy Vis Timothy.Vis@ucdenver.edu University of Colorado Denver Rocky Mountain Discrete Math Days 2008 Definition of a Hyperoval Definition In a projective plane of order n, a set of n + 1-points, no
More informationBlocking sets in chain geometries
Blocking sets in chain geometries Andrea Blunck 1 Hans Havlicek 2 Corrado Zanella 3 Contents 1. Introduction (3). 2. Examples of chain geometries (4). 3. Finite chain geometries (5). 4. Blocking sets (6).
More informationOn the size of autotopism groups of Latin squares.
On the size of autotopism groups of Latin squares. Douglas Stones and Ian M. Wanless School of Mathematical Sciences Monash University VIC 3800 Australia {douglas.stones, ian.wanless}@sci.monash.edu.au
More informationPart II Galois Theory
Part II Galois Theory Theorems Based on lectures by C. Birkar Notes taken by Dexter Chua Michaelmas 2015 These notes are not endorsed by the lecturers, and I have modified them (often significantly) after
More informationPrimitive 2-factorizations of the complete graph
Discrete Mathematics 308 (2008) 175 179 www.elsevier.com/locate/disc Primitive 2-factorizations of the complete graph Giuseppe Mazzuoccolo,1 Dipartimento di Matematica, Università di Modena e Reggio Emilia,
More informationCharacter tables for some small groups
Character tables for some small groups P R Hewitt U of Toledo 12 Feb 07 References: 1. P Neumann, On a lemma which is not Burnside s, Mathematical Scientist 4 (1979), 133-141. 2. JH Conway et al., Atlas
More informationSTRONG FORMS OF ORTHOGONALITY FOR SETS OF HYPERCUBES
The Pennsylvania State University The Graduate School Department of Mathematics STRONG FORMS OF ORTHOGONALITY FOR SETS OF HYPERCUBES A Dissertation in Mathematics by John T. Ethier c 008 John T. Ethier
More informationA Design and a Code Invariant
JOURNAL OF COMBINATORIAL THEORY, Series A 62, 225-233 (1993) A Design and a Code Invariant under the Simple Group Co3 WILLEM H. HAEMERS Department of Economics, Tilburg University, P.O. Box 90153, 5000
More information