English
Related papers

Related papers: Probabilistic Schubert Calculus

200 papers

Let $G$ be an intersection graph of $n$ geometric objects in the plane. We show that a maximum matching in $G$ can be found in $O(\rho^{3\omega/2}n^{\omega/2})$ time with high probability, where $\rho$ is the density of the geometric…

Computational Geometry · Computer Science 2024-05-02 Édouard Bonnet , Sergio Cabello , Wolfgang Mulzer

The rank $n$ swapping algebra is the Poisson algebra defined on the ordered pairs of points on a circle using the linking numbers, where a subspace of $(\mathbb{K}^n \times \mathbb{K}^{n*})^r/\operatorname{GL}(n,\mathbb{K})$ is its…

Differential Geometry · Mathematics 2020-09-04 Zhe Sun

We establish a combinatorial connection between the real geometry and the $K$-theory of complex Schubert curves $S(\lambda_\bullet)$, which are one-dimensional Schubert problems defined with respect to flags osculating the rational normal…

Combinatorics · Mathematics 2016-09-13 Maria Monks Gillespie , Jake Levinson

We prove two estimates for the expectation of the exponential of a complex function of a random permutation or subset. Using this theory, we find asymptotic expressions for the expected number of copies and induced copies of a given graph…

Combinatorics · Mathematics 2021-07-01 Catherine Greenhill , Mikhail Isaev , Brendan D. McKay

Given positive integers n and m, and a probability measure P on {0, 1, ..., m} the random intersection graph G(n,m,P) on vertex set V = {1,2, ..., n} and with attribute set W = {w_1, w_2, ..., w_m} is defined as follows. Let S_1, S_2, ...,…

Combinatorics · Mathematics 2017-12-15 Mindaugas Bloznelis , Valentas Kurauskas

We derive normal approximation bounds for generalized $U$-statistics of the form \begin{equation*} S_{n,k}(f):=\sum_{ 1 \leq \beta (1),\dots,\beta (k) \leq n \atop \beta (i)\ne\beta (j), \ 1\leq i\ne j \leq k} f\big(X_{\beta…

Probability · Mathematics 2025-11-12 Qingwei Liu , Nicolas Privault

We solve the conjecture posed by Fill, Scheinerman and Singer-Cohen and show the equivalence of the sharp threshold functions of the random intersection graph G(n,m,p) with $m >= n^3$ and a graph in which each edge appears independently.…

Combinatorics · Mathematics 2015-01-13 Katarzyna Rybarczyk

We study the Grassmann manifold $G_k$ of all $k$-dimensional subspaces of ${\mathbb R}^n$. The Cartan embedding $G_k\subset O(n)$ realizes $G_k$ as a subspace of $Sl_n({\mathbb R})$ and we study the decomposition $G_k=\coprod_w (BwB\cap…

Algebraic Geometry · Mathematics 2017-03-29 Christian Nassau

We prove new bounds on the average sensitivity of the indicator function of an intersection of $k$ halfspaces. In particular, we prove the optimal bound of $O(\sqrt{n\log(k)})$. This generalizes a result of Nazarov, who proved the analogous…

Computational Complexity · Computer Science 2015-01-28 Daniel M. Kane

As a natural analog of Urysohn's inequality in Euclidean space, Gao, Hug, and Schneider showed in 2003 that in spherical or hyperbolic space, the total measure of totally geodesic hypersurfaces meeting a given convex body K is minimized…

Probability · Mathematics 2019-10-28 Thomas Hack , Peter Pivovarov

This paper deals with the problem of quantifying the approximation a probability measure by means of an empirical (in a wide sense) random probability measure, depending on the first n terms of a sequence of random elements. In Section 2,…

Probability · Mathematics 2018-08-23 Emanuele Dolera , Eugenio Regazzini

Let $H$ be a complex Hilbert space of finite dimension $n\ge 3$. Denote by ${\mathcal G}_{k}(H)$ the Grassmannian consisting of $k$-dimensional subspaces of $H$. Every orthogonal apartment of ${\mathcal G}_{k}(H)$ is defined by a certain…

Combinatorics · Mathematics 2015-12-24 Mark Pankov

The speed of a class of graphs counts the number of graphs on the vertex set $\lbrace 1,\dots, n\rbrace$ inside the class as a function of $n$. In this paper, we investigate this function for many classes of graphs that naturally arise in…

Combinatorics · Mathematics 2021-01-12 Lisa Sauermann

Let $P$ be a set of $m$ points and $L$ a set of $n$ lines in $\mathbb R^4$, such that the points of $P$ lie on an algebraic three-dimensional surface of degree $D$ that does not contain hyperplane or quadric components, and no 2-flat…

Combinatorics · Mathematics 2016-09-29 Micha Sharir , Noam Solomon

For a finite point set $E\subset \mathbb{R}^d$ and a connected graph $G$ on $k+1$ vertices, we define a $G$-framework to be a collection of $k + 1$ points in E such that the distance between a pair of points is specified if the…

Combinatorics · Mathematics 2018-05-22 A. Iosevich , J. Passant

Let $\widetilde{I}_{2n,k}$ denote the space of $k$-dimensional, oriented isotropic subspaces of $\mathbb{R}^{2n}$, called the oriented isotropic Grassmannian. Let $f \colon \widetilde{I}_{2n,k} \rightarrow \widetilde{I}_{2m,l} $ be a map…

Algebraic Topology · Mathematics 2015-08-11 Samik Basu , Swagata Sarkar

Let $k,d $ be positive integers. We determine a sequence of constants that are asymptotic to the probability that the cluster at the origin in a $d$-dimensional Poisson Boolean model with balls of fixed radius is of order $k$, as the…

Probability · Mathematics 2025-04-10 Mathew D. Penrose , Xiaochuan Yang

Let $k \subset K$ be an extension of fields, and let $A \subset M_{n}(K)$ be a $k$-algebra. We study parameter spaces of $m$-dimensional subspaces of $K^{n}$ which are invariant under $A$. The space $\mathbb{F}_{A}(m,n)$, whose $R$-rational…

Algebraic Geometry · Mathematics 2009-02-27 A. Nyman

Much of extremal graph theory has concentrated either on finding very small subgraphs of a large graph (Turan-type results) or on finding spanning subgraphs (Dirac-type results). In this paper we are interested in finding intermediate-sized…

Combinatorics · Mathematics 2017-07-31 Peter Allen , Julia Böttcher , Jan Hladký

Consider a random graph G in G(n,p) and the graph property: G contains a copy of a specific graph H. (Note: H depends on n; a motivating example: H is a Hamiltonian cycle.) Let q be the minimal value for which the expected number of copies…

Combinatorics · Mathematics 2007-05-23 Jeff Kahn , Gil Kalai