Related papers: Generalized pentagonal geometries
A generalized pentagonal geometry PENT($k$,$r$,$w$) is a partial linear space, where every line is incident with $k$ points, every point is incident with $r$ lines, and for each point, $x$, the set of points not collinear with $x$ forms the…
A pentagonal geometry PENT($k$, $r$) is a partial linear space, where every line, or block, is incident with $k$ points, every point is incident with $r$ lines, and for each point $x$, there is a line incident with precisely those points…
New results on pentagonal geometries PENT(k,r) with block sizes k = 3 or k = 4 are given. In particular we completely determine the existence spectra for PENT(3,r) systems with the maximum number of opposite line pairs as well as those…
The point-line geometry known as a \textit{partial quadrangle} (introduced by Cameron in 1975) has the property that for every point/line non-incident pair $(P,\ell)$, there is at most one line through $P$ concurrent with $\ell$. So in…
A generalized quadrangle is a point-line incidence geometry such that any two points lie on at most one line and, given a line $\ell$ and a point $P$ not incident with $\ell$, there is a unique point of $\ell$ collinear with $P$. We study…
For k >= 3, a k-angulation is a 2-connected plane graph in which every internal face is a k-gon. We say that a point set P admits a plane graph G if there is a straight-line drawing of G that maps V(G) onto P and has the same facial cycles…
A planar integral point set is a set of non-collinear points in plane such that for any pair of the points the Euclidean distance between the points is integral. We discuss the classification of planar integral point sets and provide…
The pentagram map is a discrete dynamical system on planar polygons. By definition, the image of a polygon $P$ under the pentagram map is the polygon $P'$ whose vertices are the intersection points of consecutive shortest diagonals of $P$.…
In this paper we study some Erdos type problems in discrete geometry. Our main result is that we show that there is a planar point set of n points such that no four are collinear but no matter how we choose a subset of size $n^{5/6+o(1)} $…
An empty pentagon in a point set P in the plane is a set of five points in P in strictly convex position with no other point of P in their convex hull. We prove that every finite set of at least 328k^2 points in the plane contains an empty…
Some models of set theory are given which contain sets that have some of the important characteristics of being geometric, or spatial, yet do not have any points, in various ways. What's geometrical is that there are functions to these…
As one type of incidence theory, the geometry of pentagram map seems quite classical at first. However, this is an excellent example of such a classical idea developed into a marvellous insight by some modern approach. We introduce an…
A projective rectangle is like a projective plane that may have different lengths in two directions. We develop properties of the graph of lines, in which adjacency means having a common point, especially its strong regularity and clique…
A point set $M$ in Euclidean plane is called an integral point set in semi-general position if all the distances between the elements of $M$ are integers, and $M$ does not contain collinear triples. We improve the lower bound for diameter…
We introduce a geometric construction which relates to the pentagram map much in the way that a logarithmic spiral relates to a circle. After introducing the construction, we establish some basic geometric facts about it, and speculate on…
A rectangulation is a tiling of a rectangle by a finite number of rectangles. The rectangulation is called generic if no four of its rectangles share a single corner. We initiate the enumeration of generic rectangulations up to…
A projective rectangle is like a projective plane that has different lengths in two directions. We develop the basic theory of projective rectangles including incidence properties, projective subplanes, configuration counts, a partial…
Finsler geometry is a natural generalization of (pseudo-)Riemannian geometry, where the line element is not the square root of a quadratic form but a more general homogeneous function. Parameterizing this in terms of symmetric tensors…
To incorporate quantum nonlocality into general relativity, we propose that the preparation and measurement of a quantum system are simultaneous events. To make progress in realizing this proposal, we introduce a spacetime geometry that is…
We consider the problem of computing a triangulation of the real projective plane P2, given a finite point set S={p1, p2,..., pn} as input. We prove that a triangulation of P2 always exists if at least six points in S are in general…