English
Related papers

Related papers: Higher Order Tur\'an Inequalities for the Partitio…

200 papers

Let $\mathcal{F}$ be a family of graphs. The Tur\'{a}n number $ex(n;\mathcal{F})$ is defined to be the maximum number of edges in a graph of order $n$ that is $\mathcal{F}$-free. In 1959, Erd\H{o}s and Gallai determined the Tur\'an number…

Combinatorics · Mathematics 2020-04-10 Bo Ning , Jian Wang

In this paper, we study the fundamental open question of finding the optimal high-order algorithm for solving smooth convex minimization problems. Arjevani et al. (2019) established the lower bound $\Omega\left(\epsilon^{-2/(3p+1)}\right)$…

Optimization and Control · Mathematics 2022-05-20 Dmitry Kovalev , Alexander Gasnikov

In their work, Serre and Swinnerton-Dyer study the congruence properties of the Fourier coefficients of modular forms. We examine similar congruence properties, but for the coefficients of a modified Taylor expansion about a CM point…

Number Theory · Mathematics 2014-06-12 Hannah Larson , Geoffrey Smith

Say that mu is a ``subpartition'' of an integer partition lambda if the multiset of parts of mu is a submultiset of the parts of lambda, and define an integer partition lambda to be ``wide'' if for every subpartition mu of lambda, mu >= mu'…

Combinatorics · Mathematics 2007-05-23 Timothy Y. Chow , C. Kenneth Fan , Michel X. Goemans , Jan Vondrak

We study a curious class of partitions, the parts of which obey an exceedingly strict congruence condition we refer to as "sequential congruence": the $m$th part is congruent to the $(m+1)$th part modulo $m$, with the smallest part…

Number Theory · Mathematics 2020-06-09 Maxwell Schneider , Robert Schneider

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

The present paper develops two concepts of pointwise differentiability of higher order for arbitrary subsets of Euclidean space defined by comparing their distance functions to those of smooth submanifolds. Results include that…

Differential Geometry · Mathematics 2019-04-11 Ulrich Menne

Turan's theorem implies that every graph of order n with more edges than the r-partite Turan graph contains a complete graph of order r+1. We show that the same premise implies the existence of much larger graphs. We also prove…

Combinatorics · Mathematics 2007-11-22 Vladimir Nikiforov

In this paper, we provide some inequalities for $P$-class functions and self-adjoint operators on a Hilbert space including an operator version of the Jensen's inequality and the Hermite-Hadamard's type inequality. We improve the…

Functional Analysis · Mathematics 2020-01-22 Ismail Nikoufar , Davuod Saeedi

Given a graph $H$ and a positive integer $n$, the {\it Tur\'an number} $\ex(n,H)$ is the maximum number of edges in an $n$-vertex graph that does not contain $H$ as a subgraph. A real number $r\in(1,2)$ is called a {\it Tur\'an exponent} if…

Combinatorics · Mathematics 2019-08-08 Tao Jiang , Yu Qiu

We consider infinite sequences of positive numbers. The connection between log-concavity and the Bessenrodt--Ono inequality had been in the focus of several papers. This has applications in the white noise distribution theory and…

Combinatorics · Mathematics 2025-12-10 Bernhard Heim und Markus Neuhauser

The number partition problem is a well-known problem, which is one of 21 Karp's NP-complete problems \cite{karp}. The partition function is a boolean function that is equivalent to the number partition problem with number range restricted.…

Computational Complexity · Computer Science 2022-12-25 Chuyu Xiong

A good range of problems on trees can be described by the following general setting: Given a bilinear map $*:\mathbb R^d\times\mathbb R^d\to\mathbb R^d$ and a vector $s\in\mathbb R^d$, we need to estimate the largest possible absolute value…

Combinatorics · Mathematics 2025-07-15 Vuong Bui

We present Euler-type recurrence relations for some partition functions. Some of our results provide new recurrences for the number of unrestricted partitions of $n$, denote by $p(n)$. Others establish recurrences for partition functions…

Combinatorics · Mathematics 2020-07-16 Robson da Silva , Pedro Diniz Sakai

We investigate the parity of the coefficients of certain eta-quotients, extensively examining the case of $m$-regular partitions. Our theorems concern the density of their odd values, in particular establishing lacunarity modulo 2 for…

Combinatorics · Mathematics 2022-03-07 William J. Keith , Fabrizio Zanello

On the one hand, it is well known that the only subquadratic Dehn function of finitely presented groups is the linear one. On the other hand there is a huge class of Dehn functions $d(n)$ with growth at least $n^4$ (essentially all possible…

Group Theory · Mathematics 2018-11-22 A. Yu Olshanskii

Since the theorems of Schur and van der Waerden, numerous partition regularity results have been proved for linear equations, but progress has been scarce for non-linear ones, the hardest case being equations in three variables. We prove…

Combinatorics · Mathematics 2014-03-07 Nikos Frantzikinakis , Bernard Host

Let $\mathcal{V}_p(\lambda)$ be the collection of all functions $f$ defined in the unit disc $\ID$ having a simple pole at $z=p$ where $0<p<1$ and analytic in $\ID\setminus\{p\}$ with $f(0)=0=f'(0)-1$ and satisfying the differential…

Complex Variables · Mathematics 2017-12-11 Bappaditya Bhowmik , Firdoshi Parveen

A Known Alder-type partition inequality of level $a$, which involves the second Rogers-Ramanujan identity when the level $a$ is 2, states that the number of partitions of $n$ into parts differing by at least $d$ with the smallest part being…

Combinatorics · Mathematics 2023-08-08 Haein Cho , Soon-Yi Kang , Byungchan Kim

Let $p(n)$ denote the number of partitions of a natural number $n$. As $ n \to \infty$, the $n$th root of $p(n)$ tends to $1$, which is related to the Cauchy--Hadamard test for power series. Andrews also discovered an elementary proof. Sun…

Combinatorics · Mathematics 2026-01-19 Bernhard Heim und Markus Neuhauser