Derived and Residual Subspace Designs
|
|
- Erik O’Neal’
- 5 years ago
- Views:
Transcription
1 Derived and Residual Subspace Designs Michael Kiermaier, Reinhard Laue Universität Bayreuth, Abstract A generalization of forming derived and residual designs from t- designs to subspace designs is proposed. A q-analog of a Theorem by van Tran, van Leijenhorst and Driessen is proven, stating that if for some (not necessarily realizable) parameter set the derived and residual parameter set are realizable, the same is true for the reduced parameter set. As a result, we get the existence of several previously unknown subspace designs. Furthermore, some consequences are derived for the existence of large sets of subspace designs. Keywords: q-analog, t-design, large set, subspace design AMS classifications: Primary 51E20; Secondary 05B05, 05B25, 11Txx 1
2 1 Classic and Subspace t-designs t-(v, k, λ) designd = (, B) t-(v, k, λ) q designd = (, B) point set size v GF (q) vector space dim v B ( ) k B [ ] k q each T ( ) [ t in λ B B each T ] t q in λ B B Subspace designs: Definition: Cameron 1974 [8], first found for t 2: Thomas 1987 [14]. Introduction to theory: Suzuki, day 4 in [12, Day 4]. New: t = 2 and t = 3 M.,S.Braun et al. [2, 3, 7, 4], 2-(13, 3, 1) 2 in Braun,Etzion,Östergard,Wassermann [5], q-analog to Teirlinck s theorem [13]: t simple t- subspace design: Fazelli,Lovett,ardi [10]. 2
3 Analog of classic basic theory still missing. Important tools: Derived, residual designs. D = (, B) a t-(v, k, λ) design, x Red(D) (, B) reduced (t 1)-(v, k, λ v t+1 k t+1 ) design Der x (D) ( \ {x}, {B \ {x} : x B B}) derived (t 1)-(v 1, k 1, λ) design Res x (D) ( \ {x}, {B B : x B}) residual v k (t 1)-(v 1, k, λ k t+1 ) design D = (, B) a t-(v, k, λ) q design, U [ 1 ]q, H [ ] v 1 Red(D) (, B) reduced (t 1)-(v, k, λ qv t+1 1 q k t+1 1 q design Der U (D) (/U, {B/U : B B, U B}) derived (t 1)-(v 1, k 1, λ) q design Res H (D) (H, {B : B B, B H}) q residual in H (t 1)-(v 1, k, λ 1 q k t+1 1 q design If q 1 then q-version set-version. q. 3
4 If D exists then also Red(D), Red(Red(D)),... q So, all indices λ, λ v k 1,... must be integers. q k (t 1) 1 t-(v, k, λ) q is admissible if all these values are integers. Main Problem: Which admissible parameter sets are realizable? Example: 3-(22, 6, 1) q, 4-(23, 7, 1) q, 5-(24, 8, 1) q are not admissible. 2-(7, 3, 1) q admissible, Open: 2-(7, 3, 1) q realizable? 4
5 Theorem 1.1. Let 0 < t < k < v t-(v, k, λ) q design D = Red(D), Der U (D), Res H (D). Proof. Red(D), Der U (D): straightforward computation. Res H (D): follows from Lemma 4.2 for dual designs in Suzuki [12]. t-(v, k, λ) design D Red(D) Der U (D) Res H (D) Der U (D) is factor design. Res H (D) is subdesign. 5
6 2 A Construction Theorem Analog of a classic theorem of van Tran [16], van Leijenhorst [11], Driessen [9]. Theorem 2.1. t-(v, k, λ) q parameter set whose derived and residual parameter sets are realizable. Then its reduced parameter set is realizable, too. red (t 1)-(v, k, λ qv t+1 1 q k t+1 1 ) q t-(v, k, λ) q der (t 1)-(v 1, k 1, λ) q res (t 1)-(v 1, k, λ q v k 1 q k t+1 1 ) q 6
7 Proof. a GF (q) vector space of dim v, Construct D = (, B) with parameters of reduced design: U 1-dim subspace of. Assume designs on /U: D = (/U, B ) derived B/U B gives block B B that contains U B k 1 U 1 {0} D = (/U, B ) residual B/U B All complements K of U in B are blocks in B. U 1 {0} B k k K q k such blocks K for each B/U B. 7
8 Each t 1-subspace T in λ qv t+1 1 q k t+1 1 U T = U B, dim(t/u) = t 2 T/U in λ U T B [ (v 1) (t 2) (t 1) (t 2) [ (k 1) (t 2) (t 1) (t 2) = ] a) dim(b/u) = k 1, derived U {0} ] q q blocks of B: = λ qv t+1 1 q k t+1 1 blocks B k-1 t-1 T T in λ such blocks B b) dim(b + U/U) = k, residual U {0} T in q k t+1 λ B+U k t-1 T B q v k 1 q k t+1 1 such blocks The sum of a) and b) evaluates to right term. 8
9 Remark: Construction need not reproduce Red(D) if D exists! 2-(13, 3, 1) 2 has blocks B 1, B 2 not containing 1-dim subspace U. If U + B 1 = U + B 2 then dim(b 1 B 2 ) = 2. So, B 1 B 2 would lie in 2 blocks. 9
10 Table 1: Parameter sets of subspace designs unknown exists by exists by new t-(v, k, λ) q derived source residual source reduced 3-(8, 4, 3) 2 2-(7, 3, 3) 2 [4] 2-(7, 4, 15) 2 [4] 2-(8, 4, 63) 2 3-(8, 4, 4) 2 2-(7, 3, 4) 2 [4] 2-(7, 4, 20) 2 [4] 2-(8, 4, 84) 2 3-(8, 4, 7) 2 2-(7, 3, 7) 2 [4] 2-(7, 4, 35) 2 [4] 2-(8, 4, 147) 2 3-(8, 4, 8) 2 2-(7, 3, 8) 2 [4] 2-(7, 4, 40) 2 [4] 2-(8, 4, 168) 2 3-(8, 4, 9) 2 2-(7, 3, 9) 2 [4] 2-(7, 4, 45) 2 [4] 2-(8, 4, 189) 2 3-(8, 4, 12) 2 2-(7, 3, 12) 2 [4] 2-(7, 4, 60) 2 [4] 2-(8, 4, 252) 2 3-(8, 4, 13) 2 2-(7, 3, 13) 2 [4] 2-(7, 4, 65) 2 [4] 2-(8, 4, 273) 2 3-(8, 4, 14) 2 2-(7, 3, 14) 2 [4] 2-(7, 4, 70) 2 [4] 2-(8, 4, 294) 2 3-(10, 4, 21) 2 2-(9, 3, 21) 2 [7] 2-(9, 4, 441) 2 [7] 2-(10, 4, 1785) 2 3-(10, 4, 22) 2 2-(9, 3, 22) 2 [4] 2-(9, 4, 462) 2 [4] 2-(10, 4, 1870) 2 3-(10, 4, 42) 2 2-(9, 3, 42) 2 [7] 2-(9, 4, 882) 2 [7] 2-(10, 4, 3570) 2 3-(10, 4, 43) 2 2-(9, 3, 43) 2 [4] 2-(9, 4, 903) 2 [4] 2-(10, 4, 3655) 2 3-(10, 4, 63) 2 2-(9, 3, 63) 2 [7] 2-(9, 4, 1323) 2 [7] 2-(10, 4, 5355) 2 10
11 3 Application to large sets Definition 3.1. Large set LS q [N](t, k, v): Partition of [ ] k q into N t-(v, k, λ) q designs. Theorem 3.1. [6, 12] t 1 LS q [N](t, k, v) LS q [N](t, v k, v) Theorem 3.2. t 1 LS q [N](t, k, v) = LS q [N](t 1, k 1, v 1), LS q [N](t 1, k, v 1) Theorem 2.1 applied to pairs of derived and residual designs from large sets yields a new large set. Corollary 3.3 (q-analog of [1, Lemma. 4]). LS q [N](t, k 1, v 1), LS q [N](t, k, v 1) = LS q [N](t, k, v) For t 2 such combinable pairs of large sets have not been found so far. There are LS 2 [3](2, 3, 8) and LS 2 [3](2, 5, 8), see [6]. If an LS 2 [3](2, 4, 8) could be found then Corollary 3.3 would imply the existence of large sets with the parameters LS 2 [3](2, 4, 9), LS 2 [3](2, 5, 9) and LS 2 [3](2, 5, 10). Acknowledgement The authors thank Thomas Feulner for stimulating discussions on this topic. 11
12 References [1] Ajoodani-Namini, S. and Khosrovashahi, G.B., More on halving the complete designs, Discrete Mathematics 135 (1994), [2] Braun, Michael, Kerber, Adalbert and Laue, Reinhard, Systematic construction of q-analogs of designs, Designs, Codes, Cryptography 34, (2005), [3] Braun, Michael, Some new designs over finite fields, Bayreuther Math. Schr. 74 (2005), [4] Braun, Michael, Designs over finite fields - revisited Fq10, Ghent (2011). [5] Braun, Michael, Etzion, Tuvi, Östergard, Patric R., ardi, Alexander and Wassermann, Alfred, Existence of q-analogs of Steiner systems, ArXiv: v2. [6] Braun, Michael, Kohnert, Axel, Östergard, Patric R. and Wassermann, Alfred, Large sets of t-designs over finite fields ArXiv: v1. [7] Braun, Stefanie, Construction of q-analogs of combinatorial designs, Alcoma 10 Thurnau, [8] Cameron, P. J., Generalization of Fisher s inequality to fields with more than one element. In: Combinatorics. Proceedings of the British Combinatorial Conference 1973, London Mathematical Society Lecture Note Series 13 (1974), 9 13, Cambridge. [9] Driessen, Leon M.H.E., t-designs, t 3, Technical Report, Department of Mathematics, Eindhoven University of Technology, (1978). [10] Fazeli, Arman, Lovett, Shachar and ardi, Alexander, Nontrivial t-designs over finite fields exist for all t, preprint. [11] van Leijenhorst, Dirk C., Orbits on the projective line, J. Comb. Theory, Ser. A 31 (1981),
13 [12] Suzuki, Hiroshi Five Days Introduction to the Theory of Designs, 1989, available online at [13] Tierlinck, Luc, Non-trivial t-designs without repeated blocks exist for all t, Discrete Math. 65 (1987), [14] Thomas, Simon, Designs over finite fields, Geom. Dedicata 24 (1987), [15] Tits, Jacques, Sur les analogues algébriques des groupes semi-simples complexes, in Colloque d Algébre Supérieure, tenue à Bruxelles du 19 au 22 décembre 1956, Centre Belge de Recherches Mathèmatiques Ètablissements Ceuterick, Louvain, Paris: Librairie Gauthiers-illars, (1957), [16] Tran van Trung, On the construction of t-designs and the existence of some new infinite families of simple 5-designs, Arch. Math. (Basel) 47 (1986),
Designs over the binary field from the complete monomial group
AUSTRALASIAN JOURNAL OF COMBINATORICS Volume 67(3) (2017), Pages 470 475 Designs over the binary field from the complete monomial group Michael Braun Faculty of Computer Science University of Applied Sciences
More informationOn designs and Steiner systems over finite fields
On designs and Steiner systems over finite fields Alfred Wassermann Department of Mathematics, Universität Bayreuth, Germany Special Days on Combinatorial Construction Using Finite Fields, Linz 2013 Outline
More informationq-analogs of group divisible designs
-analogs of group divisible designs Marco Buratti, Michael Kiermaier, Sascha Kurz, Anamari Nakić, Alfred Wassermann September 7, 208 Abstract A well known class of objects in combinatorial design theory
More informationNew arcs in projective Hjelmslev planes over Galois rings
New arcs in projective Hjelmslev planes over Galois rings Michael Kiermaier and Axel Kohnert ABSTRACT. It is known that some good linear codes over a finite ring (R-linear codes) arise from interesting
More informationCodes and Designs in the Grassmann Scheme
Codes and Designs in the Grassmann Scheme Tuvi Etzion Computer Science Department Technion -Israel Institute of Technology etzion@cs.technion.ac.il ALGEBRAIC COMBINATORICS AND APPLICATIONS ALCOMA10, Thurnau,
More informationFundamentals of Coding For Network Coding
Fundamentals of Coding For Network Coding Marcus Greferath and Angeles Vazquez-Castro Aalto University School of Sciences, Finland Autonomous University of Barcelona, Spain marcus.greferath@aalto.fi and
More informationThe Impact of Network Coding on Mathematics
The Impact of Network Coding on Mathematics Eimear Byrne University College Dublin DIMACS Workshop on Network Coding: the Next 15 Years Dec 15-17, 2015 Random Network Coding and Designs Over GF (q) COST
More informationTHE ORDER OF THE AUTOMORPHISM GROUP OF A BINARY q-analog OF THE FANO PLANE IS AT MOST TWO
THE ORDER OF THE AUTOMORPHISM GROUP OF A BINARY -ANALOG OF THE FANO PLANE IS AT MOST TWO MICHAEL KIERMAIER, SASCHA KURZ, AND ALFRED WASSERMANN Abstract. It is shown that the automorphism group of a binary
More informationmake some group constructions. The resulting group is then prescribed as an automorphism group of the desired designs. Any such design is a collection
New t-designs and large sets of t-designs Anton Betten 1, Reinhard Laue, Alfred Wassermann Mathematical Department, University of Bayreuth, D-95440 Bayreuth, Germany Abstract Recent results in the search
More informationCONSTRUCTION OF (SOMETIMES) OPTIMAL LINEAR CODES
CONSTRUCTION OF (SOMETIMES) OPTIMAL LINEAR CODES MICHAEL BRAUN, AXEL KOHNERT AND ALFRED WASSERMANN 1. INTRODUCTION For the purpose of error correcting linear codes over a finite field GF (q) and fixed
More informationCombinatorial Designs Man versus Machine
Combinatorial Designs Man versus Machine Anamari Nakić Department of Energy and Power Systems Faculty of Electrical Engineering and Computing University of Zagreb Zagreb 2015 1 / 47 The theory of combinatrial
More informationk-subsets of V: Finding a collection which forms a t-design is equivalent to the problem of solving a system of diophantine equations, as mentioned ab
Simple 6- and 7-designs on 19 to 33 points Anton Betten 1, Reinhard Laue, Alfred Wassermann Universitat Bayreuth, Lehrstuhl II fur Mathematik, Lehrstuhl fur Mathematik und ihre Didaktik, D-95440 Bayreuth
More informationSome New Large Sets of Geometric Designs
Spyros S. Magliveras Department of Mathematical Sciences Florida Atlantic University Boca Raton, Florida, U.S.A. First annual Kliakhandler Conference Algebraic Combinatorics and Applications Houghton,
More informationAsymptotic bounds for the sizes of constant dimension codes and an improved lower bound
Asymptotic bounds for the sizes of constant dimension codes and an improved lower bound 5th ICMCTA Vihula Manor, 28-31 August 2017 Daniel Heinlein University of Bayreuth, Germany Daniel.Heinlein@uni-bayreuth.de
More informationEuropean Journal of Combinatorics. Locally subquadrangular hyperplanes in symplectic and Hermitian dual polar spaces
European Journal of Combinatorics 31 (2010) 1586 1593 Contents lists available at ScienceDirect European Journal of Combinatorics journal homepage: www.elsevier.com/locate/ejc Locally subquadrangular hyperplanes
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 informationProbabilistic construction of t-designs over finite fields
Probabilistic construction of t-designs over finite fields Shachar Lovett (UCSD) Based on joint works with Arman Fazeli (UCSD), Greg Kuperberg (UC Davis), Ron Peled (Tel Aviv) and Alex Vardy (UCSD) Gent
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 informationarxiv: v2 [math.co] 2 May 2018
A SUBSPACE CODE OF SIZE 333 IN THE SETTING OF A BINARY q-analog OF THE FANO PLANE DANIEL HEINLEIN, MICHAEL KIERMAIER, SASCHA KURZ, AND ALFRED WASSERMANN arxiv:1708.06224v2 [math.co] 2 May 2018 Abstract.
More informationCodewords of small weight in the (dual) code of points and k-spaces of P G(n, q)
Codewords of small weight in the (dual) code of points and k-spaces of P G(n, q) M. Lavrauw L. Storme G. Van de Voorde October 4, 2007 Abstract In this paper, we study the p-ary linear code C k (n, q),
More informationRank 4 toroidal hypertopes
ISSN 1855-3966 (printed edn.), ISSN 1855-3974 (electronic edn.) ARS MATHEMATICA CONTEMPORANEA 15 (2018) 67 79 https://doi.org/10.26493/1855-3974.1319.375 (Also available at http://amc-journal.eu) Rank
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 informationLarge sets of t designs from groups
Large sets of t designs from groups Spyros S. Magliveras Department of Mathematical Sciences Florida Atlantic University Boca Raton, Florida 33431-0991 Dedicated to Alex Rosa on the occasion of his 70th
More informationA second infinite family of Steiner triple systems without almost parallel classes
A second infinite family of Steiner triple systems without almost parallel classes Darryn Bryant The University of Queensland Department of Mathematics Qld 4072, Australia Daniel Horsley School of Mathematical
More informationarxiv: v1 [math.co] 14 Jan 2016
The Cameron-Liebler problem for sets Maarten De Boec, Leo Storme and Andrea Švob arxiv:1601.03628v1 [math.co] 14 Jan 2016 Abstract Cameron-Liebler line classes and Cameron-Liebler -classes in PG(2 + 1,
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 informationPlanar and Affine Spaces
Planar and Affine Spaces Pýnar Anapa İbrahim Günaltılı Hendrik Van Maldeghem Abstract In this note, we characterize finite 3-dimensional affine spaces as the only linear spaces endowed with set Ω of proper
More informationCONSTRUCTION OF SIMPLE 3-DESIGNS USING RESOLUTION
CONSTRUCTION OF SIMPLE 3-DESIGNS USING RESOLUTION Tran van Trung Institut für Experimentelle Mathematik Universität Duisburg-Essen ALCOMA15 Kloster Banz, Germany March 15 20, 2015 OUTLINE Generic constructions
More informationDense near octagons with four points on each line, III
Dense near octagons with four points on each line, III Bart De Bruyn Ghent University, Department of Pure Mathematics and Computer Algebra, Krijgslaan 281 (S22), B-9000 Gent, Belgium, E-mail: bdb@cage.ugent.be
More informationOn the nucleus of the Grassmann embedding of the symplectic dual polar space DSp(2n, F), char(f) = 2
On the nucleus of the Grassmann embedding of the symplectic dual polar space DSp(2n, F), char(f) = 2 Rieuwert J. Blok Department of Mathematics and Statistics Bowling Green State University Bowling Green,
More informationOverview of some Combinatorial Designs
Bimal Roy Indian Statistical Institute, Kolkata. Outline of the talk 1 Introduction 2 3 4 5 6 7 Outline of the talk 1 Introduction 2 3 4 5 6 7 Introduction Design theory: Study of combinatorial objects
More informationA spectrum result on minimal blocking sets with respect to the planes of PG(3, q), q odd
A spectrum result on minimal blocking sets with respect to the planes of PG(3, q), q odd C. Rößing L. Storme January 12, 2010 Abstract This article presents a spectrum result on minimal blocking sets with
More informationIntriguing sets of vertices of regular graphs
Intriguing sets of vertices of regular graphs Bart De Bruyn and Hiroshi Suzuki February 18, 2010 Abstract Intriguing and tight sets of vertices of point-line geometries have recently been studied in the
More informationMAXIMAL PERIODS OF (EHRHART) QUASI-POLYNOMIALS
MAXIMAL PERIODS OF (EHRHART QUASI-POLYNOMIALS MATTHIAS BECK, STEVEN V. SAM, AND KEVIN M. WOODS Abstract. A quasi-polynomial is a function defined of the form q(k = c d (k k d + c d 1 (k k d 1 + + c 0(k,
More informationOn Linear Subspace Codes Closed under Intersection
On Linear Subspace Codes Closed under Intersection Pranab Basu Navin Kashyap Abstract Subspace codes are subsets of the projective space P q(n), which is the set of all subspaces of the vector space F
More informationPROJECTIVE DIVISIBLE BINARY CODES
PROJECTIVE DIVISIBLE BINARY CODES DANIEL HEINLEIN, THOMAS HONOLD, MICHAEL KIERMAIER, SASCHA KURZ, AND ALFRED WASSERMANN Abstract. For which positive integers n, k, r does there exist a linear [n, k] code
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 informationThe Simple 7-(33,8,10)-Designs with Automorphism Group PΓL(2,32)
The Simple 7-(33,8,10)-Designs with Automorphism Group PΓL(2,32) Alfred Wassermann Abstract Lattice basis reduction in combination with an efficient backtracking algorithm is used to find all (4 996 426)
More informationGeneralized Quadrangles with a Spread of Symmetry
Europ. J. Combinatorics (999) 20, 759 77 Article No. eujc.999.0342 Available online at http://www.idealibrary.com on Generalized Quadrangles with a Spread of Symmetry BART DE BRUYN We present a common
More informationTHE NUMBER OF INVARIANT SUBSPACES UNDER A LINEAR OPERATOR ON FINITE VECTOR SPACES
Advances in Mathematics of Communications Volume 5, No. 2, 2011, 407 416 Web site: http://www.aimsciences.org THE NUMBER OF INVARIANT SUBSPACES UNDER A LINEAR OPERATOR ON FINITE VECTOR SPACES This work
More informationD-bounded Distance-Regular Graphs
D-bounded Distance-Regular Graphs CHIH-WEN WENG 53706 Abstract Let Γ = (X, R) denote a distance-regular graph with diameter D 3 and distance function δ. A (vertex) subgraph X is said to be weak-geodetically
More informationDistance-j Ovoids and Related Structures in Generalized Polygons
Distance-j Ovoids and Related Structures in Generalized Polygons Alan Offer and Hendrik Van Maldeghem Department of Pure Mathematics and Computer Algebra, Ghent University, Galglaan 2, B 9000 Ghent, Belgium
More informationIndependent generating sets and geometries for symmetric groups
Independent generating sets and geometries for symmetric groups Peter J. Cameron School of Mathematical Sciences Queen Mary, University of London Mile End Road London E1 4NS UK Philippe Cara Department
More informationA relative of the Thue-Morse Sequence
A relative of the Thue-Morse Sequence Jean-Paul Allouche C.N.R.S. U.R.A. 0226, Math., Université Bordeaux I, F-33405 Talence cedex, FRANCE André Arnold LaBRI, Université Bordeaux I, F-33405 Talence cedex,
More informationSimon R. Blackburn. Jount work with Tuvi Etzion. 9th July 2012
Grassmannian Codes Royal and Holloway Quasirandom logo Hypergraphs guidelines Simon R. Blackburn Jount work with Tuvi Etzion 9th July 2012 Standard logo The logo should be reproduced in the primary co
More informationCentralizers of Coxeter Elements and Inner Automorphisms of Right-Angled Coxeter Groups
International Journal of Algebra, Vol. 3, 2009, no. 10, 465-473 Centralizers of Coxeter Elements and Inner Automorphisms of Right-Angled Coxeter Groups Anton Kaul Mathematics Department, California Polytecnic
More informationOn λ-fold Partitions of Finite Vector Spaces and Duality
On λ-fold Partitions of Finite Vector Spaces and Duality S. El-Zanati, G. Seelinger, P. Sissokho, L. Spence, C. Vanden Eynden Abstract Vector space partitions of an n-dimensional vector space V over a
More informationExponential triples. Alessandro Sisto. Mathematical Institute, St Giles, Oxford OX1 3LB, United Kingdom
Exponential triples Alessandro Sisto Mathematical Institute, 24-29 St Giles, Oxford OX1 3LB, United Kingdom sisto@maths.ox.ac.uk Submitted: Mar 6, 2011; Accepted: Jul 6, 2011; Published: Jul 15, 2011 Mathematics
More informationBlock-Transitive 4 (v, k, 4) Designs and Suzuki Groups
International Journal of Algebra, Vol. 10, 2016, no. 1, 27-32 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/10.12988/ija.2016.51277 Block-Transitive 4 (v, k, 4) Designs and Suzuki Groups Shaojun Dai Department
More informationA characterization of the Split Cayley Generalized Hexagon H(q) using one subhexagon of order (1, q)
A characterization of the Split Cayley Generalized Hexagon H(q) using one subhexagon of order (1, q) Joris De Kaey and Hendrik Van Maldeghem Ghent University, Department of Pure Mathematics and Computer
More informationON k-abelian p-filiform LIE ALGEBRAS I. 1. Generalities
Acta Math. Univ. Comenianae Vol. LXXI, 1(2002), pp. 51 68 51 ON k-abelian p-filiform LIE ALGEBRAS I O. R. CAMPOAMOR STURSBERG Abstract. We classify the (n 5)-filiform Lie algebras which have the additional
More informationQuasimultiples of Geometric Designs
Quasimultiples of Geometric Designs G. L. Ebert Department of Mathematical Sciences University of Delaware Newark, DE 19716 ebert@math.udel.edu Dedicated to Curt Lindner on the occasion of his 65th birthday
More informationEvery generalized quadrangle of order 5 having a regular point is symplectic
Every generalized quadrangle of order 5 having a regular point is symplectic Bart De Bruyn Ghent University, Department of Mathematics, Krijgslaan 281 (S22), B-9000 Gent, Belgium, E-mail: bdb@cage.ugent.be
More informationPerfect countably infinite Steiner triple systems
AUSTRALASIAN JOURNAL OF COMBINATORICS Volume 54 (2012), Pages 273 278 Perfect countably infinite Steiner triple systems P. J. Cameron School of Mathematical Sciences Queen Mary, University of London Mile
More informationLarge minimal covers of PG(3,q)
Large minimal covers of PG(3,q) Aiden A. Bruen Keldon Drudge Abstract A cover of Σ = PG(3,q) is a set of lines S such that each point of Σ is incident with at least one line of S. A cover is minimal if
More informationThe Witt designs, Golay codes and Mathieu groups
The Witt designs, Golay codes and Mathieu groups 1 The Golay codes Let V be a vector space over F q with fixed basis e 1,..., e n. A code C is a subset of V. A linear code is a subspace of V. The vector
More informationAn algebraic proof of the Erdős-Ko-Rado theorem for intersecting families of perfect matchings
Also available at http://amc-journal.eu ISSN 855-3966 (printed edn.), ISSN 855-3974 (electronic edn.) ARS MATHEMATICA CONTEMPORANEA 2 (207) 205 27 An algebraic proof of the Erdős-Ko-Rado theorem for intersecting
More informationVan der Corput sets with respect to compact groups
Van der Corput sets with respect to compact groups Michael Kelly and Thái Hoàng Lê Abstract. We study the notion of van der Corput sets with respect to general compact groups. Mathematics Subject Classification
More informationarxiv: v1 [math.co] 28 Oct 2016
More on foxes arxiv:1610.09093v1 [math.co] 8 Oct 016 Matthias Kriesell Abstract Jens M. Schmidt An edge in a k-connected graph G is called k-contractible if the graph G/e obtained from G by contracting
More informationSome Two Character Sets
Some Two Character Sets A. Cossidente Dipartimento di Matematica e Informatica Università degli Studi della Basilicata Contrada Macchia Romana 85100 Potenza (ITALY) E mail: cossidente@unibas.it Oliver
More informationSteiner triple and quadruple systems of low 2-rank
Steiner triple and quadruple systems of low 2-rank Vladimir D. Tonchev Department of Mathematical Sciences Michigan Technological University Houghton, MI 49931, USA tonchev@mtu.edu, www.math.mtu.edu/ tonchev
More informationThe Morozov-Jacobson Theorem on 3-dimensional Simple Lie Subalgebras
The Morozov-Jacobson Theorem on 3-dimensional Simple Lie Subalgebras Klaus Pommerening July 1979 english version April 2012 The Morozov-Jacobson theorem says that every nilpotent element of a semisimple
More informationThe Singapore Copyright Act applies to the use of this document.
Title On graphs whose low polynomials have real roots only Author(s) Fengming Dong Source Electronic Journal of Combinatorics, 25(3): P3.26 Published by Electronic Journal of Combinatorics This document
More information. Here the flats of H(2d 1, q 2 ) consist of all nonzero totally isotropic
NEW BOUNDS FOR PARTIAL SPREADS OF H(d 1, ) AND PARTIAL OVOIDS OF THE REE-TITS OCTAGON FERDINAND IHRINGER, PETER SIN, QING XIANG ( ) Abstract Our first result is that the size of a partial spread of H(,
More informationFREE RESOLUTION OF POWERS OF MONOMIAL IDEALS AND GOLOD RINGS
FREE RESOLUTION OF POWERS OF MONOMIAL IDEALS AND GOLOD RINGS N. ALTAFI, N. NEMATI, S. A. SEYED FAKHARI, AND S. YASSEMI Abstract. Let S = K[x 1,..., x n ] be the polynomial ring over a field K. In this
More informationLenz-Barlotti I.4 Perspectivity Groups are Abelian
Lenz-Barlotti I.4 Perspectivity Groups are Abelian Robert A. Liebler and Elizabeth Scott-Janda Abstract: We extend a 1972 result of Kantor and Pankin and give a new elementary proof of the assertion in
More informationREMARKS ON REFLEXIVE MODULES, COVERS, AND ENVELOPES
REMARKS ON REFLEXIVE MODULES, COVERS, AND ENVELOPES RICHARD BELSHOFF Abstract. We present results on reflexive modules over Gorenstein rings which generalize results of Serre and Samuel on reflexive modules
More informationThe case of equality in the Livingstone-Wagner Theorem
J Algebr Comb 009 9: 15 7 DOI 10.1007/s10801-008-010-7 The case of equality in the Livingstone-Wagner Theorem David Bundy Sarah Hart Received: 1 January 007 / Accepted: 1 February 008 / Published online:
More informationarxiv:math/ v1 [math.co] 21 Jun 2005
Counting polyominoes with minimum perimeter arxiv:math/0506428v1 [math.co] 21 Jun 2005 Abstract Sascha Kurz University of Bayreuth, Department of Mathematics, D-95440 Bayreuth, Germany The number of essentially
More informationTactical Decompositions of Steiner Systems and Orbits of Projective Groups
Journal of Algebraic Combinatorics 12 (2000), 123 130 c 2000 Kluwer Academic Publishers. Manufactured in The Netherlands. Tactical Decompositions of Steiner Systems and Orbits of Projective Groups KELDON
More informationOn non-antipodal binary completely regular codes
On non-antipodal binary completely regular codes J. Borges, J. Rifà Department of Information and Communications Engineering, Universitat Autònoma de Barcelona, 08193-Bellaterra, Spain. V.A. Zinoviev Institute
More informationMODULI OF ALGEBRAIC SL 3 -VECTOR BUNDLES OVER ADJOINT REPRESENTATION
Masuda, K. Osaka J. Math. 38 (200), 50 506 MODULI OF ALGEBRAIC SL 3 -VECTOR BUNDLES OVER ADJOINT REPRESENTATION KAYO MASUDA (Received June 2, 999). Introduction and result Let be a reductive complex algebraic
More informationDiskrete Mathematik und Optimierung
Diskrete Mathematik und Optimierung Steffen Hitzemann and Winfried Hochstättler: On the Combinatorics of Galois Numbers Technical Report feu-dmo012.08 Contact: steffen.hitzemann@arcor.de, winfried.hochstaettler@fernuni-hagen.de
More information1. A brief introduction to
1. A brief introduction to design theory These lectures were given to an audience of design theorists; for those outside this class, the introductory chapter describes some of the concepts of design theory
More informationOn Dense Embeddings of Discrete Groups into Locally Compact Groups
QUALITATIVE THEORY OF DYNAMICAL SYSTEMS 4, 31 37 (2003) ARTICLE NO. 50 On Dense Embeddings of Discrete Groups into Locally Compact Groups Maxim S. Boyko Institute for Low Temperature Physics and Engineering,
More informationEvery SOMA(n 2, n) is Trojan
Every SOMA(n 2, n) is Trojan John Arhin 1 Marlboro College, PO Box A, 2582 South Road, Marlboro, Vermont, 05344, USA. Abstract A SOMA(k, n) is an n n array A each of whose entries is a k-subset of a knset
More informationTitle and Abstract of talks
Title and Abstract of talks 1. Speaker: Luis Paris Title: The K(π, 1) conjecture for Artin groups. (3 lectures) If a, b are two letters and m is an integer 2, we denote by Π(a, b, m) the word aba of length
More informationOn the Irreducibility of the Commuting Variety of the Symmetric Pair so p+2, so p so 2
Journal of Lie Theory Volume 16 (2006) 57 65 c 2006 Heldermann Verlag On the Irreducibility of the Commuting Variety of the Symmetric Pair so p+2, so p so 2 Hervé Sabourin and Rupert W.T. Yu Communicated
More informationNew Bounds for Partial Spreads of H(2d 1, q 2 ) and Partial Ovoids of the Ree-Tits Octagon
New Bounds for Partial Spreads of H2d 1, q 2 ) and Partial Ovoids of the Ree-Tits Octagon Ferdinand Ihringer Einstein Institute of Mathematics, The Hebrew University of Jerusalem, Givat Ram, Jerusalem,
More informationA new look at an old construction: constructing (simple) 3-designs from resolvable 2-designs
A new look at an old construction: constructing (simple) 3-designs from resolvable 2-designs Douglas R. Stinson David R. Cheriton School of Computer Science University of Waterloo Waterloo, Ontario, N2L
More informationDesign Theory Notes 1:
----------------------------------------------------------------------------------------------- Math 6023 Topics in Discrete Math: Design and Graph Theory Fall 2007 ------------------------------------------------------------------------------------------------
More informationPair dominating graphs
Pair dominating graphs Paul Balister Béla Bollobás July 25, 2004 Department of Mathematical Sciences, University of Memphis, Memphis, TN 38152 USA Abstract An oriented graph dominates pairs if for every
More informationTHE FORM SUM AND THE FRIEDRICHS EXTENSION OF SCHRÖDINGER-TYPE OPERATORS ON RIEMANNIAN MANIFOLDS
THE FORM SUM AND THE FRIEDRICHS EXTENSION OF SCHRÖDINGER-TYPE OPERATORS ON RIEMANNIAN MANIFOLDS OGNJEN MILATOVIC Abstract. We consider H V = M +V, where (M, g) is a Riemannian manifold (not necessarily
More informationarxiv: v1 [math.co] 25 Jun 2014
THE NON-PURE VERSION OF THE SIMPLEX AND THE BOUNDARY OF THE SIMPLEX NICOLÁS A. CAPITELLI arxiv:1406.6434v1 [math.co] 25 Jun 2014 Abstract. We introduce the non-pure versions of simplicial balls and spheres
More informationGeneralized Quadrangles Weakly Embedded in Finite Projective Space
Generalized Quadrangles Weakly Embedded in Finite Projective Space J. A. Thas H. Van Maldeghem Abstract We show that every weak embedding of any finite thick generalized quadrangle of order (s, t) in a
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 informationarxiv:math/ v1 [math.rt] 9 Oct 2004
On compression of Bruhat Tits buildings Yurii A. Neretin arxiv:math/0410242v1 [math.rt] 9 Oct 2004 Consider an affine Bruhat-Tits building Lat n of the type A n 1 and the complex distance in Lat n, i.e.,
More informationSome Nordhaus-Gaddum-type Results
Some Nordhaus-Gaddum-type Results Wayne Goddard Department of Mathematics Massachusetts Institute of Technology Cambridge, USA Michael A. Henning Department of Mathematics University of Natal Pietermaritzburg,
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 informationA Polyhedral Cone Counterexample
Division of the Humanities and Social Sciences A Polyhedral Cone Counterexample KCB 9/20/2003 Revised 12/12/2003 Abstract This is an example of a pointed generating convex cone in R 4 with 5 extreme rays,
More informationIntroduction to Block Designs
School of Electrical Engineering and Computer Science University of Ottawa lucia@eecs.uottawa.ca Winter 2017 What is Design Theory? Combinatorial design theory deals with the arrangement of elements into
More informationConstructing network codes using Möbius transformations
Constructing network codes using Möbius transformations Andreas-Stephan Elsenhans and Axel Kohnert November 26, 2010 Abstract We study error correcting constant dimension subspace codes for network coding.
More informationOn a subalgebra of the centre of a group ring
Journal of Algebra 295 (2006) 293 302 www.elsevier.com/locate/jalgebra On a subalgebra of the centre of a group ring Harald Meyer Universität Bayreuth, Lehrstuhl IV für Mathematik, 95440 Bayreuth, Germany
More informationA completely entangled subspace of maximal dimension
isibang/ms/2006/6 March 28th, 2006 http://www.isibang.ac.in/ statmath/eprints A completely entangled subspace of maximal dimension B. V. Rajarama Bhat Indian Statistical Institute, Bangalore Centre 8th
More informationGeneralized incidence theorems, homogeneous forms and sum-product estimates in finite fields arxiv: v2 [math.
Generalized incidence theorems, homogeneous forms and sum-product estimates in finite fields arxiv:0801.0728v2 [math.co] 31 Mar 2008 David Covert, Derrick Hart, Alex Iosevich, Doowon Koh, and Misha Rudnev
More informationInternational Mathematical Forum, Vol. 6, 2011, no. 4, Manjusri Basu
International Mathematical Forum, Vol 6, 011, no 4, 185-191 Square Designs on New Binary ( 3n 1, 3 n ) Codes Manjusri Basu Department of Mathematics University of Kalyani Kalyani, WB, India, Pin-74135
More informationResolving a conjecture on degree of regularity of linear homogeneous equations
Resolving a conjecture on degree of regularity of linear homogeneous equations Noah Golowich MIT-PRIMES, Department of Mathematics Massachusetts Institute of Technology Massachusetts, U.S.A. Submitted:
More informationCHARACTERISTIC POLYNOMIAL PATTERNS IN DIFFERENCE SETS OF MATRICES
CHARACTERISTIC POLYNOMIAL PATTERNS IN DIFFERENCE SETS OF MATRICES MICHAEL BJÖRKLUND AND ALEXANDER FISH Abstract. We show that for every subset E of positive density in the set of integer squarematrices
More informationRegular Actions on Generalized Polygons
Regular Actions on Generalized Polygons H. Van Maldeghem Department of Pure Mathematics and Computer Algebra, Ghent University, Galglaan 2, B 9000 Ghent, hvm@cage.rug.ac.be Abstract In [2], Theo Grundhöfer
More informationCOMPLETE REDUCIBILITY AND SEPARABLE FIELD EXTENSIONS
COMPLETE REDUCIBILITY AND SEPARABLE FIELD EXTENSIONS MICHAEL BATE, BENJAMIN MARTIN, AND GERHARD RÖHRLE Abstract. Let G be a connected reductive linear algebraic group. The aim of this note is to settle
More information