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 similar documents to “On the lattice of additive hereditary properties of finite graphs”

Prime ideals in the lattice of additive induced-hereditary graph properties

Amelie J. Berger, Peter Mihók (2003)

Discussiones Mathematicae Graph Theory

Similarity:

An additive induced-hereditary property of graphs is any class of finite simple graphs which is closed under isomorphisms, disjoint unions and induced subgraphs. The set of all additive induced-hereditary properties of graphs, partially ordered by set inclusion, forms a completely distributive lattice. We introduce the notion of the join-decomposability number of a property and then we prove that the prime ideals of the lattice of all additive induced-hereditary properties are divided...

Algebraic isomorphisms and Jordan derivations of 𝒥-subspace lattice algebras

Fangyan Lu, Pengtong Li (2003)

Studia Mathematica

Similarity:

It is shown that every algebraic isomorphism between standard subalgebras of 𝒥-subspace lattice algebras is quasi-spatial and every Jordan derivation of standard subalgebras of 𝒥-subspace lattice algebras is an additive derivation. Also, it is proved that every finite rank operator in a 𝒥-subspace lattice algebra can be written as a finite sum of rank one operators each belonging to that algebra. As an additional result, a multiplicative bijection of a 𝒥-subspace lattice algebra...

Characterization of Jordan derivations on 𝒥-subspace lattice algebras

Xiaofei Qi (2012)

Studia Mathematica

Similarity:

Let 𝓛 be a 𝒥-subspace lattice on a Banach space X and Alg 𝓛 the associated 𝒥-subspace lattice algebra. Assume that δ: Alg 𝓛 → Alg 𝓛 is an additive map. It is shown that δ satisfies δ(AB + BA) = δ(A)B + Aδ(B) + δ(B)A + Bδ(A) for any A,B ∈ Alg 𝓛 with AB + BA = 0 if and only if δ(A) = τ(A) + δ(I)A for all A, where τ is an additive derivation; if X is complex with dim X ≥ 3 and if δ is linear, then δ satisfies δ(AB + BA) = δ(A)B + Aδ(B) + δ(B)A + Bδ(A) for any A,B ∈ Alg 𝓛 with AB...

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...

Incomparability with respect to the triangular order

Emel Aşıcı, Funda Karaçal (2016)

Kybernetika

Similarity:

In this paper, we define the set of incomparable elements with respect to the triangular order for any t-norm on a bounded lattice. By means of the triangular order, an equivalence relation on the class of t-norms on a bounded lattice is defined and this equivalence is deeply investigated. Finally, we discuss some properties of this equivalence.

Dual Lattice of ℤ-module Lattice

Yuichi Futa, Yasunari Shidama (2017)

Formalized Mathematics

Similarity:

In this article, we formalize in Mizar [5] the definition of dual lattice and their properties. We formally prove that a set of all dual vectors in a rational lattice has the construction of a lattice. We show that a dual basis can be calculated by elements of an inverse of the Gram Matrix. We also formalize a summation of inner products and their properties. Lattice of ℤ-module is necessary for lattice problems, LLL(Lenstra, Lenstra and Lovász) base reduction algorithm and cryptographic...

On skew lattices. II.

Václav Slavík (1973)

Commentationes Mathematicae Universitatis Carolinae

Similarity: