On Poset Boolean Algebras

Let (P,≤) be a partially ordered set. The poset Boolean algebra of P, denoted F(P), is defined as follows: The set of generators of F(P) is {x _p  : p∈P}, and the set of relations is {x _p ⋅x _q =x _p  : p≤q}. We say that a Boolean algebra B is well-generated, if B has a sublattice G such that G generates B and (G,≤ ^B |G) is well-founded. A well-generated algebra is superatomic. THEOREM 1. Let (P,≤) be a partially ordered set. The following are equivalent. (i) P does not contain an infinite set of pairwise incomparable elements, and P does not contain a subset isomorphic to the chain of rational numbers, (ii) F(P) is superatomic, (iii) F(P) is well-generated. The equivalence (i) ⇔ (ii) is due to M. Pouzet. A partially ordered set W is well-ordered, if W does not contain a strictly decreasing infinite sequence, and W does not contain an infinite set of pairwise incomparable elements. THEOREM 2. Let F(P) be a superatomic poset algebra. Then there are a well-ordered set W and a subalgebra B of F(W), such that F(P) is a homomorphic image of B. This is similar but weaker than the fact that every interval algebra of a scattered chain is embeddable in an ordinal algebra. Remember that an interval algebra is a special case of a poset algebra. This revised version was published online in June 2006 with corrections to the Cover Date.     

On <Emphasis Type="Italic">T</Emphasis> -spaces and relations in relatively free,lie nilpotent,associative algebras

The purpose of this work is to obtain the commutator relations and Frobenius relations in a relatively free algebra F ^(l) specified by the identity [x ₁ , . . . , x _l ] = 0 over a field of characteristic p > 0. These relations for l > 3 are analogous to the relations in the algebra F ⁽³⁾ and are applied to the T-spaces in the algebra F ^(l). In order to study the relations in F ^(l) in more detail, we construct a model algebra analogous to the Grassmann algebra.     

Triple Representation Theorem for orthocomplete homogeneous effect algebras

The aim of our paper is twofold. First, we thoroughly study the set of meager elements M(E), the set of sharp elements S(E), and the center C(E) in the setting of meager-orthocomplete homogeneous effect algebras E. Second, we prove the Triple Representation Theorem for sharply dominating meager-orthocomplete homogeneous effect algebras, in particular orthocomplete homogeneous effect algebras.     

Strict Betweennesses Induced by Posets as well as by Graphs

For a finite poset P = (V, ≤ ), let _s(P){\cal B}_s(P) consist of all triples (x,y,z) ∈ V ³ such that either x < y < z or z < y < x. Similarly, for every finite, simple, and undirected graph G = (V,E), let B_s(G){\cal B}_s(G) consist of all triples (x,y,z) ∈ V ³ such that y is an internal vertex on an induced path in G between x and z. The ternary relations B_s(P){\cal B}_s(P) and B_s(G){\cal B}_s(G) are well-known examples of so-called strict betweennesses. We characterize the pairs (P,G) of posets P and graphs G on the same ground set V which induce the same strict betweenness relation B_s(P)=B_s(G){\cal B}_s(P)={\cal B}_s(G).     

On tense modules for extended algebras over rational fields

Let k(x) be the field of fractions of the polynomial algebra k[x] over the field k. We prove that, for an arbitrary finite dimensional k-algebra Λ, any finitely generated Λ ⊗_k k(x)-module M such that its minimal projective presentation admits no non-trivial selfextension is of the form M ≅ N^k(x), for some finitely generated Λ-module N. Some consequences are derived for tilting modules over the rational algebra Λ ⊗_k k(x) and for some generic modules for Λ. Received: 24 November 2003; revised: 11 February 2005     

Smooth and strongly smooth points in symmetric spaces of measurable operators

We investigate the relationships between smooth and strongly smooth points of the unit ball of an order continuous symmetric function space E, and of the unit ball of the space of τ-measurable operators E(M,t){E(\mathcal{M},\tau)} associated to a semifinite von Neumann algebra (M, t){(\mathcal{M}, \tau)}. We prove that x is a smooth point of the unit ball in E(M, t){E(\mathcal{M}, \tau)} if and only if the decreasing rearrangement μ(x) of the operator x is a smooth point of the unit ball in E, and either μ(∞; f) = 0, for the function f ? S_E^×{f\in S_{E^{\times}}} supporting μ(x), or s(x ^*) = 1. Under the assumption that the trace τ on M{\mathcal{M}} is σ-finite, we show that x is strongly smooth point of the unit ball in E(M, t){E(\mathcal{M}, \tau)} if and only if its decreasing rearrangement μ(x) is a strongly smooth point of the unit ball in E. Consequently, for a symmetric function space E, we obtain corresponding relations between smoothness or strong smoothness of the function f and its decreasing rearrangement μ(f). Finally, under suitable assumptions, we state results relating the global properties such as smoothness and Fréchet smoothness of the spaces E and E(M,t){E(\mathcal{M},\tau)}.     

Simultaneous inhomogeneous diophantine approximation on manifolds

In 1998, Kleinbock and Margulis proved Sprindzuk’s conjecture pertaining to metrical Diophantine approximation (and indeed the stronger Baker–Sprindzuk conjecture). In essence, the conjecture stated that the simultaneous homogeneous Diophantine exponent w ₀(x) = 1/n for almost every point x on a nondegenerate submanifold M \mathcal{M} of \mathbbRⁿ {\mathbb{R}^n} . In this paper, the simultaneous inhomogeneous analogue of Sprindzuk’s conjecture is established. More precisely, for any “inhomogeneous” vector θ ∈ \mathbbRⁿ {\mathbb{R}^n} we prove that the simultaneous inhomogeneous Diophantine exponent w ₀(x , θ) is 1/n for almost every point x on M \mathcal{M} . The key result is an inhomogeneous transference principle which enables us to deduce that the homogeneous exponent w ₀(x) is 1/n for almost all x ∈ M \mathcal{M} if and only if, for any θ ∈ \mathbbRⁿ {\mathbb{R}^n} , the inhomogeneous exponent w ₀(x , θ) = 1/n for almost all x ∈ M \mathcal{M} . The inhomogeneous transference principle introduced in this paper is an extremely simplified version of that recently discovered by us. Nevertheless, it should be emphasised that the simplified version has the great advantage of bringing to the forefront the main ideas while omitting the abstract and technical notions that come with describing the inhomogeneous transference principle in all its glory.     

Commutative lmc algebras with discrete spectrum

SupposeE is a topological algebra with non-empty spectrum Gel'fand spaceM(E) andE M(E)) the algebra of allC-valued continuous functions onM(E). EndowE M(E) with the topologies “c”, “e” of compact resp. equicontinuous convergence. ThenE M (E) characterizes all unital (commutative) semisimple complete lmc algebras with discrete spectrum, while all unital uniform complete lmc algebras with dispersed spectrum are of the formE(E)). The first result may fail if completeness is dropped. The second one fails if “e” is replaced by “c” even ifE is complete. The part of the work due to the 2nd author was carried out during her 3-month visit at the Institute of Mathematics, Univ. of Münster (Germany) in Spring of 1995. The warm hospitality from Professor Dr. G. Maltese and the financial support from a DAAD grant are thankfully acknowledged.     

New Expressions for Repeated Upper Tail Integrals of the Normal Distribution

Expressions are given for repeated upper tail integrals of the univariate normal density (and so also for the general Hermite function) for both positive and negative arguments. The expressions involve moments of the form E(x + i N) ⁿ and E1 / (x ² + N ²) ⁿ , where N is a unit normal random variable. Laplace transforms are provided for the Hermite functions and the moments. The practical use of these expressions is illustrated.     

An integral strong law of large numbers for processes with independent increments

For a stochastically continuous stochastic process with independent increments overD[0,T], letN(t,ε) be the number of smaple function jumps that occur in the interval [0,t] of sizes less than −ε or greater than ε, where ε>0. LetM(t,ε)=EN(t,ε), and assumeM(t,0+)=∞ for 0<t≦T. If lim_{ε ↓0}(M(t,ε)/M(T,ε)) exists and is positive for eacht∈(0,T], then lim_{ε ↓0}(N(t,ε)/M(T,ε)) for allt∈(0,T] with probability one. The research of Howard G. Tucker was supported in part by the National Science Foundation, Grant No. MCS76-03591A01.     

Elliptic equation with singular potential

We consider the following problem of finding a nonnegative function u(x) in a ball B = B(O, R) ⊂ R ⁿ , n ≥ 3:

Extended F4-buildings and the Baby Monster

Let Τ be the Baby Monster graph which is the graph on the set of {3,4}-transpositions in the Baby Monster group B in which two such transpositions are adjacent if their product is a central involution in B. Then Τ is locally the commuting graph of central (root) involutions in ² E ₆(2). The graph Τ contains a family of cliques of size 120. With respect to the incidence relation defined via inclusion these cliques and the non-empty intersections of two or more of them form a geometry ℰ(B) with diagram for t=4 and the action of B on ℰ(B) is flag-transitive. We show that ℰ(B) contains subgeometries ℰ(² E ₆(2)) and ℰ(Fi ₂₂) with diagrams c.F ₄(2) and c.F ₄(1). The stabilizers in B of these subgeometries induce on them flag-transitive actions of ² E ₆(2):2 and Fi ₂₂:2, respectively. The geometries ℰ(B), ℰ(² E ₆(2)) and ℰ(Fi ₂₂) possess the following properties: (a) any two elements of type 1 are incident to at most one common element of type 2 and (b) three elements of type 1 are pairwise incident to common elements of type 2 if and only if they are incident to a common element of type 5. The paper addresses the classification problem of c.F ₄(t)-geometries satisfying (a) and (b). We construct three further examples for t=2 with flag-transitive automorphism groups isomorphic to 3⋅²E₂:2, E₆(2):2 and 2²⁶ .F₄(2) and one for t=1 with flag-transitive automorphism group 3⋅Fi ₂₂:2. We also study the graph of an arbitrary (non-necessary flag-transitive) c.F ₄(t)-geometry satisfying (a) and (b) and obtain a complete list of possibilities for the isomorphism type of subgraph induced by the common neighbours of a pair of vertices at distance 2. Finally, we prove that ℰ(B) is the only c.F ₄(4)-geometry, satisfying (a) and (b). Oblatum 20-X-1999 & 2-I-2001?Published online: 5 March 2001     

