A note on rich lines in truly high dimensional sets

On the number of rich lines in truly high dimensional sets

We prove a new upper bound on the number of $r$-rich lines (lines with at least $r$ points) in a `truly' $d$-dimensional configuration of points $v_1,\ldots,v_n \in \mathbb{C}^d$. More formally, we show that, if the number of $r$-rich lines is significantly larger than $n^2/r^d$ then there must exist a large subset of the points contained in a hyperplane. We conjecture that the factor $r^d$ can be replaced with a tight $r^{d+1}$. If true, this would generalize the classic Szemerédi-Trotter theorem which gives a bound of $n^2/r^3$ on the number of $r$-rich lines in a planar configuration. This …

关于具有最小临界指数的富序列对称性的注记

A note on symmetries of rich sequences with minimum critical exponent

本文通过三个有限字母表序列的例子，指出在给定序列类中具有最小临界指数的序列展现出高度对称性，即相对于由多个反同态生成的群 G 是 G-rich 的，推广了回文丰富性的概念。

On the number of rich lines in high dimensional real vector spaces

In this short note we use the polynomial partitioning lemma to strengthen a recent result of Dvir and Gopi about the number of rich lines in high dimensional Euclidean spaces. Our result shows that if there are sufficiently many rich lines incident to a set of points then large fraction of them must be contained in a hyperplane.

Orchards in elliptic curves over finite fields

Consider a set of $ n $ points on a plane. A line containing exactly $ 3 $ out of the $ n $ points is called a $ 3 $-rich line. The classical orchard problem asks for a configuration of the $ n $ points on the plane that maximizes the number of $ 3 $-rich lines. In this note, using the group law in elliptic curves over finite fields, we exhibit several (infinitely many) group models for orchards wherein the number of $ 3 $-rich lines agrees with the expected number given by Green-Tao (or, Burr, Grünbaum and Sloane) formula for the maximum number of lines. We also show, using elliptic curves ov…

A Note on Encodings of Phylogenetic Networks of Bounded Level

Driven by the need for better models that allow one to shed light into the question how life's diversity has evolved, phylogenetic networks have now joined phylogenetic trees in the center of phylogenetics research. Like phylogenetic trees, such networks canonically induce collections of phylogenetic trees, clusters, and triplets, respectively. Thus it is not surprising that many network approaches aim to reconstruct a phylogenetic network from such collections. Related to the well-studied perfect phylogeny problem, the following question is of fundamental importance in this context: When does…

Positroids, Plabic Graphs, and Scattering Amplitudes in Mathematica

The many intricate connections between scattering amplitudes, on-shell diagrams, and the positroid stratification of the Grassmannian has recently been described in great detail. In order to facilitate the exploration of this rich correspondence, we have prepared a public Mathematica package called "positroids" which includes an array of useful tools including those for the construction of canonical coordinates for positroid configurations, the drawing of representative on-shell (plabic) graphs, and the evaluation of on-shell differential forms. This note documents the functions made available…