Invariant means and invariant ideals in L∞(G) for a locally compact group G

For a nondiscrete σ-compact locally compact Hausdorff group G, L_∞(G) is a commutative Banach algebra under pointwise multiplication which has many nonzero proper closed invariant ideals; there is at least a continuum of maximal invariant ideals {N_α} such that N_α1 + N_α2 = L_∞(G) whenever α₁ ≠ α₂. It follows from the construction of these ideals that when G is also amenable as a discrete group, then LIM?TLIM contains at least a continuum of mutually singular elements each of which is singular to any element of TLIM. The supports of left-invariant means are in the maximal ideal space of L_∞(G); the structure of these supports leads to the notion of stationary and transitive maximal ideals. To prove that both these types of maximal ideals are dense among all maximal ideals, one shows that the intersection of all nonzero closed invariant ideals is zero. This is the case even though the intersection of any sequence of closed invariant ideals is not zero and the intersection of all the maximal invariant ideals is not zero.     

Low upper bounds in the LR degrees

We say that A≤_LRB if every B-random real is A-random—in other words, if B has at least as much derandomization power as A. The LR reducibility is a natural weak reducibility in the context of randomness, and generalizes lowness for randomness. We study the existence and properties of upper bounds in the context of the LR degrees. In particular, we show that given two (or even finitely many) low sets, there is a low c.e. set which lies LR above both. This is very different from the situation in the Turing degrees, where Sacks’ splitting theorem shows that two low sets can join to 0^′.     

Post's Problem for Reducibilities of Bounded Complexity

In this paper we consider the we known method by E. Post of solving the problem of construction of recursively enumerable sets that have a degree intermediate between the degrees of recursive and complete sets with respect to a given reducibility. Post considered reducibilities ≤_m, ≤_btt, ≤_tt and ≤_T and solved the problem for al of them except ≤_T. Here we extend Post's original method of construction of incomplete sets onto two wide classes of sub‐Turing reducibilities what were studying in [1, 2].     

Similarity classes of3 × 3 matrices over a discrete valuation ring

