On the proof of Erdős’ inequality

Using undergraduate calculus, we give a direct elementary proof of a sharp Markov-type inequality \({\left\| {p'} \right\|_{\left[ { - 1,1} \right]}} \leqslant \frac{1}{2}{\left\| p \right\|_{\left[ { - 1,1} \right]}}\) for a constrained polynomial p of degree at most n, initially claimed by P. Erd?s, which is different from the one in the paper of T.Erdélyi (2015). Whereafter, we give the situations on which the equality holds. On the basis of this inequality, we study the monotone polynomial which has only real zeros all but one outside of the interval (?1, 1) and establish a new asymptotically sharp inequality.     

Cubic symmetric polynomials yielding variations of the Erdős–Ginzburg–Ziv theorem

Let p be a prime and let $\varphi\in\mathbb{Z}_{p}[x_{1},x_{2},\ldots, x_{p}]$ be a symmetric polynomial, where  $\mathbb {Z}_{p}$ is the field of p elements. A sequence T in  $\mathbb {Z}_{p}$ of length p is called a φ-zero sequence if φ(T)=0; a sequence in $\mathbb {Z}_{p}$ is called a φ-zero free sequence if it does not contain any φ-zero subsequence. Motivated by the EGZ theorem for the prime p, we consider symmetric polynomials $\varphi\in \mathbb {Z}_{p}[x_{1},x_{2},\ldots, x_{p}]$ , which satisfy the following two conditions: (i) every sequence in  $\mathbb {Z}_{p}$ of length 2p?1 contains a φ-zero subsequence, and (ii) the φ-zero free sequences in  $\mathbb {Z}_{p}$ of maximal length are all those containing exactly two distinct elements, where each element appears p?1 times. In this paper, we determine all symmetric polynomials in $\mathbb {Z}_{p}[x_{1},x_{2},\ldots, x_{p}]$ of degree not exceeding 3 satisfying the conditions above.     

A hybrid inequality of Erdös–Turán–Koksma for digital sequences

For bases $\mathbf{b}=(b_1, \ldots , b_s)$ of $s$ not necessarily distinct integers $b_i\ge 2$ , we prove a version of the inequality of Erdös–Turán–Koksma for the hybrid function system composed of the Walsh functions in base $\mathbf{b}^{(1)}=(b_1, \ldots , b_{s_1})$ and, as second component, the $\mathbf{b}^{(2)}$ -adic functions, $\mathbf{b}^{(2)}=(b_{s_1+1}, \ldots , b_s)$ , with $s=s_1+s_2$ , $s_1$ and $s_2$ not both equal to 0. Further, we point out why this choice of a hybrid function system covers all possible cases of sequences that employ addition of digit vectors as their main construction principle.     

On the restricted Chebyshev–Boubaker polynomials

Using the language of Riordan arrays, we study a one-parameter family of orthogonal polynomials that we call the restricted Chebyshev–Boubaker polynomials. We characterize these polynomials in terms of the three term recurrences that they satisfy, and we study certain central sequences defined by their coefficient arrays. We give an integral representation for their moments, and we show that the Hankel transforms of these moments have a simple form. We show that the (sequence) Hankel transform of the row sums of the corresponding moment matrix is defined by a family of polynomials closely related to the Chebyshev polynomials of the second kind, and that these row sums are in fact the moments of another family of orthogonal polynomials.     

On a paper of Erdös and Szekeres

Propositions 1.1–1.3 stated below contribute to results and certain problems considered in [E-S], on the behavior of products\(\Pi^n_1(1-z^{a_j}),1\leq{a_1}...\leq{a_n}\) integers. In the discussion below, {a₁,..., a_n} will be either a proportional subset of {1,..., n} or a set of large arithmetic diameter.     

On a problem of Erdös and Alladi

We give an estimate for the quantity {f(n):nx, p(n)y}, wherep(n) denotes the greatest prime factor ofn andf belongs to a certain class of multiplicative functions. As an application, we show that for the Moebius function, ({(n):nx, p(n)y}) ({1:nx, p(n)y})^–1 tends to zero, asx, uniformly iny2, and thus settle a conjecture of Erdös.Supported by a grant from the Deutsche Forschungsgesellschaft.     

On Jensen’s inequality and Hölder’s inequality for g-expectation

In this paper, we shall prove that for n > 1, the n-dimensional Jensen inequality holds for the g-expectation if and only if g is independent of y and linear with respect to z, in other words, the corresponding g-expectation must be linear. A Similar result also holds for the general nonlinear expectation defined in Coquet et al. (Prob. Theory Relat. Fields 123 (2002), 1–27 or Peng (Stochastic Methods in Finance Lectures, LNM 1856, 143–217, Springer-Verlag, Berlin, 2004). As an application of a special n-dimensional Jensen inequality for g-expectation, we give a sufficient condition for g under which the Hölder’s inequality and Minkowski’s inequality for the corresponding g-expectation hold true.     

On the constant and step in Jackson’s inequality for best approximations by trigonometric polynomials and by Haar polynomials

We consider the C*-algebra generated by multidimensional integral operators with (?n)th-order homogeneous kernels and by the operators of multiplication by oscillating coefficients of the form |x|^iα. For this algebra, we construct an operator symbolic calculus and obtain necessary and sufficient conditions for the Fredholm property of an operator in terms of this calculus.     

An extension of the Landau-Kolmogorov inequality. Solution of a problem of Erdös

For any fixed finite interval [a, b] on the real line, an arbitrary natural numberr and σ>0, we describe the extremal function to the problem $\left\| {f^{(k)} } \right\|L_p \left[ {a,b} \right]^{ \to \sup } \left( {1 \leqslant k \leqslant r - 1, 1 \leqslant p< \infty } \right)$ over all functionsf ∈W _∞ ^r such that |f ^(r)(x)| ≤σ, |f(x)|≤1 on (?∞, ∞). Similarly, we solve the problem, raised by Paul Erdös, of characterizing the trigonometric polynomial of fixed uniform norm whose graph has maximal arc length over [a, b].     

Further discrepancy bounds and an Erdös–Turán–Koksma inequality for hybrid sequences

We consider hybrid sequences, that is, sequences in a multidimensional unit cube that are composed from lower-dimensional sequences of two different types. We establish nontrivial deterministic discrepancy bounds for five kinds of hybrid sequences as well as a new version of the Erdös–Turán–Koksma inequality which is suitable for hybrid sequences.     

On Karatsuba’s problem concerning the divisor function

We study an asymptotic behavior of the sum ${\sum_{n \leqslant x} \frac{\tau(n)}{\tau(n+a)}}$ . Here τ(n) denote the number of divisors of n and ${a\,\geqslant\,1}$ is a fixed integer.