Related papers: Residuation in modular lattices and posets
We characterize the finite distributive lattices which admit a complete valuation, that is bijective over a set of consecutive natural numbers, with the additional conditions of completeness (Definition 2.3). We prove that such lattices are…
We establish analogues in the context of group actions or group representations of some classical problems and results in additive combinatorics of groups. We also study the notion of left invariant submodular function defined on power sets…
When working with posets which are not necessarily lattices, one has a lack of lattice operations which causes problems in algebraic constructions. This is the reason why we use the operators Max L and Min U substituting infimum and…
A sectionally pseudocomplemented poset P is one which has the top element and in which every principal order filter is a pseudocomplemented poset. The sectional pseudocomplements give rise to an implication-like operation on P which…
Non-classical generalizations of classical modal logic have been developed in the contexts of constructive mathematics and natural language semantics. In this paper, we discuss a general approach to the semantics of non-classical modal…
In this article we investigate the relations between three classes of lattices each extending the class of distributive lattices in a different way. In particular, we consider join-semidistributive, join-extremal and left-modular lattices,…
A well-known generalisation of positional numeration systems is the case where the base is the residue class of $x$ modulo a given polynomial $f(x)$ with coefficients in (for example) the integers, and where we try to construct finite…
Part B (of a project involving four Parts) is about "bases of lines", a concept introduced by C. Herrmann and the author in the late 80's. Bases of lines attempt to describe a given modular lattice in a geometric way akin to how projective…
Multilattices are generalisations of lattices introduced by Mihail Benado. He replaced the existence of unique lower (resp. upper) bound by the existence of maximal lower (resp. minimal upper) bound(s). A multilattice will be called pure if…
Given a complete modular meet-continuous lattice $A$, an inflator on $A$ is a monotone function $d\colon A\rightarrow A$such that $a\leq d(a)$ for all $a\in A$. If $I(A)$ is the set of all inflators on $A$, then $I(A)$ is a complete…
We generalize Loewner's method for proving that matrix monotone functions are operator monotone. The relation x \leq y on bounded operators is our model for a definition for C*-relations of being residually finite dimensional. Our main…
Recently a new kind of approximation to continuum topological spaces has been introduced, the approximating spaces being partially ordered sets (posets) with a finite or at most a countable number of points. The partial order endows a poset…
We establish an order-preserving bijective correspondence between the sets of coclosed elements of some bounded lattices related by suitable Galois connections. As an application, we deduce that if $M$ is a finitely generated…
In order to be able to use methods of Universal Algebra for investigating posets, we assign to every pseudocomplemented poset, to every relatively pseudocomplemented poset and to every sectionally pseudocomplemented poset a certain algebra…
On an infinite set some closure operators are finitary (algebraic) while others are not. We can generalize this idea for a complete algebraic lattice letting the compact elements act as the finite sets. With this in mind, we will consider…
The present article studies nilpotent and Hamiltonian cancellative residuated lattices and their relationship with nilpotent and Hamiltonian lattice-ordered groups. In particular, results about lattice-ordered groups are extended to the…
This paper introduces two forms of modular inverses and proves their reciprocity formulas respectively. These formulas are then applied to formulate new and generalized algorithm for computing these modular inverses. The same algorithm is…
We elaborate on the notion of a filtration of an operad defined in terms of a lattice-valued operad serving as an indexing object. That covers ordinary integer-indexed filtrations of associative algebras and operads as a special case, yet…
For every operator space $X$ the $C^\ast$-algebra containing it in a universal way is residually finite-dimensional (that is, has a separating family of finite-dimensional representations). In particular, the free $C^\ast$-algebra on any…
We study modularity of the lattice Lat $(T)$ of closed invariant subspaces for a $C_0$-operator $T$ and find a condition such that Lat $(T)$ is a modular. Furthermore, we provide a quasiaffinity preserving modularity.