Clean matrices over commutative rings

A matrix A ∈ M _n (R) is e-clean provided there exists an idempotent E ∈ M _n (R) such that A-E ∈ GL _n (R) and det E = e. We get a general criterion of e-cleanness for the matrix [[a ₁, a ₂,..., a _n +1]]. Under the n-stable range ondition, it is shown that [[a ₁, a ₂,..., a _n +1]] is 0-clean iff (a ₁, a ₂,..., a _n +1) = 1. As an application, we prove that the 0-cleanness and unit-regularity for such n × n matrix over a Dedekind domain coincide for all n ⩾ 3. The analogous for (s, 2) property is also obtained.      

Finiteness properties of minimax and coatomic local cohomology modules

Let R be a noetherian ring, \mathfraka{\mathfrak{a}} an ideal of R, and M an R-module. We prove that for a finite module M, if Hⁱ_\mathfraka(M){{\rm H}^{i}_{\mathfrak{a}}(M)} is minimax for all i ≥ r ≥ 1, then Hⁱ_\mathfraka(M){{\rm H}^{i}_{\mathfrak{a}}(M)} is artinian for i ≥ r. A local–global principle for minimax local cohomology modules is shown. If Hⁱ_\mathfraka(M){{\rm H}^{i}_{\mathfrak{a}}(M)} is coatomic for i ≤ r (M finite) then Hⁱ_\mathfraka(M){{\rm H}^{i}_{\mathfrak{a}}(M)} is finite for i ≤ r. We give conditions for a module which is locally minimax to be a minimax module. A non-vanishing theorem and some vanishing theorems are proved for local cohomology modules.     

On samples of independent random vectors in spaces of infinitely increasing dimension

We study the asymptotic behavior of a set of random vectors ξ_i, i = 1,..., m, whose coordinates are independent and identically distributed in a space of infinitely increasing dimension. We investigate the asymptotics of the distribution of the random vectors, the consistency of the sets M _m⁽ⁿ⁾ = ξ₁,..., ξ_m and X _n^λ = x ∈ X _n: ρ(x) ≤ λn, and the mutual location of pairs of vectors. Translated from Ukrainskii Matematicheskii Zhurnal, Vol. 50, No. 12, pp. 1706–1711, December, 1998.     

Asymptotic Behavior of the Maximum of Sums of I.I.D. Random Variables along Monotone Blocks

Let {X_i, Y_i}_i=1,2,... be an i.i.d. sequence of bivariate random vectors with P(Y₁ = y) = 0 for all y. Put M_n(j) = max_0≤k≤n-j (X_k+1 + ... X_k+j)I_k,j, where I_k,k+j = I{Y_k+1 < ⋯ < Y_k+j} denotes the indicator function for the event in brackets, 1 ≤ j ≤ n. Let L_n be the largest index l ≤ n for which I_k,k+l = 1 for some k = 0, 1, ..., n - l. The strong law of large numbers for “the maximal gain over the longest increasing runs,” i.e., for M_n(L_n) has been recently derived for the case where X₁ has a finite moment of order 3 + ε, ε > 0. Assuming that X₁ has a finite mean, we prove for any a = 0, 1, ..., that the s.l.l.n. for M(L_n - a) is equivalent to EX ₁ ^3+a I{X₁ > 0} < ∞. We derive also some new results for the a.s. asymptotics of L_n. Bibliography: 5 titles. __________ Translated from Zapiski Nauchnykh Seminarov POMI, Vol. 311, 2004, pp. 179–189.     

A 2-factor with Short Cycles Passing Through Specified Independent Vertices in Graph

For a graph G, we define σ₂(G) := min{d(u) + d(v)|u, v ≠ ∈ E(G), u ≠ v}. Let k ≥ 1 be an integer and G be a graph of order n ≥ 3k. We prove if σ₂(G) ≥ n + k − 1, then for any set of k independent vertices v ₁,...,v _k , G has k vertex-disjoint cycles C ₁,..., C _k of length at most four such that v _i ∈ V(C _i ) for all 1 ≤ i ≤ k. And show if σ₂(G) ≥ n + k − 1, then for any set of k independent vertices v ₁,...,v _k , G has k vertex-disjoint cycles C ₁,..., C _k such that v _i ∈ V(C _i ) for all 1 ≤ i ≤ k, V(C ₁) ∪...∪ V(C _k ) = V(G), and |C _i | ≤ 4 for all 1 ≤ i ≤ k − 1. The condition of degree sum σ₂(G) ≥ n + k − 1 is sharp. Received: December 20, 2006. Final version received: December 12, 2007.     

