All Finite Distributive Lattices Occur as Intervals Between Hausdorff Topologies

It is shown that a finite lattice L is isomorphic to the interval betweentwo Hausdorff topologies on some set if and only if L is distributive. Thecorresponding results had previously been shown in ZFC for intervals between T₁ topologies and, assuming the existence of infinitely manymeasurable cardinals, for intervals between T₃ topologies.     

Finite Intervals in the Lattice of Topologies

We prove a conjecture of Reinhold: that a finite lattice is isomorphic to an interval in the lattice of topologies on some set if and only if it is isomorphic to an interval in the lattice of topologies on a finite set.     

Modular Lattice for C 0-Operators

We prove modularity of the lattice Lat (T) of closed invariant subspaces for a C ₀-operator T with property (P). To my parents     

Strict Topologies as Topological Algebras

Let X be a completely regular Hausdorff space, C_b(X) the space of all scalar-valued bounded continuous functions on X with strict topologies. We prove that these are locally convex topological algebras with jointly continuous multiplication. Also we find the necessary and sufficient conditions for these algebras to be locally m-convex.     

A Probabilistic Approach to the Problem of the Defects of Admissible Sets in a Lattice

New estimates for the defect of the admissible set in a lattice are obtained for a sufficiently large class of sequences.     

Covers in the Lattice of Varieties of m-Groups

We consider some questions on covers in the lattice of varieties of m-groups. We prove the existence of a nonabelian cover of the smallest nontrivial variety of m-groups. We show that there exists an uncountable set of o-approximable varieties of m-groups each of which has continuum many o-approximable covers. In the lattice of o-approximable varieties of m-groups we find a variety that has no covers in this variety and no independent basis of identities.     

Effect of A-site cation substitution on magnetic transition temperature of (LaCa) MnO3

The ferromagnetic transition temperatures have been measured on two bathes of perovskite manganese oxides such as (La_1-x R _x )_2/3Ca_1/3MnO₃(R=Ce, Pr, Nd, etc.) and La_2/3(Ca_1-y Cd _y )_1/3MnO₃. It is found that the (La_1-x R _x )_2/3Ca_1/3MnO₃ samples have obviously different Curie temperatureT _C although their (r_A) (the average A-site cation radius) are almost identical, and theT _C in the system of (La_1-x R _x )_2/3Ca_1/3MnO₃(R=Ce, Pr, Nd, etc.) and La_2/3(Ca_1-y Cd _y )_1/3MnO₃. It is found that the (La_1-x R _x )_2/3Ca_1/3MnO₃ compounds increases with increasingy although (r_A) decreases slightly. It is suggested that the Curie temperature should be influenced by the average local A-site magnetic moment in the ferromagnetic perovskite manganite system. Project supported by the National Natural Science Foundation of China (Grant No. 19504012) and the Chinese Academy of Sciences.     

Lattice valued intuitionistic fuzzy sets

In this paper a new definition of a lattice valued intuitionistic fuzzy set (LIFS) is introduced, in an attempt to overcome the disadvantages of earlier definitions. Some properties of this kind of fuzzy sets and their basic operations are given. The theorem of synthesis is proved: For every two families of subsets of a set satisfying certain conditions, there is an lattice valued intuitionistic fuzzy set for which these are families of level sets. The research supported by Serbian Ministry of Science and Technology, Grant No. 1227.     

Lattice Paths,q-Multinomials and Two Variants of the Andrews-Gordon Identities

A few years ago Foda, Quano, Kirillov and Warnaar proposed and proved various finite analogs of the celebrated Andrews-Gordon identities. In this paper we use these polynomial identities along with the combinatorial techniques introduced in our recent paper to derive Garrett, Ismail, Stanton type formulas for two variants of the Andrews-Gordon identities.     

Limit theorems for the minimum interpoint distance between any pair of i.i.d. random points in R d

The limit theorem for the minimum interpoint distance between any pair of i.i.d. random points in R ^d with common density fL ² was studied by a method which makes use of the convergence of point processes. Some one-dimensional examples with fL ² (including the cases Beta and Gamma distributions) were also considered.     

Lattice path counting andM/M/c queueing systems

