Related papers: An inequality for Kruskal-Macaulay functions

For any $n > 0$ and $0 \leq m < n$, let $P_{n,m}$ be the poset of projective equivalence classes of $\{-,0,+\}$-vectors of length $n$ with sign variation bounded by $m$, ordered by reverse inclusion of the positions of zeros. Let…

The inequality of Vapnik and Chervonenkis controls the expectation of the function by its sample average uniformly over a VC-major class of functions taking into account the size of the expectation. Using Talagrand's kernel method we prove…

For k>=3 let A \subset [1,N] be a set not containing a solution to a_1 x_1+...+a_k x_k=a_1 x_{k+1}+...+a_k x_{2k} in distinct integers. We prove that there is an epsilon>0 depending on the coefficients of the equation such that every such A…

In this paper we give a simple proof of inequalities of integrals of functions which are the composition of nonnegative continous convex functions on a vector space ${\bf R}^m$ and vector-valued functions in a weakly compact subset of a…

In this work a method for numerical computation of the Schl\"afli function $f_n(x)$, for $x\in[n-1,n+1]$ and $n\geq4$ is presented. The computation is based on the Chebyshev approximation of the function $q_{n}(x)$, which is related to the…

For each of the functions $f \in \{\phi, \sigma, \omega, \tau\}$ and every natural number $k$, we show that there are infinitely many solutions to the inequalities $f(p_n-1) < f(p_{n+1}-1) < \dots < f(p_{n+k}-1)$, and similarly for…

The polynomial coefficient $\binom {n,q}{k}$ is defined to be the coefficient of $x^{k}$ in the expansion of $(1+x+x^2+... +x^{q-1})^n$. In this note we give an asymptotic estimate for $\binom {n,q}{cn}$ as $n$ tends to infinity, where $c$…

In this paper, we study the binomial sum $S_{n}(q):=% \overset{n}{\underset{k=0}{\sum }}a_{k}\binom{n}{k}\left( 1-q\right) ^{k}q^{n-k}$ for a given sequence $\left( a_{n}\right) $ of real or complex numbers. We express $S_{n}(q)$ in…

Let $n,k\in\mathbb{N}$ and let $p_{n}$ denote the $n$th prime number. We define $p_{n}^{(k)}$ recursively as $p_{n}^{(1)}:=p_{n}$ and $p_{n}^{(k)}=p_{p_{n}^{(k-1)}}$, that is, $p_{n}^{(k)}$ is the $p_{n}^{(k-1)}$th prime. In this note we…

In this paper, we introduce and develop the method of diagonalization of functions $f:\mathbb{N}\longrightarrow \mathbb{R}$. We apply this method to show that the equations of the form $\Gamma_r(n)+k=m^2$ has a finite number of solutions…

We revisit Euler's partition function recurrence, which asserts, for integers $n\geq 1,$ that $$ p(n)=p(n-1)+p(n-2)-p(n-5)-p(n-7)+\dots = \sum_{k\in \mathbb{Z}\setminus \{0\}} (-1)^{k+1} p(n-\omega(k)), $$ where $\omega(m):=(3m^2+m)/2$ is…

In a previous work, we developed an algorithm for the computation of incomplete Bessel functions, which pose as a numerical challenge, based on the $G_{n}^{(1)}$ transformation and Slevinsky-Safouhi formula for differentiation. In the…

A sequence of $\{a_n\}_{n\ge 0}$ satisfies the Briggs inequality if \begin{align*} a_n^2(a_n^2-a_{n-1}a_{n+1})>a_{n-1}^2(a_{n+1}^2-a_na_{n+2}) \end{align*} holds for any $n\ge 1$. In this paper we show that both the partition function…

The Euler-Maclaurin formula which relates a discrete sum with an integral, is generalised to the setting of Riemann-Stieltjes sums and integrals on stochastic processes whose paths are a.s. rectifiable, namely, continuous and with bounded…

It is known that a positive Boolean function f depending on n variables has at least n + 1 extremal points, i.e. minimal ones and maximal zeros. We show that f has exactly n + 1 extremal points if and only if it is linear read-once. The…

By means of the mathematical analysis theory, inequality theory, mathematical induction and the dimension reduction method, under the proper hypotheses, we establish the following cyclic inequalities: \[\sum_{i=1}^{n}…

We obtain bounds on fractional parts of binary forms of the shape $$\Psi(x,y)=\alpha_k x^k+\alpha_l x^ly^{k-l}+\alpha_{l-1}x^{l-1}y^{k-l+1}+\cdots+\alpha_0 y^k$$ with $\alpha_k,\alpha_l,\ldots,\alpha_0\in\mathbb{R}$ and $l\leq k-2.$ By…

In this paper, we establish some nontrivial and effective upper bounds for the least common multiple of consecutive terms of a finite arithmetic progression. Precisely, we prove that for any two coprime positive integers $a$ and $b$, with…

Let $\{U_n\}$ be given by $U_0=1$ and $U_n=-2\sum_{k=1}^{[n/2]} \b n{2k}U_{n-2k}\ (n\ge 1)$, where $[\cdot]$ is the greatest integer function. In the paper we present a summation formula and several congruences involving $\{U_n\}$.

The Kalm\'ar function K(n) counts the ordered factorizations of n as a product of integers bigger than 1. We precise the maximal order of K(n) and give several properties of the K-champions, where n is a K-champion if K(m) < K(n) for all m…