Let Q be a complete discrete valuation ring. Let Π be a prime element in Q. Write P = ΠQ. For n = 1,2,…, letQ_n be the factor ring Q | Pⁿ. Let G = G1₃(Q_n. Denote by M?_n the G-module of 3 × 3 matrices over Q_n modulo scalar matrices. Canonical forms are found for every element in M?_n, and it is shown that there exist five sets of similarity classes. Some results about the general case of NxN matrices over Q also are proved.     

Some aspects of (non) functoriality of natural discrete covers of locales

Abstract

The frame S_c(L) generated by closed sublocales of a locale L is known to be a natural Boolean (“discrete”) extension of a subfit L; also it is known to be its maximal essential extension. In this paper we first show that it is an essential extension of any L and that the maximal essential extensions of L and S_c(L) are isomorphic. The construction S_c is not functorial; this leads to the question of individual liftings of homomorphisms L → M to homomorphisms S_c(L) → S_c(M). This is trivial for Boolean L and easy for a wide class of spatial L, M . Then, we show that one can lift all h : L → 2 for weakly Hausdor? L (and hence the spectra of L and S_c(L) are naturally isomorphic), and finally present liftings of h : L → M for regular L and arbitrary Boolean M.     

Reducibility number

Let P be a poset in a class of posets P. A smallest positive integer r is called reducibility number of P with respect to P if there exists a non-empty subset S of P with |S|=r and P-S∈P. The reducibility numbers for the power set 2ⁿ of an n-set (n?2) with respect to the classes of distributive lattices, modular lattices and Boolean lattices are calculated. Also, it is shown that the reducibility number r of the lattice of all subgroups of a finite group G with respect to the class of all distributive lattices is 1 if and only if the order of G has at most two distinct prime divisors; further if r is a prime number then order of G is divisible by exactly three distinct primes. The class of pseudo-complemented u-posets is shown to be reducible. Deletable elements in semidistributive posets are characterized.     

On maximal subalgebras of the algebras of unary recursive functions

Under consideration are the algebras of unary functions with supports in countable primitively recursively closed classes and composition operation. Each algebra of this type is proved to have continuum many maximal subalgebras including the set of all unary functions of the class ε ² of the Grzegorczyk hierarchy.     

Positive definite binary hermitian forms with finitely many exceptions

Let E/F be a CM extension of number fields, and L be a positive definite binary hermitian lattice over the ring of integers of E. An element in F is called an exception of L if it is represented by every localization of L but not by L itself. We show that if E/F and a positive integer k are given, then there are only finitely many similarity classes of positive definite binary hermitian lattices with at most k exceptions. This generalizes the corresponding finiteness result by Earnest and Khosravani [A.G. Earnest, A. Khosravani, Representation of integers by positive definite binary hermitian lattices over imaginary quadratic fields, J. Number Theory 62 (1997) 368-374, Theorem 2.2] for the case F=Q. We also prove that for a fixed totally real field F of odd degree over Q, there are only finitely many CM extensions E/F for which there exists a positive definite regular normal binary hermitian lattice over the ring of integers of E.     

Measure-compact operators, almost compact operators, and linear functional equations in L p

Under study are the measure-compact operators and almost compact operators in L _p . We construct an example of a measure-compact operator that is not almost compact. Introducing two classes of closed linear operators in L _p , we prove that the resolvents of these operators are almost compact or measure-compact. We present methods for the reduction of linear functional equations of the second kind in L _p with almost compact or measure-compact operators to equivalent linear integral equations in L _p with quasidegenerate Carleman kernels.     

Conjugation in Representations of the Zassenhaus Algebra

Let F be an algebracially closed field of characteristic p > 2, and L be the p ⁿ -dimensional Zassenhaus algebra with the maximal invariant subalgebra L ₀ and the standard filtration {L _i }| ^pn−2 _{i =−1}. Then the number of isomorphism classes of simple L-modules is equal to that of simple L ₀-modules, corresponding to an arbitrary character of L except when its height is biggest. As to the number corresponding to the exception there was an earlier result saying that it is not bigger than p ⁿ . Received May 10, 1999, Accepted December 8, 1999     

Inner divisors and composition operators

This characterization is stated and proved in much greater generality, beginning with subspaces of arbitrary L^∞ spaces and using a notion of inner divisors. Among the consequences are a variant of Wermer's theorem on embedding disks in maximal ideal spaces and a result on linear isometrics of H^∞. The ranges of composition operators C_I when I is not necessarily inner are characterized. In particular, relatively closed sets E ?cΔ of zero logarithmic and zero analytic capacity are characterized in terms of the algebras of bounded analytic functions on A invariant under corresponding Fuchsian groups. The paper concludes with an example of a uniformly closed subalgebra of H^∞ which contains the constants and the inner factors of its members, but is not of the form H ∞ I.     

Intriguing Sets of Points of Q(2n, 2) \Q +(2n ? 1, 2)

Intriguing sets of vertices have been studied for several classes of strongly regular graphs. In the present paper, we study intriguing sets for the graphs Γ _n , n ≥ 2, which are defined as follows. Suppose Q(2n, 2), n?≥ 2, is a nonsingular parabolic quadric of PG(2n, 2) and Q ⁺(2n ? 1, 2) is a nonsingular hyperbolic quadric obtained by intersecting Q(2n, 2) with a suitable nontangent hyperplane. Then the collinearity relation of Q(2n, 2) defines a strongly regular graph Γ _n on the set Q(2n, 2) \ Q ⁺(2n ? 1, 2). We describe some classes of intriguing sets of Γ _n and classify all intriguing sets of Γ₂ and Γ₃.     

Sublattices of product spaces: Hulls, representations and counting

The Cartesian product of lattices is a lattice, called a product space, with componentwise meet and join operations. A sublattice of a lattice L is a subset closed for the join and meet operations of L. The sublattice hullLQ of a subset Q of a lattice is the smallest sublattice containing Q. We consider two types of representations of sublattices and sublattice hulls in product spaces: representation by projections and representation with proper boundary epigraphs. We give sufficient conditions, on the dimension of the product space and/or on the sublattice hull of a subset Q, for LQ to be entirely defined by the sublattice hulls of the two-dimensional projections of Q. This extends results of Topkis (1978) and of Veinott [Representation of general and polyhedral subsemilattices and sublattices of product spaces, Linear Algebra Appl. 114/115 (1989) 681-704]. We give similar sufficient conditions for the sublattice hull LQ to be representable using the epigraphs of certain isotone (i.e., nondecreasing) functions defined on the one-dimensional projections of Q. This also extends results of Topkis and Veinott. Using this representation we show that LQ is convex when Q is a convex subset in a vector lattice (Riesz space), and is a polyhedron when Q is a polyhedron in Rⁿ.We consider in greater detail the case of a finite product of finite chains (i.e., totally ordered sets). We use the representation with proper boundary epigraphs and provide upper and lower bounds on the number of sublattices, giving a partial answer to a problem posed by Birkhoff in 1937. These bounds are close to each other in a logarithmic sense. We define a corner representation of isotone functions and use it in conjunction with the representation with proper boundary epigraphs to define an encoding of sublattices. We show that this encoding is optimal (up to a constant factor) in terms of memory space. We also consider the sublattice hull membership problem of deciding whether a given point is in the sublattice hull LQ of a given subset Q. We present a good characterization and a polynomial time algorithm for this sublattice hull membership problem. We construct in polynomial time a data structure for the representation with proper boundary epigraphs, such that sublattice hull membership queries may be answered in time logarithmic in the size |Q| of the given subset.     

Minimal prime ideals of reduced rings

Let R be a reduced ring with Q its Martindale symmetric ring of quotients, and let B be the complete Boolean algebra of all idempotents in C, where C is the extended centroid of R. It is proved that every minimal prime ideal of R must be of the form mQ∩R for some maximal ideal m of B but the converse is in general not true. In addition, if R is centrally closed or has only finitely many minimal prime ideals, then the converse also holds. By applying the explicit expression, many properties of minimal prime ideals of reduced rings are realized more easily.     

Classification of certain pairs of operators (P, Q) satisfying [P, Q] = −i Id

In a separable Hilbert space a certain class of pairs of operators (P, Q) satisfying the Born-Heisenberg commutation relation [P, Q] = ?i Id on a dense domain Ω is investigated. This class is essentially defined by requiring Q bounded and self-adjoint, P symmetric and $\text{PΩ ? Ω, QΩ ? Ω}$. We show that Q is absolutely continuous and that P can be thought of as a first order differential operator. The class considered contains the pair “angle ?” and “angular momentum L_z.” It is expected that the methods of this paper can be applied to more general classes of operators (P, Q) including the Schrödinger case.     

Hypersimplicity and semicomputability in the weak truth table degrees

We study the classes of hypersimple and semicomputable sets as well as their intersection in the weak truth table degrees. We construct degrees that are not bounded by hypersimple degrees outside any non-trivial upper cone of Turing degrees and show that the hypersimple-free c.e. wtt degrees are downwards dense in the c.e. wtt degrees. We also show that there is no maximal (w.r.t. ≤_wtt) hypersimple wtt degree. Moreover, we consider the sets that are both hypersimple and semicomputable, characterize them as the (bi-infinite) c.e. cuts of computable orderings of ℕ of order type ω+ω* and study their wtt degrees. We show that there are hypersimple degrees that are not bounded by any hypersimple semicomputable degree, investigate relationships with the join and look for maximal and minimal elements of related classes. I wish to thank the anonymous referee for making helpful remarks that have improved the presentation of this work.     

Lifting of homeomorphisms to 4-sheeted branched coverings of a disk

Let p:X→D be a simple, possibly not connected, 4-sheeted branched covering of a closed 2-dimensional disk D with n branch values A₁,…,An. The isotopy classes of homeomorphisms of D which are fixed on the boundary of D and permute the branch values form a braid group Bn. Some of these homeomorphisms can be lifted to homeomorphisms of X. They form a subgroup L(p) of finite index in Bn. For each equivalence class of coverings we find a set of generators for L(p) which contains between n and n+4 elements, depending on the equivalence class of the covering, and the generators are powers of half-twists.