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.     

Filtering on manifolds

We coasider a partially observable diffusion process (x _t,y_t)t0 whose unobservable componentx _t lives on a submanifold M ofR ⁿ . We present some general conditions under which the conditional law ofx _t, given the observationsy _s ,s [0,t], admits a density w.r.t. a given measure on M. We characterize the analytical properties of this density by using appropriate Sobolev spaces.Research supported by the Hungarian National Foundation of Scientific Research No. 2290.     

On approximation by bivariate incomplete polynomials

In this paper we prove that given certain convex domains Δ on the plane, ε>0, andf∈C(Δ) such thatf=0 on θ²Δ={(θ² x,θ² y):(x,y)?Δ} (0<θ<1), a polynomialp(x, y) of the form $$p(x,y) = \sum\limits_{\theta n \leqslant k + l \leqslant n} {a_{kl} x^k y^l }$$ exists such that ∥f?p∥ _C(Δ) ≤ε. The admissible convex domains include triangles and parallelograms with a vertex at the origin and sections of unit disk.     

Second-order properties of the loss probability inM/M/s/s +c systems

The Erlang loss function, which gives the steady state loss probability in anM/M/s/s system, has been extensively studied in the literature. In this paper, we look at the similar loss probability inM/M/s/s + c systems and an extension of it to nonintegral number of servers and queue capacity. We study its monotonicity properties. We show that the loss probability is convex in the queue capacity, and that it is convex in the traffic intensity if is below some ^* and concave if is greater that ^*, for a broad range of number of servers and queue capacities. We prove that the one-server loss system is the onlyM/M/s/s +c system for which the loss probability is concave in the traffic intensity in all its range.Research supported by Grant BD/645/90-RM from Junta Nacional de Investigação Científica e Tecnológica.On leave from: Departamento de Matemática, Instituto Superior Técnico, Av. Rovisco Pais, 1096 Lisboa Codex, Portugal.     

Norm-graphs and bipartite turán numbers

For everyt>1 and positiven we construct explicit examples of graphsG with |V (G)|=n, |E(G)|c _t ·n ^2–1/t which do not contain a complete bipartite graghK _t,t !+1 This establishes the exact order of magnitude of the Turán numbers ex (n, K _t,s ) for any fixedt and allst!+1, improving over the previous probabilistic lower bounds for such pairs (t, s). The construction relies on elementary facts from commutative algebra.Research supported in part by NSF Grants DMS-8707320 and DMS-9102866.Research supported in part by Hungarian National Foundation for Scientific Research Grant