A(α)-acceptability of pade approximations to function exp (Q)

In this paper, a necessary and sufficient condition of A(a)-acceptability for rational approximations to the functionexp(q) and some sufficient conditions to guarantee A(α)-acceptability of Padé approximations[^(R)]_mⁿ (q)\hat R_m^n (q) to the functionexp(q) are given, where a ∈(0,π/2), n≤m,m≥2. Furthermore, it is proved that the condition of A(α)-acceptability of rational approximations toexp(q) is equivalent to the nonnegatively of a real polynomial in interval (−∞,0). Finally, we prove that[^(R)]₄¹ (q)\hat R_4^1 (q) is A(π/3)-acceptable. Based on this conclusion, two A(π/3)-stable multiderivative (hybrid) one-step methods are constructed.     

An extension of the Erdős–Ginzburg–Ziv Theorem to hypergraphs

An n-set partition of a sequence S is a collection of n nonempty subsequences of S, pairwise disjoint as sequences, such that every term of S belongs to exactly one of the subsequences, and the terms in each subsequence are all distinct with the result that they can be considered as sets. For a sequence S, subsequence S^′, and set T, |T∩S| denotes the number of terms x of S with xT, and |S| denotes the length of S, and SS^′ denotes the subsequence of S obtained by deleting all terms in S^′. We first prove the following two additive number theory results.(1) Let S be a finite sequence of elements from an abelian group G. If S has an n-set partition, A=A₁,…,A_n, such that

then there exists a subsequence S^′ of S, with length |S^′|≤max{|S|−n+1,2n}, and with an n-set partition, , such that . Furthermore, if ||A_i|−|A_j||≤1 for all i and j, or if |A_i|≥3 for all i, then .(2) Let S be a sequence of elements from a finite abelian group G of order m, and suppose there exist a,bG such that . If |S|≥2m−1, then there exists an m-term zero-sum subsequence S^′ of S with or .Let be a connected, finite m-uniform hypergraph, and be the least integer n such that for every 2-coloring (coloring with the elements of the cyclic group ) of the vertices of the complete m-uniform hypergraph , there exists a subhypergraph isomorphic to such that every edge in is monochromatic (such that for every edge e in the sum of the colors on e is zero). As a corollary to the above theorems, we show that if every subhypergraph of contains an edge with at least half of its vertices monovalent in , or if consists of two intersecting edges, then . This extends the Erdős–Ginzburg–Ziv Theorem, which is the case when is a single edge.     

On the sequence of powers of a stochastic matrix with large exponent

We consider the class of primitive stochastic n×n matrices A, whose exponent is at least (n²−2n+2)/2+2. It is known that for such an A, the associated directed graph has cycles of just two different lengths, say k and j with k>j, and that there is an α between 0 and 1 such that the characteristic polynomial of A is λⁿ−αλ^n−j−(1−α)λ^n−k. In this paper, we prove that for any mn, if α1/2, then A^m+k−A^m_∞A^m−1w^T_∞, where 1 is the all-ones vector and w^T is the left-Perron vector for A, normalized so that w^T1=1. We also prove that if jn/2, n31 and , then A^m+j−A^m_∞A^m−1w^T_∞ for all sufficiently large m. Both of these results lead to lower bounds on the rate of convergence of the sequence A^m.     

The Fine Structure of the n-Widths of H-Spaces in Lq(−1, 1)

The n-widths of the unit ball A_p of the Hardy space H^p in L_q( −1, 1) are determined asymptotically. It is shown that for 1 ≤ q < p ≤∞ there exist constants k₁ and k₂ such that [formula]≤ d_n(A_p, L_q(−1, 1)),dⁿ(A_p, L_q(−1, 1)), δ_n(A_p, L_q(−1, 1))[formula]where d_n, dⁿ, and δ_n denote the Kolmogorov, Gel′fand and linear n-widths, respectively. This result is an improvement of estimates previously obtained by Burchard and Höllig and by the author.     

Some extensions of the Kantorovich inequality and statistical applications

Kantorovich gave an upper bound to the product of two quadratic forms, (X′AX) (X′A⁻¹X), where X is an n-vector of unit length and A is a positive definite matrix. Bloomfield, Watson and Knott found the bound for the product of determinants |X′AX| |X′A⁻¹X| where X is n × k matrix such that X′X = I_k. In this paper we determine the bounds for the traces and determinants of matrices of the type X′AYY′A⁻¹X, X′B²X(X′BCX)⁻¹ X′C²X(X′BCX)⁻¹ where X and Y are n × k matrices such that X′X = Y′Y = I_k and A, B, C are given matrices satisfying some conditions. The results are applied to the least squares theory of estimation.     

