Fixed points of meromorphic functions and of their differences,divided differences and shifts

Let f(z) be a finite order meromorphic function and let c∈C\{0} be a constant.If f(z)has a Borel exceptional value a∈C,it is proved that max{τ(f(z)),τ(△_cf(z))}=max{τ(f(z)),τ(f(z+c))}=max{τ(△_cf(z)),τ(f(z+c))}=σ(f(z)).If f(z) has a Borel exceptional value b∈(C\{0})∪{∞},it is proved that max{τ(f(z)),τ(△cf(z)/f(z))}=max{τ(△cf(z)/f(z)),τ(f(z+c))}=σ(f(z)) unless f(z) takes a special form.Here τ(g(z)) denotes the exponent of convergence of fixed points of the meromorphic function g(z),and σ(g(z)) denotes the order of growth of g(z).     

Approximation of Sondow’s generalized-Euler-constant function on the interval [−1, 1]

Using the Euler-Maclaurin (Boole/Hermite) summation formula, the generalized-Euler-Sondow-constant function γ(z),

$ \gamma(z):=\sum_{k=1}^{\infty}z^{k-1}\left(\frac{1}{k}-\ln\frac{k+1}{k}\right) \qquad (-1\le z\le 1),$

where \({\gamma(-1)=\ln\frac{4}{\pi}}\) and γ(1) is the Euler-Mascheroni constant, is estimated accurately.

     

A generalized Khintchine inequality in rearrangement invariant spaces

Let X be a separable or maximal rearrangement invariant space on [0, 1]. Necessary and sufficient conditions are found under which the generalized Khintchine inequality

$\left\| {\sum\limits_{k = 1}^\infty {f_k } } \right\|_X \leqslant C\left\| {\left( {\sum\limits_{k = 1}^\infty {f_k^2 } } \right)^{1/2} } \right\|_X $

holds for an arbitrary sequence {?_k} _k=1 ^∞ ? X of mean zero independent variables. Moreover, the subspace spanned in a rearrangement invariant space by the Rademacher system with independent vector coefficients is studied.

     

Neighborhood Conditions for Fractional ID-<Emphasis Type="Italic">k</Emphasis>-factor-critical Graphs

Let G be a graph and k ≥ 2 a positive integer. Let h: E(G) → [0, 1] be a function. If \(\sum\limits_{e \mathrel\backepsilon x} {h(e) = k} \) holds for each x ∈ V (G), then we call G[F_h] a fractional k-factor of G with indicator function h where F_h = {e ∈ E(G): h(e) > 0}. A graph G is fractional independent-set-deletable k-factor-critical (in short, fractional ID-k-factor-critical), if G ? I has a fractional k-factor for every independent set I of G. In this paper, we prove that if n ≥ 9k ? 14 and for any subset X ? V (G) we have

$${N_G}(X) = V(G)if|X| \geqslant \left\lfloor {\frac{{kn}}{{3k - 1}}} \right\rfloor ;or|{N_G}(X)| \geqslant \frac{{3k - 1}}{k}|X|if|X| < \left\lfloor {\frac{{kn}}{{3k - 1}}} \right\rfloor ,$$

then G is fractional ID-k-factor-critical.

     

Some Zygmund type inequalities for the <Emphasis Type="Italic">s</Emphasis>th derivative of polynomials

For a polynomial P(z) of degree n having no zeros in |z| < 1, it was recently proved in [9] that

$$\left| {{z^s}{P^{\left( s \right)}}\left( z \right) + \beta \frac{{n\left( {n - 1} \right)...\left( {n - s + 1} \right)}}{{{2^s}}}P\left( z \right)} \right| \leqslant \frac{{n\left( {n - 1} \right)...\left( {n - s + 1} \right)}}{2}\left( {\left| {1 + \frac{\beta }{{{2^s}}}} \right| + \left| {\frac{\beta }{{{2^s}}}} \right|} \right)\mathop {\max }\limits_{\left| z \right| = 1} \left| {P\left( z \right)} \right|$$

