English
Related papers

Related papers: On Tur\'an inequality for ultraspherical polynomia…

200 papers

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

Let $G$ be an $n$-vertex graph, and let $\lambda(G)$ and $\lambda_n(G)$ denote the largest and smallest eigenvalues of its adjacency matrix. Write $e(G)$ for the number of edges of $G$, $d(G)=2e(G)/n$ for its average degree, and $T_r(n)$…

Combinatorics · Mathematics 2026-05-07 Lele Liu , Bo Ning

Recently, Domagoj Brada\v{c}, Oliver Janzer, Benny Sudakov and Istv\'an Tomon have proved that the Tur\'an number of $2$-dimensional grids is $\Theta(n^{3/2})$, or more general, $\mathrm{ex}\left(n,T\square{P}\right)=\Theta(n^{3/2})$, where…

Combinatorics · Mathematics 2022-03-25 Dingyuan Liu

We introduced previously the generalized characteristic polynomial defined by $P_C(\lambda)={\rm det}\,C(\lambda),$ where $C(\lambda)=C+{\rm diag}\big(\lambda_1,\dots,\lambda_n\big)$ for $C\in {\rm Mat}(n,\mathbb C)$ and…

Representation Theory · Mathematics 2023-10-27 A. V. Kosyak

Motivated by some applications in applied mathematics, biology, chemistry, physics and engineering sciences, new tight Tur\'an type inequalities for modified Bessel functions of the first and second kind are deduced. These inequalities…

Classical Analysis and ODEs · Mathematics 2017-07-14 Árpád Baricz

Some 76 years ago P. Tur\'an was the first to establish lower estimations of the ratio of the maximum norm of the derivatives of polynomials and the maximum norm of the polynomials themselves on the interval I:=[-1,1] and on the unit disk…

Classical Analysis and ODEs · Mathematics 2024-07-29 Polina Yu. Glazyrina , Szilárd Gy. Révész

We consider properties of semi-classical orthogonal polynomials with respect to the generalised Airy weight \[\omega(x;t,\lambda)=x^{\lambda}\exp\left(-\tfrac13x^3+tx\right),\qquad x\in \mathbb{R}^+,\] with parameters $\lambda>-1$ and $t\in…

Classical Analysis and ODEs · Mathematics 2021-04-21 Peter A. Clarkson , Kerstin Jordaan

We obtain the strong asymptotics of polynomials $p_n(\lambda)$, $\lambda\in\mathbb{C}$, orthogonal with respect to measures in the complex plane of the form $$ e^{-N(|\lambda|^{2s}-t\lambda^s-\overline{t\lambda}^s)}dA(\lambda), $$ where $s$…

Mathematical Physics · Physics 2016-07-05 Ferenc Balogh , Tamara Grava , Dario Merzi

Let $U_{n,d}$ be the uniform matroid of rank $d$ on $n$ elements. Denote by $g_{U_{n,d}}(t)$ the Speyer's $g$-polynomial of $U_{n,d}$. The Tur\'{a}n inequality and higher order Tur\'{a}n inequality are related to the Laguerre-P\'{o}lya…

Combinatorics · Mathematics 2024-10-11 James J. Y. Zhao

A new characterization of the generalized Hermite polynomials and of the orthogonal polynomials with respect to the maesure $|x|^\g (1-x^2)^{\a-1/2}dx$ is derived which is based on a "reversing property" of the coefficients in the…

Classical Analysis and ODEs · Mathematics 2008-02-03 Holger Dette

Inequalities among symmetric polynomial functions are fundamental questions in mathematics and have various applications in science and engineering. This paper investigates a beautiful and inspiring conjecture, proposed by Cuttler, Greene…

Combinatorics · Mathematics 2025-05-14 Jia Xu , Yong Yao

In this paper some Tur\'an type inequalities for the general Bessel function, monotonicity and bounds for its logarithmic derivative are derived. Moreover we find the series representation and the relative extrema of the Tur\'anian of…

Classical Analysis and ODEs · Mathematics 2015-02-11 Árpád Baricz , Saminathan Ponnusamy , Sanjeev Singh

In 2002, Nikiforov proved that for an $n$-vertex graph $G$ with clique number $\omega$ and edge number $m$, the spectral radius $\lambda(G)$ satisfies $\lambda (G) \leq \sqrt{2(1 - 1/\omega) m}$, which confirmed a conjecture implicitly…

Combinatorics · Mathematics 2025-10-14 Lele Liu , Bo Ning

The topological Tur\'an number $\mathrm{ex}_{\hom}(n,X)$ of a 2-dimensional simplicial complex $X$ asks for the maximum number of edges in an $n$-vertex 3-uniform hypergraph containing no triangulation of $X$ as a subgraph. We prove that…

Combinatorics · Mathematics 2026-05-14 Maya Sankar

P. Tur\'an was the first to derive lower estimations on the uniform norm of the derivatives of polynomials $p$ of uniform norm $1$ on the interval I:=[-1,1] and the disk D:=$\{z \in C~:~|z| \le 1\}$, under the normalization condition that…

Complex Variables · Mathematics 2016-11-16 Polina Yu. Glazyrina , Szilárd Gy. Révész

In 2007, \'A. Baricz put forward a conjecture concerning Tur\'an-type inequalities for Gaussian hypergeometric functions (see Conjecture \ref{ConjA} in Section \ref{Sec1}). In this paper, the authors disprove this conjecture with several…

Classical Analysis and ODEs · Mathematics 2024-08-29 Song-Liang Qiu , Xiao-Yan Ma , Xue-Yan Xiang

In this paper, we provide several characterizations of a spherically quasinormal tuple $\mathbf{T}$ in terms of its normal extension, as well as in terms of powers of the associated elementary operator $\Theta_{\mathbf{T}}(I)$. Utilizing…

Functional Analysis · Mathematics 2025-03-20 Hranislav Stanković

In 1935, P. Tur\'an proved that $$ S_{n,a}(x)= \sum_{j=1}^n{n+a-j\choose n-j} \sin(jx)>0 \quad{(n,a\in\mathbf{N}; 0<x<\pi).} $$ We present various related inequalities. Among others, we show that the refinements $$ S_{2n-1,a}(x)\geq \sin(x)…

Classical Analysis and ODEs · Mathematics 2016-10-19 Horst Alzer , Man Kam Kwong

We propose a strengthening of the conclusion in Tur\'an's (3,4)-conjecture in terms of algebraic shifting, and show that its analogue for graphs does hold. In another direction, we generalize the Mantel-Tur\'an theorem by weakening its…

Combinatorics · Mathematics 2018-02-13 Gil Kalai , Eran Nevo

We investigate two conjectured spectral graph theoretic strengthenings of Tur\'an's theorem. Let $\mu_1 \ge \ldots \ge \mu_n$ denote the eigenvalues of a graph $G$ with $n$ vertices, $m$ edges and clique number $\omega(G)$. The concise…

Combinatorics · Mathematics 2023-12-21 Clive Elphick , William Linz , Pawel Wocjan