On maximal partial spreads in PG(n, q)

András Gács, T. Szőnyi

Research output: Contribution to journalArticle

18 Citations (Scopus)

Abstract

A study on maximal partial spreads in PG(n,q) is presented. Maximal partial spreads are constructed in PG(3,q) which are a log q factor larger than the best known lower bound. Some definitions and results about hypergraphs are summarized. The geometric lemmas which use these hypergraph results are formulated.

Original languageEnglish
Pages (from-to)123-129
Number of pages7
JournalDesigns, Codes, and Cryptography
Volume29
Issue number1-3
DOIs
Publication statusPublished - May 2003

Fingerprint

Partial Spreads
Hypergraph
Lemma
Lower bound

Keywords

  • Fractional cover of hypergraphs
  • Partial spreads
  • Spreads

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computational Theory and Mathematics
  • Applied Mathematics

Cite this

On maximal partial spreads in PG(n, q). / Gács, András; Szőnyi, T.

In: Designs, Codes, and Cryptography, Vol. 29, No. 1-3, 05.2003, p. 123-129.

Research output: Contribution to journalArticle

Gács, András ; Szőnyi, T. / On maximal partial spreads in PG(n, q). In: Designs, Codes, and Cryptography. 2003 ; Vol. 29, No. 1-3. pp. 123-129.
@article{84096819550c4ecc8686b49cb566a8b4,
title = "On maximal partial spreads in PG(n, q)",
abstract = "A study on maximal partial spreads in PG(n,q) is presented. Maximal partial spreads are constructed in PG(3,q) which are a log q factor larger than the best known lower bound. Some definitions and results about hypergraphs are summarized. The geometric lemmas which use these hypergraph results are formulated.",
keywords = "Fractional cover of hypergraphs, Partial spreads, Spreads",
author = "Andr{\'a}s G{\'a}cs and T. Szőnyi",
year = "2003",
month = "5",
doi = "10.1023/A:1024148308054",
language = "English",
volume = "29",
pages = "123--129",
journal = "Designs, Codes, and Cryptography",
issn = "0925-1022",
publisher = "Springer Netherlands",
number = "1-3",

}

TY - JOUR

T1 - On maximal partial spreads in PG(n, q)

AU - Gács, András

AU - Szőnyi, T.

PY - 2003/5

Y1 - 2003/5

N2 - A study on maximal partial spreads in PG(n,q) is presented. Maximal partial spreads are constructed in PG(3,q) which are a log q factor larger than the best known lower bound. Some definitions and results about hypergraphs are summarized. The geometric lemmas which use these hypergraph results are formulated.

AB - A study on maximal partial spreads in PG(n,q) is presented. Maximal partial spreads are constructed in PG(3,q) which are a log q factor larger than the best known lower bound. Some definitions and results about hypergraphs are summarized. The geometric lemmas which use these hypergraph results are formulated.

KW - Fractional cover of hypergraphs

KW - Partial spreads

KW - Spreads

UR - http://www.scopus.com/inward/record.url?scp=0038380555&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0038380555&partnerID=8YFLogxK

U2 - 10.1023/A:1024148308054

DO - 10.1023/A:1024148308054

M3 - Article

AN - SCOPUS:0038380555

VL - 29

SP - 123

EP - 129

JO - Designs, Codes, and Cryptography

JF - Designs, Codes, and Cryptography

SN - 0925-1022

IS - 1-3

ER -