On the trigonometric polynomials of Fejér and Young

The trigonometric polynomials of Fejér and Young are defined by $S_n (x) = \sum\nolimits_{k = 1}^n {\tfrac{{\sin (kx)}} {k}}$S_n (x) = \sum\nolimits_{k = 1}^n {\tfrac{{\sin (kx)}} {k}} and $C_n (x) = 1 + \sum\nolimits_{k = 1}^n {\tfrac{{\cos (kx)}} {k}}$C_n (x) = 1 + \sum\nolimits_{k = 1}^n {\tfrac{{\cos (kx)}} {k}}, respectively. We prove that the inequality $\left( {{1 \mathord{\left/ {\vphantom {1 9}} \right. \kern-\nulldelimiterspace} 9}} \right)\sqrt {15} \leqslant {{C_n \left( x \right)} \mathord{\left/ {\vphantom {{C_n \left( x \right)} {S_n \left( x \right)}}} \right. \kern-\nulldelimiterspace} {S_n \left( x \right)}}$\left( {{1 \mathord{\left/ {\vphantom {1 9}} \right. \kern-\nulldelimiterspace} 9}} \right)\sqrt {15} \leqslant {{C_n \left( x \right)} \mathord{\left/ {\vphantom {{C_n \left( x \right)} {S_n \left( x \right)}}} \right. \kern-\nulldelimiterspace} {S_n \left( x \right)}} holds for all n ≥ 2 and x ∈ (0, π). The lower bound is sharp.     

Complete moment and integral convergence for sums of negatively associated random variables

For a sequence of identically distributed negatively associated random variables {Xn; n ≥ 1} with partial sums Sn = ∑i=1^n Xi, n ≥ 1, refinements are presented of the classical Baum-Katz and Lai complete convergence theorems. More specifically, necessary and sufficient moment conditions are provided for complete moment convergence of the form ∑n≥n0 n^r-2-1/pq anE（max1≤k≤n｜Sk｜^1/q-∈bn^1/qp）^＋〈∞to hold where r 〉 1, q 〉 0 and either n0 = 1,0 〈 p 〈 2, an = 1,bn = n or n0 = 3,p = 2, an = 1 （log n） ^1/2q, bn=n log n. These results extend results of Chow and of Li and Spataru from the indepen- dent and identically distributed case to the identically distributed negatively associated setting. The complete moment convergence is also shown to be equivalent to a form of complete integral convergence.     

Stability of symmetric closed characteristics on symmetric compact convex hypersurfaces in ℝ<Superscript>2<Emphasis Type="Italic">n</Emphasis></Superscript> under a pinching condition

In this paper, let Σ R2n be a symmetric compact convex hypersurface which is ( r, R )- pinched with R/r (5/3)1/2 . Then Σ carries at least two elliptic symmetric closed characteristics; moreover, Σ carries at least E [ n-1/2 ] + E [ n-1/3 ] non-hyperbolic symmetric closed characteristics.     

Proof of a conjecture of V. Nikiforov

