Results 1 to 10 of about 167 (147)
Quasi-Semilattices on Networks
This paper introduces a representation of subnetworks of a network Γ consisting of a set of vertices and a set of relations, where relations are the primitive structures of a network.
Yanhui Wang, Dazhi Meng
doaj +3 more sources
Balancing the accuracy and the complexity of models is a well established and ongoing challenge. Models can be misleading if they are not accurate, but models may be incomprehensible if their accuracy depends upon their being complex.
Stephen Fox, Antonio Ricciardo
doaj +3 more sources
Predicative theories of continuous lattices [PDF]
We introduce a notion of strong proximity join-semilattice, a predicative notion of continuous lattice which arises as the Karoubi envelop of the category of algebraic lattices. Strong proximity join-semilattices can be characterised by the coalgebras of
Tatsuji Kawai
doaj +1 more source
On the Topology of the Cambrian Semilattices [PDF]
For an arbitrary Coxeter group $W$, David Speyer and Nathan Reading defined Cambrian semilattices $C_{\gamma}$ as certain sub-semilattices of the weak order on $W$.
Myrto Kallipoliti, Henri Mühle
doaj +1 more source
The Fixed-Point Theory of Strictly Contracting Functions on Generalized Ultrametric Semilattices [PDF]
We introduce a new class of abstract structures, which we call generalized ultrametric semilattices, and in which the meet operation of the semilattice coexists with a generalized distance function in a tightly coordinated way.
Eleftherios Matsikoudis, Edward A. Lee
doaj +1 more source
Universal extensions of specialization semilattices [PDF]
A specialization semilattice is a join semilattice together with a coarser preorder ⊑ satisfying an appropriate compatibility condition. If X is a topological space, then (P(X),∪,⊑) is a specialization semilattice, where x ⊑ y if x ⊆ Ky, for x, y ⊆ X ...
Paolo Lipparini
doaj +1 more source
The lattice of (2, 1)-congruences on a left restriction semigroup
All the (2, 1)-congruences on a left restriction semigroup become a complete sublattice of its lattice of congruences. The aim of this article is to study certain fundamental properties of this complete sublattice.
Liu Haijun, Guo Xiaojiang
doaj +1 more source
Let A, B, C, and D be posets. Assume C and D are finite with a greatest element. Also assume that AC ≅B D. Then there exist posets E, X, Y , and Z such that A ≅E X, B ≅E Y , C≅Y ×Z, and D≅X×Z. If C≅D, then A≅B.
Jonathan Farley
doaj +1 more source
On automorphisms of strong semilattice of groups
In this paper, we consider the automorphisms of the strong semilattice of groups and relate them to the isomorphisms and automorphisms of underlying groups. We also provide a construction for non-trivial automorphisms of semilattices.
Aftab Hussain Shah +2 more
doaj +1 more source
Compatibilities between continuous semilattices
We define compatibilities between continuous semilattices as Scott continuous functions from their pairwise cartesian products to $\{0,1\}$ that are zero preserving in each variable.
O.Ya. Mykytsey, K.M. Koporkh
doaj +1 more source

