Invertibility preserving linear maps on

For Banach spaces and , we show that every unital bijective invertibility preserving linear map between and is a Jordan isomorphism. The same conclusion holds for maps between and .

     

SOME NEW PARTIAL ORDERINGSDESCRIBING AGING PROPERTY

The concept of aging, which is very users in relability describes the adverse orbeneficial effects of age on the lifetime of systems. Several partial orderings of life distributionshave been introduced. In this article,some more partial orderings of life distributions are imtroduced mainly by means of the equilibrium distribution. And conversely, a group of new aging clasps oflife distrbutions can be derived from these orderings.     

Computable choice functions for computable linear orderings

A choice set for a computable linear ordering is a set which contains one element from each maximal block of the ordering. We obtain a partial characterization of the computable linear order‐types for which each computable model has a computable choice set, and a full characterization in the relativized case; Every model of the linear order‐type α of degree ≤ d has a choice set of degree ≤ d iff α can written as a finite sum of order‐types, each of which either has finitely many blocks, or has order‐type n · η for some integer n.     

Finding a positive definite linear combination of two Hermitian matrices

Let A and B be n-by-n Hermitian matrices over the complex field. A result of Au-Yeung [1] and Stewart [8] states that if

$\text{x}{}^1\text{(A + iB)x≠0}$

for all nonzero n-vectors x, then there is a linear combination of A and B which is positive definite. In this article we present an algorithm which finds such a linear combination in a finite number of steps. We also discuss the implementation of the algorithm in case A and B are real symmetric sparse matrices.     

Computability-theoretic and proof-theoretic aspects of partial and linear orderings

Szpilrajn’s Theorem states that any partial orderP=〈S,<p〉 has a linear extensionP=〈S,<L〉. This is a central result in the theory of partial orderings, allowing one to define, for instance, the dimension of a partial ordering. It is now natural to ask questions like “Does a well-partial ordering always have a well-ordered linear extension?” Variations of Szpilrajn’s Theorem state, for various (but not for all) linear order typesτ, that ifP does not contain a subchain of order typeτ, then we can chooseL so thatL also does not contain a subchain of order typeτ. In particular, a well-partial ordering always has a well-ordered extension.We show that several effective versions of variations of Szpilrajn’s Theorem fail, and use this to narrow down their proof-theoretic strength in the spirit of reverse mathematics.     

广义幂等算子差的可逆性

设P, Q为Hilbert空间H上的幂等算子, 关于算子$P$的广义幂等算子类ω(P)定义为ω(P)={A∈B}(H): A²=αA+βP, AP=PA=A,P²=P,∨α, β∈C}. 对任意A ∈ω(P), B∈ω(Q)使得A²=αA +βP, B²=mB+nQ,βn≠ 0, 得到了如下的结论: 值域R(PQ)是闭的充要条件是值域R(AB)是闭的; 如果P-Q是可逆的, 则A-B是可逆的.     

Invertibility of linear combinations of two idempotents

Let and be two idempotents on a Hilbert space. In this note, we prove that the invertibility of the linear combination is independent of the choice of , if and

     

无界形式Hamilton算子的可逆性

利用算子分块方法研究了具有一般定义域的形式Hamilton算子的可逆性和可逆补,还进一步给出了无穷维Hamilton算子的相关结论.     

Generalized quadraticity of linear combination of two generalized quadratic matrices

It is investigated the necessary and sufficient conditions for the generalized quadraticity of a linear combination of any two generalized quadratic matrices. The main result obtained is, in a sense, a generalization of the main results given in [Uç M, Özdemir H, Özban AY. On the quadraticity of linear combinations of quadratic matrices. Linear Multilinear Algebra. 2015;63:1125–1137.] which contains many of the results in the literature related to idempotency or involutivity of the linear combinations of idempotent and/or involutive matrices, to the generalized quadratic matrices.     

A note on fast approximate minimum degree orderings for symmetric matrices with some dense rows

Recently, a number of variants of the approximate minimum degree algorithm have been proposed that aim to efficiently order symmetric matrices containing some dense rows. We compare the performance of these variants on a range of problems and highlight their potential limitations. This leads us to propose a new variant that offers both speed and robustness. Copyright © 2009 John Wiley & Sons, Ltd.     

Manufacturer-buyer coordination for newsvendor-type-products with two ordering opportunities and partial backorders