for every β ∈ C with |β| ≤ 1, 1 ≤ s ≤ n and |z| = 1. In this paper, we obtain the L _p mean extension of the above and other related results for the sth derivative of polynomials.

     

Inequalities for the derivative of a polynomial

Let P(z) be a polynomial of degreen which does not vanish in ¦z¦ <k, wherek > 0. Fork ≤ 1, it is known that

$$\mathop {\max }\limits_{|z| = 1} |P'(z)| \leqslant \frac{n}{{1 + k^n }}\mathop {\max }\limits_{|z| = 1} |P(z)|$$

, provided ¦P’(z)¦ and ¦Q’(z)¦ become maximum at the same point on ¦z¦ = 1, where\(Q(z) = z^n \overline {P(1/\bar z)} \). In this paper we obtain certain refinements of this result. We also present a refinement of a generalization of the theorem of Tu?an.

     

Two remarks on iterates of Euler’s totient function

Let φ _k denote the kth iterate of Euler’s φ-function. We study two questions connected with these iterates. First, we determine the average order of φ _k and 1/φ _k ; e.g., we show that for each k ≥ 0,

$\sum_{n \leq x} \varphi_{k+1}(n) \sim \frac{3}{k! {\rm e}^{k\gamma}\pi^2}\frac{x^2}{(\log_3{x})^k}\qquad (x\to\infty),$

where γ is the Euler–Mascheroni constant. Second, for prime values of p, we study the number of distinct primes dividing \({\prod_{k=1}^{\infty}\varphi_k(p)}\). These prime divisors are precisely the primes appearing in the Pratt tree for p, which has been the subject of recent work by Ford, Konyagin, and Luca. We show that for each \({\epsilon > 0}\), the number of distinct primes appearing in the Pratt tree for p is \({ > ({\rm log}{p})^{1/2-\epsilon}}\) for all but x ^o(1) primes p ≤ x.

     

Up-embeddability of graphs with new degree-sum

Let G be a k(k ≤ 2)-edge connected simple graph with minimal degree ≥ 3 and girth \(g,r = \left\lfloor {\frac{{g - 1}}{2}} \right\rfloor \). For any edge uv ∈ E(G), if

$${d_G}\left( u \right) + {d_G}\left( v \right) > \frac{{2v\left( G \right) - 2\left( {k + 1} \right)\left( {g - 2r} \right)}}{{\left( {k + 1} \right)\left( {{2^r} - 1} \right)\left( {g - 2r} \right)}} + 2\left( {g - 2r - 1} \right),$$

then G is up-embeddable. Furthermore, similar results for 3-edge connected simple graphs are also obtained.

     

A Refinement of the Kolmogorov–Marcinkiewicz–Zygmund Strong Law of Large Numbers

Let {X _n ; n≥1} be a sequence of independent copies of a real-valued random variable X and set S _n =X ₁+???+X _n , n≥1. This paper is devoted to a refinement of the classical Kolmogorov–Marcinkiewicz–Zygmund strong law of large numbers. We show that for 0<p<2,

$\sum_{n=1}^{\infty}\frac{1}{n}\biggl(\frac{|S_{n}|}{n^{1/p}}\biggr)<\infty\quad \mbox{almost surely}$

if and only if

$\begin{cases}\mathbb{E}|X|^{p}<\infty &; \mbox{if }0 < p < 1,\\\mathbb{E}X=0,\ \sum_{n=1}^{\infty}\frac{|\mathbb{E}XI\{|X|\leq n\}|}{n}<\infty,\mbox{ and }\\\sum_{n=1}^{\infty}\frac{\int_{\min\{u_{n},n\}}^{n}\mathbb{P}(|X|>t)\,dt}{n}<\infty &; \mbox{if }p = 1,\\\mathbb{E}X=0\mbox{ and }\int_{0}^{\infty}\mathbb{P}^{1/p}(|X|>t)\,dt<\infty,&;\mbox{if }1 < p < 2,\end{cases}$

