✦ LIBER ✦

Glued Near Polygons

✍ Scribed by Bart De Bruyn

Publisher: Elsevier Science
Year: 2001
Tongue: English
Weight: 321 KB
Volume: 22
Category: Article
ISSN: 0195-6698
DOI: 10.1006/eujc.2001.0512

No coin nor oath required. For personal study only.

✦ Synopsis

We generalize a construction given in [3] to derive new near polygons from spreads of symmetry in generalized quadrangles.

📜 SIMILAR VOLUMES

Valuations of glued near hexagons

✍ Bart De Bruyn 📂 Article 📅 2006 🏛 John Wiley and Sons 🌐 English ⚖ 155 KB

## Abstract Valuations of near polygons were introduced in [12] as an important tool for classifying dense near polygons. In the present article, we will introduce the class of the semi‐diagonal valuations. These valuations live in glued near hexagons. A glued near hexagon __S__ can be coordinatize

Homogeneous Graphs and Regular Near Poly

Homogeneous Graphs and Regular Near Polygons

✍ K. Nomura 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 210 KB

We consider a distance-regular graph having homogeneous edge patterns in each entry of its intersection diagram with respect to an edge. We call such graphs homogeneous graphs. We study elementary properties of homogeneous graphs, and we show these graphs are related deeply with regular near polygon

Combinatorial Construction of Some Near

Combinatorial Construction of Some Near Polygons

✍ Bruce.N. Cooperstein; Ernest.E. Shult 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 397 KB

We give a construction which takes a rank two incidence geometry with three points on a line and returns a geometry of the same type, i.e., with three points on a line. It is also demonstrated that embeddings of the original geometry can be extended to the new geometry. It is shown that the family o

Strongly Closed Subgraphs in a Regular T

Strongly Closed Subgraphs in a Regular Thick Near Polygon

✍ Akira Hiraki 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 114 KB

In this paper we show that a regular thick near polygon has a tower of regular thick near subpolygons as strongly closed subgraphs if the diameter d is greater than the numerical girth g.

On the Uniqueness of Near Polygons with

On the Uniqueness of Near Polygons with Three Points on Every Line

✍ Bart De Bruyn 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 69 KB

Algebraic Polygons

✍ Linus Kramer; Katrin Tent 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 178 KB

In this paper we prove the following: Over each algebraically closed field K of Ž . characteristic 0 there exist precisely three algebraic polygons up to duality , namely the projective plane, the symplectic quadrangle, and the split Cayley Ž . hexagon over K Theorem 3.3 . As a corollary we prove th