English
Related papers

Related papers: Probabilistic Schubert Calculus

200 papers

We prove that, for every set of $n$ points $\mathcal{P}$ in $\mathbb{R}^2$, a random plane graph drawn on $\mathcal{P}$ is expected to contain less than $n/10.18$ isolated vertices. In the other direction, we construct a point set where the…

Combinatorics · Mathematics 2024-11-14 Neely Lovvorn , Oscar Murillo-Espinoza , Adam Sheffer

We study the PI degree of various quantum algebras at roots of unity, including quantum Grassmannians, quantum Schubert varieties, partition subalgebras, and their associated quantum affine spaces. By a theorem of De Concini and Procesi,…

Quantum Algebra · Mathematics 2023-11-28 Jason P. Bell , Stéphane Launois , Alexandra Rogers

We consider classes $\mathscr{G}^s ([0,1])$ of subsets of $[0,1]$, originally introduced by Falconer, that are closed under countable intersections, and such that every set in the class has Hausdorff dimension at least $s$. We provide a…

Number Theory · Mathematics 2017-09-12 Tomas Persson , Henry W. J. Reeve

Let $X_1,\ldots,X_n$ be a standard normal sample in $\mathbb R^d$. We compute exactly the expected volume of the Gaussian polytope $\mathrm{conv}[X_1,\ldots,X_n]$, the symmetric Gaussian polytope $\mathrm{conv}[\pm X_1,\ldots,\pm X_n]$, and…

Probability · Mathematics 2017-06-27 Zakhar Kabluchko , Dmitry Zaporozhets

We prove that with high probability over the choice of a random graph $G$ from the Erd\H{o}s-R\'enyi distribution $G(n,1/2)$, the $n^{O(d)}$-time degree $d$ Sum-of-Squares semidefinite programming relaxation for the clique problem will give…

Computational Complexity · Computer Science 2016-04-13 Boaz Barak , Samuel B. Hopkins , Jonathan Kelner , Pravesh K. Kothari , Ankur Moitra , Aaron Potechin

In a graph $G$, a geodesic between two vertices $x$ and $y$ is a shortest path connecting $x$ to $y$. A subset $S$ of the vertices of $G$ is in general position if no vertex of $S$ lies on any geodesic between two other vertices of $S$. The…

Combinatorics · Mathematics 2019-07-23 Balázs Patkós

An elementary combinatorial technique for computing lower bounds for the Yang indices of real Stiefel manifolds and oriented real Grassmannians is described. As a demonstration, it shown that the Yang index of $St(n,k)$, and consequently…

Algebraic Topology · Mathematics 2025-09-09 James Dibble

A continuous map $\mathbb{C}^n\to Gr(\tau, N)$ is $k$-regular if the $\tau$-dimensional subspaces corresponding to images of any $k$ distinct points span a $\tau k$-dimensional space. For $\tau = 1$ this essentially recovers the classical…

Algebraic Geometry · Mathematics 2024-09-19 Joachim Jelisiejew , Hanieh Keneshlou

We study the complexity of learning $k$-mixtures of Gaussians ($k$-GMMs) on $\mathbb{R}^d$. This task is known to have complexity $d^{\Omega(k)}$ in full generality. To circumvent this exponential lower bound on the number of components,…

Machine Learning · Computer Science 2025-04-22 Ilias Diakonikolas , Daniel M. Kane , Sushrut Karmalkar , Jasper C. H. Lee , Thanasis Pittas

As a variant of the celebrated Szemer\'edi--Trotter theorem, Guth and Katz proved that $m$ points and $n$ lines in $\mathbb{R}^3$ with at most $\sqrt{n}$ lines in a common plane must determine at most $O(m^{1/2}n^{3/4})$ incidences for…

Combinatorics · Mathematics 2024-08-30 Andrew Suk , Ji Zeng

We establish an inclusion relation between two uniform models of random $k$-graphs (for constant $k \ge 2$) on $n$ labeled vertices: $\mathbb G^{(k)}(n,m)$, the random $k$-graph with $m$ edges, and $\mathbb R^{(k)}(n,d)$, the random…

Combinatorics · Mathematics 2019-11-12 Andrzej Dudek , Alan Frieze , Andrzej Ruciński , Matas Šileikis

Learning a Gaussian mixture model (GMM) is a fundamental problem in machine learning, learning theory, and statistics. One notion of learning a GMM is proper learning: here, the goal is to find a mixture of $k$ Gaussians $\mathcal{M}$ that…

Data Structures and Algorithms · Computer Science 2015-06-04 Jerry Li , Ludwig Schmidt

Consider a uniformly distributed random linear subspace $L$ and a stochastically independent random affine subspace $E$ in $\mathbb{R}^n$, both of fixed dimension. For a natural class of distributions for $E$ we show that the intersection…

Metric Geometry · Mathematics 2024-04-23 Emil Dare , Markus Kiderlen , Christoph Thaele

We consider configurations of lines in 3-space with incidences prescribed by a graph. This defines a subvariety in a product of Grassmannians. Leveraging a connection with rigidity theory in the plane, for any graph, we determine the…

Combinatorics · Mathematics 2025-11-27 Benjamin Hollering , Elia Mazzucchelli , Matteo Parisi , Bernd Sturmfels

We prove that the Schubert structure constants of the quantum K-theory rings of symplectic Grassmannians of lines have signs that alternate with codimension and vanish for degrees at least 3. We also give closed formulas that characterize…

Algebraic Geometry · Mathematics 2024-02-20 Vladimiro Benedetti , Nicolas Perrin , Weihong Xu

We consider random sub-graphs of a fixed graph $G=(V,E)$ with large minimum degree. We fix a positive integer $k$ and let $G_k$ be the random sub-graph where each $v\in V$ independently chooses $k$ random neighbors, making $kn$ edges in…

Combinatorics · Mathematics 2014-05-12 Alan Frieze , Tony Johansson

We consider the Grassman manifold $G(E)$ as the subset of all orthogonal projections of a given Euclidean space $E$ and obtain some explicit formulas concerning the differential geometry of $G(E)$ as a submanifold of $L(E,E)$ endowed with…

Differential Geometry · Mathematics 2021-01-26 Armando Machado , Isabel Salavessa

In quantum field theory study, Grassmannian manifolds $\text{Gr}(4,n)$ are closely related to $D{=}4$ kinematics input for $n$-particle scattering processes, whose combinatorial and geometrical structures have been widely applied in…

Mathematical Physics · Physics 2024-09-10 Jian-Rong Li , Changjian Su , Qinglin Yang

Let $\lambda_1(G)\ge \lambda_2(G)\ge \cdots \ge \lambda_n(G)$ denote the adjacency eigenvalues of a graph $G$ of order $n$. We prove that for every $k\geq 2$ and every graph $G$ on $n\geq k$ vertices, $$ \lambda_k(G)\le…

Combinatorics · Mathematics 2026-04-01 Tanay Wakhare

Let $m>1$ be an integer, and let $I(\mathbb{Z}_m)^*$ be the set of all non-zero proper ideals of $\mathbb{Z}_m$. The intersection graph of ideals of $\mathbb{Z}_m$, denoted by $G(\mathbb{Z}_m)$, is a graph with vertices $I(\mathbb{Z}_m)^*$…

Commutative Algebra · Mathematics 2017-03-06 Soheila Khojasteh