✦ LIBER ✦

Minimal Covers of the Klein Quadric

✍ Scribed by J. Eisfeld; L. Storme; P. Sziklai

Publisher: Elsevier Science
Year: 2001
Tongue: English
Weight: 129 KB
Volume: 95
Category: Article
ISSN: 0097-3165
DOI: 10.1006/jcta.2000.3157

No coin nor oath required. For personal study only.

✦ Synopsis

A t-cover of a quadric Q is a set C of t-dimensional subspaces contained in Q such that every point of Q belongs to at least one element of C. We consider t-covers of the Klein quadric Q + (5, q). For t=2, we show that a 2-cover has at least q 2 +q elements, and we give an exact description of the examples of this cardinality. For t=1, we show that a 1-cover has at least q 3 +2q+1 elements, and we give examples of covers of that size.

📜 SIMILAR VOLUMES

Minimal multiplicative covers of an inte

Minimal multiplicative covers of an integer

✍ Carl G. Wagner 📂 Article 📅 1978 🏛 Elsevier Science 🌐 English ⚖ 633 KB

VfE[!. kj. 1 Ji+, Si#S)l have been studied Dreviously by Hcarnz and Wagner. The prrsent paper \*-eats three arrays. rG(n. k). 61(n. k). and k(n. k). which extend min. k i in the sense .:hat I ., PI --l R\*k)=~(p,...p,.k)=ri(p,.. -p,. k)= ni(s.k) for all sequences (r,. . . . \_p,l of distinct primes.

On the Largest Caps Contained in the Kle

On the Largest Caps Contained in the Klein Quadric of PG(5, q), q Odd

✍ L Storme 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 175 KB

On the number of distinct minimal clique

On the number of distinct minimal clique partitions and clique covers of a line graph

✍ Sean McGuinness; Rolf Rees 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 812 KB

Let G be a line graph. Orlin determined the clique covering and clique partition numbers cc(G) and cp(G). We obtain a constructive proof of Orlin's result and in doing so we are able to completely enumerate the number of distinct minimal clique covers and partitions of G, in terms of easily calculab

The universal covering homomorphism in o

The universal covering homomorphism in o-minimal expansions of groups

✍ Mário J. Edmundo; Pantelis E. Eleftheriou 📂 Article 📅 2007 🏛 John Wiley and Sons 🌐 English ⚖ 169 KB

## Abstract Suppose __G__ is a definably connected, definable group in an o‐minimal expansion of an ordered group. We show that the o‐minimal universal covering homomorphism $ \tilde p $: $ \tilde G $→ __G__ is a locally definable covering homomorphism and __π__~1~(__G__) is isomorphic to the o‐min

Minimal coverings of uniform hypergraphs

Minimal coverings of uniform hypergraphs and P-recursiveness

✍ Virgil Domocoş 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 280 KB

Two wide classes of hypergraphs are proved to be enumerated by P-recursive sequences. The open problem of enumerating minimal coverings that are multipartite hypergraphs receives a qualitative-type answer.

On minimal covering of incompletely spec

On minimal covering of incompletely specified sequential networks

✍ Tse-Yun Feng 📂 Article 📅 1971 🏛 Elsevier Science 🌐 English ⚖ 698 KB

## In this paper we describe a simpb procedure using &zaselli and ~ccio's concept to Jind a minimum-state cover. Their concept ie then extended to include a new class of p&nx compatibles 80 that a minimal cover can be found. Finally a complete procedure ie described to Jind both the minimum-state