Displaying similar documents to “Asymptotics of variance of the lattice point count”

The Banach lattice C[0,1] is super d-rigid

Y. A. Abramovich, A. K. Kitover (2003)

Studia Mathematica

Similarity:

The following properties of C[0,1] are proved here. Let T: C[0,1] → Y be a disjointness preserving bijection onto an arbitrary vector lattice Y. Then the inverse operator T - 1 is also disjointness preserving, the operator T is regular, and the vector lattice Y is order isomorphic to C[0,1]. In particular if Y is a normed lattice, then T is also automatically norm continuous. A major step needed for proving these properties is provided by Theorem 3.1 asserting that T satisfies some technical...

On extensions of orthosymmetric lattice bimorphisms

Mohamed Ali Toumi (2013)

Mathematica Bohemica

Similarity:

In the paper we prove that every orthosymmetric lattice bilinear map on the cartesian product of a vector lattice with itself can be extended to an orthosymmetric lattice bilinear map on the cartesian product of the Dedekind completion with itself. The main tool used in our proof is the technique associated with extension to a vector subspace generated by adjoining one element. As an application, we prove that if ( A , * ) is a commutative d -algebra and A 𝔡 its Dedekind completion, then, A 𝔡 can...

A T-partial order obtained from T-norms

Funda Karaçal, M. Nesibe Kesicioğlu (2011)

Kybernetika

Similarity:

A partial order on a bounded lattice L is called t-order if it is defined by means of the t-norm on L . It is obtained that for a t-norm on a bounded lattice L the relation a ⪯ T b iff a = T ( x , b ) for some x ∈ L is a partial order. The goal of the paper is to determine some conditions such that the new partial order induces a bounded lattice on the subset of all idempotent elements of L and a complete lattice on the subset A of all elements of L which are the supremum of a subset of atoms.

Classification systems and their lattice

Sándor Radeleczki (2002)

Discussiones Mathematicae - General Algebra and Applications

Similarity:

We define and study classification systems in an arbitrary CJ-generated complete lattice L. Introducing a partial order among the classification systems of L, we obtain a complete lattice denoted by Cls(L). By using the elements of the classification systems, another lattice is also constructed: the box lattice B(L) of L. We show that B(L) is an atomistic complete lattice, moreover Cls(L)=Cls(B(L)). If B(L) is a pseudocomplemented lattice, then every classification system of L is independent...