Q-matrices and boundedness of solutions to linear complementarity problems

This paper is concerned with the existence and boundedness of the solutions to the linear complementarity problemw=Mz+q,w0,z0,w ^T z=0, for eachq ⁿ . It has been previously established that, ifM is copositive plus, then the solution set is nonempty and bounded for eachq ⁿ iffM is aQ-matrix. This result is shown to be valid also forL ₂-matrices,P ₀-matrices, nonnegative matrices, andZ-matrices.     

Über Positive Resolventenwerte Positiver Operatoren

In this paper we study the positive resolvent values of positive operators respectively of positive elements in Banach lattice ordered algebras. In the matrix case these values are just the inverse M-matrices. One of the main results is the following: Let A be a Banach lattice ordered algebra. A positive invertible element xA is a resolvent value of a positive element yA if and only if the element x satisfies the negative principle: If aA, < 0 and xaa then xa 0.     

The Eta Invariant and the Connective K-Theory of the Classifying Space for Cyclic 2 Groups

We use the eta invariant to study the connective K-theory groups ko _m (B ) of the classifying space for the cyclic group where - 2 2.     

Weak Laws with Random Indices for Arrays of Random Elements in Rademacher Type p Banach Spaces

For a sequence of constants {a _n,n1}, an array of rowwise independent and stochastically dominated random elements { V _nj, j1, n1} in a real separable Rademacher type p (1p2) Banach space, and a sequence of positive integer-valued random variables {T _n, n1}, a general weak law of large numbers of the form is established where {c _nj, j1, n1}, _n , b _n are suitable sequences. Some related results are also presented. No assumption is made concerning the existence of expected values or absolute moments of the {V _nj, j1, n1}. Illustrative examples include one wherein the strong law of large numbers fails.     

The Higher K-Theory of Real Curves

If X is a smooth curve defined over the real numbers , we show that K _n (X) is the sum of a divisible group and a finite elementary Abelian 2-group when n 2. We determine the torsion subgroup of K _n (X), which is a finite sum of copies of and 2, only depending on the topological invariants of X() and X(), and show that (for n 2) these torsion subgroups are periodic of order 8.     

On the E- and MV-optimality of block designs having k≥v

In this paper we consider the problem of determining and constructing E- and MV-optimal block designs to use in experimental settings where treatments are applied to experimental units occurring in b blocks of size k, k. It is shown that some of the well-known methods for constructing E- and MV-optimal unequally replicated designs having k fail to yield optimal designs in the case where . Some sufficient conditions are derived for the E- and MV-optimality of block designs having and methods for constructing designs satisfying these sufficient conditions are given.     

The Parameters of Bipartite Q-polynomial Distance-Regular Graphs

Let denote a bipartite distance-regular graph with diameter D 3 and valency k 3. Suppose ₀, ₁, ..., _D is a Q-polynomial ordering of the eigenvalues of . This sequence is known to satisfy the recurrence _{i – 1} – _i + _{i + 1} = 0 (0 > i > D), for some real scalar . Let q denote a complex scalar such that q + q ^–1 = . Bannai and Ito have conjectured that q is real if the diameter D is sufficiently large.We settle this conjecture in the bipartite case by showing that q is real if the diameter D 4. Moreover, if D = 3, then q is not real if and only if ₁ is the second largest eigenvalue and the pair (, k) is one of the following: (1, 3), (1, 4), (1, 5), (1, 6), (2, 4), or (2, 5). We observe that each of these pairs has a unique realization by a known bipartite distance-regular graph of diameter 3.     

Some Conditions for a C0-Semigroup to Be Asymptotically Finite-Dimensional

We study the class of bounded C ₀-semigroups T=(T _t ) _t0 on a Banach space X satisfying the asymptotic finite dimensionality condition: codim X ₀(T)<, where X ₀(T):={x X:lim_t T _t x=0}. We prove a theorem which provides some necessary and sufficient conditions for asymptotic finite dimensionality.     

A short proof of finiteness of Murty's principal pivoting algorithm

We give a short proof of the finiteness of Murty's principal pivoting algorithm for solving the linear complementarity problemy = Mz + q, y ^T z = 0,y 0,z 0 withP-matrixM.     

Über die Häufigkeit großer Differenzen konsekutiver Primzahlen

The following theorem is going to be proved. Letp _m be them-th prime and putd _m :=p _m+1–p _m . LetN(,T), 1/21,T3. denote the number of zeros =+i of the Riemann zeta function which fulfill and ||T. Letc2 andh0 be constants such thatN(,T)T ^c(1–) (logT) ^h holds true uniformly in 1/21. Let >0 be given. Then there is some constantK>0 such that      

Differential geometry of tensor product immersions II

In the first part of this series, we prove that the tensor product immersionf ₁ f _2k of2k isometric spherical immersions of a Riemannian manifoldM in Euclidean space is of-type with k and classify tensor product immersionsf ₁ f _2k which are ofk-type. In this article we investigate the tensor product immersionsf ₁ f _2k which are of (k+1)-type. Several classification theorems are obtained.     

Infinitesimal obstructions to weakly mixing

