Related papers: Almost-Orthogonal Bases for Inner Product Polynomi…
Constrained orthogonal polynomials have been recently introduced in the study of the Hohenberg-Kohn functional to provide basis functions satisfying particle number conservation for an expansion of the particle density. More generally, we…
We answer a question posed by Vitaly Bergelson, showing that in a totally ergodic system, the average of a product of functions evaluated along polynomial times, with polynomials of pairwise differing degrees, converges in $L^{2}$ to the…
We consider random polynomials of the form $G_n(z):= \sum_{|\alpha|\leq n} \xi^{(n)}_{\alpha}p_{n,\alpha}(z)$ where $\{\xi^{(n)}_{\alpha}\}_{|\alpha|\leq n}$ are i.i.d. (complex) random variables and $\{p_{n,\alpha}\}_{|\alpha|\leq n}$ form…
A collection of subroutines and examples of their uses, as well as the underlying numerical methods, are described for generating orthogonal polynomials relative to arbitrary weight functions. The object of these routines is to produce the…
We investigate the asymptotic properties of orthogonal polynomials for a class of inner products including the discrete Sobolev inner products $\langle h,g \rangle = \int hg\, d\mu + \sum_{j=1}^m \sum_{i=0}^{N_j} M_{j,i} h^{(i)}(c_j)…
We present a randomized method to approximate any vector $v$ from some set $T \subset \R^n$. The data one is given is the set $T$, and $k$ scalar products $(\inr{X_i,v})_{i=1}^k$, where $(X_i)_{i=1}^k$ are i.i.d. isotropic subgaussian…
We study the sequence of polynomials $\{S_n\}_{n\geq 0}$ that are orthogonal with respect to the general discrete Sobolev-type inner product $$ \langle f,g \rangle_{\mathsf{s}}=\!\int\! f(x)…
Householder orthogonalization plays an important role in numerical linear algebra. It attains perfect orthogonality regardless of the conditioning of the input. However, in the context of a non-standard inner product, it becomes difficult…
Zeros of many ensembles of polynomials with random coefficients are asymptotically equidistributed near the unit circumference. We give quantitative estimates for such equidistribution in terms of the expected discrepancy and expected…
We study asymptotic distribution of zeros of random holomorphic sections of high powers of positive line bundles defined over projective homogenous manifolds. We work with a wide class of distributions that includes real and complex…
We study the spherical cap packing problem with a probabilistic approach. Such probabilistic considerations result in an asymptotic sharp universal uniform bound on the maximal inner product between any set of unit vectors and a…
We present a prescription for choosing orthogonal bases of differential $n$-forms belonging to quadratic twisted period integrals, with respect to the intersection number inner product. To evaluate these inner products, we additionally…
The long-standing Gaussian product inequality (GPI) conjecture states that $E [\prod_{j=1}^{n}|X_j|^{\alpha_j}]\geq\prod_{j=1}^{n}E[|X_j|^{\alpha_j}]$ for any centered Gaussian random vector $(X_1,\dots,X_n)$ and any non-negative real…
We consider mixtures of $k\geq 2$ Gaussian components with unknown means and unknown covariance (identical for all components) that are well-separated, i.e., distinct components have statistical overlap at most $k^{-C}$ for a large enough…
The long-standing Gaussian product inequality (GPI) conjecture states that, for any centered $\mathbb{R}^n$-valued Gaussian random vector $(X_1, \dots, X_n)$ and any positive reals $\alpha_1, \dots, \alpha_n$, ${\bf…
The purpose of this work is to analyse a family of mutually orthogonal polynomials on the unit ball with respect to an inner product which includes an additional term on the sphere. First, we will get connection formulas relating classical…
In this paper we study Cartesian products of graphs and their divisorial gonality, which is a tropical version of the gonality of an algebraic curve. We present an upper bound on the gonality of the Cartesian product of any two graphs, and…
This paper puts forward a new generalized polynomial dimensional decomposition (PDD), referred to as GPDD, comprising hierarchically ordered measure-consistent multivariate orthogonal polynomials in dependent random variables. Unlike the…
We consider the problem of approximating the product of $n$ expectations with respect to a common probability distribution $\mu$. Such products routinely arise in statistics as values of the likelihood in latent variable models. Motivated…
We provide a general framework on the coefficients of the graph polynomials of graphs which are Cartesian products. As a corollary, we prove that if $G=(V,E)$ is a graph with degrees of vertices $2d(v), v\in V$, and the graph polynomial…