where \(u_{n}=\inf \{t:~\mathbb{P}(|X|>t)<\frac{1}{n}\}\), n≥1. Versions of the above result in a Banach space setting are also presented. To establish these results, we invoke the remarkable Hoffmann-Jørgensen (Stud. Math. 52:159–186, 1974) inequality to obtain some general results for sums of the form \(\sum_{n=1}^{\infty}a_{n}\|\sum_{i=1}^{n}V_{i}\|\) (where {V _n ; n≥1} is a sequence of independent Banach-space-valued random variables, and a _n ≥0, n≥1), which may be of independent interest, but which we apply to \(\sum_{n=1}^{\infty}\frac{1}{n}(\frac{|S_{n}|}{n^{1/p}})\).

     

On a Congruence Involving Generalized Fibonomial Coefficients

Let (F_n)_n≥0 be the Fibonacci sequence. For 1 ≤ k ≤ m, the Fibonomial coefficient is defined as

$${\left[ {\begin{array}{*{20}{c}} n \\ k \end{array}} \right]_F} = \frac{{{F_{n - k + 1}} \cdots {F_{n - 1}}{F_n}}}{{{F_1} \cdots {F_k}}}$$

. In 2013, Marques, Sellers and Trojovský proved that if p is a prime number such that p ≡ ±1 (mod 5), then p?\({\left[ {\begin{array}{*{20}{c}} {{p^{a + 1}}} \\ {{p^a}} \end{array}} \right]_F}\) for all integers a ≥ 1. In 2010, in particular, Kilic generalized the Fibonomial coefficients for

$${\left[ {\begin{array}{*{20}{c}} n \\ k \end{array}} \right]_{F,m}} = \frac{{{F_{\left( {n - k + 1} \right)m}} \cdots {F_{\left( {n - 1} \right)m}}{F_{nm}}}}{{{F_m} \cdots {F_{km}}}}$$

. In this note, we generalize Marques, Sellers and Trojovský result to prove, in particular, that if p ≡ ±1 (mod 5), then \({\left[ {\begin{array}{*{20}{c}} {{p^{a + 1}}} \\ {{p^a}} \end{array}} \right]_{F,m}} \equiv 1\) (mod p), for all a ≥ 0 and m ≥ 1.

     

Distance-Regular Shilla Graphs with <Emphasis Type="Italic">b</Emphasis><Subscript>2</Subscript> = <Emphasis Type="Italic">c</Emphasis><Subscript>2</Subscript>

A Shilla graph is defined as a distance-regular graph of diameter 3 with second eigen-value θ₁ equal to a₃. For a Shilla graph, let us put a = a₃ and b = k/a. It is proved in this paper that a Shilla graph with b₂ = c₂ and noninteger eigenvalues has the following intersection array:

$$\left\{ {\frac{{{b^2}\left( {b - 1} \right)}}{2},\frac{{\left( {b - 1} \right)\left( {{b^2} - b + 2} \right)}}{2},\frac{{b\left( {b - 1} \right)}}{4};1,\frac{{b\left( {b - 1} \right)}}{4},\frac{{b{{\left( {b - 1} \right)}^2}}}{2}} \right\}$$

If Γ is a Q-polynomial Shilla graph with b₂ = c₂ and b = 2r, then the graph Γ has intersection array

$$\left\{ {2tr\left( {2r + 1} \right),\left( {2r + 1} \right)\left( {2rt + t + 1} \right),r\left( {r + t} \right);1,r\left( {r + t} \right),t\left( {4{r^2} - 1} \right)} \right\}$$

and, for any vertex u in Γ, the subgraph Γ₃(u) is an antipodal distance-regular graph with intersection array