In a recent paper [Weng, Z.K., 2004. Coordinating order quantities between the manufacturer and the buyer: A generalized newsvendor model. European Journal of Operational Research 156, 148–161], a newsvendor-type coordination model was developed for a single-manufacturer single-buyer channel with two ordering opportunities. This paper further extends the model to the case where the excess demand after the first order is partially backlogged and both parties share the manufacturing setup cost of the second order (if happened). We show that the decentralized system would perform best if the manufacturer covers utterly the second production setup cost, which is opposite to that obtained in Weng (2004). Another extension in the present paper is that in the centralized system, the second order decision is made by the buyer based on the channel’s benefit rather than based on the buyer’s benefit as in Weng (2004). It is proved that the expected profit of the system in our paper is always larger than that in Weng (2004). In order to maximize the expected profit of the channel, two coordinated policies are proposed to achieve perfect coordination: a two-part-tariff policy for the special case that the buyer pays all the manufacturing setup cost, and a revised revenue-sharing contract for the case that two parties share the manufacturing setup cost.     

Tripotency of a linear combination of two involutory matrices and a tripotent matrix that mutually commute

This paper concerns with the tripotency of a linear combination of three matrices, which has a background in statistical theory. We demonstrate all the possible cases that lead to the tripotency of a linear combination of two involutory matrices and a tripotent matrix that mutually commute. By utilizing block technique and returning the partitioned matrices to their original forms, we derive the sufficient and necessary conditions such that a linear combination of three mutually commuting involutory matrices is tripotent.     

Majorization and arrangement orderings in open queueing networks

Consider an open Jackson network of queues. Majorization and arrangement orderings are studied to order, respectively, various loading and server-assignment policies. It is shown that under these order relations, stochastic and likelihood ratio orderings can be established for the maximum and the minimum queue lengths and for the total number of jobs in the network. Stochastic majorization and stochastic orderings are also established, respectively, for the queue-length vector and the associated order-statistic vector. Implications of the results on loading and assignment decisions are discussed.     

Invertibility of symmetric random matrices

We study symmetric random matrices H, possibly discrete, with iid above‐diagonal entries. We show that H is singular with probability at most , and . Furthermore, the spectrum of H is delocalized on the optimal scale . These results improve upon a polynomial singularity bound due to Costello, Tao and Vu, and they generalize, up to constant factors, results of Tao and Vu, and Erdös, Schlein and Yau.Copyright © 2012 Wiley Periodicals, Inc. Random Struct. Alg., 44, 135‐182, 2014     

Adaptive linear combination of heuristic orderings in constructing examination timetables

In this paper, we investigate adaptive linear combinations of graph coloring heuristics with a heuristic modifier to address the examination timetabling problem. We invoke a normalisation strategy for each parameter in order to generalise the specific problem data. Two graph coloring heuristics were used in this study (largest degree and saturation degree). A score for the difficulty of assigning each examination was obtained from an adaptive linear combination of these two heuristics and examinations in the list were ordered based on this value. The examinations with the score value representing the higher difficulty were chosen for scheduling based on two strategies. We tested for single and multiple heuristics with and without a heuristic modifier with different combinations of weight values for each parameter on the Toronto and ITC2007 benchmark data sets. We observed that the combination of multiple heuristics with a heuristic modifier offers an effective way to obtain good solution quality. Experimental results demonstrate that our approach delivers promising results. We conclude that this adaptive linear combination of heuristics is a highly effective method and simple to implement.     

Henselian valuations and orderings of a commutative ring

The purpose of this paper is to investigate the interplay between henselian valuations and orderings (or semiorderings) of a ring. As a main result, it is proved that for a henselian valuation on a ring , the following statements are equivalent: (1) is compatible with every semiordering of ; (2) is compatible with every ordering of ; (3) Every real prime ideal of is contained in the core of .

     

On Positive Invertibility of matrices

A new criterion for the positive invertibility of matrices is established. It improves the theorem by Collatz for matrices which are near to triangular ones.     

Weakening partial orderings to lattice and semilattice orderings

A partial ordering on a set P can be weakened to an upper or lower semilattice ordering, respectively a lattice ordering, if and only if P is filtered in the appropriate direction(s).This work was done while the author was partly supported by NSF contract DMS 85-02330.