The quaternion matrix equation ΣA i XB i =E

LetH _F be the generalized quaternion division algebra over a fieldF with charF#2. In this paper, the adjoint matrix of anyn×n matrix overH _F [γ] is defined and its properties is discussed. By using the adjoint matrix and the method of representation matrix, this paper obtains several necessary and sufficient conditions for the existence of a solution or a unique solution to the matrix equation Σ _i=0 ^k A ⁱ XB _i =E overH _F , and gives some explicit formulas of solutions. Supported by the National Natural Science Foundation of China and Human     

由Smith标准形求解矩阵方程∑AiXBi=C

By using the Smith normal form of polynomial matrix and algebraic methods, this paper discusses the solvability for the linear matrix equation ∑AiXBi = C over a field, and obtains the explicit formulas of general solution or unique solution.     

Rates of convergence for classes of functions: The non-i.i.d. case

Let X_i, i ≥ 1, be a sequence of φ-mixing random variables with values in a sample space (X, A). Let L(X_i) = P_(i) for all i ≥ 1 and let _n, n ≥ 1, be classes of real-valued measurable functions on (X, A). Given any function g on (X, A), let S_n(g) = Σ_{i = 1}ⁿ {g(X_i) − Eg(X_i)}. Under weak metric entropy conditions on _n and under growth conditions on both the mixing coefficients and the maximal variance V V(n) max_{i ≤ n} sup_{g n} ∫ g² dP_(i), we show that there is a numerical constant U < ∞ such that

Full-size image

a.s. ^*, where _{i = 1}^xP_(i) and H H(n) is the square root of the entropy of the class _n. Additionally, the rate of convergence H⁻¹(n/V)^1/2 cannot, in general, be improved upon. Applications of this result are considered.     

Extensions of homogeneous polynomials on c 0(l 2 i )

We show that a 2-homogeneous polynomial on the complex Banach space c ₀ l ₂ ⁱ ) is norm attaining if and only if it is finite (i.e, depends only on finite coordinates). As the consequence, we show that there exists a unique norm-preserving extension for norm-attaining 2-homogeneous polynomials on c ₀(l ₂ ⁱ ). The second author was supported by FAPESP, Brazil, Research Grant 01/04220-8.     

A strong law for weighted sums of i.i.d. random variables

A strong law is proved for weighted sumsS _n=a _in X _i whereX _i are i.i.d. and {a _in} is an array of constants. When sup(n ^–1|a _in | ^q )^1/q <, 1<q andX _i are mean zero, we showE|X| ^p <,p ^l+q ^–1=1 impliesS _n /n 0. Whenq= this reduces to a result of Choi and Sung who showed that when the {a _in} are uniformly bounded,EX=0 andE|X|< impliesS _n /n 0. The result is also true whenq=1 under the additional assumption that lim sup |a _in |n ^–1 logn=0. Extensions to more general normalizing sequences are also given. In particular we show that when the {a _in} are uniformly bounded,E|X|^1/< impliesS _n /n 0 for >1, but this is not true in general for 1/2<<1, even when theX _i are symmetric. In that case the additional assumption that (x ^1/ log^1/–1 x)P(|X|x)0 asx provides necessary and sufficient conditions for this to hold for all (fixed) uniformly bounded arrays {a _in}.     

I.i.d. representations for the bivariate product limit estimators and the bootstrap versions

Let F(s, t) = P(X > s, Y > t) be the bivariate survival function which is subject to random censoring. Let be the bivariate product limit estimator (PL-estimator) by Campbell and Földes (1982, Proceedings International Colloquium on Non-parametric Statistical Inference, Budapest 1980, North-Holland, Amsterdam). In this paper, it was shown that

Full-size image

, where {ζ_i(s, t)} is i.i.d. mean zero process and R_n(s, t) is of the order O((n⁻¹log n)^3/4) a.s. uniformly on compact sets. Weak convergence of the process {n⁻¹ Σ_{i = 1}ⁿ ζ_i(s, t)} to a two-dimensional-time Gaussian process is shown. The covariance structure of the limiting Gaussian process is also given. Corresponding results are also derived for the bootstrap estimators. The result can be extended to the multivariate cases and are extensions of the univariate case of Lo and Singh (1986, Probab. Theory Relat. Fields, 71, 455–465). The estimator is also modified so that the modified estimator is closer to the true survival function than in supnorm.     