Lower bounds for the cardinality of minimal blocking sets in projective spaces

In this paper new lower bounds for the cardinality of minimal m-blocking sets are determined. Let r₂(q) be the number such that q+r₂(q)+1 is the cardinality of the smallest non-trivial line-blocking set in a plane of order q. If B is a minimal m-blocking set in PG(n,q) that contains at most q^m+q^m−1+…+q+1+r₂(q)·(∑_i=2m−n′^m−1qⁱ) points for an integer n′ satisfying mn′2m, then the dimension of B is at most n′. If the dimension of B is n′, then the following holds. The cardinality of B equals q^m+q^m−1+…+q+1+r₂(q)(∑_i=2m−n′^m−1qⁱ). For n′=m the set B is an m-dimensional subspace and for n′=m+1 the set B is a cone with an (m−2)-dimensional vertex over a non-trivial line-blocking set of cardinality q+r₂(q)+1 in a plane skew to the vertex. This result is due to Heim (Mitt. Math. Semin. Giessen 226 (1996), 4–82). For n′>m+1 and q not a prime the number q is a square and for q16 the set B is a Baer cone. If q is odd and |B|<q^m+q^m−1+…+q+1+r₂(q)(q^m−1+q^m−2), it follows from this result that the subspace generated by B has dimension at most m+1. Furthermore we prove that in this case, if , then B is an m-dimensional subspace or a cone with an (m−2)-dimensional vertex over a non-trivial line-blocking set of cardinality q+r₂(q)+1 in a plane skew to the vertex. For q=p^3h, p7 and q not a square we show this assertion for |B|q^m+q^m−1+…+q+1+q^2/3·(q^m−1+…+1).     

Centres of Convex Sets inLMetrics

It is shown that for each convex bodyARⁿthere exists a naturally defined family _AC(Sⁿ⁻¹) such that for everyg _A, and every convex functionf: R→Rthe mappingy∫_Sⁿ⁻¹ f(g(x)−y, x) dσ(x) has a minimizer which belongs toA. As an application, approximation of convex bodies by balls with respect toL^pmetrics is discussed.     

Transformations preserving normality and Wishart-ness

Let R^n×p, (n), Gl(p) and ₊(p) denote respectively the set of n×p matrices, the set of n×n orthogonal matrices, the set of p×p nonsingular matrices and the set of p × p positive definite matrices. In this paper, it is first shown that a bijective and bimeasurable transformation (BBT) g on R^p≡R^p×1 preserving the multivariate normality of N_p(μ, Σ) for fixed μ=μ₁, μ₂ (μ₁≠μ₂) and for all Σ ₊(p) is of the form g(x)=Ax+b a.e. for some (A, b)Gl(p)×R^p. Second, a BBT g on R^n×p preserving the form for certain 's and all Σ ₊(p) is shown to be of the form g(x)=QxA+E a.e. for some (Q, A, E) (n)×Gl(p)×R^n×p. Third, a BBT h on ₊(p) preserving the Wishart-ness of W_p(Σ, m) (m≥p) for all Σ ₊(p) is shown to be of the form h(w)=A′wA a.e. for some AGl(p). Fourth, a BBT k(x, w)=(k₁(x, w), k₂(x, w)) on R^n×p× ₊(p) which preserves the form of for certain 's and all Σ ₊(p) is shown to be of the form k(x, w)=(QxA+E, A′wA) a.e. for some (Q, A, E) (n)×Gl(p)×R^n×p.     

On nonautonomous linear systems of differential and difference equations with -symmetric coefficient matrices

Let denote the set of continuous n×n matrices on an interval . We say that is a nontrivial k-involution if where ζ=e^-2πi/k, d₀+d₁++d_k-1=n, and with . We say that is R-symmetric if R(t)A(t)R^-1(t)=A(t), , and we show that if A is R-symmetric then solving x^′=A(t)x or x^′=A(t)x+f(t) reduces to solving k independent d_ℓ×d_ℓ systems, 0ℓk-1. We consider the asymptotic behavior of the solutions in the case where . Finally, we sketch analogous results for linear systems of difference equations.     

Stochastic comparisons of order statistics from heterogeneous populations, with applications in reliability

The basic result of the paper states: Let F₁, …, F_n, F₁^′,…, F_n^′ have proportional hazard functions with λ₁ ,…, λ_n , λ₁^′ ,…, λ_n^′ as the constants of proportionality. Let X₍₁₎ ≤ … ≤ X_(n) (X₍₁₎^′ ≤ … ≤ X_(n)^′) be the order statistics in a sample of size n from the heterogeneous populations {F₁ ,…, F_n}({F₁^′ ,…, F_n^′}). Then (λ₁ ,…, λ_n) majorizes (λ₁^′ ,…, λ_n^′) implies that (X₍₁₎ ,…, X_(n)) is stochastically larger than (X₍₁₎^′ ,…, X_(n)^′). Earlier results stochastically comparing individual order statistics are shown to be special cases. Applications of the main result are made in the study of the robustness of standard estimates of the failure rate of the exponential distribution, when observations actually come from a set of heterogeneous exponential distributions. Further applications are made to the comparisons of linear combinations of Weibull random variables and of binomial random variables.     

On the evaluation of the Eigenvalues of a banded toeplitz block matrix

Let A = (a_ij) be an n × n Toeplitz matrix with bandwidth k + 1, K = r + s, that is, a_ij = a_j−i, i, J = 1,… ,n, a_i = 0 if i > s and if i < -r. We compute p(λ)= det(A - λI), as well as p(λ)/p′(λ), where p′(λ) is the first derivative of p(λ), by using O(k log k log n) arithmetic operations. Moreover, if a_i are m × m matrices, so that A is a banded Toeplitz block matrix, then we compute p(λ), as well as p(λ)/p′(λ), by using O(m³k(log² k + log n) + m²k log k log n) arithmetic operations. The algorithms can be extended to the computation of det(A − λB) and of its first derivative, where both A and B are banded Toeplitz matrices. The algorithms may be used as a basis for iterative solution of the eigenvalue problem for the matrix A and of the generalized eigenvalue problem for A and B.     

On the description of overgroups of E(m,R)?E(n,R)

The subgroups E(m,R) ⊗ E(n,R) ≤ H ≤ G = GL(mn,R) are studied under the assumption that the ring R is commutative and m, n ≥ 3. The group GL _m ⊗GL _n is defined by equations, the normalizer of the group E(m,R) ⊗ E(n,R) is calculated, and with each intermediate subgroup H it is associated a uniquely determined lower level (A,B,C), where A,B,C are ideals in R such that mA,A ² ≤ B ≤ A and nA,A ² ≤ C ≤ A. The lower level specifies the largest elementary subgroup satisfying the condition E(m, n,R, A,B,C) ≤ H. The standard answer to this problem asserts that H is contained in the normalizer N _G (E(m,n,R, A,B,C)). Bibliography: 46 titles.     

On the Classification of Twisting Maps Between Kn and Km

We define the notion of admissible pair for an algebra A, consisting on a couple (Γ, R), where Γ is a quiver and R a unital, splitted and factorizable representation of Γ, and prove that the set of admissible pairs for A is in one to one correspondence with the points of the variety of twisting maps T_Aⁿ:=T(Kⁿ,A)\mathcal{T}_A^n:=\mathcal{T}(K^n,A). We describe all these representations in the case A = K ^m .     

Positive periodic solutions of higher-dimensional functional difference equations with a parameter

By using Krasnoselskii's fixed point theorem and upper and lower solutions method, we find some sets of positive values λ determining that there exist positive T-periodic solutions to the higher-dimensional functional difference equations of the form where A(n)=diag[a₁(n),a₂(n),…,a_m(n)], h(n)=diag[h₁(n),h₂(n),…,h_m(n)], a_j,h_j :Z→R⁺, τ :Z→Z are T -periodic, j=1,2,…,m, T1, λ>0, x :Z→R^m, f :R₊^m→R₊^m, where R₊^m={(x₁,…,x_m)^TR^m, x_j0, j=1,2,…,m}, R⁺={xR, x>0}.     

Stability of unitary SK<Subscript>1</Subscript> of Azumaya algebras

For an Azumaya algebra A with center C of rank n ² and a unitary involution τ, we study the stability of the unitary SK₁ under reduction. We show that if R = C ^τ is a Henselian ring with maximal ideal \mathfrakm{\mathfrak{m}} and 2 and n are invertible in R then SK₁(A, t) @ SK₁(A/ \mathfrakm A, overline t){{{\rm SK}_1}(A, \tau) \cong {{\rm SK}_1}(A/ \mathfrak{m} A, overline \tau)}.     

