Intersections of nest algebras in finite dimensions

If are maximal nests on a finite-dimensional Hilbert space H, the dimension of the intersection of the corresponding nest algebras is at least dim H. On the other hand, there are three maximal nests whose nest algebras intersect in the scalar operators. The dimension of the intersection of two nest algebras (corresponding to maximal nests) can be of any integer value from n to n(n+1)/2, where n=dim H. For any two maximal nests there exists a basis {f₁,f₂,…,f_n} of H and a permutation π such that and where M_i=  span{f₁,f₂,…,f_i} and N_i= span{f_π(1),f_π(2),…,f_π(i)}. The intersection of the corresponding nest algebras has minimum dimension, namely dim H, precisely when π(j)=n−j+1,1jn. Those algebras which are upper-triangular matrix incidence algebras, relative to some basis, can be characterised as intersections of certain nest algebras.     

Shelah's pcf theory and its applications

This is a survey paper giving a self-contained account of Shelah's theory of the pcf function pcf(a)={cf(Πa/D, <_D):D is an ultrafilter on a}, where a is a set of regular cardinals such that |a|a). We also give several applications of the theory to cardinal arithmetic, the existence of Jonsson algebras, and partition calculus.     

Decidability of the binary infinite Post Correspondence Problem

We shall show that it is decidable for binary instances of the Post Correspondence Problem whether the instance has an infinite solution. In this context, a binary instance (h,g) consists of two morphisms h and g with a common two element domain alphabet. An infinite solution ω is an infinite word ω=a₁a₂… such that h(ω)=g(ω). This problem is known to be undecidable for the unrestricted instances of the Post Correspondence Problem.     

Nonseparable UHF algebras I: Dixmier's problem

There are three natural ways to define UHF (uniformly hyperfinite) C^∗-algebras, and all three definitions are equivalent for separable algebras. In 1967 Dixmier asked whether the three definitions remain equivalent for not necessarily separable algebras. We give a complete answer to this question. More precisely, we show that in small cardinality two definitions remain equivalent, and give counterexamples in other cases. Our results do not use any additional set-theoretic axioms beyond the usual axioms, namely ZFC.     

Some algebraic constructions in rational homotopy theory

In this note we describe constructions in the category of differential graded commutative algebras over the rational numbers Q which are analogs of the space F(X, Y) of continuous maps of X to Y, the component F(X, Y,ƒ) containing ƒ ε F(X, Y), fibrations, induced fibrations, the space Γ(π) of sections of a fibration π: E → X, and the component Γ(π,σ) containing σ ε Γ (π). As a focus, we address the problem of expressing π^*(F(X, Y, ƒ)) = Hom(π_*(F(X,Y, ƒ)),Q) in terms of differential graded algebra models for X and Y.     

On the λY calculus

The λY calculus is the simply typed λ calculus augmented with the fixed point operators. We show three results about λY: (a) the word problem is undecidable, (b) weak normalisability is decidable, and (c) higher type fixed point operators are not definable from fixed point operators at smaller types.     

ContributionsGraph partitions with minimum degree constraints

Given a graph with n nodes and minimum degree δ, we give a polynomial time algorithm that constructs a partition of the nodes of the graph into two sets X and Y such that the sum of the minimum degrees in X and in Y is at least δ and the cardinalities of X and Y differ by at most δ(δ + 1 if n ≠ δ(mod 2)). The existence of such a partition was shown by Sheehan (1988).     

交换的实W~*-代数

本文指出，交换的（复）Ｗ 代数的大部分结果对于实情形仍然成立，自然有周期为２同胚的差别．此外，不同于复情形，可分实Ｈｉｌｂｅｒｔ空间中不包含任何极小投影的交换实ＶＮ代数同构于Ｌ∞（［０，１］），Ｌ∞ｒ（［０，１］）或Ｌ∞（［０，１］）Ｌ∞ｒ（［０，１］）．     

On Solvable Congruences in Finitely Decidable Varieties

In this paper we establish the (1, 2)- and (2, 1)-transfer principles for finitely decidable locally finite varieties, where a class of structures is finitely decidable if the first order theory of its finite members is recursive. The transfer principles deal with the local structure of finite algebras and have strong global consequences. Mathematics Subject Classification : 08A05, 03C13, 08B05, 08B10.     