Infinite families of 2- and 3-designs with parameters v = p + 1, k = (p − 1)/2i + 1, where p odd prime, 2e T (p − 1), e ≥ 2, 1 ≤ i ≤ e

Let p be an odd prime number such that p − 1 = 2^em for some odd m and e ≥ 2. In this article, by using the special linear fractional group PSL(2, p), for each i, 1 ≤ i ≤ e, except particular cases, we construct a 2-design with parameters v = p + 1, k = (p − 1)/2ⁱ + 1 and λ = ((p − 1)/2ⁱ+1)(p − 1)/2 = k(p − 1)/2, and in the case i = e we show that some of these 2-designs are 3-designs. Likewise, by using the linear fractional group PGL(2,p) we construct an infinite family of 3-designs with the same v k and λ = k(k − 2). These supplement a part of [4], in which we gave an infinite family of 3-designs with parameters v = q + 1, k = (q + 1)/2 = (q − 1)/2 + 1 and λ = (q + 1)(q − 3)/8 = k(k − 2)/2, where q is a prime power such that q − 1 = 2m for some odd m and q > 7. Some of the designs given in this article and in [4] fill in a few blanks in the table of Chee, Colbourn, and Kreher [2]. © 1997 John Wiley & Sons, Inc.     

On theG-matrices with entries and eigenvalues inQ(i)

LetG be a finite abelian group,K a subfield ofC, C[G] regarded as an algebra of matrices.A _G ^K {AC[G]| all the entries and eigenvalues ofA are inK} is an association algebra overK. In this paper, the association scheme ofA _G ^K is determined and in the caseK=Q(i), the first eigenmatrix of the association scheme computed. As an application, it is proved thatZ ₄×Z ₄×Z ₄ is the only abelian group admitted as a Singer group by some distance-regular digraph of girth 4 on 64 vertices.     

Exact Asymptotics for k i -limited Exponential Polling Models

In this paper we find exact asymptotic expressions for the event that the total queue length is large for a k _i -limited exponential polling model with equal service rates and two classes of customer. It is found that this behaviour divides into two very different regimes, depending on the arrival rates to the system. Using these exact asymptotic expressions, we provide heuristics for choosing the k _i values to provide a given level of quality of service to one class while giving best effort to the other class.     

NONLINEAR HOMOTOPY AND PRE-POINCARÉ LEMMAS

Abstract

Most homotopies considered in the literature are linear homotopies of the form h ⁱ (λ) = λx ⁱ + (1—λ)y ⁱ , 0 ≤ λ ≤ 1. Although these prove to be adequate in most instances, they lack direct geometric significance because {h ⁱ (λ) | 0 ≤ λ ≤ 1} are not orbits of a vector field. On the other hand, the nonlinear homotopy g ⁱ (s) = e ^s x ⁱ + (1—e ^s )y ⁱ ,—∞ ≤ s ≤ 0, are orbits of a vector field (i.e., dg ⁱ /ds = g ⁱ —y ⁱ , g ⁱ (0) = x ⁱ ), and thus have direct geometric significance. This suggests that useful results can be obtained by replacing linear homotopy by transport along flows of smooth vector fields. The purpose of this paper is to elaborate on this simple idea. We define prehomotopy operators induced by vector fields on a manifold. These allow us to obtain finite transport relations and pre-Poincaré lemmas that generalize the classical results. They are shown to reproduce the classical results as asymptotic limits and to obtain representations of all solutions of complete systems of exterior differential equations on a star shaped region of a manifold.     

An unexpected separation result in Linearly Bounded Arithmetic

The theories Sⁱ₁(α) and Tⁱ₁(α) are the analogues of Buss' relativized bounded arithmetic theories in the language where every term is bounded by a polynomial, and thus all definable functions grow linearly in length. For every i, a Σ^b_i+1(α)‐formula TOPⁱ(a), which expresses a form of the total ordering principle, is exhibited that is provable in Sⁱ⁺¹₁ (α), but unprovable in Tⁱ₁(α). This is in contrast with the classical situation, where Sⁱ⁺¹₂ is conservative over Tⁱ₂ w. r. t. Σ^b_i+1‐sentences. The independence results are proved by translations into propositional logic, and using lower bounds for corresponding propositional proof systems. (© 2005 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

Competition and Cooperation in Non-Centralized Linear Production Games

