Stability theorems for infinitely constrained mathematical programs

The primary concern of this paper is to investigate stability conditions for the mathematical program: findx E ⁿ that maximizesf(x):g ^j(x)0 for somej J, wheref is a real scalarvalued function and eachg is a real vector-valued function of possibly infinite dimension. It should be noted that we allow, possibly infinitely many, disjunctive forms. In an earlier work, Evans and Gould established stability theorems wheng is a continuous finite-dimensional real-vector function andJ=1. It is pointed out that the results of this paper reduce to the Evans-Gould results under their assumptions. Furthermore, since we use a slightly more general definition of lower and upper semicontinuous point-to-set mappings, we can dispense with the continuity ofg (except in a few instances where it is implied by convexity assumptions).     

A constructive proof by elementary transformations of Roth's removal theorems in the theory of matrix equations

W. E. Roth gave necessary and sufficient conditions for the existence of solution(s) of certain types of linear matrix equations. Proofs were based on invariant factors and were long and complicated. Other shorter but non-constructive proofs have since been provided by later authors. We present here very brief constructive proofs based on the simplest of mathematical techniques, namely row- and column-reduction of a matrix.     

Construction of sliced (nearly) orthogonal Latin hypercube designs

Sliced Latin hypercube designs are very useful for running a computer model in batches, ensembles of multiple computer models, computer experiments with qualitative and quantitative factors, cross-validation and data pooling. However, the presence of highly correlated columns makes the data analysis intractable. In this paper, a construction method for sliced (nearly) orthogonal Latin hypercube designs is developed. The resulting designs have flexible sizes and most are new. With the orthogonality or near orthogonality being guaranteed, the space-filling property of the resulting designs is also improved. Examples are provided for illustrating the proposed method.     

Characterization of an Algerian diatomite by inverse gas chromatography: Specific and non-specific contribution and Lewis acid–base parameters

The fundamental understanding of the behavior of a solid is intimately related to the understanding of the interactions on the surface of the latter, a major challenge in particular if the material is natural and ecological. The infinite dilution-inverse gas chromatography was used to evaluate the surface thermodynamic properties of several phases (grafted and/or coated) diatomite. A series of non- or polar-solute probes were injected at temperatures of 45?°C and 90?°C. The dispersive surface free energies values of the supports decrease with increasing temperature and their active surface is amphoteric with predominantly acidic character.     

The use of Sinc‐collocation method for solving Falkner–Skan boundary‐layer equation

The MHD Falkner–Skan equation arises in the study of laminar boundary layers exhibiting similarity on the semi‐infinite domain. The proposed approach is equipped by the orthogonal Sinc functions that have perfect properties. This method solves the problem on the semi‐infinite domain without truncating it to a finite domain and transforming domain of the problem to a finite domain. In addition, the governing partial differential equations are transformed into a system of ordinary differential equations using similarity variables, and then they are solved numerically by the Sinc‐collocation method. It is shown that the Sinc‐collocation method converges to the solution at an exponential rate. Copyright © 2010 John Wiley & Sons, Ltd.     

Strong approximation for ρ-mixing sequences

We establish strong invariance principles for sums of stationary ρ-mixing random variables with finite and infinite second moments under weaker mixing rates.Some earlier results are improved.As applications,some results of the law of the iterated logarithm with finite and infinite variance are obtained,also a conjecture raised by Shao in 1993 is solved.     

Ends,tangles and critical vertex sets

We show that an arbitrary infinite graph G can be compactified by its ends plus its critical vertex sets, where a finite set X of vertices of an infinite graph is critical if its deletion leaves some infinitely many components each with neighbourhood precisely equal to X. We further provide a concrete separation system whose ?₀‐tangles are precisely the ends plus critical vertex sets. Our tangle compactification is a quotient of Diestel's (denoted by ), and both use tangles to compactify a graph in much the same way as the ends of a locally finite and connected graph compactify it in its Freudenthal compactification. Finally, generalising both Diestel's construction of and our construction of , we show that G can be compactified by every inverse limit of compactifications of the sets of components obtained by deleting a finite set of vertices. Diestel's is the finest such compactification, and our is the coarsest one. Both coincide if and only if all tangles are ends. This answers two questions of Diestel.     

On Applications of Quasi-Monotone Sequences and Quasi Power Increasing Sequences

In this article, we prove a general theorem dealing with an application of quasi-f-power increasing sequences and δ-quasi monotone sequences. This theorem also includes some known and new results.