Academia.eduAcademia.edu

Distributive Q- lattice

description361 papers
group1 follower
lightbulbAbout this topic
A distributive Q-lattice is a type of lattice in order theory that satisfies the distributive property for arbitrary joins and meets, where the elements are drawn from a complete lattice structure. It is characterized by the absence of certain configurations that would violate distributivity, thus ensuring a specific algebraic structure.
lightbulbAbout this topic
A distributive Q-lattice is a type of lattice in order theory that satisfies the distributive property for arbitrary joins and meets, where the elements are drawn from a complete lattice structure. It is characterized by the absence of certain configurations that would violate distributivity, thus ensuring a specific algebraic structure.

Key research themes

1. How can distributive q-ary lattices be constructed and characterized using generalized Construction D methods?

This research theme investigates the extension of classical lattice constructions (notably Constructions D, D', and D̄) from linear codes over finite fields to q-ary linear codes over finite rings Z_q. These constructions aim to produce lattices with desirable properties for applications in coding and cryptography, such as minimum distance and explicit generator matrices. Establishing necessary and sufficient conditions for these constructions to yield lattices and understanding their interrelations is essential for designing new lattice-based schemes.

Key finding: The paper extends Constructions D, D', and D̄ from codes over finite fields F_p to linear codes over the ring Z_q, providing an operation called zero-one addition that generalizes the Schur product. It establishes that the... Read more
Key finding: Building on the extended constructions, this work derives bounds for the minimum l_1 (Manhattan) distance of lattices Λ_D, Λ_D', and Λ_ overline{D} obtained from these constructions. It also provides explicit expressions for... Read more

2. What are the algebraic and structural relationships between distributive lattices, residuated lattices, and generalizations like orthomodular and modular lattices?

This area explores the interplay between distributive lattices and various classes of residuated lattices, which are algebraic structures foundational for fuzzy logic, substructural logic, and quantum logic. Special emphasis is laid on characterizing residuated lattices via special elements (distributive, neutral, standard), or via poset and lattice modifications (e.g., extensions, orthomodularity). It also includes connections to quantum structures such as orthomodular lattices and their conversion into residuated or left residuated lattices. Understanding these connections aids in generalizing algebraic semantics of logical systems and in identifying structural properties relating modularity, distributivity, and residuation.

Key finding: This paper introduces and studies distributive, standard, and neutral elements in residuated lattices, extending classical lattice notions to residuated settings. It demonstrates that these special elements form MTΛ-algebras... Read more
Key finding: It shows that any complemented modular lattice can be converted into a divisible left residuated lattice by defining multiplication and residuum via lattice operations and complementation. It further extends this residuation... Read more
Key finding: The authors demonstrate that every idempotent weakly divisible residuated lattice satisfying the double negation law can be organized into an orthomodular lattice, and conversely, orthomodular lattices correspond to weak... Read more

3. How do distributive properties manifest and generalize in almost distributive lattices via new algebraic operations like α-multiplier?

This research direction focuses on the study of almost distributive lattices (ADLs), which relax some distributivity conditions, and the introduction and analysis of α-multiplier operations on them. Such multipliers extend concepts of classical multipliers and are instrumental in understanding lattice operations, homomorphisms, ideals, and congruences in ADLs. The work also connects these concepts to α-increasing homomorphisms and isotone α-multipliers, contributing to an algebraic framework generalizing distributivity and enriching theory applicable to ring-like structures.

Key finding: This paper defines α-multiplier on almost distributive lattices, generalizing classical multipliers, and investigates their fundamental properties. It introduces principal and isotone α-multipliers, establishes conditions... Read more

All papers in Distributive Q- lattice

We discuss the question of extending homeomorphism between closed subsets of the Cantor discontinuum D τ . For every set P ⊂ D τ let L P be the set of cardinality λ such that the λ-interior of P is not empty. It is established that any... more
We discuss the question of extending homeomorphisms between closed subsets of the Cantor cube $D^{\tau }$ . It is established that any homeomorphism between two closed negligible subsets of $D^{\tau }$ can be extended to an... more
We show that the epireflective hull of the Q-Sierpinski space in the category Q-TOP0 of Q-T0-topological spaces is the category Q-SOB of Q-sober topological spaces.
The concept of annihilator ideals is introduced in an Almost Distributive Lattice (ADL)R. It is proved that the set of all annihilator ideals of R forms a complete Boolean algebra. The sufficient condition for R to become a relatively... more
Cantor's Theorem is generalized to a theorem on partially ordered sets.
We characterize the distributive lattices of Jacobson rings and prove that if a semiring is a distributive lattice of Jacobson rings, then, up to isomorphism, it is equal to the subdirect product of a distributive lattice and a Jacobson... more
In this paper we study the semiring variety V generated by any finite number of finite fields F1,..., Fk and two-element distributive lattice B2, i.e., V = HSP{B2, F1,..., Fk}. It is proved that V is hereditarily finitely based, and that,... more
A semiring variety is d-semisimple if it is generated by the distributive lattice of order two and a finite number of finite fields. A d-semisimple variety V = HSP{B2, F1,..., Fk} plays the main role in this paper. It will be proved that... more
Let V be a d-dimensional vector space over a finite field F equipped with a non-degenerate hermitian, alternating, or quadratic form. Suppose |F| = q 2 if V is hermitian, and |F| = q otherwise. Given integers e, e ′ such that e + e ′ d,... more
We define the notion of a relative matrad and realize the free relative matrad rH∞ as a free H∞-bimodule structure on cellular chains of bimultiplihedra JJ = {JJn,m = JJm,n} m,n≥1 . We define a morphism G : A ⇒ B of A∞-bialgebras as a... more
An A∞-bialgebra of type (m, n) is a Hopf algebra H equipped with a "compatible" operation ω n m : H ⊗m → H ⊗n of positive degree. We determine the structure relations for A∞-bialgebras of type (m, n) and construct a purely algebraic... more
In this paper we consider some properties of derivations of lattices and show that (i) for a derivation $d$ of a lattice $L$ with the maximum element $1$, it is monotone if and only if $d(x) le d(1)$ for all $xin L$ (ii) a monotone... more
We introduce a new class of real-valued monotones in preordered spaces, injective monotones. We show that the class of preorders for which they exist lies in between the class of preorders with strict monotones and preorders with... more
It is shown that the median voter theorem for committee-decisions holds over a full unimodal preference domain whenever (i) the underlying median interval space satis…es interval antiexchange and (ii) unimodality is de…ned with respect to... more
The concept lattice of a coalitional game form is introduced and advocated as a structural classificatory tool. The basic properties of such lattices are studied. Sufficient concept-latticial properties for convexity of the underlying... more
Collective Identification Procedures (CIPs) model admission rules regulating membership in associations, communities and clubs: the Libertarian identification rule F l is the CIP which essentially relies on self-certification. This paper... more
It is shown that a social choice rule f : X N → X as defined on a bounded distributive lattice (X,≤ ) is strategy-proof on the set of all profiles of unimodal total preorders on X if and only if it can be represented as an iterated median... more
Let L be a lattice. A function f : , and modular if it is both submodular and supermodular. Modular functions on a finite lattice form a finite dimensional vector space. For finite distributive lattices, we compute this (modular)... more
We examine two associative products over the ring of symmetric functions related to the intransitive and Cartesian products of permutation groups. As an application, we give an enumeration of some Feynman type diagrams arising in Bender's... more
In order to extend Schützenberger’s factorization to general perturbations, the combinatorial aspects of the Hopf algebra of a deformed shuffle product is developed systematically in a parallel way with those of the shuffle product, with... more
3 General results on summability and duality 4 3.1 Total algebras and duality . . . . . . . . . . . . . . . . . . . . . . 4 3.1.1 Series and infinite sums . . . . . . . . . . . . . . . . . . . 4 3.1.2 Summable families in Hom spaces. . .... more
In order to extend Schützenberger's factorization to general perturbations, the combinatorial aspects of the Hopf algebra of a deformed shuffle product is developed systematically in a parallel way with those of the shuffle product, with... more
The problem of establishing Bell and Greenberger-Horne-Zeilinger states between faraway places or distant nodes of a circuit is a difficult and an extremely important one, and a strategy which addresses it is entanglement percolation. We... more
Two new results concerning complements in a semisimple Hopf algebra are proved. They extend some well known results from group theory. The uniqueness of Krull Schmidt Remak type decomposition is proved for semisimple completely reducible... more
In this work, we study the possibility of inserting an increasing continuous lattice-valued function between two comparable semicontinuous functions on a preordered topological space. Depending on the monotonicity conditions imposed on... more
Problems of inserting lattice-valued functions are investigated. We provide an analogue of the classical insertion theorem of Lane [Proc. Amer. Math. Soc. 49 (1975) 90-94] for L-valued functions where L is a -separable completely... more
In this paper we present the representation theorems for three classes of algebras based on residuated, not necessarily distributive lattices. These structures are algebras of weak fuzzy logics, which are the bottom part of the hierarchy... more
A soft semigroup over a semigroup is a collection of subsemigroups. Similarly, a soft ideal over a semigroup is a collection of ideals of the semigroup. As a natural consequence, the idea of soft ideals of a soft semigroup originates.... more
We partially prove a conjecture from [MkSh:366] which says that the spectrum of almost free, essentially free, non-free algebras in a variety is either empty or consists of the class of all successor cardinals.
For a fixed set X, an arbitrary weight structure d ∈ [0, ∞] X×X can be inter-preted as a distance assignment between pairs of points on X. Restrictions (i.e., metric axioms) on the behaviour of any such d naturally arise, such as... more
In this paper we analyze some fragments of the universal theory of distributive lattices with many sorted bridging operators. Our interest in such algebras is motivated by the fact that, in description logics, numerical features are often... more
In this paper we present a method for automated theorem proving in non-classical logics having as algebraic models bounded distributive lattices with certain types of operators. The idea is to use a Priestley-style representation for... more
In this paper intuitionistic topological system and its properties have been introduced. Categorical interrelationships among Heyting algebra, Gödel algebra, Esakia space and proposed intuitionistic topological systems have also been... more
In this paper intuitionistic topological system and its properties have been introduced. Categorical interrelationships among Heyting algebra, G\"odel algebra, Esakia space and proposed intuitionistic topological systems have also... more
Institute of Mathematics of the Academy of Sciences of the Czech Republic provides access to digitized documents strictly for personal use. Each copy of any part of this document must contain these Terms of use. This paper has been... more
In [9], the concept of fuzzy sets is applied to the theory of Ζ-ideals in a BCI-semigroup (it was renamed as an IS-algebra for the convenience of study), and a characterization of fuzzy Ζ-ideals by their level Ζ-ideals was discussed. In... more
We show that binary orthologic becomes either quantum or classical logic when nothing but modus ponens rule is added to it, depending on the kind of the operation of implication used. We also show that in the usual approach the rule... more
An n-ary associative function is called reducible if it can be written as a composition of a binary associative function. We summarize known results when the function is defined on a chain and is nondecreasing. Our main result shows that... more
The problem of establishing Bell and Greenberger-Horne-Zeilinger states between faraway places or distant nodes of a circuit is a difficult and an extremely important one, and a strategy which addresses it is entanglement percolation. We... more
The problem of establishing Bell and Greenberger-Horne-Zeilinger states between faraway places or distant nodes of a circuit is a difficult and an extremely important one, and a strategy which addresses it is entanglement percolation. We... more
Holliday recently introduced a non-classical logic called Fundamental Logic, which intends to capture exactly those properties of the connectives "and", "or" and "not" that hold in virtue of their introduction and elimination rules in... more
In this paper we describe the Hopf algebras on planar binary trees used to renormalize the Feynman propagators of quantum electrodynamics, and the coaction which describes the renormalization procedure. Both structures are related to some... more
The starting point of this paper is the empirically determined ability to reason in natural language by employing probable sentences. A sentence is understood to be logically probable if its schema, expressed as a formula in the language... more
A Heyting algebra is a distributive lattice with implication and a dual BCK-algebra is an algebraic system having as models logical systems equipped with implication. The aim of this paper is to investigate the relation of Heyting... more
Download research papers for free!