Some properties of BLUE in a linear model and canonical correlations associated with linear transformations

Let (x, Xβ, V) be a linear model and let A′ = (A′₁, A′₂) be a p × p nonsingular matrix such that A₂X = 0, Rank A₂ = p − Rank X. We represent the BLUE and its covariance matrix in alternative forms under the conditions that the number of unit canonical correlations between y₁ ( = A₁x) and y₂ ( = A₂x) is zero. For the second problem, let x′ = (x′₁, x′₂) and let a g-inverse V⁻ of V be written as (V⁻)′ = (A′₁, A′₂). We investigate the reations (if any) between the nonzero canonical correlations {1 ₁ … ₁ > 0} due to y₁ ( = A₁x) and y₂ ( = A₂x), and the nonzero canonical correlations {1 λ₁ … λ_v+r > 0} due to x₁ and x₂. We answer some of the questions raised by Latour et al. (1987, in Proceedings, 2nd Int. Tampere Conf. Statist. (T. Pukkila and S. Puntanen, Eds.), Univ. of Tampere, Finland) in the case of the Moore-Penrose inverse V⁺ = (A′₁, A′₂) of V.     

C-Cosine Functions and the Abstract Cauchy Problem, II

For a bounded linear injectionCon a Banach spaceXand a closed linear operatorA : D(A) X → Xwhich commutes withCwe prove that (1) the abstract Cauchy problem,u″(t) = Au(t),t R,u(0) = Cx,u′(0) = Cy, has a unique strong solution for everyx,y D(A) if and only if (2)A₁ = AD(A²) generates aC₁-cosine function onX₁(D(A) with the graph norm), if (and only if, in caseAhas nonempty resolvent set) (3)Agenerates aC-cosine function onX. HereC₁ = CX₁. Under the assumption thatAis densely defined andC⁻¹AC = A, statement (3) is also equivalent to each of the following statements: (4) the problemv″(t) = Av(t) + C(x + ty) + ∫^t₀ Cg(r) dr,t R,v(0) = v′(0) = 0, has a unique strong solution for everyg L¹_locandx, y X; (5) the problemw″(t) = Aw(t) + Cg(t),t R,w(0) = Cx,w′(0) = Cy, has a unique weak solution for everyg L¹_locandx, y X. Finally, as an application, it is shown that for any bounded operatorBwhich commutes withCand has range contained in the range ofC,A + Bis also a generator.     

Generalized Sets of Lengths

LetRbe a Dedekind domain and (R) the set of irreducible elements ofR. In this paper, we study the sets _R(n) = {m | α₁,…,α_n, β₁,…,β_m (R) such that α₁,…,α_n = β₁,…,β_m}, wherenis a positive integer. We show, in constrast to indications in some earlier work, that the sets _R(n) are not completely determined by the Davenport constant of the class group ofR. We offer some specific constructions for Dedekind domains with small class groups, and show how these sets are generalizations of the sets studied earlier by Geroldinger [[9], [10]].     

A direct method for the general solution of a system of linear equations

A computationally stable method for the general solution of a system of linear equations is given. The system isA ^Tx–B=0, where then-vectorx is unknown and then×q matrixA and theq-vectorB are known. It is assumed that the matrixA ^T and the augmented matrix [A ^T,B] are of the same rankm, wheremn, so that the system is consistent and solvable. Whenm<n, the method yields the minimum modulus solutionx _m and a symmetricn ×n matrixH _m of rankn–m, so thatx=x _m+H _my satisfies the system for ally, ann-vector. Whenm=n, the matrixH _m reduces to zero andx _m becomes the unique solution of the system.The method is also suitable for the solution of a determined system ofn linear equations. When then×n coefficient matrix is ill-conditioned, the method can produce a good solution, while the commonly used elimination method fails.This research was supported by the National Science Foundation, Grant No. GP-41158.     

On Rado numbers for

For all integers m3 and all natural numbers a₁,a₂,…,a_m−1, let n=R(a₁,a₂,…,a_m−1) represent the least integer such that for every 2-coloring of the set {1,2,…,n} there exists a monochromatic solution to

a₁x₁+a₂x₂++a_m−1x_m−1=x_m.