English
Related papers

Related papers: Bounds on Tur{\'a}n determinants

200 papers

We establish some new Tur\'an's type inequalities for orthogonal polynomials defined by a three-term recurrence with monotonic coefficients. As a corollary we deduce asymptotic bounds on the extreme zeros of orthogonal polynomials with…

Classical Analysis and ODEs · Mathematics 2011-01-18 Ilia Krasikov

Let $(p_n)_n$ be a sequence of orthogonal polynomials with respect to the measure $\mu$. Let $T$ be a linear operator acting in the linear space of polynomials $\PP$ and satisfying that $\dgr(T(p))=\dgr(p)-1$, for all polynomial $p$. We…

Classical Analysis and ODEs · Mathematics 2013-02-06 Antonio J. Durán

Let $P$ be a polytope defined by the system $A x \leq b$, where $A \in R^{m \times n}$, $b \in R^m$, and $\text{rank}(A) = n$. We give a short geometric proof of the following tight upper bound on the number of vertices of $P$: $$ n! \cdot…

Let $[q] = \{0,1,\ldots,q-1\}$, let $\Delta[q]$ denote the simplex of probability measures on $[q]$, and let $\gamma$ denote the Lebesgue measure normalized on $\Delta[q]$. We prove that for any symmetric monotone function $f \colon[q]^n…

Probability · Mathematics 2026-05-20 Saba Lepsveridze , Allen Lin

We show that the maximal determinant D(n) for $n \times n$ ${\pm 1}$-matrices satisfies $R(n) := D(n)/n^{n/2} \ge \kappa_d > 0$. Here $n^{n/2}$ is the Hadamard upper bound, and $\kappa_d$ depends only on $d := n-h$, where $h$ is the maximal…

Combinatorics · Mathematics 2013-05-07 Richard P. Brent , Judy-anne H. Osborn , Warren D. Smith

Let $(\xi_i)_{i=1,...,n}$ be a sequence of independent and symmetric random variables. We consider the upper bounds on tail probabilities of self-normalized deviations $$ \mathbf{P} \Big( \max_{1\leq k \leq n} \sum_{i=1}^{k} |\xi_i|\big/…

Probability · Mathematics 2017-05-05 Xiequan Fan

Let $F$ be a strictly balanced $r$-uniform hypergraph with $e>2$ edges and $r$-density $m$. We give a new short proof of the fact that the Tur\'an number $\ex(n, F)$ is greater than $c\, n^{r-1/m} (\log n)^{1/(e-1)}$ where $c$ depends only…

Combinatorics · Mathematics 2017-11-01 Dhruv Mubayi

Let $f_n$ be a random polynomial of degree $n$, whose coefficients are independent and identically distributed random variables with mean-zero and variance one. Let $\Delta(f_n)$ denote the discriminant of $f_n$, that is $\Delta(f_n) =…

Probability · Mathematics 2025-06-17 Marcus Michelen , Oren Yakir

The boundary regularity for the normalized $p$-parabolic equation $u_t =\frac{1}{p}|Du|^{2-p}\Delta_pu$ is studied. Perron's method is used to construct solutions in arbitrary domains. We classify the regular boundary points in terms of…

Analysis of PDEs · Mathematics 2018-09-19 Nikolai Ubostad

Let $D(n)$ be the maximal determinant for $n \times n$ $\{\pm 1\}$-matrices, and ${\mathcal R}(n) = D(n)/n^{n/2}$ be the ratio of $D(n)$ to the Hadamard upper bound. We give several new lower bounds on ${\mathcal R}(n)$ in terms of $d$,…

Combinatorics · Mathematics 2016-10-26 Richard P. Brent , Judy-anne H. Osborn , Warren D. Smith

The determinantal complexity of a polynomial $P \in \mathbb{F}[x_1, \ldots, x_n]$ over a field $\mathbb{F}$ is the dimension of the smallest matrix $M$ whose entries are affine functions in $\mathbb{F}[x_1, \ldots, x_n]$ such that $P =…

Computational Complexity · Computer Science 2021-12-03 Mrinal Kumar , Ben Lee Volk

Consider the divisor sum $\sum_{n\leq N}\tau(n^2+2bn+c)$ for integers $b$ and $c$ which satisfy certain extra conditions. For this average sum we obtain an explicit upper bound, which is close to the optimal. As an application we improve…

Number Theory · Mathematics 2015-10-21 Kostadinka Lapkova

In this paper, we study self-normalized moderate deviations for degenerate { $U$}-statistics of order $2$. Let $\{X_i, i \geq 1\}$ be i.i.d. random variables and consider symmetric and degenerate kernel functions in the form…

Probability · Mathematics 2025-01-08 Lin Ge , Hailin Sang , Qi-Man Shao

We show that the planar normalized orthogonal polynomials $P_{m,n}(z)$ of degree $n$ with respect to an exponentially varying planar measure $\mathrm{e}^{-2mQ}\mathrm{dA}$ enjoy an asymptotic expansion \[ P_{m,n}(z)\sim…

Complex Variables · Mathematics 2020-08-07 Haakan Hedenmalm , Aron Wennman

It is shown that in a tower of coverings the regularized determinant of a generalized Laplacian converges to the $L^2$-determinant. This shows generic nontriviality of analytic torsion or regularized determinants since the…

dg-ga · Mathematics 2008-02-03 Anton Deitmar

Let $P_1,...,P_n$ be generic homogeneous polynomials in $n$ variables of degrees $d_1,...,d_n$ respectively. We prove that if $\nu$ is an integer satisfying ${\sum_{i=1}^n d_i}-n+1-\min\{d_i\}<\nu,$ then all multivariate subresultants…

Algebraic Geometry · Mathematics 2007-05-23 Laurent Busé , Carlos D'Andrea

Tur\'an number is one of primary topics in the combinatorics of finite sets,in this paper, we will present a new upper bound for Tur\'an number.

Combinatorics · Mathematics 2011-10-25 An-Ping Li

In this article explicit formulas for the recurrence equation p_{n+1}(x) = (A_n x + B_n) p_n(x) - C_n p_{n-1}(x) and the derivative rules sigma(x) p'_n(x) = alpha_n p_{n+1}(x) + beta_n p_n(x) + gamma_n p_{n-1}(x) and sigma(x) p'_n(x) =…

Classical Analysis and ODEs · Mathematics 2008-02-03 Wolfram Koepf , Dieter Schmersau

We study solutions of three-term recurrence relations whose $N$-step transfer matrices belong to the uniform Stolz class. In particular, we derive the first order of their uniform asymptotics. For orthonormal polynomials we show more.…

Classical Analysis and ODEs · Mathematics 2020-03-05 Grzegorz Świderski , Bartosz Trojan

We consider a polynomial $P\in \mathbb{R}[x_{1},\cdots, x_{d}]$ of degree $ \delta $ that depends non-trivially on each of $x_1,...,x_d$ with $d\geq 2$. For any integer $t$ with $2\leq t\leq d$, any natural number $n \in \mathbb{N}$, and…

Combinatorics · Mathematics 2026-03-09 Yewen Sun