Related papers: Higher Order Tur\'an Inequalities for the Partitio…
Talagran's correlation inequality provides quantitative lower bounds on the covariance of two increasing Boolean functions in terms of their coordinate influences, but, in general, a logarithmic loss is necessary. Motivated by a question of…
In this paper, we investigate the Tur\'an exponent for $1$-subdivisions of graphs that are neither bipartite nor complete. Specifically, we establish an upper bound on the Tur\'an number of the 1-subdivision of $K_{s,t}^+$, where…
We derive a combinatorial multisum expression for the number $D(n,k)$ of partitions of $n$ with Durfee square of order $k$. An immediate corollary is therefore a combinatorial formula for $p(n)$, the number of partitions of $n$. We then…
Let $\Pi_n$ be the class of algebraic polynomials $P$ of degree $n$, all of whose zeros lie on the segment $[-1,1]$. In 1995, S.P. Zhou has proved the following Tur\'{a}n type reverse Markov-Nikol'skii inequality: $\|P'\|_{L_p[-1,1]}>c\,…
Let $ACC \circ THR$ be the class of constant-depth circuits comprised of AND, OR, and MOD$m$ gates (for some constant $m > 1$), with a bottom layer of gates computing arbitrary linear threshold functions. This class of circuits can be seen…
A partition of $n$ is called a $t$-core partition if none of its hook number is divisible by $t.$ In 2019, Hirschhorn and Sellers \cite{Hirs2019} obtained a parity result for $3$-core partition function $a_3(n)$. Motivated by this result,…
In this paper we initiate a systematic study of the Tur\'an problem for edge-ordered graphs. A simple graph is called $\textit{edge-ordered}$, if its edges are linearly ordered. An isomorphism between edge-ordered graphs must respect the…
Let $A(p,n,k)$ be the number of $p$-tuples of commuting permutations of $n$ elements whose permutation action results in exactly $k$ orbits or connected components. We formulate the conjecture that, for every fixed $p$ and $n$, the…
In this paper we study several partition relations, defined by Saharon Shelah, and relate them to the Hales-Jewett numbers. In particular we give an upper bound for the Hales-Jewett numbers using the primitive recursive function…
We will find a lower bound on the recognition complexity of the theories that are nontrivial relative to some equivalence relation (this relation may be equality), namely, each of these theories is consistent with the formula, whose sense…
Let $f \in C^n(\mathbb{R})$ be such that $\Vert f^{(n)} \Vert_\infty < \infty$. Let $f^{[n]} \in C(\mathbb{R}^{n+1})$ be the $n$th order divided difference. A special case of our main result states that for $1 < p < \infty$ we have \[\Vert…
Erd\H{o}s and Tur\'an proved a classical inequality on the distribution of roots for a complex polynomial in 1950, depicting the fundamental interplay between the size of the coefficients of a polynomial and the distribution of its roots on…
We study the Fourier coefficients of functions satisfying a certain version of Wright's circle method with finitely many major arcs. We show that the Jensen polynomials associated with such Fourier coefficients are asymptotically…
In 1878, Sylvester proved Cayley's Conjecture that the coefficients of the Gaussian $q$-binomial coefficients are unimodal. In 1990, O'Hara famously discovered a constructive combinatorial proof, and in 2013, Pak and Panova proved the…
L\'evai and Pyber proposed the following as a conjecture: Let $G$ be a profinite group such that the set of solutions of the equation $x^n=1$ has positive Haar measure. Then $G$ has an open subgroup $H$ and an element $t$ such that all…
In the $1970$s Nicolas proved that the coefficients $p_d(n)$ defined by the generating function \begin{equation*} \sum_{n=0}^{\infty} p_d(n) \, q^n = \prod_{n=1}^{\infty} \left( 1- q^n\right)^{-n^{d-1}} \end{equation*} are log-concave for…
The planar Tu\'{a}n number of $H$, denoted by $ex_{\mathcal{P}}(n,H)$, is defined as the maximum number of edges in an $n$-vertex $H$-free planar graph. The exact value of $ex_{\mathcal{P}}(n,H)$ remains a mystery when $H$ is large (for…
Most correlation inequalities for high-dimensional functions in the literature, such as the Fortuin-Kasteleyn-Ginibre (FKG) inequality and the celebrated Gaussian Correlation Inequality of Royen, are qualitative statements which establish…
We show that for every rational number $r \in (1,2)$ of the form $2 - a/b$, where $a, b \in \mathbb{N}^+$ satisfy $\lfloor b/a \rfloor^3 \le a \le b / (\lfloor b/a \rfloor +1) + 1$, there exists a graph $F_r$ such that the Tur\'an number…
The paper deals about Hardy-type inequalities associated with the following higher order Poincar\'e inequality: $$ \left( \frac{N-1}{2} \right)^{2(k -l)} := \inf_{ u \in C_{c}^{\infty} \setminus \{0\}} \frac{\int_{\mathbb{H}^{N}}…