We present a direct and fairly simple proof of the following incidence bound: Let $P$ be a set of $m$ points and $L$ a set of $n$ lines in ${\mathbb R}^d$, for $d\ge 3$, which lie in a common algebraic two-dimensional surface of degree $D$ that does not contain any 2-flat, so that no 2-flat contains more than $s \le D$ lines of $L$. Then the number of incidences between $P$ and $L$ is $$ I(P,L)=O\left(m^{1/2}n^{1/2}D^{1/2} + m^{2/3}\min\{n,D^{2}\}^{1/3}s^{1/3} + m + n\right). $$ When $d=3$, this improves the bound of Guth and Katz~\cite{GK2} for this special case, when $D$ is not too large.
A supplementary feature of this work is a review, with detailed proofs, of several basic (and folklore) properties of ruled surfaces in three dimensions.
To each affine variety $X$ and $m_1,\ldots,m_k\in \mathbb{C}$ such that no subset of the $m_i$ add to zero, we construct a variety which for $m_1,\ldots,m_k \in \mathbb{N}$ specializes to the closed $(m_1,\ldots,m_k)$-incidence stratum of $Sym^{m_1+\ldots+m_k}X$. These fit into a finite-type family, which is functorial in $X$, and which is topologically a family of $\mathbb{C}$-weighted configuration spaces. We verify our construction agrees with an analogous construction in the Deligne category $Rep(S_{d})$ for $d \in \mathbb{C}$. We next classify the singularity locus and branching behaviour…
We study the probability for a random line to intersect a given plane curve, defined over a finite field, in a given number of points defined over the same field. In particular, we focus on the limits of these probabilities under successive finite field extensions. Supposing absolute irreducibility for the curve, we show how a variant of Chebotarev density theorem for function fields can be used to prove the existence of these limits, and to compute them under a mildly stronger condition, known as simple tangency. Partial results have already appeared in the literature, and we propose this wor…
We describe the package "IncidenceCorrespondenceCohomology" for the computer algebra system Macaulay2. The main feature concerns the computation of characters and dimensions for the cohomology groups of line bundles on the incidence correspondence (the partial flag variety parametrizing pairs consisting of a point in projective space and a hyperplane containing it). Additionally, the package provides tools for (1) computing the multiplication in the graded Han-Monsky representation ring, (2) determining the splitting type of vector bundles of principal parts on the projective line, and (3) tes…
For a finite dimensional vector space V of dimension n, we consider the incidence correspondence (or partial flag variety) X in P(V) x P(V*), parametrizing pairs consisting of a point and a hyperplane containing it. We completely characterize the vanishing and non-vanishing behavior of the cohomology groups of line bundles on X in characteristic p>0. If n=3 then X is the full flag variety of V, and the characterization is contained in the thesis of Griffith from the 70s. In characteristic 0, the cohomology groups are described for all V by the Borel-Weil-Bott theorem. Our strategy is to recast…
Jordan showed that the incidence variety of a smooth cubic surface containing 27 lines has solvable Galois group over the incidence variety of a smooth cubic surface containing 3 skew lines. As noted by Harris, it follows that for any smooth cubic surface, there exist formulas for all 27 lines in terms of any 3 skew lines. In response to a question of Farb, we compute these formulas explicitly. We also discuss how these formulas relate to Schläfli's count of lines on real smooth cubic surfaces.
Cohomology on the incidence correspondence and related questions
Busitema University（布西泰马大学）；Università degli Studi di Genova（热那亚大学）；CIMAT - Centro de Investigación en Matemáticas（墨西哥数学研究中心）；University of Notre Dame（圣母大学）；Institute of Mathematics “Simion Stoilow” of the Romanian Academy（罗马尼亚科学院西蒙·斯托伊洛瓦数学研究所）；Academy of Mathematics and Systems Science, Chinese Academy of Sciences（中国科学院数学与系统科学研究院）
In this article, we consider the decoding problem of Grassmann codes using majority logic. We show that for two points of the Grassmannian, there exists a canonical path between these points once a complete flag is fixed. These paths are used to construct a large set of parity checks orthogonal on a coordinate of the code, resulting in a majority decoding algorithm.
The purpose of this paper is to study the famous Pappus configuration of $9$ lines and its dual arrangement. We show among others that by applying the Pappus Theorem to the dual arrangement we obtain the configuration corresponding to the initial data of beginning configuration. We consider also the Pappus arrangements with some additional incidences and we establish algebraic conditions paralleling with these incidences.
