Results 61 to 70 of about 1,290 (174)

Orthomodular semilattices

open access: yesDiscrete 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

Contact Join-semilattices

open access: yesStudia 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

On the Presentation and Cayley Graph of the Bruck–Reilly Idealization Semigroup

open access: yesJournal of Mathematics, Volume 2026, Issue 1, 2026.
Transferring constructions between different algebraic structures often reveals deep connections and enables the application of techniques from one theory to another. The idealization of the module over a ring, introduced by Nagata in 1962, has been a powerful tool in commutative algebra for decades.
Suha Wazzan   +3 more
wiley   +1 more source

Keterkaitan semigrup regular dengan semilattice [PDF]

open access: yes, 2006
ABSTRAK Skripsi dengan judul “Keterkaitan Semigrup Regular dengan Semilattice” ini termasuk jenis penelitian dengan metode kajian pustaka. Struktur aljabar atau sistem aljabar akan selalu dianggap sebuah himpunan tak kosong yang mempunyai elemen ...
Utami, Gemi
core  

Equivariant Hilbert and Ehrhart series under translative group actions

open access: yesJournal 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

A semilattice generated by superlow computably enumerable degrees [PDF]

open access: yes, 2011
We prove that a partially ordered set of all computably enumerable (c. e.) degrees that are the least upper bounds of two superlow c. e. degrees is an upper semilattice not elementary equivalent to the semilattice of all c. e.
M. Kh. Faizrakhmanov, Faizrakhmanov M.
core   +1 more source

On Endomorphism Universality of Sparse Graph Classes

open access: yesJournal 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

Some ordered hypersemigroups which enter their properties into their σ-classes [PDF]

open access: yesJournal of Hyperstructures, 2017
An important problem in the theory of ordered hypersemigroups is to describe the ordered hypersemigroups which enter their properties into their σ-classes.
Niovi Kehayopulu
doaj   +1 more source

Periodic Orbits of MAX and MIN Multistate Networks

open access: yesMathematical 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

NATURAL DUALITIES FOR SEMILATTICE-BASED ALGEBRAS [PDF]

open access: yes, 2008
. While every finite lattice-based algebra is dualisable, the same is not true of semilattice-based algebras. We show that a finite semilattice-based algebra is dualisable if all its operations are compatible with the semilattice operation.
M. Jackson   +3 more
core  

Home - About - Disclaimer - Privacy