Results 61 to 70 of about 10,642 (232)
Coupled right orthosemirings induced by orthomodular lattices
, 2017 L. P. Belluce, A. Di Nola and B. Gerla established a connection between MV-algebras and (dually) lattice ordered semirings by means of so-called coupled semirings.
Chajda, Ivan, Länger, Helmut
core +2 more sources
Corrigendum to “Perfect semilattices” [PDF]
Semigroup Forum, 1985 B. M. Schein let us know that \(S_ 3\) is not perfect. In fact, it is the smallest non-perfect semilattice. Consequently, Theorem 1 of the paper mentioned in the title [ibid. 32, 23-29 (1985; Zbl 0564.06004)] has to be corrected as follows. Let S be a semilattice. Then the following are equivalent: (1) S is perfect; (4) S is a chain.
Hansoul, G., Varlet, J.
openaire +2 more sources
, 2015 We solve the word problem for the free objects in the variety consisting of bands with a semilattice transversal.
Albert, Justin, Pastijn, Francis
core +1 more source
Discrete Mathematics, 2007 Quantum structures are usually bounded posets, but attempts were made to introduce also generalizations having only the lower bound,~\(0\). Then the orthocomplement is replaced by the relative complement, \(x^a\), of \(x\) in the interval \([0,a]\).
openaire +2 more sources
Studia Logica, 2022 Contact algebra is one of the main tools in region-based theory of space. In \cite{dmvw1, dmvw2,iv,i1} it is generalized by dropping the operation Boolean complement. Furthermore we can generalize contact algebra by dropping also the operation meet. Thus we obtain structures, called contact join-semilattices (CJS) and structures, called distributive ...
openaire +2 more sources
Equivariant Hilbert and Ehrhart series under translative group actions
Journal of the London Mathematical Society, Volume 112, Issue 5, November 2025.Abstract We study representations of finite groups on Stanley–Reisner rings of simplicial complexes and on lattice points in lattice polytopes. The framework of translative group actions allows us to use the theory of proper colorings of simplicial complexes without requiring an explicit coloring to be given.
Alessio D'Alì, Emanuele Delucchi
wiley +1 more source
$0$-ideals in $0$-distributive posets [PDF]
Mathematica Bohemica, 2016 The concept of a $0$-ideal in $0$-distributive posets is introduced. Several properties of $0$-ideals in $0$-distributive posets are established. Further, the interrelationships between $0$-ideals and $\alpha$-ideals in $0$-distributive posets are ...
Khalid A. Mokbel
doaj +1 more source
On Endomorphism Universality of Sparse Graph Classes
Journal of Graph Theory, Volume 110, Issue 2, Page 223-244, October 2025.ABSTRACT We show that every commutative idempotent monoid (a.k.a. lattice) is the endomorphism monoid of a subcubic graph. This solves a problem of Babai and Pultr and the degree bound is best‐possible. On the other hand, we show that no class excluding a minor can have all commutative idempotent monoids among its endomorphism monoids. As a by‐product,
Kolja Knauer, Gil Puig i Surroca
wiley +1 more source
A survey of recent results on congruence lattices of lattices [PDF]
, 2005 We review recent results on congruence lattices of (infinite) lattices. We discuss results obtained with box products, as well as categorical, ring-theoretical, and topological ...
Tuma, Jiri, Wehrung, Friedrich
core
Periodic Orbits of MAX and MIN Multistate Networks
Mathematical Methods in the Applied Sciences, Volume 48, Issue 12, Page 11620-11629, August 2025.ABSTRACT This work presents a generalization of Boolean networks to multistate networks over a complement‐closed set 𝒞, which can be finite or infinite. Specifically, we focus on MAX (and MIN) multistate networks, whose dynamics are governed by global arbitrary 𝒞‐maxterm (or 𝒞‐minterm) functions, which extend the well‐known maxterm (or minterm) Boolean
Juan A. Aledo +3 more
wiley +1 more source