Using analytical tools, we prove that for any simple graph G on n vertices and its complement [`(G)]\bar G the inequality $\mu \left( G \right) + \mu \left( {\bar G} \right) \leqslant \tfrac{4} {3}n - 1$\mu \left( G \right) + \mu \left( {\bar G} \right) \leqslant \tfrac{4} {3}n - 1 holds, where μ(G) and m( [`(G)] )\mu \left( {\bar G} \right) denote the greatest eigenvalue of adjacency matrix of the graphs G and [`(G)]\bar G respectively.     

Fujita-Liouville Type Theorem for Coupled Fourth-Order Parabolic Inequalities

This paper deals with a coupled system of fourth-order parabolic inequalities |u|t ≥ 2u + |v|q,|v|t ≥ 2v + |u|p in S = Rn × R+ with p,q > 1,n ≥ 1.A FujitaLiouville type theorem is established that the inequality system does not admit nontrivial nonnegative global solutions on S whenever n4 ≤ max(ppq+11,pqq+11).Since the general maximum-comparison principle does not hold for the fourth-order problem,the authors use the test function method to get the global non-existence of nontrivial solutions.     

On the Fon-Der-Flaass interpretation of extremal examples for Turán’s (3, 4)-problem

Fon-Der-Flaass (1988) presented a general construction that converts an arbitrary [(C)\vec]₄\vec C_4 -free oriented graph Γ into a Turán (3, 4)-graph. He observed that all Turán-Brown-Kostochka examples result from his construction, and proved the lower bound $\tfrac{4} {9} $\tfrac{4} {9} (1 − o(1)) on the edge density of any Turán (3, 4)-graph obtainable in this way. In this paper we establish the optimal bound $\tfrac{3} {7} $\tfrac{3} {7} (1 − o(1)) on the edge density of any Turán (3, 4)-graph resulting from the Fon-Der-Flaass construction under any of the following assumptions on the undirected graph G underlying the oriented graph Γ: (i) G is complete multipartite; (ii) the edge density of G is not less than $\tfrac{2} {3} - \varepsilon $\tfrac{2} {3} - \varepsilon for some absolute constant ε > 0. We are also able to improve Fon-Der-Flaass’s bound to $\tfrac{7} {{16}} $\tfrac{7} {{16}} (1 − o(1)) without any extra assumptions on Γ.     

Asymptotic property of approximation to x αsgn x by Newman Type Operators

Approximation to the function ｜x｜ plays an important role in approximation theory. This paper studies the approximation to the function xαsgn x, which equals ｜x｜ if α = 1. We construct a Newman Type Operator rn（x） and prove max ｜x｜≤1｜xαsgn x-rn（x）｜～Cn1/4e-π1/2（1/2）αn.     

Jacob’s ladders,the structure of the Hardy-Littlewood integral and some new class of nonlinear integral equations

In this paper we obtain new formulae for short and microscopic parts of the Hardy-Littlewood integral, and the first asymptotic formula for the sixth-order expression $\left| {\zeta \left( {\tfrac{1} {2} + i\phi _1 \left( t \right)} \right)} \right|^4 \left| {\zeta \left( {\tfrac{1} {2} + it} \right)} \right|^2$\left| {\zeta \left( {\tfrac{1} {2} + i\phi _1 \left( t \right)} \right)} \right|^4 \left| {\zeta \left( {\tfrac{1} {2} + it} \right)} \right|^2. These formulae cannot be obtained in the theories of Balasubramanian, Heath-Brown and Ivić.     

Joint asymptotic distribution of exceedances point process and partial sum of stationary Gaussian sequence

Let {X _i } _i=1^∞ be a standardized stationary Gaussian sequence with covariance function r(n) = EX ₁ X _n+1, S _n = Σ _i=1 ⁿ X _i , and $\bar X_n = \tfrac{{S_n }} {n} $\bar X_n = \tfrac{{S_n }} {n} . And let N _n be the point process formed by the exceedances of random level $(\tfrac{x} {{\sqrt {2\log n} }} + \sqrt {2\log n} - \tfrac{{\log (4\pi \log n)}} {{2\sqrt {2\log n} }})\sqrt {1 - r(n)} + \bar X_n $(\tfrac{x} {{\sqrt {2\log n} }} + \sqrt {2\log n} - \tfrac{{\log (4\pi \log n)}} {{2\sqrt {2\log n} }})\sqrt {1 - r(n)} + \bar X_n by X ₁,X ₂,…, X _n . Under some mild conditions, N _n and S _n are asymptotically independent, and N _n converges weakly to a Poisson process on (0,1].     

The Riemann zeta-function and moment conjectures from Random Matrix Theory

On the basis of the Random Matrix Theory-model several interesting conjectures for the Riemann zeta-function were made during the recent past, in particular, asymptotic formulae for the 2kth continuous and discrete moments of the zeta-function on the critical line,

A general law of moment convergence rates for uniform empirical process

Let {X _n ; n ≥ 1} be a sequence of independent and identically distributed U[0,1]-distributed random variables. Define the uniform empirical process $F_n (t) = n^{ - \tfrac{1} {2}} \sum\nolimits_{i = 1}^n {(I_{\{ X_i \leqslant t\} } - t),0} \leqslant t \leqslant 1,\left\| {F_n } \right\| = \sup _{0 \leqslant t \leqslant 1} \left| {F_n (t)} \right| $F_n (t) = n^{ - \tfrac{1} {2}} \sum\nolimits_{i = 1}^n {(I_{\{ X_i \leqslant t\} } - t),0} \leqslant t \leqslant 1,\left\| {F_n } \right\| = \sup _{0 \leqslant t \leqslant 1} \left| {F_n (t)} \right| . In this paper, the exact convergence rates of a general law of weighted infinite series of E {‖F _n ‖ − ɛg ^s (n)}₊ are obtained.     

Ordering graphs with cut edges by their spectral radii

Let Gnk denote a set of graphs with n vertices and k cut edges. In this paper, we obtain an order of the first four graphs in Gnk in terms of their spectral radii for 6 ≤ k ≤ (n-2)/3.     

Limitations of VCG-based mechanisms

We consider computationally-efficient truthful mechanisms that use the VCG payment scheme, and study how well they can approximate the social welfare in auction settings. We present a novel technique for setting lower bounds on the approximation ratio of this type of mechanisms. Our technique is based on setting lower bounds on the communication complexity by analyzing combinatorial properties of the algorithms. Specifically, for combinatorial auctions among submodular (and thus also subadditive) bidders we prove an $\Omega \left( {m^{\tfrac{1} {6}} } \right)$\Omega \left( {m^{\tfrac{1} {6}} } \right) lower bound, which is close to the known upper bound of ${\rm O}\left( {m^{\tfrac{1} {2}} } \right)${\rm O}\left( {m^{\tfrac{1} {2}} } \right), and qualitatively higher than the constant factor approximation possible from a purely computational point of view.     

An Application of Exponential Sum Estimates

Let p be an odd prime and let δ be a fixed real number with 0<δ<2. For an integer a with 0<a<p, denote by ā the unique integer between 0 and p satisfying a ā≡1 (mod p). Further, let {x} denote the fractional part of x. We derive an asymptotic formula for the number of pairs of integers (a, b with . This work is supported by N. S. F. of P. R. China (10271093)     

On a variant of Giuga numbers

In this paper, we characterize the odd positive integers n satisfying the congruence∑n -1 j=1 j n-1/2 ≡ 0 (mod n). We show that the set of such positive integers has an asymptotic density which turns out to be slightly larger than 3/8.     

On <Emphasis Type="Italic">T</Emphasis> points of algebroid functions

In this paper, we firstly give a new definition, namely, the T point of algebroid functions. Then by using Ahlfors’ theory of covering surfaces, we prove the existence of these points for any ν-valued algebroid functions in the unit disk satisfying $\mathop {\lim \sup }\limits_{r \to 1^ - } \frac{{T(r,w)}} {{\log \tfrac{1} {{1 - r}}}} = + \infty $\mathop {\lim \sup }\limits_{r \to 1^ - } \frac{{T(r,w)}} {{\log \tfrac{1} {{1 - r}}}} = + \infty . This extends the recent results of Xuan, Wu and Sun.     

A condition for asymptotic finite-dimensionality of an operator semigroup

Let X be a Banach space and let T: X → X be a power bounded linear operator. Put X ₀ = {x ∈ X ∣ T ⁿ x → 0}. Assume given a compact set K ⊂ X such that lim inf _n→∞ ρ{T ⁿ x, K} ≤ η < 1 for every x ∈ X, ∥x∥ ≤ 1. If $\eta < \tfrac{1} {2} $\eta < \tfrac{1} {2} , then codim X ₀ < ∞. This is true in X reflexive for $\eta \in [\tfrac{1} {2},1) $\eta \in [\tfrac{1} {2},1) , but fails in the general case.     

New improvements on connectivity of cages

A (δ, g)-cage is a δ-regular graph with girth g and with the least possible number of vertices. In this paper, we show that all (δ, g)-cages with odd girth g ≥ 9 are r-connected, where (r − 1)² ≤ δ + $ \sqrt \delta $ \sqrt \delta − 2 < r ² and all (δ, g)-cages with even girth g ≥ 10 are r-connected, where r is the largest integer satisfying $ \frac{{r\left( {r - 1} \right)^2 }} {4} + 1 + 2r\left( {r - 1} \right) \leqslant \delta $ \frac{{r\left( {r - 1} \right)^2 }} {4} + 1 + 2r\left( {r - 1} \right) \leqslant \delta . These results support a conjecture of Fu, Huang and Rodger that all (δ, g)-cages are δ-connected.     

Some properties for a class of symmetric functions with applications

For x = (x ₁, x ₂, ..., x _n ) ∈ ℝ₊ ⁿ , the symmetric function ψ _n (x, r) is defined by $\psi _n (x,r) = \psi _n \left( {x_1 ,x_2 , \cdots ,x_n ;r} \right) = \sum\limits_{1 \leqslant i_1 < i_2 \cdots < i_r \leqslant n} {\prod\limits_{j = 1}^r {\frac{{1 + x_{i_j } }} {{x_{i_j } }}} } ,$\psi _n (x,r) = \psi _n \left( {x_1 ,x_2 , \cdots ,x_n ;r} \right) = \sum\limits_{1 \leqslant i_1 < i_2 \cdots < i_r \leqslant n} {\prod\limits_{j = 1}^r {\frac{{1 + x_{i_j } }} {{x_{i_j } }}} } ,     

On the period function of a class of reversible quadratic centers

This paper is devoted to the study of the period function for a class of reversible quadratic system