The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying 41 –
60 of
3896
We construct a totally disconnected compact Hausdorff space K₊ which has clopen subsets K₊” ⊆ K₊’ ⊆ K₊ such that K₊” is homeomorphic to K₊ and hence C(K₊”) is isometric as a Banach space to C(K₊) but C(K₊’) is not isomorphic to C(K₊). This gives two nonisomorphic Banach spaces (necessarily nonseparable) of the form C(K) which are isomorphic to complemented subspaces of each other (even in the above strong isometric sense), providing a solution to the Schroeder-Bernstein problem for Banach spaces...
For every countable ordinal α, we construct an -predual which is isometric to a subspace of and isomorphic to a quotient of . However, is not isomorphic to a subspace of .
We study the multiplicative lattices which satisfy the condition for all . Call them sharp lattices. We prove that every totally ordered sharp lattice is isomorphic to the ideal lattice of a valuation domain with value group or . A sharp lattice localized at its maximal elements are totally ordered sharp lattices. The converse is true if has finite character.
We prove here an Eilenberg type theorem: the so-called conjunctive varieties of rational languages correspond to the pseudovarieties of finite semilattice-ordered monoids. Taking complements of members of a conjunctive variety of languages we get a so-called disjunctive variety. We present here a non-trivial example of such a variety together with an equational characterization of the corresponding pseudovariety.
We introduce the so-called DN-algebra whose axiomatic system is a common axiomatization of directoids with an antitone involution and the so-called D-quasiring. It generalizes the concept of Newman algebras (introduced by H. Dobbertin) for a common axiomatization of Boolean algebras and Boolean rings.
A complete list of positive Tits-sincere one-peak posets is provided by applying combinatorial algorithms and computer calculations using Maple and Python. The problem whether any square integer matrix is ℤ-congruent to its transpose is also discussed. An affirmative answer is given for the incidence matrices and the Tits matrices of positive one-peak posets I.
We discuss the ultrasimplicial property of lattice-ordered abelian groups and their associated MV-algebras. We give a constructive proof of the fact that every lattice-ordered abelian group generated by three elements is ultrasimplicial.
Currently displaying 41 –
60 of
3896