𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On a family of minimal blocking sets of the Hermitian surface

✍ Scribed by Antonio Cossidente;; Oliver H. King

Publisher
John Wiley and Sons
Year
2011
Tongue
English
Weight
87 KB
Volume
19
Category
Article
ISSN
1063-8539

No coin nor oath required. For personal study only.

✦ Synopsis

An infinite family of minimal blocking sets of H(3,q 2 ) is constructed for even q, with links to Ceva configurations.

πŸ“œ SIMILAR VOLUMES

Special sets of the Hermitian surface an
Special sets of the Hermitian surface and indicator sets
✍ Antonio Cossidente; Giuseppe Marino; Olga Polverino πŸ“‚ Article πŸ“… 2007 πŸ› John Wiley and Sons 🌐 English βš– 121 KB

## Abstract An interesting connection between special sets of the Hermitian surface of PG(3,__q__^2^), __q__ odd, (after Shult 13) and indicator sets of line‐spreads of the three‐dimensional projective space is provided. Also, the CP‐type special sets are characterized. Β© 2007 Wiley Periodicals, In

The smallest minimal blocking sets of Q(
The smallest minimal blocking sets of Q(6, q), q even
✍ J. De Beule; L. Storme πŸ“‚ Article πŸ“… 2003 πŸ› John Wiley and Sons 🌐 English βš– 155 KB

## Abstract We characterize the smallest minimal blocking sets of Q(6,__q__), __q__ even and __q__ β‰₯ 32. We obtain this result using projection arguments which translate the problem into problems concerning blocking sets of Q(4,__q__). Then using results on the size of the smallest minimal blocking

On the Determination of Minimal Facets a
On the Determination of Minimal Facets and Edges of a Polyhedral Set
✍ JOHANNES JAHN πŸ“‚ Article πŸ“… 1997 πŸ› John Wiley and Sons 🌐 English βš– 158 KB πŸ‘ 1 views

In this paper we investigate the image of a polyhedral set under a linear map. Moreover, we present an algorithm for the determination of so-called minimal facets and certain minimal irredundant proper edges of a convex polyhedral set in IR 3 . & 1997 by John Wiley & Sons, Ltd.

A note on the complexity of family sched
A note on the complexity of family scheduling to minimize the number of late jobs
✍ T. C. Edwin Cheng; Zhaohui Liu; Yakov M. Shafransky πŸ“‚ Article πŸ“… 2001 πŸ› Springer US 🌐 English βš– 65 KB

The single-machine family scheduling problem of minimizing the number of late jobs has been known to be NP-hard, but whether it is NP-hard in the strong sense is cited as an open problem in several reviews. In this note, we prove that this problem is strongly NP-hard even if all set-up times and pro