Some geometrical aspects of semidefinite linear complementarity problems

This article studies some geometrical aspects of the semidefinite linear complementarity problem (SDLCP), which can be viewed as a generalization of the well-known linear complementarity problem (LCP). SDLCP is a special case of a complementarity problem over a closed convex cone, where the cone considered is the closed convex cone of positive semidefinite matrices. It arises naturally in the unified formulation of a pair of primal-dual semidefinite programming problems. In this article, we introduce the notion of complementary cones in the semidefinite setting using the faces of the cone of positive semidefinite matrices and show that unlike complementary cones induced by an LCP, semidefinite complementary cones need not be closed. However, under R₀-property of the linear transformation, closedness of all the semidefinite complementary cones induced by L is ensured. We also introduce the notion of a principal subtransformation with respect to a face of the cone of positive semidefinite matrices and show that for a self-adjoint linear transformation, strict copositivity is equivalent to strict semimonotonicity of each principal subtransformation. Besides the above, various other solution properties of SDLCP will be interpreted and studied geometrically.     

On perfectly normal dense subspaces of products

Let M be a separable metric space consisting of more than one point. We construct perfectly normal dense subspaces Z⊂Mc² and (under additional set-theoretic assumption) Y⊂Mc which are not collectionwise Hausdorff.     

Eliminating graphs by means of parallel knock-out schemes

In 1997 Lampert and Slater introduced parallel knock-out schemes, an iterative process on graphs that goes through several rounds. In each round of this process, every vertex eliminates exactly one of its neighbors. The parallel knock-out number of a graph is the minimum number of rounds after which all vertices have been eliminated (if possible). The parallel knock-out number is related to well-known concepts like perfect matchings, hamiltonian cycles, and 2-factors.We derive a number of combinatorial and algorithmic results on parallel knock-out numbers: for families of sparse graphs (like planar graphs or graphs of bounded tree-width), the parallel knock-out number grows at most logarithmically with the number n of vertices; this bound is basically tight for trees. Furthermore, there is a family of bipartite graphs for which the parallel knock-out number grows proportionally to the square root of n. We characterize trees with parallel knock-out number at most 2, and we show that the parallel knock-out number for trees can be computed in polynomial time via a dynamic programming approach (whereas in general graphs this problem is known to be NP-hard). Finally, we prove that the parallel knock-out number of a claw-free graph is either infinite or less than or equal to 2.     

The Sheffer group and the Riordan group

We define the Sheffer group of all Sheffer-type polynomials and prove the isomorphism between the Sheffer group and the Riordan group. An equivalence of the Riordan array pair and generalized Stirling number pair is also presented. Finally, we discuss a higher dimensional extension of Riordan array pairs.     

Some new integral inequalities of Bellman–Bihari type with delay for discontinuous functions

In this article we investigate some integral functional inequalities of Bellman–Bihari type for piecewise-continuous functions with some fixed points of discontinuity. We also prove a new analogy and generalization of results which were obtained by Bellman and Bihari to integro-sum inequalities with delay and discontinuities that do not belong to Lipschitz’s type.     

First-Principles Study on the Electronic Structures for Y^3＋：PbWO4 Crystals

The possible defect models of Y^3＋：PbWO4 crystals are discussed by defect chemistry and the most possible substituting positions of the impurity Y^3＋ ions are studied by using the general utility lattice program （GULP）. The calculated results indicate that in the lightly doped Y^3＋ ：PWO crystal, the main compensating mechanism is [2Ypb^＋ ＋ VPb^2-], and in the heavily doped Y^3＋ ：PWO crystal, it will bring interstitial oxygen ions to compensate the positive electricity caused by YPb^＋, forming defect clusters of [2Ypb^＋ ＋Oi^2-] in the crystal. The electronic structures of Y3＋ ：PWO with different defect models are calculated using the DV-Xα method. It can be concluded from the electronic structures that, for lightly doped cases, the energy gap of the crystal would be broadened and the 420nm absorption band will be restricted; for heavily doped cases, because of the existence of interstitial oxygen ions, it can bring a new absorption band and reduce the radiation hardness of the crystal.     

Barycentric systems and stretchability

Using a general resolution of barycentric systems we give a generalization of Tutte's theorem on convex drawing of planar graphs. We deduce a characterization of the edge coverings into pairwise non-crossing paths which are stretchable: such a system is stretchable if and only if each subsystem of at least two paths has at least three free vertices (vertices of the outer face of the induced subgraph which are internal to none of the paths of the subsystem). We also deduce that a contact system of pseudo-segments is stretchable if and only if it is extendible.     

Beyond Cartesian limits: Leibniz's passage from algebraic to “transcendental” mathematics

This article deals with Leibniz's reception of Descartes' “geometry.” Leibnizian mathematics was based on five fundamental notions: calculus, characteristic, art of invention, method, and freedom. On the basis of methodological considerations Leibniz criticized Descartes' restriction of geometry to objects that could be given in terms of algebraic (i.e., finite) equations: “Descartes's mind was the limit of science.” The failure of algebra to solve equations of higher degree led Leibniz to develop linear algebra, and the failure of algebra to deal with transcendental problems led him to conceive of a science of the infinite. Hence Leibniz reconstructed the mathematical corpus, created new (transcendental) notions, and redefined known notions (equality, exactness, construction), thus establishing “a veritable complement of algebra for the transcendentals”: infinite equations, i.e., infinite series, became inestimable tools of mathematical research.     

On simultaneous confidence intervals for all contrasts in the means of the intraclass correlation model with missing data

In this paper, we consider simultaneous confidence intervals for all contrasts in the means when the observations are missing at random in the intraclass correlation model. An exact test statistic for the equality of the means and Scheffé, Bonferroni and Tukey types of simultaneous confidence intervals are given by an extension of Bhargava and Srivastava [On Tukey's confidence intervals for the contrasts in the means of the intraclass correlation model, J. Royal Statist. Soc. B35 (1973) 147-152] when the missing observations are of the monotone type. Finally, numerical results of simultaneous confidence intervals are presented.     

Preemptive scheduling of interval orders is polynomial

In 1979, Papadimitriou and Yannakakis gave a polynomial time algorithm for the scheduling of jobs requiring unit completion times when the precedence constraints form an interval order. The authors solve here the corresponding problem, for preemptive scheduling (a job can be interrupted to work on more important tasks, and completed at a later time, subject to the usual scheduling constraints.) The m-machine preemptive scheduling problem is shown to have a polynomial algorithm, for both unit time and variable execution times as well, when the precedence constraints are given by an interval order.