Related papers: Counting 7-Arcs in Projective Planes over Finite F…

This paper is an addition to the book [54] on Compact projective planes. Such planes, if connected and finite-dimensional, have a point space of topological dimension 2, 4, 8, or 16, the classical example in the last case being the…

Enumerative algebraic geometry deals with problems of counting geometric objects defined algebraically, An important class of enumerative problems is that of counting curves: given a class of curves in some projective variety defined by…

This paper extends the seven-dimensional Fano plane to a 15-dimensional Fano volume, which is related to sedenions. The Fano plane visualises the octonions and their structure as seven quaternions and is derived from a calibration in…

We classify the algebraic combinatorial geometries of arbitrary field extensions of transcendence degree greater than 4 and describe their groups of automorphisms. Our results and proofs extend similar results and proofs by Evans and…

Given the algebra $T$ of ternions (upper triangular $2\times 2$ matrices) over a commutative field $F$ we consider as set of points of a projective line over $T$ the set of all free cyclic submodules of $T^2$. This set of points can be…

A subset of $\mathbb{F}_q^2$ is called an arc if it does not contain three collinear points. We show that there are at most $\binom{(1 + o(1))q}{m}$ arcs of size $m \gg q^{1/2} (\log q)^{3/2}$, nearly matching a trivial lower bound…

There are several remarkable points, defined for polygons and multisets of points in the plane, called centers (such as the centroid). To make possible their study, there exists a formal definition for the concept of center in both cases.…

This is meant to be a survey article for the Cubo Journal. We discuss the existence and number of rational points over a finite field, the Hodge type over the complex numbers, and the motivic conjectures which are controlling those…

Let $f(n,\ell)$ be the maximum integer such that every set of $n$ points in the plane with at most $\ell$ collinear contains a subset of $f(n,\ell)$ points with no three collinear. First we prove that if $\ell \leq O(\sqrt{n})$ then…

We give a new proof of a result of DiPippo and Wan for counting points of bounded height on projective spaces over global function fields. The new proof adapts the geometry of numbers arguments used by Schanuel in the number field case.

We consider point sets in the affine plane $\mathbb{F}_q^2$ where each Euclidean distance of two points is an element of $\mathbb{F}_q$. These sets are called integral point sets and were originally defined in $m$-dimensional Euclidean…

We use three different methods to count the number of lines in the plane whose intersection with a fixed general quintic has fixed cross-ratios. We compare and contrast these methods, shedding light on some classical ideas which underly…

We prove the following generalised empty pentagon theorem: for every integer $\ell \geq 2$, every sufficiently large set of points in the plane contains $\ell$ collinear points or an empty pentagon. As an application, we settle the next…

We consider A-hypergeometric functions associated to normal sets in the plane. We give a classification of all point configurations for which there exists a parameter vector such that the associated hypergeometric function is algebraic. In…

This is a survey on the Fano schemes of linear spaces, conics, rational curves, and curves of higher genera in smooth projective hypersurfaces, complete intersections, Fano threefolds, etc.

We study plane algebraic curves defined over a field k of arbitrary characteristic as coverings of the the projective line and the problem of enumerating branched coverings of $\mathbb{P}^{1}$ by using combinatorial methods.

For a finite field k and a triple of integers g \ge r \ge s \ge 0, we count the number of semilinear endomorphisms of a g-dimensional k-vector space which have rank r and stable rank s. Such endomorphisms show up naturally in the…

In this paper, plane polynomial systems having a singular point attracting all orbits in positive time are classified up to topological equivalence. This is done by assigning a combinatorial invariant to the system (a so-called "feasible…

We consider the problem of counting matchings in planar graphs. While perfect matchings in planar graphs can be counted by a classical polynomial-time algorithm, the problem of counting all matchings (possibly containing unmatched vertices,…

The fundamental theorem of affine geometry is a classical and useful result. For finite-dimensional real vector spaces, the theorem roughly states that a bijective self-mapping which maps lines to lines is affine. In this note we prove…