The asymptotic distribution of weighted empirical distribution functions

Let G_n denote the empirical distribution based on n independent uniform (0, 1) random variables. The asymptotic distribution of the supremum of weighted discrepancies between G_n(u) and u of the forms 6w_v(u)D_n(u)6 and 6w_v(G_n(u))D_n(u)6, where D_n(u) = G_n(u)?u, w_v(u) = (u(1?u))^?1+v and 0 ? v < $\text{1}\text{2}$ is obtained. Goodness-of-fit tests based on these statistics are shown to be asymptotically sensitive only in the extreme tails of a distribution, which is exactly where such statistics that use a weight function w_v with $\text{1}\text{2}$ ? v ? 1 are insensitive. For this reason weighted discrepancies which use the weight function w_v with 0 ? v < $\text{1}\text{2}$ are potentially applicable in the construction of confidence contours for the extreme tails of a distribution.     

L p -decay rates to nonlinear diffusion waves for p-system with nonlinear damping

In this paper, we study the L ^p (2 ? p ? +∞) convergence rates of the solutions to the Cauchy problem of the so-called p-system with nonlinear damping. Precisely, we show that the corresponding Cauchy problem admits a unique global solution (v(x,t), u(x,t)) and such a solution tends time-asymptotically to the corresponding nonlinear diffusion wave (?(x,t), ū(x,t)) governed by the classical Darcys’s law provided that the corresponding prescribed initial error function (w ₀(x), z ₀(x)) lies in (H ³ × H ²) (?) and |v ₊ ? v _?| + ∥w ₀∥₃ + ∥z ₀∥₂ is sufficiently small. Furthermore, the L ^p (2 ? p ? +∞) convergence rates of the solutions are also obtained.     

A new proof of a theorem of Harper on the Sperner-Erdös problem

