Related papers: Probabilistic Schubert Calculus
The Euler characteristic of a very affine variety encodes the algebraic complexity of solving likelihood (or scattering) equations on this variety. We study this quantity for the Grassmannian with $d$ hyperplane sections removed. We provide…
We investigate the geometrical structure of probabilistic generative dimensionality reduction models using the tools of Riemannian geometry. We explicitly define a distribution over the natural metric given by the models. We provide the…
Given $mp$ different $p$-planes in general position in $(m+p)$-dimensional space, a classical problem is to ask how many $p$-planes intersect all of them. For example when $m = p = 2$, this is precisely the question of "lines meeting four…
Let $G$ be a random graph on the vertex set $\{1,2,..., n\}$ such that edges in $G$ are determined by independent random indicator variables, while the probability $p_{ij}$ for $\{i,j\}$ being an edge in $G$ is not assumed to be equal.…
The Kakeya problem in $\mathbb{R}^n$ is about estimating the size of union of $k$-planes; the projection problem in $\mathbb{R}^n$ is about estimating the size of projection of a set onto every $k$-plane ($1\le k\le n-1$). The $k=1$ case…
This article gives an invariant representation of the curvature of a plane wave spacetime in terms of the Schwarzian of a curve in the Lagrangian Grassmannian. It develops a general theory of cross ratios and Schwarzians of curves in what…
This expository monograph cuts a short path from the common, elementary background in geometry (linear algebra, vector bundles, and algebraic ideals) to the most advanced theorems about involutive exterior differential systems: (1) The…
We provide formulas for the degrees of the projections of the locus of square matrices with given rank from linear spaces spanned by a choice of matrix entries. The motivation for these computations stem from applications to `matrix…
We give an exact formula for the value of the derivative at zero of the gap probability in finite n x n Gaussian ensembles. As n goes to infinity our computation provides an asymptotic (with an explicit constant) of the order n^(1/2). As a…
The finite Grassmannian $\mathcal{G}_{q}(k,n)$ is defined as the set of all $k$-dimensional subspaces of the ambient space $\mathbb{F}_{q}^{n}$. Subsets of the finite Grassmannian are called constant dimension codes and have recently found…
Defining distances over finite fields formally by $||x-y||:=(x_1-y_1)^2+\cdots + (x_d-y_d)^2$ for $x,y\in \mathbb{F}_q^d$, distance problems naturally arise in analogy to those studied by Erd\H{o}s and Falconer in Euclidean space. Given a…
Given a set of points in the plane, the \textsc{General Position Subset Selection} problem is that of finding a maximum-size subset of points in general position, i.e., with no three points collinear. The problem is known to be ${\rm…
Let $\sigma$ be a simple involution of an algebraic semisimple group $G$ and let $H$ be the subgroup of $G$ of points fixed by $\sigma$. If the restricted root system is of type $A$, $C$ or $BC$ and $G$ is simply connected or if the…
A bipartite graph $G$ is semi-algebraic in $\mathbb{R}^d$ if its vertices are represented by point sets $P,Q \subset \mathbb{R}^d$ and its edges are defined as pairs of points $(p,q) \in P\times Q$ that satisfy a Boolean combination of a…
A classical open problem in combinatorial geometry is to obtain tight asymptotic bounds on the maximum number of k-level vertices in an arrangement of n hyperplanes in d dimensions (vertices with exactly k of the hyperplanes passing below…
We consider a set of generators for the space of Eisenstein series of even weight $k$ for any congruence group $\Gamma$ and study the set of all of their zeros taken for $\Gamma(1)$-conjugates of $\Gamma$ in the standard fundamental domain…
A random geometric digraph $G_n$ is constructed by taking $\{X_1,X_2,... X_n\}$ in $\mathbb{R}^2$ independently at random with a common bounded density function. Each vertex $X_i$ is assigned at random a sector $S_i$ of central angle…
The main result of this announcement is a formula for the tensor product of the class of a homogeneous line bundle with a Schubert class, expressed as a K(X)-linear combination of Schubert classes. We believe that this formula is the most…
We compute the expectation of the number of linear spaces on a random complete intersection in $p$-adic projective space. Here "random" means that the coefficients of the polynomials defining the complete intersections are sampled uniformly…
Motivated by questions of manifold learning, we study a sequence of random manifolds, generated by embedding a fixed, compact manifold $M$ into Euclidean spheres of increasing dimension via a sequence of Gaussian mappings. One of the…