English
Related papers

Related papers: Enumeration of points, lines, planes, etc

200 papers

In trying to generalize the classic Sylvester-Gallai theorem and De Bruijn-Erd\H{o}s theorem in plane geometry, lines and closure lines were previously defined for metric spaces and hypergraphs. Both definitions do not obey the geometric…

Metric Geometry · Mathematics 2014-02-25 Xiaomin Chen , Guangda Huzhang , Peihan Miao , Kuan Yang

We prove that in every direction in the Euclidean plane, there exists a line containing no double exponential time random (ee-random) points. This means each point on these lines has an algorithmically predictable location, to the extent…

Computational Complexity · Computer Science 2025-09-25 Neil Lutz , Spencer Park Martin , Rain White

Denote by $M_n(K)$ the algebra of $n$ by $n$ matrices with entries in the field $K$. A theorem of Albert and Muckenhoupt states that every trace zero matrix of $M_n(K)$ can be expressed as $AB-BA$ for some pair $(A,B)$ of matrices of…

Rings and Algebras · Mathematics 2014-07-16 Clément de Seguins Pazzis

Several tools have been developed to enhance automation of theorem proving in the 2D plane. However, in 3D, only a few approaches have been studied, and to our knowledge, nothing has been done in higher dimensions. In this paper, we present…

Computational Geometry · Computer Science 2022-01-04 Pascal Schreck , Nicolas Magaud , David Braun

We give a quintet of proofs resulting from questions posed by Erd\H{o}s. These questions concern ordinary lines in planar point sets, sequences with uniformly small exponential sums, $K_4$-free $4$-critical graphs with few chords in any…

Combinatorics · Mathematics 2026-04-09 Boris Alexeev , Moe Putterman , Mehtaab Sawhney , Mark Sellke , Gregory Valiant

The aim of this paper is to investigate an attempt to build a binary classification algorithm using principles of geometry such as vectors, planes, and vector algebra. The basic idea behind the proposed algorithm is that a hyperplane can be…

Machine Learning · Computer Science 2025-03-04 Vatsal Srivastava

Let $(P,E)$ be a $(d+1)$-uniform geometric hypergraph, where $P$ is an $n$-point set in general position in $\mathbb{R}^d$ and $E\subseteq {P\choose d+1}$ is a collection of $\epsilon{n\choose d+1}$ $d$-dimensional simplices with vertices…

Combinatorics · Mathematics 2024-03-04 Natan Rubin

The paper is devoted to a somewhat idiosyncratic account of the theorem of de Bruijn-Erd\"{o}s and Hanani from the combinatorics of finite geometries and its various proofs. Among the proofs discussed are the original proofs by de…

Combinatorics · Mathematics 2017-05-31 Nikolai V. Ivanov

The Big-Line-Big-Clique Conjecture of Kara, Por and Wood asserts that, for every fixed $k$ and $\ell$, every sufficiently large finite planar point set contains either $k$ collinear points or $\ell$ pairwise visible points. We prove a…

Combinatorics · Mathematics 2026-05-05 Sohail Sarkar

For a finite point set $E\subset \mathbb{R}^d$ and a connected graph $G$ on $k+1$ vertices, we define a $G$-framework to be a collection of $k + 1$ points in E such that the distance between a pair of points is specified if the…

Combinatorics · Mathematics 2018-05-22 A. Iosevich , J. Passant

It is shown that $n$ points and $e$ lines in the complex Euclidean plane ${\mathbb C}^2$ determine $O(n^{2/3}e^{2/3}+n+e)$ point-line incidences. This bound is the best possible, and it generalizes the celebrated theorem by Szemer\'edi and…

Combinatorics · Mathematics 2015-07-10 Csaba D. Toth

According to Suk's breakthrough result on the Erdos-Szekeres problem, any point set in general position in the plane, which has no $n$ elements that form the vertex set of a convex $n$-gon, has at most $2^{n+O\left({n^{2/3}\log n}\right)}$…

Combinatorics · Mathematics 2020-08-04 Andreas F. Holmsen , Hossein Nassajian Mojarrad , János Pach , Gábor Tardos

We introduce a novel concept of rank for subsets of finite metric spaces E^n_q (the set of all n-dimensional vectors over an alphabet of size q) equipped with the Hamming distance, where the rank R(A) of a subset A is defined as the number…

Discrete Mathematics · Computer Science 2025-06-17 Jamolidin K. Abdurakhmanov

For each pair $(Q_i,Q_j)$ of reference points and each real number $r$ there is a unique hyperplane $h \perp Q_iQ_j$ such that $d(P,Q_i)^2 - d(P,Q_j)^2 = r$ for points $P$ in $h$. Take $n$ reference points in $d$-space and for each pair…

Combinatorics · Mathematics 2010-01-26 Thomas Zaslavsky

For non-amenable finitely generated virtually free groups, we show that the combinatorial Euler characteristic introduced by Emerson and Meyer is the preimage of the K-theory class of higher Kazhdan projections under the Baum-Connes…

Operator Algebras · Mathematics 2025-07-29 Sanaz Pooya , Baiying Ren , Hang Wang

We show a general result known as the Erdos_Sos Conjecture: if $E(G)>{1/2}(k-1)n$ where $G$ has order $n$ then $G$ contains every tree of order $k+1$ as a subgraph.

Discrete Mathematics · Computer Science 2010-08-02 Jesse Gilbert

Given a rank 3 real arrangement $\mathcal A$ of $n$ lines in the projective plane, the Dirac-Motzkin conjecture (proved by Green and Tao in 2013) states that for $n$ sufficiently large, the number of simple intersection points of $\mathcal…

Combinatorics · Mathematics 2015-05-12 Benjamin Anzis , Stefan Tohaneanu

Consider moduli schemes of vector bundles over a smooth projective curve endowed with parabolic structures over a marked point. Boden and Hu observed that a slight variation of the weights leads to a desingularisation of the moduli scheme,…

Algebraic Geometry · Mathematics 2007-05-23 Norbert Hoffmann

We consider arrangements of n hyperplanes of codimension one in a real projective space of dimension d. Let us denote by F the maximal possible number f of connected components of the complement in the projective space of dimension d to the…

Combinatorics · Mathematics 2015-01-06 I. Shnurnikov

We show that if $E \subset \mathbb{F}_q^d$, the $d$-dimensional vector space over the finite field with $q$ elements, and $|E| \geq \rho q^d$, where $ q^{-\frac{1}{2}}\ll \rho \leq 1$, then $E$ contains an isometric copy of at least $c…

Combinatorics · Mathematics 2010-09-22 David Covert , Derrick Hart , Alex Iosevich , Steven Senger , Ignacio Uriarte-Tuero
‹ Prev 1 3 4 5 6 7 10 Next ›