Related papers: Counting rational approximations on rank one flag …

We study the generalized Galois numbers which count flags of length r in N-dimensional vector spaces over finite fields. We prove that the coefficients of those polynomials are asymptotically Gaussian normally distributed as N becomes…

We study the random rotation number for random circle homeomorphisms. We introduce two new definitions of the random rotation number that can be stated without reference to any choice of lift of the dynamics to the real line, and prove that…

Approximating complex probability distributions, such as Bayesian posterior distributions, is of central interest in many applications. We study the expressivity of geometric Gaussian approximations. These consist of approximations by…

We consider random systems of linear equations over GF(2) in which every equation binds k variables. We obtain a precise description of the clustering of solutions in such systems. In particular, we prove that with probability that tends to…

We consider the problem of approaching real numbers with rational numbers with prime denominator and with a single numerator allowed for each denominator. We obtain basic results, both probabilistic and deterministic, draw connections to…

Let d_{k,n} and #_{k,n} denote the dimension and the degree of the Grassmannian G_{k,n} of k-planes in projective n-space, respectively. For each k between 1 and n-2 there are 2^{d_{k,n}} \cdot #_{k,n} (a priori complex) k-planes in P^n…

We suggest a new optimization technique for minimizing the sum $\sum_{i=1}^n f_i(x)$ of $n$ non-convex real functions that satisfy a property that we call piecewise log-Lipschitz. This is by forging links between techniques in computational…

We extend Alberti's Rank-One Theorem to $\mathrm{RCD}(K,N)$ metric measure spaces.

Boltzmann samplers, introduced by Duchon et al. in 2001, make it possible to uniformly draw approximate size objects from any class which can be specified through the symbolic method. This, through by evaluating the associated generating…

We consider the problem of uniform sampling of points on an algebraic variety. Specifically, we develop a randomized algorithm that, given a small set of multivariate polynomials over a sufficiently large finite field, produces a common…

We show that any quiver Grassmannian associated with a rigid representation of a quiver is a rational variety using torus localization techniques.

Quantitative bounds for random embeddings of $\mathbb{R}^{k}$ into Lorentz sequence spaces are given, with improved dependence on $\varepsilon$.

Laplace's method approximates a target density with a Gaussian distribution at its mode. It is computationally efficient and asymptotically exact for Bayesian inference due to the Bernstein-von Mises theorem, but for complex targets and…

In the computation of Feynman integrals which evaluate to multiple polylogarithms one encounters quite often square roots. To express the Feynman integral in terms of multiple polylogarithms, one seeks a transformation of variables, which…

To any two-dimensional rational plane in four-dimensional space one can naturally attach a point in the Grassmannian Gr(2,4) and four lattices of rank two. Here, the first two lattices originate from the plane and its orthogonal complement…

Any Zariski dense countable subgroup of $SL(d,R)$ is shown to carry a non-degenerate finitely supported symmetric random walk such that its harmonic measure on the flag space is singular. The main ingredients of the proof are: (1) a new…

The Grassmann convexity conjecture gives a conjectural formula for the maximal total number of real zeros of the consecutive Wronskians of an arbitrary fundamental solution to a disconjugate linear ordinary differential equation with real…

We consider two varieties of labeled rooted trees, and the probability that a vertex chosen from all vertices of all trees of a given size uniformly at random has a given rank. We prove that this probability converges to a limit as the tree…

Approximation in this paper is of vectors on the unit $d$-cube by the projection of integer lattice points onto the same cube. We define badly approximable vectors on a rational quadratic variety and show that sets of these vectors, which…

We consider the problem of counting the number of varieties in a family over $\mathbb{Q}$ with a rational point. We obtain lower bounds for this counting problem for some families over $\mathbb{P}^1$, even if the Hasse principle fails. We…