Related papers: From Random Polynomials to Symplectic Geometry

In this paper we study Appell polynomials by connecting them to random variables. This probabilistic approach yields, e.g., the mean value property which is fundamental in the sense that many other properties can be derived from it. We also…

This is a survey on symplectic birational geometry. In arbitrary dimension, this subject is centered around the notion of uniruledness. In low dimensions, we will also discuss Kodaira dimension and minimality.

We present general reduction procedures for Courant, Dirac and generalized complex structures, in particular when a group of symmetries is acting. We do so by taking the graded symplectic viewpoint on Courant algebroids and carrying out…

We introduce a general class of algorithms and supply a number of general results useful for analysing these algorithms when applied to regular graphs of large girth. As a result, we can transfer a number of results proved for random…

In this talk we go over several new developments regarding the techniques for a large class of non-hermitian matrix models with unitary randomness (complex random numbers). In particular, we discuss: (a) - A diagrammatic approach based on a…

Central limit theorems for the log-volume of a class of random convex bodies in $\mathbb{R}^n$ are obtained in the high-dimensional regime, that is, as $n\to\infty$. In particular, the case of random simplices pinned at the origin and…

We present fully polynomial approximation schemes for a broad class of Holant problems with complex edge weights, which we call Holant polynomials. We transform these problems into partition functions of abstract combinatorial structures…

The main goal of this paper is to present the application of structural sums, mathematical objects originating from the computational materials science, in construction of a feature space vector of 2D random composites simulated by…

Multisymplectic geometry is a generalization of symplectic geometry suitable for n-dimensional field theories, in which the nondegenerate 2-form of symplectic geometry is replaced by a nondegenerate (n+1)-form. The case n = 2 is relevant to…

We survey results on the distribution of zeros of random polynomials and of random holomorphic sections of line bundles, especially for large classes of probability measures on the spaces of holomorphic sections. We provide furthermore some…

There have been several attempts in recent years to extend the notions of symplectic and Poisson structures in order to create a suitable geometrical framework for classical field theories, trying to achieve a success similar to the use of…

As has been known since the time of Gromov's Nonsqueezing Theorem, symplectic embedding questions lie at the heart of symplectic geometry. After surveying some of the most important ways of measuring the size of a symplectic set, these…

Random shapes arise naturally in many contexts. The topological and geometric structure of such objects is interesting for its own sake, and also for applications. In physics, for example, such objects arise naturally in quantum gravity, in…

Our paper develops a theory of Poisson slices and a uniform approach to their partial compactifications. The theory in question is loosely comparable to that of symplectic cross-sections in real symplectic geometry.

We study the problem of lifting of polynomial symplectomorphisms in characteristic zero to automorphisms of the Weyl algebra by means of approximation by tame automorphisms. We utilize -- and reprove -- D. Anick's fundamental result on…

There are (at least) two reasons to study random polytopes. The first is to understand the combinatorics and geometry of random polytopes especially as compared to other classes of polytopes, and the second is to analyze average-case…

We investigate some topological properties of random geometric complexes and random geometric graphs on Riemannian manifolds in the thermodynamic limit. In particular, for random geometric complexes we prove that the normalized counting…

Using the formalism of polynomials with positive coefficients, the fact that exactly half of all subsets of a finite set have even cardinality can be generalized asymptotically.

Consider a random trigonometric polynomial $X_n: \mathbb R \to \mathbb R$ of the form $$ X_n(t) = \sum_{k=1}^n \left( \xi_k \sin (kt) + \eta_k \cos (kt)\right), $$ where $(\xi_1,\eta_1),(\xi_2,\eta_2),\ldots$ are independent identically…

Let p_N be a random degree N polynomial in one complex variable whose zeros are chosen independently from a fixed probability measure mu on the Riemann sphere S^2. This article proves that if we condition p_N to have a zero at some fixed…