Sudakov-type minoration for gaussian chaos processes

Consider a setA of symmetricn×n matricesa=(a _i,j) _i,j≤n . Consider an independent sequence (g _i) _i≤n of standard normal random variables, and letM=Esup_a∈A|Σ_i,j⪯na_i,jg_ig_j|. Denote byN ₂(A, α) (resp.N _t(A, α)) the smallest number of balls of radiusα for thel ₂ norm ofR ^{n 2} (resp. the operator norm) needed to coverA. Then for a universal constantK we haveα(logN ₂(A, α))^1/4≤KM. This inequality is best possible. We also show that forδ≥0, there exists a constantK(δ) such thatα(logN _t≤K(δ)M. Work partially supported by an N.S.F. grant.     

Exact laws for sums of ratios of order statistics from the Pareto distribution

Consider independent and identically distributed random variables {X _nk, 1 ≤ k ≤ m, n ≤ 1} from the Pareto distribution. We select two order statistics from each row, X _n(i) ≤ X _n(j), for 1 ≤ i < j ≤ = m. Then we test to see whether or not Laws of Large Numbers with nonzero limits exist for weighted sums of the random variables R _ij = X _n(j)/X _n(i).     

An elementary approach to gap theorems

Using elementary comparison geometry, we prove: Let (M, g) be a simply-connected complete Riemannian manifold of dimension ≥ 3. Suppose that the sectional curvature K satisfies −1 − s(r) ≤ K ≤ −1, where r denotes distance to a fixed point in M. If lim _{r → ∞} e^2r s(r) = 0, then (M, g) has to be isometric to ℍ ⁿ . The same proof also yields that if K satisfies −s(r) ≤ K ≤ 0 where lim _{r → ∞} r ² s(r) = 0, then (M, g) is isometric to ℝ ⁿ , a result due to Greene and Wu. Our second result is a local one: Let (M, g) be any Riemannian manifold. For a ∈ ℝ, if K ≤ a on a geodesic ball B _p (R) in M and K = a on ∂B _p (R), then K = a on B _p (R).     

On Cycle Sequences

. For each vertex v in a graph G, the maximum length of a cycle which passes through v is called the cycle number of v, denoted by c(v). A sequence a ₁,a ₂,…,a _n of nonnegative integers is called a cycle sequence of a graph G if the vertices of G can be labeled as v ₁,v ₂,…,v _n such that a _i =c(v _i ) for 1≤i≤n. We give some sufficient and necessary conditions for a sequence to be a cycle sequence. We can thereby derive a polynomial time procedure for recognizing cycle sequences. Received: July 14, 1997 Final version received: June 15, 1998     

Separation properties forMW-fractals

Corresponding to the irreducible 0–1 matrix (a _ij ) _n×n , take similitude contraction mappingsϕ _ij for eacha _ij =1, ina _ij =1, in R ^d with ratio 0<r _ij <1. There are unique nonempty compact setsF ₁,…,F _n satisfying for each1≤i≤n, F _i. We prove that open set condition holds if and only ifF _i is ans-set for some1≤i≤n, wheres is such that the spectral radius of matrix (r _ij ³ ) _{n x n} is 1. Partly supported by Natural Science Foundation of China, and partly by Natural Science Foundation of Hubei Province     

A remark on the unitary group of a tensor product of<Emphasis Type="Italic">n</Emphasis> finite-dimensional Hilbert spaces

LetH _i, 1 ≤ i ≤n be complex finite-dimensional Hilbert spaces of dimension d_i,1 ≤ i ≤n respectively withd _i ≥ 2 for everyi. By using the method of quantum circuits in the theory of quantum computing as outlined in Nielsen and Chuang [2] and using a key lemma of Jaikumar [1] we show that every unitary operator on the tensor productH =H ₁ ⊗H ₂ ⊗... ⊗H _n can be expressed as a composition of a finite number of unitary operators living on pair productsH _i ⊗H _j,1 ≤i,j ≤n. An estimate of the number of operators appearing in such a composition is obtained. Dedicated to Prof. A.K. Roy on his 62nd birthday.     

The roots of <Emphasis Type="Italic">σ</Emphasis>-polynomials

Let G be a connected graph. We denote by σ(G,x) and δ(G) respectively the σ-polynomial and the edge-density of G, where . If σ(G,x) has at least an unreal root, then G is said to be a σ-unreal graph. Let δ(n) be the minimum edgedensity over all n vertices graphs with σ-unreal roots. In this paper, by using the theory of adjoint polynomials, a negative answer to a problem posed by Brenti et al. is given and the following results are obtained: For any positive integer a and rational number 0≤c≤1, there exists at least a graph sequence {G _i}_1≤i≤a such that G _i is σ-unreal and δ(G _i)→c as n→∞ for all 1 ≤i≤a, and moreover, δ(n)→0 as n→∞. Supported by the National Natural Science Foundation of China (10061003) and the Science Foundation of the State Education Ministry of China.     

Extremes of independent Gaussian processes

For every n ∈ ℕ, let X _1n ,..., X _nn be independent copies of a zero-mean Gaussian process X _n  = {X _n (t), t ∈ T}. We describe all processes which can be obtained as limits, as n→ ∞, of the process a _n (M _n  − b _n ), where M _n (t) =  max _{i = 1,...,n} X _in (t), and a _n , b _n are normalizing constants. We also provide an analogous characterization for the limits of the process a _n L _n , where L _n (t) =  min _{i = 1,...,n} |X _in (t)|.     

Almost poised basic hypergeometric series

Given a basic hypergeometric series with numerator parametersa ₁,a ₂, ...,a _r and denominator parametersb ₂, ...,b _r, we say it isalmost poised ifb _i, =a ₁ q ^δ,i a _i,δ_i = 0, 1 or 2, for 2 ≤i ≤r. Identities are given for almost poised series withr = 3 andr = 5 when a₁, =q ⁻²ⁿ. Partially supported by N.S.F. Grant No. DMS-8521580.     

On the Hamilton-Waterloo Problem

 The Hamilton-Waterloo problem asks for a 2-factorisation of K _v in which r of the 2-factors consist of cycles of lengths a ₁,a ₂,…,a _t and the remaining s 2-factors consist of cycles of lengths b ₁,b ₂,…,b _u (where necessarily ∑ _i=1 ^t a _i =∑ _j=1 ^u b _j =v). In this paper we consider the Hamilton-Waterloo problem in the case a _i =m, 1≤i≤t and b _j =n, 1≤j≤u. We obtain some general constructions, and apply these to obtain results for (m,n)∈{(4,6),(4,8),(4,16),(8,16),(3,5),(3,15),(5,15)}. Received: July 5, 2000     

On rigidity of Clifford torus in a unit sphere

We extend the scalar curvature pinching theorems due to Peng-Terng, Wei-Xu and Suh-Yang. Let M be an n-dimensional compact minimal hypersurface in S n+1 satisfying Sf 4 f_3~2 ≤ 1/n S~3 , where S is the squared norm of the second fundamental form of M, and f_k =sum λ_i~k from i and λ_i (1 ≤ i ≤ n) are the principal curvatures of M. We prove that there exists a positive constant δ(n)(≥ n/2) depending only on n such that if n ≤ S ≤ n + δ(n), then S ≡ n, i.e., M is one of the Clifford torus S~k ((k/n)~1/2 ) ×S~...     

Inequalities for sums of independent geometrical random variables

Summary We give a survey of known results regarding Schur-convexity of probability distribution functions. Then we prove that the functionF(p ₁,...,p_n;t)=P(X₁+...+X_n≤t) is Schur-concave with respect to (p ₁,...,p_n) for every realt, whereX _i are independent geometric random variables with parametersp _i. A generalization to negative binomial random variables is also presented.     

Algebraic Independence by Approximation Method (II)

Let f (x) be a continued fraction with elements a _n x, where coefficients a _n are positive algebraic numbers. Using the criterion of [l] for any nonzero real algebraic numbers α₁,...,α_s with distinct absolute values the algebraic independence of the values f(α₁), ..., f(α_s) is proved under certain assumption concerning only with a _n . For some transcendental numbers ξ the algebraic independence of values f(ξ^j)(j∈ℤ) is also established. Received March 27, 1998, Accepted September 28, 1998     

Are the degrees of the best (co)convex and unconstrained polynomial approximations the same? II

In Part I of the paper, we have proved that, for every α > 0 and a continuous function f, which is either convex (s = 0) or changes convexity at a finite collection Y _s = {y _i } ^s _i=1 of points y _i ∈ (-1, 1),