The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

Displaying similar documents to “A note on weakly 𝔪 -distributive Boolean algebras”

Orthomodular lattices that are horizontal sums of Boolean algebras

Ivan Chajda, Helmut Länger (2020)

Commentationes Mathematicae Universitatis Carolinae

Similarity:

The paper deals with orthomodular lattices which are so-called horizontal sums of Boolean algebras. It is elementary that every such orthomodular lattice is simple and its blocks are just these Boolean algebras. Hence, the commutativity relation plays a key role and enables us to classify these orthomodular lattices. Moreover, this relation is closely related to the binary commutator which is a term function. Using the class of horizontal sums of Boolean algebras, we establish an identity...

The lattice of subvarieties of the biregularization of the variety of Boolean algebras

Jerzy Płonka (2001)

Discussiones Mathematicae - General Algebra and Applications

Similarity:

Let τ: F → N be a type of algebras, where F is a set of fundamental operation symbols and N is the set of all positive integers. An identity φ ≈ ψ is called biregular if it has the same variables in each of it sides and it has the same fundamental operation symbols in each of it sides. For a variety V of type τ we denote by V b the biregularization of V, i.e. the variety of type τ defined by all biregular identities from Id(V). Let B be the variety of Boolean algebras of type τ b : + , · , ´ N , where...

Generalised irredundance in graphs: Nordhaus-Gaddum bounds

Ernest J. Cockayne, Stephen Finbow (2004)

Discussiones Mathematicae Graph Theory

Similarity:

For each vertex s of the vertex subset S of a simple graph G, we define Boolean variables p = p(s,S), q = q(s,S) and r = r(s,S) which measure existence of three kinds of S-private neighbours (S-pns) of s. A 3-variable Boolean function f = f(p,q,r) may be considered as a compound existence property of S-pns. The subset S is called an f-set of G if f = 1 for all s ∈ S and the class of f-sets of G is denoted by Ω f ( G ) . Only 64 Boolean functions f can produce different classes Ω f ( G ) , special cases...

A class of multiplicative lattices

Tiberiu Dumitrescu, Mihai Epure (2021)

Czechoslovak Mathematical Journal

Similarity:

We study the multiplicative lattices L which satisfy the condition a = ( a : ( a : b ) ) ( a : b ) for all a , b L . 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 L localized at its maximal elements are totally ordered sharp lattices. The converse is true if L has finite character.

Structural aspects of truncated archimedean vector lattices: good sequences, simple elements

Richard N. Ball (2021)

Commentationes Mathematicae Universitatis Carolinae

Similarity:

The truncation operation facilitates the articulation and analysis of several aspects of the structure of archimedean vector lattices; we investigate two such aspects in this article. We refer to archimedean vector lattices equipped with a truncation as truncs. In the first part of the article we review the basic definitions, state the (pointed) Yosida representation theorem for truncs, and then prove a representation theorem which subsumes and extends the (pointfree) Madden representation...

A new approach to construct uninorms via uninorms on bounded lattices

Zhen-Yu Xiu, Xu Zheng (2024)

Kybernetika

Similarity:

In this paper, on a bounded lattice L , we give a new approach to construct uninorms via a given uninorm U * on the subinterval [ 0 , a ] (or [ b , 1 ] ) of L under additional constraint conditions on L and U * . This approach makes our methods generalize some known construction methods for uninorms in the literature. Meanwhile, some illustrative examples for the construction of uninorms on bounded lattices are provided.

Linear preserver of n × 1 Ferrers vectors

Leila Fazlpar, Ali Armandnejad (2023)

Czechoslovak Mathematical Journal

Similarity:

Let A = [ a i j ] m × n be an m × n matrix of zeros and ones. The matrix A is said to be a Ferrers matrix if it has decreasing row sums and it is row and column dense with nonzero ( 1 , 1 ) -entry. We characterize all linear maps perserving the set of n × 1 Ferrers vectors over the binary Boolean semiring and over the Boolean ring 2 . Also, we have achieved the number of these linear maps in each case.

On K -Boolean Rings

W. B. Vasantha Kandasamy (1992)

Publications du Département de mathématiques (Lyon)

Similarity:

FKN Theorem on the biased cube

Piotr Nayar (2014)

Colloquium Mathematicae

Similarity:

We consider Boolean functions defined on the discrete cube - γ , γ - 1 equipped with a product probability measure μ n , where μ = β δ - γ + α δ γ - 1 and γ = √(α/β). This normalization ensures that the coordinate functions ( x i ) i = 1 , . . . , n are orthonormal in L ( - γ , γ - 1 , μ n ) . We prove that if the spectrum of a Boolean function is concentrated on the first two Fourier levels, then the function is close to a certain function of one variable. Our theorem strengthens the non-symmetric FKN Theorem due to Jendrej, Oleszkiewicz and Wojtaszczyk. Moreover,...

Configurations of rank- 40 r extremal even unimodular lattices ( r = 1 , 2 , 3 )

Scott Duke Kominers, Zachary Abel (2008)

Journal de Théorie des Nombres de Bordeaux

Similarity:

We show that if L is an extremal even unimodular lattice of rank 40 r with r = 1 , 2 , 3 , then L is generated by its vectors of norms 4 r and 4 r + 2 . Our result is an extension of Ozeki’s result for the case r = 1 .

Counterexamples to Hedetniemi's conjecture and infinite Boolean lattices

Claude Tardif (2022)

Commentationes Mathematicae Universitatis Carolinae

Similarity:

We prove that for any c 5 , there exists an infinite family ( G n ) n of graphs such that χ ( G n ) > c for all n and χ ( G m × G n ) c for all m n . These counterexamples to Hedetniemi’s conjecture show that the Boolean lattice of exponential graphs with K c as a base is infinite for c 5 .

The rings which are Boolean

Ivan Chajda, Filip Švrček (2011)

Discussiones Mathematicae - General Algebra and Applications

Similarity:

We study unitary rings of characteristic 2 satisfying identity x p = x for some natural number p. We characterize several infinite families of these rings which are Boolean, i.e., every element is idempotent. For example, it is in the case if p = 2 n - 2 or p = 2 n - 5 or p = 2 n + 1 for a suitable natural number n. Some other (more general) cases are solved for p expressed in the form 2 q + 2 m + 1 or 2 q + 2 m where q is a natural number and m 1 , 2 , . . . , 2 q - 1 .

Differentiation and splitting for lattices over orders

Wolfgang Rump (2001)

Colloquium Mathematicae

Similarity:

We extend our module-theoretic approach to Zavadskiĭ’s differentiation techniques in representation theory. Let R be a complete discrete valuation domain with quotient field K, and Λ an R-order in a finite-dimensional K-algebra. For a hereditary monomorphism u: P ↪ I of Λ-lattices we have an equivalence of quotient categories ̃ u : Λ - l a t / [ ] δ u Λ - l a t / [ B ] which generalizes Zavadskiĭ’s algorithms for posets and tiled orders, and Simson’s reduction algorithm for vector space categories. In this article we replace...