English

Generalized pentagonal geometries -- II

Combinatorics 2023-01-10 v3

Abstract

A generalized pentagonal geometry PENT(kk,rr,ww) is a partial linear space, where every line is incident with kk points, every point is incident with rr lines, and for each point, xx, the set of points not collinear with xx forms the point set of a Steiner system S(2,k,w)S(2,k,w) whose blocks are lines of the geometry. If w=kw = k, the structure is called a pentagonal geometry and denoted by PENT(kk,rr). The deficiency graph of a PENT(kk,rr,ww) has as its vertices the points of the geometry, and there is an edge between xx and yy precisely when xx and yy are not collinear. Our primary objective is to investigate generalized pentagonal geometries PENT(kk,rr,ww) where the deficiency graph has girth 4. We describe some construction methods, including a procedure that preserves deficiency graph connectedness, and we prove a number of theorems regarding the existence spectra for k=3k = 3 and various values of ww. In addition, we present some new PENT(4,rr) (including PENT(4,25)) and PENT(5,rr) with connected deficiency graphs. Consequently, we prove that there exist pentagonal geometries PENT(kk,rr) with deficiency graphs of girth at least 5 for r13r \ge 13, rr congruent to 1 modulo 4 when k=4k = 4, and for r200000r \ge 200000, rr congruent to 0 or 1 modulo 5 when k=5k = 5. We conclude with a discussion of appropriately defined identifying codes for pentagonal geometries.

Keywords

Cite

@article{arxiv.2111.13599,
  title  = {Generalized pentagonal geometries -- II},
  author = {Anthony D. Forbes and Carrie G. Rutherford},
  journal= {arXiv preprint arXiv:2111.13599},
  year   = {2023}
}

Comments

84 pages. Abstract changed. Lemmas and theorems in Sections 4 and 5 significantly improved. Many more directly constructed PENT(4,r). New section: Identifying codes for pentagonal geometries. The paper with the appendix omitted will be submitted to a journal

R2 v1 2026-06-24T07:53:18.205Z