Related papers: From Random Polynomials to Symplectic Geometry
Generalized Pl\"ucker numbers are defined to count certain types of tangent lines of generic degree $d$ complex projective hypersurfaces. They can be computed by identifying them as coefficients of GL(2)-equivariant cohomology classes of…
The paper contains a short review of the theory of symplectic and contact manifolds and of the generalization of this theory to the case of supermanifolds. It is shown that this generalization can be used to obtain some important results in…
We study the probability distribution of the number of zeros of multivariable polynomials with bounded degree over a finite field. We find the probability generating function for each set of bounded degree polynomials. In particular, in the…
In this article we study the limiting empirical measure of zeros of higher derivatives for sequences of random polynomials. We show that these measures agree with the limiting empirical measure of zeros of corresponding random polynomials.…
Using a basic idea of Sullivan's rational homotopy theory, one can see a Lie groupoid as the fundamental groupoid of its Lie algebroid. This paper studies analogues of Lie algebroids with non-trivial higher homotopy. Using various homotopy…
Generalized symmetries (also known as categorical symmetries) is a newly developing technique for studying quantum field theories. It has given us new insights into the structure of QFT and many new powerful tools that can be applied to the…
A partition polynomial is a refinement of the partition number p(n) whose coefficients count some special partition statistic. Just as partition numbers have useful asymptotics so do partition polynomials. In fact, their asymptotics…
Cosymplectic and normal almost contact structures are analogues of symplectic and complex structures that can be defined on 3-manifolds. Their existence imposes strong topological constraints. Generalized geometry offers a natural common…
We make a number of comments on Chebyshev polynomials for general compact subsets of the complex plane. We focus on two aspects: asymptotics of the zeros and explicit Totik--Widom upper bounds on their norms.
Universality of eigenvalue spacings is one of the basic characteristics of random matrices. We give the precise meaning of universality and discuss the standard universality classes (sine, Airy, Bessel) and their appearance in unitary,…
We generalize the classical Fisher information metric on statistical models to $L^p$-metrics on various spaces of differential forms or group of diffeomorphisms. Using this new interpretation from information geometry, we derive several new…
We study the 'critical moments' of subcritical Gaussian multiplicative chaos (GMCs) in dimensions $d \leq 2$. In particular, we establish a fully explicit formula for the leading order asymptotics, which is closely related to large…
In this survey we consider polynomial optimization problems, asking to minimize a polynomial function over a compact semialgebraic set, defined by polynomial inequalities. This models a great variety of (in general, nonlinear nonconvex)…
In this paper, we investigate the number of real zeros of random Weyl polynomials of degree \(n \to \infty\) with general coefficient distributions. Motivated by the results of arXiv:1409.4128 and arXiv:1402.4628 as well as arXiv:1711.03316…
Polytopes are the basic finite data structures for convex sets: they appear as feasible regions in linear optimization, as geometric summaries in algorithms, and as random objects in stochastic geometry. A natural geometric question is…
We consider the set S(n,0) of monic complex polynomials of degree $n\ge 2$ having all their zeros in the closed unit disk and vanishing at 0. For $p\in S(n,0)$ we let $|p|_{0}$ denote the distance from the origin to the zero set of $p'$. We…
Consider a monic polynomial of degree $n$ whose subleading coefficients are independent, identically distributed, nondegenerate random variables having zero mean, unit variance, and finite moments of all orders, and let $m \geq 0$ be a…
Parametric geometry of numbers is a new theory, recently created by Schmidt and Summerer, which unifies and simplifies many aspects of classical Diophantine approximations, providing a handle on problems which previously seemed out of…
We consider sequences of polynomials that satisfy differential-difference recurrences. Polynomials satisfying such recurrences frequently appear as generating polynomials of integer valued random variables that are of interest in discrete…
We consider the problem of stable sampling of multivariate real polynomials of large degree in a general framework where the polynomials are defined on an affine real algebraic variety $M$, equipped with a weighted measure. In particular,…