Let P be a finite, partially ordered set and v a weight on P, i.e., a function v: P → R₊/{0. A subset F ? P) is called a k-family, if there are not c₀,…,c_k?F such that c₀ < … <c_k. Let d_k(P, v) = max {Σ_x?Fv(x); F is k-family. It is given a new proof of a theorem of Harper which states that d_k(P, v) = d_k(Q, w), if there is a flow morphism from (P, v) onto (Q, w).     

Polynomials orthogonal on the semicircle,II

Generalizing previous work [2], we study complex polynomials {π _k },π _k (z)=z ^k +?, orthogonal with respect to a complex-valued inner product (f,g)=∫ ₀ ^π f(e ^iθ)g(e ^iθ)w(e ^iθ)dθ. Under suitable assumptions on the “weight function”w, we show that these polynomials exist whenever Re ∫ ₀ ^π w(e ^iθ)dθ≠0, and we express them in terms of the real polynomials orthogonal with respect to the weight functionw(x). We also obtain the basic three-term recurrence relation. A detailed study is made of the polynomials {π _k } in the case of the Jacobi weight functionw(z)=(1?z)^α(1+z)^β, α>?1, and its special case \(\alpha = \beta = \lambda - \tfrac{1}{2}\) (Gegenbauer weight). We show, in particular, that for Gegenbauer weights the zeros ofπ _n are all simple and, ifn≥2, contained in the interior of the upper unit half disc. We strongly suspect that the same holds true for arbitrary Jacobi weights. Finally, for the Gegenbauer weight, we obtain a linear second-order differential equation forπ _n (z). It has regular singular points atz=1, ?1, ∞ (like Gegenbauer's equation) and an additional regular singular point on the negative imaginary axis, which depends onn.     

The Exponent of Discrepancy Is at Least 1.0669

LetP⊂[0, 1]^dbe ann-point set and letw: P→[0, ∞) be a weight function withw(P)=∑_z∈P w(z)=1. TheL₂-discrepancy of the weighted set (P, w) is defined as theL₂-average ofD(x)=vol(B_x)−w(P∩B_x) overx∈[0, 1]^d, where vol(B_x) is the volume of thed-dimensional intervalB_x=∏^d_k=1 [0, x_k). The exponent of discrepancyp* is defined as the infimum of numberspsuch that for all dimensionsd⩾1 and allε>0 there exists a weighted set of at mostKε^−ppoints in [0, 1]^dwithL₂-discrepancy at mostε, whereK=K(p) is a suitable number independent ofεandd. Wasilkowski and Woźniakowski proved thatp*⩽1.4779, by combining known bounds for the error of numerical integration and using their relation toL₂-discrepancy. In this note we observe that a careful treatment of a classical lower- bound proof of Roth yieldsp*⩾1.04882, and by a slight modification of the proof we getp*⩾1.0669. Determiningp* exactly seems to be quite a difficult problem.     

Integers with dense divisors

Let 1=d₁(n)<d₂(n)<?<d_τ(n)=n be the sequence of all positive divisors of the integer n in increasing order. We say that the divisors of n are y-dense iff max_1?i<τ(n)d_i+1(n)/d_i(n)?y. Let D(x,y,z) be the number of positive integers not exceeding x whose divisors are y-dense and whose prime divisors are bigger than z, and let , and . We show that is equivalent, in a large region, to a function d(u,v) which satisfies a difference-differential equation. Using that equation we find that d(u,v)?(1−u/v)/(u+1) for v?3+ε. Finally, we show that d(u,v)=e^−γd(u)+O(1/v), where γ is Euler's constant and d(u)∼x⁻¹D(x,y,1), for fixed u. This leads to a new estimate for d(u).     

The inverse of a matrix polynomial

An explicit representation is obtained for P(z)^?1 when P(z) is a complex n×n matrix polynomial in z whose coefficient of the highest power of z is the identity matrix. The representation is a sum of terms involving negative powers of z?λ for each λ such that P(λ) is singular. The coefficients of these terms are generated by sequences u_k, v_k of 1×n and n×1 vectors, respectively, which satisfy u₁≠0, v₁≠0, ∑^k?1_h=0(1?h!)u_k?hP^(h)(λ)=0, ∑^k?1_h=0(1?h!)P^(h)(λ)v_k?h=0, and certain orthogonality relations. In more general cases, including that when P(z) is analytic at λ but not necessarily a polynomial, the terms in the representation involving negative powers of z?λ provide the principal part of the Laurent expansion for P(z)^?1 in a punctured neighborhood of z=λ.     

On almost good triples of vertices in edge regular graphs

Consider a connected edge regular graph Γ with parameters (v, k, λ) and put b ₁ = k?λ?1. A triple (u, w, z) of vertices is called (almost) good whenever d(u, w) = d(u, z) = 2 and µ(u, w)+µ(u, z) ≤ 2k ? 4b ₁ + 3 (and µ(u, w) + µ(u, z) = 2k ? 4b ₁ + 4). If k = 3b ₁ + γ with γ ≥ ?2, a triple (u, w, z) is almost good, and Δ = [u] ∩ [w] ∩ [z] then: either |Δ| ≤ 2; or Δ is a 3-clique and Γ is a Clebsch graph; or Δ is a 3-clique, k = 16, b ₁ = 6, and v = 31; or Δ is a 4-clique and Γ is a Schläfli graph.     

Spatial energy decay estimate in dynamical problems for a micropolar viscoelastic solid

We consider a linear micropolar viscoelastic solid occupying a domainB in dynamical conditions. First, on assuming thatB is of the kindB={∈R:x’ =(x ₁,x ₂)∈D(x ₃);x ₃∈R⁺⁺}, and that the body is subjected to boundary data different from zero only onD(0), we estimate for any fixedt>0, in terms of the initial and boundary data, the «energy» of the portions of the solid at distance greater thanz fromD(0)(g _t(z)) and its norm inL ¹(0,t) (G_t(z)). Moreover we show that, if there exists somez ₀≥0, such that past histories vanish onD(z) withz≥z ₀, then for any fixedt>0 the points (x’’, z) withz?z ₀≥Vt are at rest, while forz?z ₀≤Vt, G_t(z) decays withz?z ₀, the decay rate being described by the factor $1 - \frac{{z - z_0 }}{{Vt}}$ .V is a computable positive constant depending on the relaxation functions, the mass density and the microinertial tensor. Finally these last results are extended to more general domains under the hypothesis that the initial and boundary data have a bounded support. In our analysis we make use of a Maximal Free Energy which allows us to impose very mild restrictions on the relaxation functions.     

Trees of extremal connectivity index

The connectivity index w_α(G) of a graph G is the sum of the weights (d(u)d(v))^α of all edges uv of G, where α is a real number (α≠0), and d(u) denotes the degree of the vertex u. Let T be a tree with n vertices and k pendant vertices. In this paper, we give sharp lower and upper bounds for w₁(T). Also, for -1?α<0, we give a sharp lower bound and a upper bound for w_α(T).     

Entrainment of frequency in evolution equations

The existence of periodic solutions near resonance is discussed using elementary methods for the evolution equation ·u = Au + ?f(t, u) when the linear problem is totally degenerate (e^2πA = I) and the period of f is entrained with ? (T = 2π(1 + ?μ)). The approach is to solve the periodicity equation u(T,p,?) = p for an element p(?) in D, the domain of A, as a perturbation from an approximate solution p₀. p₀ is a solution of the nonlinear boundary value problem 2πμAp + ∝₀^2πe^?Asf(s, e^Asp) ds = 0 obtained from the periodicity equation by dividing by ?, applying the entrainment assumption, and letting ? → 0. Once p₀ is known, the conventional inverse function theorem is applied in a slightly unconventional manner. Two particular cases where results are obtained are u_t = u_x + ?{g(u) ? h(t, x)} with g strongly monotone and

$\text{d}\text{dt}\text{v}\text{w}\text{=}\text{0}\text{d}\text{dx}\text{d}\text{dx}\text{0}\text{v}\text{w}\text{+ ?}\text{v}{}^3\text{h(t,x)}$

, where in both cases D is a certain class of 2π-periodic functions of x.     

On quasilinear Beltrami-type equations with degeneration

We consider the solvability problem for the equation $f_{\bar z} $ = v(z, f(z))f _z , where the function v(z,w) of two variables may be close to unity. Such equations are called quasilinear Beltrami-type equations with ellipticity degeneration. We prove that, under some rather general conditions on v(z,w), the above equation has a regular homeomorphic solution in the Sobolev classW _loc ^1,1 . Moreover, such solutions f satisfy the inclusion f ^?1 ∈ W _loc ^1,2 .     

Kernels in quasi-transitive digraphs

Let D be a digraph, V(D) and A(D) will denote the sets of vertices and arcs of D, respectively.A kernel N of D is an independent set of vertices such that for every w∈V(D)-N there exists an arc from w to N. A digraph is called quasi-transitive when (u,v)∈A(D) and (v,w)∈A(D) implies (u,w)∈A(D) or (w,u)∈A(D). This concept was introduced by Ghouilá-Houri [Caractérisation des graphes non orientés dont on peut orienter les arrêtes de maniere à obtenir le graphe d’ un relation d’ordre, C.R. Acad. Sci. Paris 254 (1962) 1370-1371] and has been studied by several authors. In this paper the following result is proved: Let D be a digraph. Suppose D=D₁∪D₂ where D_i is a quasi-transitive digraph which contains no asymmetrical infinite outward path (in D_i) for i∈{1,2}; and that every directed cycle of length 3 contained in D has at least two symmetrical arcs, then D has a kernel. All the conditions for the theorem are tight.     

The transcendental meromorphic solutions of a certain type of nonlinear differential equations

In this paper, we study the differential equations of the following form w²+R(z)²(w(k))=Q(z), where R(z), Q(z) are nonzero rational functions. We proved the following three conclusions: (1) If either P(z) or Q(z) is a nonconstant polynomial or k is an even integer, then the differential equation w²+P²(z)²(w(k))=Q(z) has no transcendental meromorphic solution; if P(z), Q(z) are constants and k is an odd integer, then the differential equation has only transcendental meromorphic solutions of the form f(z)=acos(bz+c). (2) If either P(z) or Q(z) is a nonconstant polynomial or k>1, then the differential equation w²+(z−z₀)P²(z)²(w(k))=Q(z) has no transcendental meromorphic solution, furthermore the differential equation w²+A(z−z₀)²(w^′)=B, where A, B are nonzero constants, has only transcendental meromorphic solutions of the form , where a, b are constants such that Ab²=1, a²=B. (3) If the differential equation , where P is a nonconstant polynomial and Q is a nonzero rational function, has a transcendental meromorphic solution, then k is an odd integer and Q is a polynomial. Furthermore, if k=1, then Q(z)≡C (constant) and the solution is of the form f(z)=Bcosq(z), where B is a constant such that B²=C and q^′(z)=±P(z).     

Some properties onf-edge covered critical graphs

LetG(V, E) be a simple graph, and letf be an integer function onV with 1 ≤f(v) ≤d(v) to each vertexv ∈V. An f-edge cover-coloring of a graphG is a coloring of edge setE such that each color appears at each vertexv ∈V at leastf(v) times. Thef-edge cover chromatic index ofG, denoted by χ′ _fc (G), is the maximum number of colors such that anf-edge cover-coloring ofG exists. Any simple graphG has anf-edge cover chromatic index equal to δ_f or δ _f - 1, where $\delta _f = \mathop {\min }\limits_{\upsilon \in V} \{ \left\lfloor {\frac{{d(v)}}{{f(v)}}} \right\rfloor \} $ . LetG be a connected and not complete graph with χ′ _fc (G)=δ _f-1, if for eachu, v ∈V and e =uv ?E, we have ÷ _fc (G + e) > ÷ _fc (G), thenG is called anf-edge covered critical graph. In this paper, some properties onf-edge covered critical graph are discussed. It is proved that ifG is anf-edge covered critical graph, then for eachu, v ∈V and e =uv ?E there existsw ∈ {u, v } withd(w) ≤ δ _f (f(w) + 1) - 2 such thatw is adjacent to at leastd(w) - δ _f + 1 vertices which are all δ _f -vertex inG.     

Symbolic and numerical computation on Bessel functions of complex argument and large magnitude

The Lanczos τ-method, with perturbations proportional to Faber polynomials, is employed to approximate the Bessel functions of the first kind J_v(z) and the second kind Y_v(z), the Hankel functions of the first kind H_v⁽¹⁾(z) and the second kind H_v⁽²⁾(z) of integer order v for specific outer regions of the complex plane, i.e. ¦z¦ ⩾ R for some R. The scaled symbolic representation of the Faber polynomials and the appropriate automated τ-method approximation are introduced. Both symbolic and numerical computation are discussed. In addition, numerical experiments are employed to test the proposed τ-method. Computed accuracy for J₀(z) and Y₀(z) for ¦z¦ ⩾ 8 are presented. The results are compared with those obtained from the truncated Chebyshev series approximations and with those of the τ-method approximations on the inner disk ¦z¦ ⩽ 8. Some concluding remarks and suggestions on future research are given.     

On analytic multifunctions

For any multifunction S ? D _z × ? _w , we give a criterion for analyticity (pseudoconcavity) in terms of plurisubharmonicity of the function V(z, w) = ?lnρ(w, S _z ), where ρ(w, S _a ) stands for the distance from the point w to the set S _a = S ∩ {z = a}.     

Isometries of some F-algebras of holomorphic functions on the upper half plane

Linear isometries of N ^p (D) onto N ^p (D) are described, where N ^p (D), p > 1, is the set of all holomorphic functions f on the upper half plane D = {z ∈ ?: Im z > 0} such that sup _y >0 ∫_? ln ^p (1 + |(x + iy)|) dx < +∞. Our result is an improvement of the results by D.A. Efimov.     

Restrictions on the zeros of a polynomial as a consequence of conditions on the coefficients of even powers and odd powers of the variable

The classical Eneström–Kakeya Theorem states that if p(z)=∑_v=0ⁿa_vz^v is a polynomial satisfying 0⩽a₀⩽a₁⩽⋯⩽a_n, then all of the zeros of p(z) lie in the region |z|⩽1 in the complex plane. Many generalizations of the Eneström–Kakeya theorem exist which put various conditions on the coefficients of the polynomial (such as monotonicity of the moduli of the coefficients). We will introduce several results which put conditions on the coefficients of even powers of z and on the coefficients of odd powers of z. As a consequence, our results will be applicable to some polynomials to which these related results are not applicable.     

Singular integrals along Lipschitz curves with holomorphic kernels

If γ(x)=x+iA(x),tan ^?1‖A′‖_∞<ω<π/2,S _ω ⁰ ={z∈C}| |argz|<ω, or, |arg(-z)|<ω} We have proved that if φ is a holomorphic function in S _ω ⁰ and \(\left| {\varphi (z)} \right| \leqslant \frac{C}{{\left| z \right|}}\) , denotingT f (z)= ∫?(z-ζ)f(ζ)dζ, ?f∈C ₀(γ), ?z∈suppf, where C_c(γ) denotes the class of continuous functions with compact supports, then the following two conditions are equivalent:

1. T can be extended to be a bounded operator on L²(γ);
2. there exists a function ?₁ ∈H ^∞(S _ω ⁰ ) such that ?′₁(z)=?(z)+?(-z), ?z∈S _ω ⁰ ?z∈S _w ⁰ .