English
Related papers

Related papers: Ovals and Hyperovals in Desarguesian Nets

200 papers

A configuration of 7 points in RP2 is called typical if it has no collinear triples and no coconic sextuples of points. We show that there exist 14 deformation classes of such configurations. This yields classification of real Aronhold…

Algebraic Geometry · Mathematics 2015-07-29 Sergey Finashin , Remziye Arzu Zabun

An ordinary hypersphere of a set of points in real $d$-space, where no $d+1$ points lie on a $(d-2)$-sphere or a $(d-2)$-flat, is a hypersphere (including the degenerate case of a hyperplane) that contains exactly $d+1$ points of the set.…

Combinatorics · Mathematics 2021-02-11 Aaron Lin , Konrad Swanepoel

Let $\mathrm{PG}(n-1,q)$ denote the $(n-1)$-dimensional projective space over $\mathbb{F}_q$. We investigate the intersection of two Desarguesian $(h-1)$-spreads of $\mathrm{PG}(kh-1,q)$ and show that it is determined by a subgeometry over…

Combinatorics · Mathematics 2026-05-22 Antonio Cossidente , Giuseppe Marino , Francesco Pavese , Paolo Santonastaso , John Sheekey

We classify the orbits of nets of conics under the action of the projective linear group and we determine the specializations of these orbits, using geometric and algebraic methods. We study related geometric questions, as the…

Algebraic Geometry · Mathematics 2022-08-10 Nancy Abdallah , Jacques Emsalem , Anthony Iarrobino

Multinets are certain configurations of lines and points with multiplicities in the complex projective plane P2. They are used in the studies of resonance and characteristic varieties of complex hyperplane arrangement complements and…

Algebraic Geometry · Mathematics 2018-10-10 Jeremiah Bartz , Sergey Yuzvinsky

A \v{S}olt\'es' hypergraph is a hypergraph for which the removal of any of its vertices does not change its total distance. We prove that every uniform \v{S}olt\'es' hypergraph has order at least $10$, there exist uniform \v{S}olt\'es'…

Combinatorics · Mathematics 2025-06-10 Stijn Cambie , Ajay Tiwari

A classical conjecture of Erd\H{o}s and S\'os asks to determine the Tur\'an number of a tree. We consider variants of this problem in the settings of hypergraphs and multi-hypergraphs. In particular, for all $k$ and $r$, with $r \ge k…

Combinatorics · Mathematics 2020-04-16 Ervin Győri , Nika Salia , Casey Tompkins , Oscar Zamora

A new mneumonic device is shown to emerge in connection with O(7) numerical tensors exhibiting duality and reflecting the natural 7=(4+3) splitting of 7-dimensional space. Then Desargues' and Pappus' theorems are shown to be connected…

High Energy Physics - Theory · Physics 2007-05-23 Sultan Catto

Orthogonal spreads in orthogonal spaces of type $V^+(2n+2,2)$ produce large numbers of rank $n$ dual hyperovals in orthogonal spaces of type $V^+(2n,2)$. The construction resembles the method for obtaining symplectic spreads in $V(2n,q)$…

Combinatorics · Mathematics 2014-04-15 Ulrich Dempwolff , William M. Kantor

In the paper, we study special configurations of lines and points in the complex projective plane, so called k-nets. We describe the role of these configurations in studies of cohomology on arrangement complements. Our most general result…

Combinatorics · Mathematics 2016-09-07 Sergey Yuzvinsky

A k-arc in a Dearguesian projective plane whose secants meet some external line in k-1 points is said to be hyperfocused. Hyperfocused arcs are investigated in connection with a secret sharing scheme based on geometry due to Simmons. In…

Combinatorics · Mathematics 2007-05-23 Massimo Giulietti , Elisa Montanucci

The problem of determining the {\it Bonnet hypersurfaces in} $R^{n+1}$, for $n>1$, is studied here. These hypersurfaces are by definition those that can be isometrically mapped to another hypersurface or to itself (as locus) by at least one…

Differential Geometry · Mathematics 2007-05-23 Hulya Bagdatli , Ziya Soyucok

We construct convex bodies that can be "captured by nets." More precisely, for each dimension $n \geq 2$, we construct a family of Riemannian $n$-spheres, each with a stable geodesic net, which is a stable 1-dimensional integral varifold.…

Differential Geometry · Mathematics 2023-12-01 Herng Yi Cheng

Over a decade ago, it was shown that every edge unfolding of the Platonic solids was without self-overlap, yielding a valid net. We consider this property for regular polytopes in arbitrary dimensions, notably the simplex, cube, and…

Computational Geometry · Computer Science 2021-11-03 Satyan L. Devadoss , Matthew Harvey

A lower bound on the minimum degree of the plane algebraic curves containing every point in a large point-set $K$ of the Desarguesian plane $PG(2,q)$ is obtained. The case where $K$ is a maximal $(k,n)$-arc is considered to greater extent.

Combinatorics · Mathematics 2009-07-18 A. Aguglia , L. Giuzzi , G. Korchmaros

The Tur\'an hypergraph problem asks to find the maximum number of $r$-edges in a $r$-uniform hypergraph on $n$ vertices that does not contain a clique of size $a$. When $r=2$, i.e., for graphs, the answer is well-known and can be found in…

Combinatorics · Mathematics 2016-10-14 Annie Raymond

Having in mind their potential quantum physical applications, we classify all geometric hyperplanes of the near hexagon that is a direct product of a line of size three and the generalized quadrangle of order two. There are eight different…

Mathematical Physics · Physics 2009-12-07 Metod Saniga , Peter Levay , Michel Planat , Petr Pracna

This work is, in part, a generalization of the article by A.A. Bruen ,T.C Bruen and J.M.McQuillan on Desargues Theorem in arXiv:2007.09175[mathCO]July 17,2020. We prove the extension of Desargues theorem in all dimensions, using 4 different…

Combinatorics · Mathematics 2023-02-08 Aiden A Bruen

Let A be an n by d matrix having full rank n. An orthogonal dual A^{\perp} of A is a (d-n) by d matrix of rank (d-n) such that every row of A^{\perp} is orthogonal (under the usual dot product) to every row of A. We define the orthogonal…

Combinatorics · Mathematics 2012-01-31 Joseph P. S. Kung , Hal Schenck

An $r$-uniform linear cycle of length $\ell$, denoted by $C^r_{\ell}$, is an $r$-graph with $\ell$ edges $e_1,e_2,\dots,e_{\ell}$ where $e_i=\{v_{(r-1)(i-1)},v_{(r-1)(i-1)+1},\dots,v_{(r-1)i}\}$ (here $v_0=v_{(r-1)\ell}$). For $0<\delta<1$…

Combinatorics · Mathematics 2025-04-10 Lirong Deng , Jie Han , Jiaxi Nie , Sam Spiro