Related papers: An upper bound on binomial coefficients in the de …

We study the dynamics of upper and lower bounds of squared concurrence.Our results are similar to that of Konard et al. and can help the estimation of high-dimension bipartite entanglement in experiments.

Consider an algorithm computing in a differential field with several commuting derivations such that the only operations it performs with the elements of the field are arithmetic operations, differentiation, and zero testing. We show that,…

We investigate the existence of representations of every large positive integer as a sum of $k$-th powers of integers represented as certain diagonal forms. In particular, we consider a family of diagonal forms and discuss the problem of…

Let $u$ be an eigenfunction of the Laplacian on a compact manifold with boundary, with Dirichlet or Neumann boundary conditions, and let $-\lambda^2$ be the corresponding eigenvalue. We consider the problem of estimating the maximum of $u$…

We give a lower bound for the bottom of the $L^2$ differential form spectrum on hyperbolic manifolds, generalizing thus a well-known result due to Sullivan and Corlette in the function case. Our method is based on the study of the resolvent…

We provide an algorithm for the construction of orthonormal multivariate polynomials that are symmetric with respect to the interchange of any two coordinates on the unit hypercube and are constrained to the hyperplane where the sum of the…

In this work, we consider the problem of bounding the values of a covariance function corresponding to a continuous-time stationary stochastic process or signal. Specifically, for two signals whose covariance functions agree on a finite…

We prove a spectral upper bound for the torsion function of symmetric stable processes that holds for convex domains in $\mathbb{R}^d$. Our bound is explicit and captures the correct order of growth in $d$, improving upon the existing…

Upper and lower bounds on the error probability of linear codes under maximum-likelihood (ML) decoding are shortly surveyed and applied to ensembles of codes on graphs. For upper bounds, focus is put on Gallager bounding techniques and…

In this work we provide an upper bound for the multiplicity of a one-dimensional Cohen-Macaulay ring (under certain conditions), describe the rings attaining the equality for this bound, and outline a connection with Wilf's conjecture for…

We study the volume distribution of nodal domains of random band-limited functions on generic manifolds, and find that in the high energy limit a typical instance obeys a deterministic universal law, independent of the manifold. Some of the…

A classical statistical inequality is used to show that the distance covariance of two bounded random vectors is bounded from above by a simple function of the dimensionality and the bounds of the random vectors. Two special cases that…

We give explicit upper bounds for coefficients of polynomials appearing in Gauss-Kra\"{i}tchik formula for cyclotomic polynomials. We use a certain relation between elementary symmetric polynomials and power sums polynomials.

We obtain an explicit upper bound on the size of the coefficients of the elliptic modular polynomials $\Phi_N$ for any $N\geq1$. These polynomials vanish at pairs of $j$-invariants of elliptic curves linked by cyclic isogenies of degree…

We consider linear systems of recurrence equations whose coefficients are given in terms of indefinite nested sums and products covering, e.g., the harmonic numbers, hypergeometric products, $q$-hypergeometric products or their mixed…

We give an upper bound in O(d ^((n+1)/2)) for the number of critical points of a normal random polynomial with degree d and at most n variables. Using the large deviation principle for the spectral value of large random matrices we obtain…

In the present work, we investigate real numbers whose sequence of partial quotients enjoys some combinatorial properties involving the notion of palindrome. We provide three new transendence criteria, that apply to a broad class of…

An upper bound of the variation of argument of a holomorphic function along a curve on a Riemann surface is given. This bound is expressed through the Bernstein index of the function multiplied by a geometric constant. The Bernstein index…

An often-cited fact regarding mixing or mixture distributions is that their density functions are able to approximate the density function of any unknown distribution to arbitrary degrees of accuracy, provided that the mixing or mixture…

Due to their flexibility, frames of Hilbert spaces are attractive alternatives to bases in approximation schemes for problems where identifying a basis is not straightforward or even feasible. Computing a best approximation using frames,…