Let ^t be the flow (parametrized with respect to arc length) of a smooth unit vector field v on a closed Riemannian manifold M ⁿ , whose orbits are geodesics. Then the (n-1)-plane field normal to v, v, is invariant under d ^t and, for each x M, we define a smooth real function _x (t) : (1 + _i (t)), where the _i(t) are the eigenvalues of AA ^T, A being the matrix (with respect to orthonormal bases) of the non-singular linear map d^2t , restricted to v at the point _x ^-t M ⁿ.Among other things, we prove the Theorem (Theorem II, below). Assume v is also volume preserving and that _x ^' (t) 0 for all x M and real t; then, if _x ^t : M M is weakly missng for some t, it is necessary that vx 0 at all x M.     

Degeneracy in linear complementarity problems: a survey

Given a square matrixM of ordern and a vectorq ⁿ , the linear complementarity problem is the problem of either finding aw ⁿ and az ⁿ such thatw–Mz=q,w0,z0 andw ^T z=0 or showing that no such (w, z) exists. This problem is denoted asLCP(q, M). We say that a solution (w, z) toLCP(q, M) is degenerate if the number of positive coordinates in (w, z) is less thann. As in linear programming, degeneracy may cause cycling in an adjacent vertex following methods like Lemke's algorithm. Moreover, ifLCP(0,M) has a nontrivial solution, a condition related to degeneracy, then unless certain other conditions are satisfied, the algorithm may not be able to decide about the solvability of the givenLCP(q, M). In this paper we review the literature on the implications of degeneracy to the linear complementarity theory.     

Slope Estimates of Artin–Schreier Curves

Let X/F_p be an Artin–Schreier curve defined by the affine equation y ^p –y=f(x) where f(x)F_p[x] is monic of degree d. In this paper we develop a method for estimating the first slope of the Newton polygon of X. Denote this first slope by NP₁(X/F_p). We use our method to prove that if p>d2 then NP₁(X/F_p)(p–1)/d/(p–1). If p>2d4, we give a sufficient condition for the equality to hold.     

The Coordinatewise Uniformly Kadec–Klee Property in Some Banach Spaces

We introduce a new property UKK _c for a Banach space and show for an Orlicz sequence space the following: UKK _c H _{c 2}.     

Some greedyt-intersecting families of finite sequences

Letn, s ₁,s ₂, ... ands _n be positive integers. Assume is an integer for eachi}. For , , and , denotes _p (a)={j|1jn,a _j p}, , and . is called anI _t ^p -intersecting family if, for any a,b ,a _i b _i =min(a _i ,b _i )p for at leastt i's. is called a greedyI _t ^P -intersecting family if is anI _t ^p -intersecting family andW _p (A)W _p (B+A ^c ) for anyAS _p ( ) and any with |B|=t–1.In this paper, we obtain a sharp upper bound of | | for greedyI _t ^p -intersecting families in for the case 2ps _i (1in) ands ₁>s ₂>...>s _n .This project is partially supported by the National Natural Science Foundation of China (No.19401008) and by Postdoctoral Science Foundation of China.     

Une variante à la Coxeter du groupe de Steinberg

LetG _n ()be the semi-direct product of the symmetric groupS _n by the Steinberg groupSt _n ()of a ringWe first prove thatG _n ()has a Coxeter-type presentation. The canonical morphism St _n () GL _n ()extends to a group homo G_n() GL _n ()We next determine the kernel of for n = We also give an expression for the generator of the algebraic K group K ₂(Z)of the integers in terms of permutation matrices.     

Edge Coloring of Embedded Graphs with Large Girth

Let G be a simple graph embedded in the surface of Euler characteristic ()0. Denote _e(G), and g the edge chromatic number, the maximum degree and the girth of the graph G, respectively. The paper shows that _e(G)= if 5 and g4, or 4 and g5, or 3 and g9. In addition, if ()>0, then _e(G)= if 3 and g8. Acknowledgments.The authors would like to thank Dr. C.Q. Zhang for carefully reading several versions of this paper during its preparation and for suggesting several stylistic changes that have improved the overall presentation.     

D λ -cycles in 3-cyclable graphs

Letk and be positive integers, andG a 2-connected graph of ordern with minimum degree and independence number. A cycleC ofG is called aD -cycle if every component ofG – V(C) has order smaller than. The graphG isk-cyclable if anyk vertices ofG lie on a common cycle. A previous result of the author is that if k 2, G isk-connected and every connected subgraphH ofG of order has at leastn +k ² + 1/k + 1 – vertices outsideH adjacent to at least one vertex ofH, thenG contains aD -cycle. Here it is conjectured that k-connected can be replaced by k-cyclable, and this is proved fork = 3. As a consequence it is shown that ifn 4 – 6, or ifG is triangle-free andn 8 – 10, thenG contains aD ₃-cycle orG , where denotes a well-known class of nonhamiltonian graphs of connectivity 2. As an analogue of a result of Nash-Williams it follows that ifn 4 – 6 and – 1, thenG is hamiltonian orG . The results are all best possible and compare favorably with recent results on hamiltonicity of graphs which are close to claw-free.     

On the Weak Limiting Behavior of Almost Surely Convergent Row Sums from Infinite Arrays of Rowwise Independent Random Elements in Banach Spaces

For an array {V _nk ,k1,n1} of rowwise independent random elements in a real separable Banach space with almost surely convergent row sums , we provide criteria for S _n –A _n to be stochastically bounded or for the weak law of large numbers to hold where {A _n ,n1} is a (nonrandom) sequence in .