$$\left\{ {t\left( {2r + 1} \right),\left( {2r - 1} \right)\left( {t + 1} \right),1;1,t + 1,t\left( {2r + 1} \right)} \right\}$$

The Shilla graphs with b₂ = c₂ and b = 4 are also classified in the paper.

     

Adaptive Fourier series—a variation of greedy algorithm

We study decomposition of functions in the Hardy space \(H^2(\mathbb{D} )\) into linear combinations of the basic functions (modified Blaschke products) in the system

$\label{Walsh like} {B}_n(z)= \frac{\sqrt{1-|a_n|^2}}{1-\overline{a}_{n}z}\prod\limits_{k=1}^{n-1}\frac{z-a_k}{1-\overline{a}_{k}z}, \quad n=1,2,..., $

(1)

where the points a _n ’s in the unit disc \(\mathbb{D}\) are adaptively chosen in relation to the function to be decomposed. The chosen points a _n ’s do not necessarily satisfy the usually assumed hyperbolic non-separability condition

$\label{condition} \sum\limits_{k=1}^\infty (1-|a_k|)=\infty $

(2)

in the traditional studies of the system. Under the proposed procedure functions are decomposed into their intrinsic components of successively increasing non-negative analytic instantaneous frequencies, whilst fast convergence is resumed. The algorithm is considered as a variation and realization of greedy algorithm.

     

Symmetric quasi-norms of sums of independent random variables in symmetric function spaces with the Kruglov property

Let X be a symmetric Banach function space on [0, 1] and let E be a symmetric (quasi)-Banach sequence space. Let f = {f _k } _k=1 ⁿ , n ≥ 1 be an arbitrary sequence of independent random variables in X and let {e _k } _k=1 ^∞ ? E be the standard unit vector sequence in E. This paper presents a deterministic characterization of the quantity

$||||\sum\limits_{k = 1}^n {{f_k}{e_k}|{|_E}|{|_X}} $

in terms of the sum of disjoint copies of individual terms of f. We acknowledge key contributions by previous authors in detail in the introduction, however our approach is based on the important recent advances in the study of the Kruglov property of symmetric spaces made earlier by the authors. Authors acknowledge support from the ARC.

     

Spectrum and the trace formula for a two-dimensional Schrödinger operator in a homogeneous magnetic field

In the space L ₂(?²), we consider the operator

$H = \left( {\frac{1}{i}\frac{\partial }{{\partial x_1 }} - x_2 } \right)^2 + \left( {\frac{1}{i}\frac{\partial }{{\partial x_2 }} + x_1 } \right)^2 + V,V = V(x) \in L_2 (\mathbb{R}^2 ).$

. We study the spectrum of H and, for V ∈ C ₀ ² (?²), prove the trace formula

$\sum\limits_{k = 0}^\infty {\left( {\sum\limits_{i = - k}^\infty {(4k + 2 - \mu _k^{(i)} ) + c_0 } } \right)} = \frac{1}{{8\pi }}\int\limits_{\mathbb{R}^2 } {V^2 (x)dx,} $

where c ₀ = π ^?1 \(\smallint _{\mathbb{R}^2 } \) V(x) dx and the µ _k ⁽ⁱ⁾ are the eigenvalues of H.

     

Moderate deviation principle for <Emphasis Type="Italic">m</Emphasis>-dependent random variables<Superscript>*</Superscript>

Let {X _n }_n?≥?1 be a sequence of strictly stationary m-dependent random variableswith EX₁ = 0 and \( \mathrm{E}{X}_1^2<\infty \), and let (b _n ) be an increasing sequence of positive numbers such that b _n ?↑?∞ and \( {b}_n/\sqrt{n}\downarrow 0\kern0.5em \mathrm{as}\kern0.5em n\to \infty \). We establish a moderate deviation principle of \( {\left({b}_n\sqrt{n}\right)}^{-1}{\sum}_{i=1}^n{X}_i \) under the condition