Computing simple paths among obstacles

Given a set X of points in the plane, two distinguished points s,tX, and a set Φ of obstacles represented by line segments, we wish to compute a simple polygonal path from s to t that uses only points in X as vertices and avoids the obstacles in Φ. We present two results: (1) we show that finding such simple paths among arbitrary obstacles is NP-complete, and (2) we give a polynomial-time algorithm that computes simple paths when the obstacles form a simple polygon P and X is inside P. Our algorithm runs in time O(m²n²), where m is the number of vertices of P and n is the number of points in X.     

Reconstruction of infinite locally finite connected graphs

Let G be an infinite locally finite connected graph. We study the reconstructibility of G in relation to the structure of its end set . We prove that an infinite locally finite connected graph G is reconstructible if there exists a finite family (Ω_i)_0i (n2) of pairwise finitely separable subsets of such that, for all x,y,x′,y′V(G) and every isomorphism f of G−{x,y} onto G−{x′,y′} there is a permutation π of {0,…,n−1} such that for 0i<n. From this theorem we deduce, as particular consequences, that G is reconstructible if it satisfies one of the following properties: (i) G contains no end-respecting subdivision of the dyadic tree and has at least two ends of maximal order; (ii) the set of thick ends or the one of thin ends of G is finite and of cardinality greater than one. We also prove that if almost all vertices of G are cutvertices, then G is reconstructible if it contains a free end or if it has at least a vertex which is not a cutvertex.     

Classes of finite relations as initial abstract data types I

The aim of this paper is to give axiomatizations for sixteen types of finite relations. These classes of relations are obtained as intersections of the following basic classes of relations: total relations, surjective relations, partial functions, and injective relations.

A normal form for all relations is given and each of the sixteen types of relations is (syntactically) characterized by certain additional conditions on this normal form.

For each of the sixteen types T, a set of identities E_T is singled out. The class of relations of type T forms an initial algebra in the category of all algebras which satisfy E_T. In the first part of this paper, for each type T the involved algebras are symmetric strict monoidal categories (in the sense of MacLane), enriched with certain specific constants.     

Some inequalities for commutators and an application to spectral variation. II

Inequalities that compare unitarily invariant norms of A - B and those of AΓ - ΓB and Γ^-1A - B Γ^-1 are obtained, where both A and B are either Hermitian or unitary or normal operators and Γ is a positive definite operator in a complex separable Hilbert space. These inequalities are then applied to derive bounds for spectral variation of diagonalisable matrices. Our new bounds improve substantially previously published bounds.     

Sur les identités polynomiales vérifiées par les algèbres de rétrocroisement

We study the ideal of polynomial identities of a single indeterminate satisfied by all backcrossing algebras. For this we distinguish two categories according to whether or not these algebras satisfy an identity for the plenary powers. For each category, we give the generators for the vector space of identities, a condition for any object belonging to one of these two categories verify a given identity, a necessary and su?cient condition that a polynomial is an identity and we study the existence of an idempotent element. We give a method which brings the search of identities satified by the backcrossing algebras to the solution of linear systems and we illustrate this method by constructing generators of homogeneous and non homogeneous identities of degrees less than 8.     

Classes of structurable algebras of skew-rank

Let R be a ring such that 2, 3 ∈ R ^×. We construct classes of structurable algebras over R whose residue class algebras have skew-dimension 1. These are matrix algebras or forms of matrix algebras which do not necessarily arise out of separable Jordan algebras of degree 3. As an application, we give canonical examples of structurable algebras of large dimension.     

Measures on minimally generated Boolean algebras

We investigate properties of minimally generated Boolean algebras. It is shown that all measures defined on such algebras are separable but not necessarily weakly uniformly regular. On the other hand, there exist Boolean algebras small in terms of measures which are not minimally generated. We prove that under CH a measure on a retractive Boolean algebra can be nonseparable. Some relevant examples are indicated. Also, we give two examples of spaces satisfying some kind of Efimov property.     

A stability property of the stochastic heat equation

In this paper we consider continuity properties of a stochastic heat equation of the form ∂u(t,x)/∂t = ∂²u(t,x)/∂x² + f(u(t,x))W_x,t. We prove that the solutions of this equation depend continuously on the function f and give some new estimates for this connection.