In this paper we analyze how to improve the benefits of n producers when: (1) each producer i faces a linear production problem given by max {cⁱ xⁱ:Aⁱ xⁱ≤ bⁱ,xⁱ 0}, and (2) maintaining the production capabilities of each producer is mandatory. In order to maximize the benefits, the producers decide to trade their resources while ensuring their initial individual gains. We study the games which describe this non-centralized linear production situation when players do not cooperate (section two), when players cooperate and side payments are possible (section three), and when players cooperate and side payments are not possible (section four).     

Counting cycles and finite dimensional L norms

We obtain sharp bounds for the number of n-cycles in a finite graph as a function of the number of edges, and prove that the complete graph is optimal in more ways than could be imagined. We prove sharp estimates on both ∑_i=1ⁿx_i^k and ∑_i=1ⁿ|x_i|^k, subject to the constraints that ∑_i=1ⁿx_i²=C and ∑_i=1ⁿx_i=0.     

The k-record processes are i.i.d.

Let X ₁, X ₂, ... be i.i.d. positive random variables, and let _n be the initial rank of X _n (that is, the rank of X _n among X ₁, ..., X _n). Those observations whose initial rank is k are collected into a point process N ^k on ⁺, called the k-record process. The fact that {itN^k; k=1, 2, ... are independent and identically distributed point processes is the main result of the paper. The proof, based on martingales, is very rapid. We also show that given N ¹, ..., N ^k, the lifetimes in rank k of all observations of initial rank at most k are independent geometric random variables.These results are generalised to continuous time, where the analogue of the i.i.d. sequence is a time-space Poisson process. Initially, we think of this Poisson process as having values in ⁺, but subsequently we extend to Poisson processes with values in more general Polish spaces (for example, Brownian excursion space) where ranking is performed using real-valued attributes.     

Similarity of matrices under SL(n,K)

Take a similarity class of n × n matrices over a field K Let p_i ,(λ) ^m(i) be the elementary divisors L_i , = K [λ]/(p_i ). Under conjugation by SL(n, K), the class splits into subclasses corresponding to the elements of K^×/Π(NL _i ^×) ^m(i).     

Omega subgroups of powerful <Emphasis Type="Italic">p</Emphasis>-groups

Let G be a powerful finite p-group. In this note, we give a short elementary proof of the following facts for all i ≥ 0: (i) exp Ω_i(G) ≤ p ⁱ for odd p, and expΩ_i(G) ≤ 2 ⁱ⁺¹ for p = 2; (ii) the index |G: G ^{p i}| coincides with the number of elements of G of order at most p ⁱ. Supported by the Spanish Ministry of Science and Education, grant MTM2004-04665, partly with FEDER funds, and by the University of the Basque Country, grant UPV05/99.     

Conditions for dominated splittings

In this paper, we solve the problem proposed by Lan Wen for the case of dimM = 3. Roughly speaking, we prove that for fixed i, f has C1 persistently no small angles of index i if and only if f has a dominated splitting of index i on the C1 i-preperiodic set P＊i（f）.     

An asymptotic minimax risk bound for estimation of a linear functional relationship

We consider estimation of the parameter B in a multivariate linear functional relationship X_i=ξ_i+ξ_1i, Y_i=Bξ_i+ξ_2i, i=1,…,n, where the errors (ζ_1i^′, ζ_2i^′) are independent standard normal and (ξ_i, i ) is a sequence of unknown nonrandom vectors (incidental parameters). If there are no substantial a priori restrictions on the infinite sequence of incidental parameters then asymptotically the model is nonparametric but does not fit into common settings presupposing a parameter from a metric function space. A special result of the local asymptotic minimax type for the m.1.e. of B is proved. The accuracy of the normal approximation for the m.l.e. of order n^−1/2 is also established.     

A Note on Conservativity Relations among Bounded Arithmetic Theories

For all i ≥ 1, Tⁱ⁺¹₁(α) is not ∀Σ^b₂(α)‐conservative over Tⁱ₁(α).     

On classes of convex sets that permit plane coverings

A family {K _i | of convex domains in the Euclidean planeR ² is said to permit a plane covering if there exist rigid motions {τ_i} such that U _i ^∞ =₁τ_i K _i =R ². Necessary and sufficient conditions that a given family of convex domains permits a plane covering are established.