✦ LIBER ✦

Intriguing sets in partial quadrangles

✍ Scribed by John Bamberg; Frank De Clerck; Nicola Durante

Publisher: John Wiley and Sons
Year: 2010
Tongue: English
Weight: 316 KB
Volume: 19
Category: Article
ISSN: 1063-8539
DOI: 10.1002/jcd.20269

No coin nor oath required. For personal study only.

✦ Synopsis

The point-line geometry known as a partial quadrangle (introduced by Cameron in 1975) has the property that for every point/line non-incident pair (P, ), there is at most one line through P concurrent with . So in particular, the well-studied objects known as generalized quadrangles are each partial quadrangles. An intriguing set of a generalized quadrangle is a set of points which induces an equitable partition of size two of the underlying strongly regular graph. We extend the theory of intriguing sets of generalized quadrangles by Bamberg, Law and Penttila to partial quadrangles, which gives insight into the structure of hemisystems and other intriguing sets of generalized quadrangles.

📜 SIMILAR VOLUMES

Maximal partial ovoids and maximal parti

Maximal partial ovoids and maximal partial spreads in hermitian generalized quadrangles

✍ K. Metsch; L. Storme 📂 Article 📅 2008 🏛 John Wiley and Sons 🌐 English ⚖ 181 KB

## Abstract Maximal partial ovoids and maximal partial spreads of the hermitian generalized quadrangles __H__(3,__q__^2^) and __H__(4,__q__^2^) are studied in great detail. We present improved lower bounds on the size of maximal partial ovoids and maximal partial spreads in the hermitian quadrangle

Partial ordering in L-underdeterminate s

Partial ordering in L-underdeterminate sets

✍ Ulrich Höhle; Nicole Blanchard 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 571 KB

Efficient sets in partial k-trees

✍ Jan Arne Telle; Andrzej Proskurowski 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 652 KB

New partial difference sets in p-groups

✍ Xiang-Dong Hou 📂 Article 📅 2002 🏛 John Wiley and Sons 🌐 English ⚖ 110 KB

## Abstract Latin square type partial difference sets (PDS) are known to exist in __R__ × __R__ for various abelian __p__‐groups __R__ and in ℤ^__t__^. We construct a family of Latin square type PDS in ℤ^__t__^ × ℤ^2__nt__^~__p__~ using finite commutative chain rings. When __t__ is odd, the ambient

Arithmetic progressions in partially ord

Arithmetic progressions in partially ordered sets

✍ William T. Trotter; Peter Winkler 📂 Article 📅 1987 🏛 Springer Netherlands 🌐 English ⚖ 308 KB

Coding in the Partial Order of Enumerabl

Coding in the Partial Order of Enumerable Sets

✍ Leo Harrington; André Nies 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 489 KB

We develop methods for coding with first-order formulas into the partial order E of enumerable sets under inclusion. First we use them to reprove and generalize the (unpublished) result of the first author that the elementary theory of E has the same computational complexity as the theory of the nat