We apply the lattice path counting method to the analysis of the transientM/M/c queueing system. A closed-form solution is obtained for the probability of exactlyi arrivals andj departures within a time interval of lengtht in anM/M/c queueing system that is empty at the initial time. The derivation of the probability is based on the counting of paths from the origin to(i,j) on thexy-plane, that have exactly r_d x-steps whose depth from the liney=x isd (d=0,1,...,c–1). The closed-form solution has an expression useful for numerical calculation.     

An everywhere convergent series representation of the distribution of Hotelling's generalized T0

A new series representation of the exact distribution of Hotelling's generalized T₀² statistic is obtained. Unlike earlier work, the series representation given here is everywhere convergent. Explicit formulae are given for both the null and the non-central distributions. Earlier results by [1], 215–225), which are convergent on the interval [0, 1), are also derived quite simply from our formulae. The paper therefore provides a solution to the long standing problem of the exact distribution of the T₀² statistic in the general case.     

A Constructive Approach to Lattice Rule Canonical Forms

The rank and invariants of a general lattice rule are conventionally defined in terms of the group-theoretic properties of the rule. Here we give a constructive definition of the rank and invariants using integer matrices. This underpins a nonabstract algorithm set in matrix algebra for obtaining the Sylow p-decomposition of a lattice rule. This approach is particularly useful when it is not known whether the form in which the lattice rule is specified is canonical or even repetitive. A new set of necessary and sufficient conditions for recognizing a canonical form is given.     

The Number of Lattice Rules of Specified Upper Class and Rank

The upper class of a lattice rule is a convenient entity for classification and other purposes. The rank of a lattice rule is a basic characteristic, also used for classification. By introducing a rank proportionality factor and obtaining certain recurrence relations, we show how many lattice rules of each rank exist in any prime upper class. The Sylow p-decomposition may be used to obtain corresponding results for any upper class.     

Epimorphisms and cowellpoweredness for separated metrically generated theories

For metrically generated constructs X we give an internal characterization of the regular closure operator on X, determined by the subconstruct X ₀, consisting of its T ₀ objects. This allows us to describe the epimorphisms in X ₀ and to show that all the constructs of that type are cowellpowered. We capture many known results but our method also gives solutions in cases where the epimorphism problem was still open. The third author is “research assistant” at the FWO-Vlaanderen.     

A remark on CD 0(K)-spaces

A representation of the CD ₀(K)-space is given in [1, 2] for a compact Hausdorff space K without isolated points. We generalize this to an arbitrary countably compact space K without any assumption on isolated points.     

Invariant Sets in Banach Lattices and Linear Differential Equations and Delay

In this paper we characterize the invariance of some sets with respect to a C ₀-semigroup in Banach lattice. An application to a linear differential equation with delay is given.     

On the limit-classifications of even and odd-order formally symmetric differential expressions

In this paper we consider the formally symmetric differential expressionM [.] of any order (odd or even) ≥ 2. We characterise the dimension of the quotient spaceD(T _max)/D(T _min) associated withM[.] in terms of the behaviour of the determinants det [[f _rg_s](∞)] where 1 ≤n ≤ (order of the expression +1); here [fg](∞) = lim [fg](x), where [fg](x) is the sesquilinear form in f andg associated withM. These results generalise the well-known theorem thatM is in the limit-point case at ∞ if and only if [fg](∞) = 0 for everyf, g ε the maximal domain Δ associated withM.     

AlmostP 0-matrices and the classQ

This paper demonstrates that within the class of thosen × n real matrices, each of which has a negative determinant, nonnegative proper principal minors and inverse with at least one positive entry, the class ofQ-matrices coincides with the class of regular matrices. Each of these classes of matrices plays an important role in the theory of the linear complementarity problem. Lastly, analogous results are obtained for nonsingular matrices which possess only nonpositive principal minors.     

Lattice square approach to construction of mutually orthogonalF-squares

Summary Factorial design theory has been effectively used in solving problems associated with many combinatorial structures. Hedayat, Raghavarao and Seiden [7] clearly demonstrated this in obtaining various results onF(n, λ)-squares. Indeed, both theorems in their paper are cute observations if knowledge of factorial design theory is assumed. The objective of this paper is to present the lattice square method for obtaining sets of mutually orthogonalF(n, λ)-squares of given ordern. As a by-product a generalization of a theorem, due to the above authors, is obtained and a lower bound is presented for the number of mutually orthogonalF(n, λ)-squares on sets of various cardinalities associated with the canonical decomposition ofn as a product of powers of distinct primes.