A characterization ofL n(K) as a permutation group

In 1972 M. O'Nan proved thatL _n (q),h 3; can be characterized as a doubly-transitive groupG on a finite set , whereG _a has an Abelian normal subgroup acting not semi-regularly on -a. In the Main Theorem we show that a similar statement holds if is infinite. Our result implies O'Nan's theorem.This paper is part of the author's Ph.D. thesis written under supervision of Prof. F. G. Timmesfeld.     

Fibres of width 3 ordered sets

We show that in an ordered setP of width 3 there always exists a fibre (i.e., a subset intersecting each maximal nontrivial antichain) of size at most 11/18|P|. This improves previously known results.Research supported by Polish KBN Grant 2 2037 92 03.     

Remarques sur les m\'ethodes de projection pour l'approximation des \'equations de Navier--Stokes

Summary. L'objet de cet article est de montrer que les estimations de convergence sur la pression pour les m\'ethodes de projection d\'ecrites dans \cite{Shen1} et \cite{Shen2} ne sont pas obtenues correctement car elles sont toutes bas\'ees sur une in\'egalit\'e fausse. Il semble qu'on ait besoin d'une convergence en de la vitesse dans pour d\'emontrer les estimations de convergence sur la pression en . La question de savoir si la m\'ethode de projection a un taux de convergence pour la pression plus \'elev\'e que reste ouverte. Received June 1, 1993     

Approximation of convex bodies by simplices

This paper deals with the following kind of approximation of a convex bodyQ in Euclidean space E ⁿ by simplices: which is the smallest positive numberh _S(Q) such thatS ₁ Q S ₂ for a simplexS ₁ and its homothetic copyS ₂ of ratioh _S(Q). It is shown that ifS ₀ is a simplex of maximal volume contained inQ, then a homothetic copy ofS ₀ of ratio 13/3 containsQ.     

Convexity in finite metric spaces

A subsetS of a metric space (X,d) is calledd-convex if for any pair of pointsx,y S each pointz X withd(x,z) +d(z,y) =d(x,y) belongs toS. We give some results and open questions concerning isometric and convexity-preserving embeddings of finite metric spaces into standard spaces and the number ofd-convex sets of a finite metric space.     

Algebras of sets generating non-barrelled spaces

IfA is a -algebra on setX, thenl ₀ (X,A) is a barrelled space of class ₀. IfA is an algebra, there are conditions which imply thatl ₀ (X,A) is suprabarelled. Here, wheneverA is an algebra, we give conditions forl ₀ (X,A) to be not barrelled which are related with the existence of non-trivial convergent sequences.Supported in part by DGICYT, project PB91-0407 and by the Institució Valenciana d'Estudis i Investigació, project 023.     

Join-continuous frames,Priestley's duality and biframes

The primary purpose of this paper is to study join-continuous frames. We present two representation theorems for them: one in terms of -subframes of complete Boolean algebras and the other in terms of certain Priestley spaces. This second representation is used to prove that the topological spaces whose frame of open sets is join-continuous are characterized by a condition which says that certain intersections of open sets are open. Finally, we show that Priestley's duality can be viewed as a partialization of the dual adjunction between the categories of, respectively, bitopological spaces and biframes, stated by B. Banaschewski, G. C. L. Brümmer and K. A. Hardie in [5].This work was partially supported by Centro de Matemáíica da Universidade de Coimbra.     

Facial reduction in partially finite convex programming

We consider the problem of minimizing an extended-valued convex function on a locally convex space subject to a finite number of linear (in)equalities. When the standard constraint qualification fails a reduction technique is needed to derive necessary optimality conditions. Facial reduction is usually applied in the range of the constraints. In this paper it is applied in the domain space, thus maintaining any structure (and in particular lattice properties) of the underlying domain. Applications include constrained approximation and best entropy estimation.Research partially supported by the Natural Sciences and Engineering Research Council of Canada.