English
Related papers

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

200 papers

Over the complex numbers, there are 92 plane conics meeting 8 general lines in projective 3-space. Using the Euler class and local degree from motivic homotopy theory, we give an enriched version of this result over any perfect field. This…

Algebraic Geometry · Mathematics 2023-06-01 Cameron Darwin , Aygul Galimova , Miao Pam Gu , Stephen McKean

A fundamental problem in the theory of linearized and projective polynomials over finite fields is to characterize the number of roots in the coefficient field directly from the coefficients. We prove results of this type, of a recursive…

Number Theory · Mathematics 2019-04-11 Gary McGuire , John Sheekey

We give upper and lower bounds on the maximum and minimum number of geometric configurations of various kinds present (as subgraphs) in a triangulation of $n$ points in the plane. Configurations of interest include \emph{convex polygons},…

Combinatorics · Mathematics 2015-09-22 Adrian Dumitrescu , Maarten Löffler , André Schulz , Csaba D. Tóth

For various triple systems $F$, we give tight lower bounds on the number of copies of $F$ in a triple system with a prescribed number of vertices and edges. These are the first such results for hypergraphs, and extend earlier theorems of…

Combinatorics · Mathematics 2009-05-14 Dhruv Mubayi

A topological drawing of a graph is fan-planar if for each edge $e$ the edges crossing $e$ form a star and no endpoint of $e$ is enclosed by $e$ and its crossing edges. A fan-planar graph is a graph admitting such a drawing. Equivalently,…

Discrete Mathematics · Computer Science 2021-07-16 Michael Kaufmann , Torsten Ueckerdt

A covering path for a planar point set is a path drawn in the plane with straight-line edges such that every point lies at a vertex or on an edge of the path. A covering tree is defined analogously. Let $\pi(n)$ be the minimum number such…

Computational Geometry · Computer Science 2023-03-09 Ahmad Biniaz

Topological drawings are representations of graphs in the plane, where vertices are represented by points, and edges by simple curves connecting the points. A drawing is simple if two edges intersect at most in a single point, either at a…

Computational Geometry · Computer Science 2022-09-08 Alfredo García , Alexander Pilz , Javier Tejel

A conjecture widely attributed to Neumann is that all finite non-desarguesian projective planes contain a Fano subplane. In this note, we show that any finite projective plane of even order which admits an orthogonal polarity contains a…

Combinatorics · Mathematics 2015-10-21 Michael Tait

We explore various techniques for counting the number of straight-edge crossing-free graphs that can be embedded on a planar point set. In particular, we derive a lower bound on the ratio of the number of such graphs with $m+1$ edges to the…

Combinatorics · Mathematics 2019-05-24 Siddharth Prasad

We determine those maps between affine or projective spaces that are linear in the abstract sense of transforming collinear points into collinear points and whose restriction to any line is constant or injective. Our results are extensions…

Algebraic Geometry · Mathematics 2023-07-28 Juan B. Sancho de Salas

We investigate Fano varieties defined over a number field that contain subvarieties whose number of rational points of bounded height is comparable to the total number on the variety.

Number Theory · Mathematics 2017-03-23 T. D. Browning , D. Loughran

We classify fields having finitely many finite non-commutative (not necessarily central) division algebras over them. In the process, we introduce the notion of anti-closure of a field and also make comments on fields having a linear…

Rings and Algebras · Mathematics 2023-09-18 Snehinh Sen

The problem of constructing curves with many points over finite fields has received considerable attention in the recent years. Using the class field theory approach, we construct new examples of curves ameliorating some of the known…

Number Theory · Mathematics 2016-11-16 Pavel Solomatin

Assuming PFA, every uncountable subset E of the plane meets some C^1 arc in an uncountable set. This is not provable from MA(aleph_1), although in the case that E is analytic, this is a ZFC result. The result is false in ZFC for C^2 arcs,…

General Topology · Mathematics 2009-06-16 Joan E. Hart , Kenneth Kunen

In this paper we study the number of finite topologies on an $n$-element set subject to various restrictions.

Combinatorics · Mathematics 2024-01-02 Eldar Fischer , Johann A. Makowsky

In this paper we consider an elementary, and largely unexplored, combinatorial problem in low-dimensional topology. Consider a real 2-dimensional compact surface $S$, and fix a number of points $F$ on its boundary. We ask: how many…

Geometric Topology · Mathematics 2016-02-01 Norman Do , Musashi A. Koyama , Daniel V. Mathews

Let ${\cal B}$ be a nontrivial biplane of order $k-2$ represented by symmetric canonical incidence matrix with trace $1+ \binom{k}{2}$. We proved that ${\cal B}$ includes a partially balanced incomplete design with association scheme of…

Combinatorics · Mathematics 2014-01-22 Ivica Martinjak

These notes are intended as an easy-to-read supplement to part of the background material presented in my talks on enumerative geometry. In particular, the numbers $n_3$ and $n_4$ of plane rational cubics through eight points and of plane…

Algebraic Geometry · Mathematics 2007-05-23 Aleksey Zinger

In the projective plane over a finite field of characteristic not equal to 2, we compute the probability that a randomly selected pair of distinct conics $(\mathscr{A},\mathscr{B})$, with $\mathscr{A}$ smooth or singular and $\mathscr{B}$…

Algebraic Geometry · Mathematics 2026-03-17 Milena Radnović , Ruzzel Ragas

This paper explores and proves the one-seventh area triangle using a purely algebraic approach as opposed to a geometric one. A triangle set purely in the complex plane is used so that we can utilise features of the complex number system to…

General Mathematics · Mathematics 2025-10-21 Mathew Miltonhardy