中文
相关论文

相关论文: Sylvester-Gallai for Arrangements of Subspaces

200 篇论文

A Sylvester-Gallai (SG) configuration is a finite set S of points such that the line through any two points in S contains a third point of S. According to the Sylvester-Gallai Theorem, an SG configuration in real projective space must be…

度量几何 · 数学 2007-05-23 Noam Elkies , Lou M. Pretorius , Konrad J. Swanepoel

In this paper, we prove the following non-linear generalization of the classical Sylvester-Gallai theorem. Let $\mathbb{K}$ be an algebraically closed field of characteristic $0$, and $\mathcal{F}=\{F_1,\cdots,F_m\} \subset…

交换代数 · 数学 2023-10-09 Rafael Oliveira , Akash Kumar Sengupta

We prove a variant of the Sylvester-Gallai theorem for cubics (algebraic curves of degree three): If a finite set of sufficiently many points in $\mathbb{R}^2$ is not contained in a cubic, then there is a cubic that contains exactly nine of…

组合数学 · 数学 2022-01-04 Alex Cohen , Frank de Zeeuw

We prove a robust generalization of a Sylvester-Gallai type theorem for quadratic polynomials, generalizing the result in [S'20]. More precisely, given a parameter $0 < \delta \leq 1$ and a finite collection $\mathcal{F}$ of irreducible and…

离散数学 · 计算机科学 2022-03-11 Abhibhav Garg , Rafael Oliveira , Akash Sengupta

The Sylvester-Gallai theorem says that for any finite set of non-collinear points in $\R^2$, there is some line passing through exactly two points of the set. Over the complex numbers, this theorem fails: there are finite configurations…

组合数学 · 数学 2025-09-01 Alex Cohen

The Sylvester-Gallai theorem states that for a finite set of points in the plane, if every line determined by any two of these points also contains a third, then the set is necessarily made of collinear points. In this paper, we first…

组合数学 · 数学 2025-12-17 Imre Barany , Julia Q. Du , Dan Schwarz , Liping Yuan , Tudor Zamfirescu

We prove Sylvester-Gallai type theorems for quadratic polynomials. Specifically, we prove that if a finite collection $\mathcal Q$, of irreducible polynomials of degree at most $2$, satisfy that for every two polynomials $Q_1,Q_2\in…

组合数学 · 数学 2020-08-12 Amir Shpilka

In this work, we extend the robust version of the Sylvester-Gallai theorem, obtained by Barak, Dvir, Wigderson and Yehudayoff, and by Dvir, Saraf and Wigderson, to the case of quadratic polynomials. Specifically, we prove that if…

计算几何 · 计算机科学 2022-02-11 Shir Peleg , Amir Shpilka

We give an exact criterion of a conjecture of L.M.Kelly to hold true which is stated as follows. If there is a finite family $\Sigma$ of mutually skew lines in $\mathbb{R}^l,l\geq 4$ such that the three dimensional affine span (hull) of…

组合数学 · 数学 2022-05-04 C P Anil Kumar , Anoop Singh

In this article, we show the existence of large sets $\operatorname{LS}_2[3](2,k,v)$ for infinitely many values of $k$ and $v$. The exact condition is $v \geq 8$ and $0 \leq k \leq v$ such that for the remainders $\bar{v}$ and $\bar{k}$ of…

组合数学 · 数学 2025-10-02 Michael Kiermaier , Reinhard Laue , Alfred Wassermann

Our point of departure is the following simple common generalisation of the Sylvester-Gallai theorem and the Motzkin-Rabin theorem: Let S be a finite set of points in the plane, with each point coloured red or blue or with both colours.…

组合数学 · 数学 2009-03-12 L. M. Pretorius , K. J. Swanepoel

We study a non-trivial extreme case of the orchard problem for $12$ pseudolines and we provide a complete classification of pseudoline arrangements having $19$ triple points and $9$ double points. We have also classified those that can be…

组合数学 · 数学 2023-01-10 Jürgen Bokowski , Piotr Pokora

Three $k$-dimensional subspaces $A$, $B$, and $C$ of an $n$-dimensional vector space $V$ over a finite field are called a $3$-cluster if $A \cap B \cap C = \{\mathbf{0}_V\}$ and yet $\dim(A+B+C) \leq 2k$. A special kind of $3$-cluster,…

组合数学 · 数学 2024-03-11 Gabriel Currier , Shahriar Shahriari

We study finite systems of subspaces of a complex Hilbert space such that each pair of subspaces satisfies a certain condition as described in the following. For each subspace excepting the first one an angle between this subspace and the…

泛函分析 · 数学 2012-01-18 Ivan Feshchenko , Alexander Strelets

We introduce the theory of div point sets, which aims to provide a framework to study the combinatoric nature of any set of points in general position on an Euclidean plane. We then show that proving the unsatisfiability of some first-order…

组合数学 · 数学 2019-09-02 Archy Will He

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…

组合数学 · 数学 2015-05-12 Benjamin Anzis , Stefan Tohaneanu

We study the rank of complex sparse matrices in which the supports of different columns have small intersections. The rank of these matrices, called design matrices, was the focus of a recent work by Barak et. al. (BDWY11) in which they…

组合数学 · 数学 2012-11-05 Zeev Dvir , Shubhangi Saraf , Avi Wigderson

We present some elementary ideas to prove the following Sylvester-Gallai type theorems involving incidences between points and lines in the planes over the complex numbers and quaternions. (1) Let A and B be finite sets of at least two…

组合数学 · 数学 2009-03-12 Jozsef Solymosi , Konrad J. Swanepoel

Let K be a field admitting a cyclic Galois extension of degree n. The main result of this paper is a decomposition theorem for the space of alternating bilinear forms defined on a vector space of odd dimension n over K. We show that this…

交换代数 · 数学 2007-09-07 Rod Gow , Rachel Quinlan

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…

度量几何 · 数学 2014-02-25 Xiaomin Chen , Guangda Huzhang , Peihan Miao , Kuan Yang
‹ 上一页 1 2 3 10 下一页 ›