Results 111 to 120 of about 1,290 (174)
Equationally Extremal Semilattices [PDF]
In the current paper we study extremal semilattices with respect to their equational properties. In the class $\mathbf{S}_n$ of all semilattices of order $n$ we find semilattices which have maximal (minimal) number of consistent equations. Moreover, we find a semilattice in $\mathbf{S}_n$ with maximal sum of numbers of solutions of equations.
openaire +4 more sources
Approximately multiplicative maps from weighted semilattice algebras [PDF]
We investigate which weighted convolution algebras ℓ1ω(S), where S is a semilattice, are AMNM in the sense of Johnson [‘Approximately multiplicative functionals’, J. Lond. Math. Soc. (2) 34(3) (1986), 489–510].
Choi, Yemon, Yemon Choi
core
On Semilattice-based Logics with an Algebraizable Assertional Companion [PDF]
This paper studies some properties of the so-called semilattice-based logics (which are defined in a standard way using only the order relation from a variety of algebras that have a semilattice reduct with maximum) under the assumption that its ...
Font, Josep Maria
core
On some semilattice structures for production technologies [PDF]
Tracing back from Charnes et al. [9] many approaches have been proposed to extend the DEA production model to non-convex technologies. The FDH method were introduced by Deprins et al. [13] and it only assumes a free disposal assumption of the technology.
Briec, Walter, Liang, Qi Bin
core
Directed Graphs representing isomorphism classes of C-Hypergroupoids
We investigate the relation of directed graphs and hyperstructures by virtue of the graph hyperoperation. A new class of graphs arises in this way representing isomorphism classes of C-hypergroupoids and we present the 17 such graphs that correspond to ...
Antonios Kalampakas +2 more
doaj
On Semilattice Structure of Mizar Types [PDF]
Summary. The aim of this paper is to develop a formal theory of Mizar types. The presented theory is an approach to the structure of Mizar types as a sup-semilattice with widening (subtyping) relation as the order.
Grzegorz Bancerek
core
Quasi-abelian and quasi-solvable regular semigroups
In this note quasi-abelian semigroups are studied and it is proved that they form an e-variety of orthodox semigroups. More, quasi-abelian regular Bruck-Reilly monoids are characterized as extensions of monoids which are (reverse) semidirect products of ...
Brunetto Piochi
doaj
High Performance and Lightweight Single Semi-Lattice Algebraic Machine Learning
Algebraic machine learning is a novel parameter-free model that has demonstrated impressive accuracy in challenging tasks such as the MNIST dataset and N-Queens completion.
Imane M. Haidar +3 more
doaj +1 more source