$$ \underset{n\to \infty }{\lim \sup}\frac{1}{b_n^2}\log \left[n\mathbf{P}\left(\left|{X}_1\right|>{b}_n\sqrt{n}\right)\right]=-\infty, $$

which is weaker than the classical exponential integrability condition. The results in the present paper weaken the assumptions of Chen [5] and extend partially the results of Eichelsbacher and Löwe [10].     

Endpoint asymptotics for Müntz–Legendre polynomials

Müntz–Legendre polynomials L _n (Λ;x) associated with a sequence Λ={λ _k } are obtained by orthogonalizing the system \((x^{\lambda_{0}},x^{\lambda_{1}},x^{\lambda_{2}},\dots)\) in L ₂[0,1] with respect to the Legendre weight. Under very mild conditions on Λ, we establish the endpoint asymptotics close to x=1. The main result is

$\lim_{n\to\infty}L_n\left(1-\frac{y^2}{4S_n}\right)=J_0\big(|y|\big)$

where \(S_{n}=\sum_{k=0}^{n-1}(2\lambda_{k}+1)+\frac{2\lambda_{n}+1}{2}\) and J ₀ is the Bessel function of order 0.

     

The <Emphasis Type="Italic">p</Emphasis>-adic order of some fibonomial coefficients whose entries are powers of <Emphasis Type="Italic">p</Emphasis>

Let (F _n ) _n≥0 be the Fibonacci sequence. For 1 ≤ k ≤ m, the Fibonomial coefficient is defined as

$${\left[ {\begin{array}{*{20}{c}} m \\ k \end{array}} \right]_F} = \frac{{{F_{m - k + 1}} \cdots {F_{m - 1}}{F_m}}}{{{F_1} \cdots {F_k}}}$$

. In 2013, Marques, Sellers and Trojovský proved that if p is a prime number such that p ≡ ±2 (mod 5), then \(p{\left| {\left[ {\begin{array}{*{20}{c}} {{p^{a + 1}}} \\ {{p^a}} \end{array}} \right]} \right._F}\) for all integers a ≥ 1. In 2015, Marques and Trojovský worked on the p-adic order of \({\left[ {\begin{array}{*{20}{c}} {{p^{a + 1}}} \\ {{p^a}} \end{array}} \right]_F}\) for all a ≥ 1 when p ≠ 5. In this paper, we shall provide the exact p-adic order of \({\left[ {\begin{array}{*{20}{c}} {{p^{a + 1}}} \\ {{p^a}} \end{array}} \right]_F}\) for all integers a, b ≥ 1 and for all prime number p.

     

A new approximate proximal point algorithm for maximal monotone operator

The problem concerned in this paper is the set-valued equation 0 ∈T(z) where T is a maximal monotone operator. For given xk and βk > 0, some existing approximate proximal point algorithms take x~(k+1) = xk such thatwhere {ηk} is a non-negative summable sequence. Instead of xk+1 = xk , the new iterate of the proposing method is given bywhere Ω is the domain of T and PΩ(·) denotes the projection on Ω. The convergence is proved under a significantly relaxed restriction supk>0 ηk<1.     

On the uniform Kreiss resolvent condition

Let B be a Banach space with norm ‖ · ‖ and identity operator I. We prove that, for a bounded linear operator T in B, the strong Kreiss resolvent condition

$\parallel (T - \lambda I)^{ - k} \parallel \leqslant \frac{M}{{(|\lambda | - 1)^k }}, |\lambda | > 1,k = 1,2, \ldots ,$

implies the uniform Kreiss resolvent condition

$\left\| {\sum\limits_{k = 0}^n {\frac{{T^k }}{{\lambda ^{k + 1} }}} } \right\| \leqslant \frac{L}{{|\lambda | - 1}}, |\lambda | > 1, n = 0,1,2, \ldots .$

We establish that an operator T satisfies the uniform Kreiss resolvent condition if and only if so does the operator T ^m for each integer m ? 2.