English
Related papers

Related papers: A Poncelet theorem for lines

200 papers

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

The input to the NP-hard Point Line Cover problem (PLC) consists of a set $P$ of $n$ points on the plane and a positive integer $k$, and the question is whether there exists a set of at most $k$ lines which pass through all points in $P$. A…

Data Structures and Algorithms · Computer Science 2013-07-10 Stefan Kratsch , Geevarghese Philip , Saurabh Ray

In 1640's, Blaise Pascal discovered a remarkable property of a hexagon inscribed in a conic - Pascal Theorem, which gave birth of the projective geometry. In this paper, a new geometric invariant of algebraic curves is discovered by a…

Algebraic Geometry · Mathematics 2015-03-19 Zhongxuan Luo

In this paper we prove a conjecture regarding the form of the Born-Infeld Lagrangian with a U(1)^2n gauge group after the elimination of the auxiliary fields. We show that the Lagrangian can be written as a symmetrized trace of Lorentz…

High Energy Physics - Theory · Physics 2009-10-31 Paolo Aschieri , Daniel Brace , Bogdan Morariu , Bruno Zumino

A matching is compatible to two or more labeled point sets of size $n$ with labels $\{1,\dots,n\}$ if its straight-line drawing on each of these point sets is crossing-free. We study the maximum number of edges in a matching compatible to…

Computational Geometry · Computer Science 2022-09-07 Oswin Aichholzer , Alan Arroyo , Zuzana Masárová , Irene Parada , Daniel Perz , Alexander Pilz , Josef Tkadlec , Birgit Vogtenhuber

A complex matrix is called \emph{coninvolutory} if $T\overline{T}=I$. In this paper, we study decompositions of affine transformations in $\mathrm{Aff}(n,\mathbb{C})=\mathrm{GL}(n,\mathbb{C})\ltimes \mathbb{C}^n$ into products of…

Group Theory · Mathematics 2026-03-12 Sandipan Dutta , Krishnendu Gongopadhyay , Rahul Mondal

We consider the problem of finding an optimal piecewise linear path (polygonal line) connecting two given points with the possibility of making n turns at some points (the absolute value of each turn angle does not exceed a prescribed…

Optimization and Control · Mathematics 2026-05-18 Nefedov V. N

In the generalized Legendre approach, the equation describing an asymptotically locally Euclidean space of type $D_n$ is found to admit an algebraic formulation in terms of the group law on a Weierstrass cubic. This curve has the structure…

Differential Geometry · Mathematics 2008-01-05 Radu A. Ionas

In this paper we give for any integer l > 2 a numerical criterion ensuring the existence of a chain of length l of lines through two general points of an irreducible variety X in P^N, involving the degrees and the number of homogeneous…

Algebraic Geometry · Mathematics 2013-05-28 Simone Marchesi , Alex Massarenti

We consider the ring of invariants of n points on the projective line. The space (P^1)^n // PGL_2 is perhaps the first nontrivial example of a Geometry Invariant Theory quotient. The construction depends on the weighting of the n points.…

Algebraic Geometry · Mathematics 2009-06-16 Ben Howard , John Millson , Andrew Snowden , Ravi Vakil

We show that a realization of a closed connected PL-manifold of dimension n-1 in n-dimensional Euclidean space (n>2) is the boundary of a convex polyhedron (finite or infinite) if and only if the interior of each (n-3)-face has a point,…

Computational Geometry · Computer Science 2007-05-23 Konstantin Rybnikov

In this paper, we deal with the question; under what conditions the points $P_i(xi,yi)$ $(i = 1,\cdots, n)$ form a convex polygon provided $x_1 < \cdots < x_n$ holds. One of the main findings of the paper can be stated as follows: "Let…

Metric Geometry · Mathematics 2024-04-19 Angshuman Robin Goswami , István Szalkai

We show that a large class of site percolation processes on any planar graph contains either zero or infinitely many infinite connected components. The assumptions that we require are: tail triviality, positive association (FKG) and that…

Probability · Mathematics 2026-04-21 Alexander Glazman , Matan Harel , Nathan Zelesko

In the projective plane, we consider congruences of straight lines with the combinatorics of the square grid and with all elementary quadrilaterals possessing touching inscribed conics. The inscribed conics of two combinatorially…

Algebraic Geometry · Mathematics 2019-11-21 Alexander I. Bobenko , Alexander Y. Fairley

A (general) polygonal line tiling is a graph formed by a string of cycles, each intersecting the previous at an edge, no three intersecting. In 2022, Matsushita proved the matching complex of a certain type of polygonal line tiling with…

Combinatorics · Mathematics 2023-03-13 Margaret Bayer , Marija Jelić Milutinović , Julianne Vega

We study convex cyclic polygons, that is, inscribed $n$-gons. Starting from P. Schreiber's idea, published in 1993, we prove that these polygons are not constructible from their side lengths with straightedge and compass, provided $n$ is at…

Algebraic Geometry · Mathematics 2015-02-10 Gábor Czédli , Ádám Kunos

The paper is concerned with families of plane algebraic curves that contain a given and quite special finite set X of points in the projective plane. We focus on the case in which the set X is formed by transversally intersecting pairs of…

Algebraic Geometry · Mathematics 2007-05-23 Gabriel Katz

We prove that for a system of indeterminates (X_a) indiced by the P^2(2), the projective plane over F_2, there exists a 3-3 correspondance compatible with the incidence structures of P^2(2), such that (X_a) is one of the orbits of it. We…

Group Theory · Mathematics 2007-05-23 J. -F. Mestre

We show that, under an additional mild assumption, on the class of generic frontals, any involution whose fixed point set is exactly the same as the fixed point set of the Legendre involution must be the Legendre involution (Theorem 2 in \S…

Differential Geometry · Mathematics 2024-10-30 Takashi Nishimura

We prove that for $n$ sufficiently large, if $A$ is a family of permutations of $\{1,2,\ldots,n\}$ with no two permutations in $\mathcal{A}$ agreeing exactly once, then $|\mathcal{A}| \leq (n-2)!$, with equality holding only if…

Combinatorics · Mathematics 2013-10-31 David Ellis