Canonical form with respect to semiscalar equivalence for a matrix pencil with nonsingular first matrix

Polynomial n × n matrices A(x) and B(x) over a field \mathbbF \mathbb{F} are called semiscalar equivalent if there exist a nonsingular n × n matrix P over \mathbbF \mathbb{F} and an invertible n × n matrix Q(x) over \mathbbF \mathbb{F} [x] such that A(x) = PB(x)Q(x). We give a canonical form with respect to semiscalar equivalence for a matrix pencil A(x) = A _0x - A ₁, where A ₀ and A ₁ are n × n matrices over \mathbbF \mathbb{F} , and A ₀ is nonsingular.     

Topologies on central extensions of von Neumann algebras

Given a von Neumann algebra M, we consider the central extension E(M) of M. We introduce the topology t _c(M) on E(M) generated by a center-valued norm and prove that it coincides with the topology of local convergence in measure on E(M) if and only if M does not have direct summands of type II. We also show that t _c(M) restricted to the set E(M) _h of self-adjoint elements of E(M) coincides with the order topology on E(M) _h if and only if M is a σ-finite type I_fin von Neumann algebra.     

A Modification of the Lyons-Sullivan Discretization of Positive Harmonic Functions

A modification of the Lyons-Sullivan discretization of positive harmonic functions on a Riemannian manifold M is proposed. This modification, depending on a choice of constants C = {C _n :n = 1,2,..}, allows for constructing measures n_x^C, x ? M\nu_x^\mathbf{C},\ x\in M, supported on a discrete subset Γ of M such that for every positive harmonic function f on M

The connectivity and minimum degree of circuit graphs of matroids

Let G be the circuit graph of any connected matroid M with minimum degree 5（G）. It is proved that its connectivity κ（G） ≥2｜E（M） - B（M）｜ - 2. Therefore 5（G） ≥ 2｜E（M） - B（M）｜ - 2 and this bound is the best possible in some sense.     

Asymptotic stability and instability criteria for nonautonomous systems

The classical criterion of asymptotic stability of the zero solution of equations x′ = f(t, x) is that there exists a function V (t, x), a(∥x∥) ≤ V (t, x) ≤ b(∥x∥) for some a, b ∈ K such that [(V)\dot] \dot{V} (t, x) ≤ −c(∥x∥) for some c ∈ K. In this paper, we prove that if V^{(m + 1)} \mathop {V}\limits^{(m + {1})} (t, x) is bounded on some set [tk − T, tk + T] × BH(tk → +∞ as k → ∞), then the condition that [(V)\dot] \dot{V} (t, x) ≤ −c(∥x∥) can be weakened and replaced by that [(V)\dot] \dot{V} (t, x) ≤ 0 and − (−[(V)\dot] \dot{V} (tk, x)| + − [(V)\ddot] \ddot{V} (tk, x)| + ⋯ + − V^(m) \mathop {V}\limits^{(m)} (tk, x)|) ≤ −c′(∥x∥) for some c′ ∈ K. Moreover, the author also presents a corresponding instability criterion. [1–10]     

On the word problem for the free Burnside semigroups satisfying <Emphasis Type="Italic">x</Emphasis><Superscript>2</Superscript> = <Emphasis Type="Italic">x</Emphasis><Superscript>3</Superscript>

We study the word problem for the free Burnside semigroups satisfying x ² = x ³. For any k > 2, we reduce this problem for the k-generated free Burnside semigroup B(2, 1, k) to the word problem for the two-generated semigroup B(2, 1, 2). Furthermore, if every element of B(2, 1, 2) is a regular language, then every element of B(2, 1, k) appears to be a regular language as well. Thus, Brzozowski’s conjecture holds for the semigroup B(2, 1, k) if and only if it holds for B(2, 1, 2).     

On some properties of Musielak-Orlicz spaces and their subspaces of order continuous elements

Some criterions in order thatl ¹ embeds complementably inE ^Φ(μ) and inL ^Φ(μ) are given. It is also proved that every idealL inL ^Φ(μ) such thatI _Φ(x/‖x‖Φ)=1 for anyxεL/{0} is contained inE ^Φ(μ).     

On the Existence of Towers in Pseudo-Tree Algebras

A tower in a Boolean algebra (BA) is a strictly increasing sequence, of regular order type, of elements of the algebra different from 1 but with sum 1. A pseudo-tree is a partially ordered set T such that the set T↓t = {s ∈ T:s < t} is linearly ordered for every t ∈ T. If that set is well-ordered, then T is a tree. For any pseudo-tree T, the BA Treealg(T) is the algebra of subsets of T generated by all of the sets T↑t = {s ∈ T:t ≤ s}. The main theorem of this note is a characterization in tree terms of when Treealg(T) has a tower of order type κ (given in advance).