Results 41 to 50 of about 532 (199)
Dominions, zigzags and epimorphisms for partially ordered semigroups [PDF]
We prove an analogue of Isbell's celebrated zigzag theorem for partially ordered semigroups. This theorem provides a useful description of dominions which we employ to describe absolute closedness of posemigroups and epimorphisms in varieties of ...
Sohail, Nasir, Tart, Lauri
core +2 more sources
Lattice embeddings between types of fuzzy sets. Closed-valued fuzzy sets
In this paper we deal with the problem of extending Zadeh's operators on fuzzy sets (FSs) to interval-valued (IVFSs), set-valued (SVFSs) and type-2 (T2FSs) fuzzy sets.
Lobillo, F. J. +3 more
core +1 more source
How to get the weak order out of a digraph ? [PDF]
We construct a poset from a simple acyclic digraph together with a valuation on its vertices, and we compute the values of its Möbius function. We show that the weak order on Coxeter groups $A$$n-1$, $B$$n$, $Ã$$n$, and the flag weak order on the wreath ...
Francois Viard
doaj +1 more source
Classifying topoi in synthetic guarded domain theory
Several different topoi have played an important role in the development and applications of synthetic guarded domain theory (SGDT), a new kind of synthetic domain theory that abstracts the concept of guarded recursion frequently employed in the ...
Palombi, Daniele, Sterling, Jonathan
core +1 more source
Open Set Lattices of Subspaces of Spectrum Spaces
We take a unified approach to study the open set lattices of various subspaces of the spectrum of a multiplicative lattice L. The main aim is to establish the order isomorphism between the open set lattice of the respective subspace and a sub-poset of L.
Nai Y.T., Zhao D.
doaj +1 more source
ABSTRACT Joint inquiry requires agents to exchange public content about some target domain, which in turn requires them to track which content a linguistic form contributes to a conversation. But, often, the inquiry delivers a necessary truth. For example, if we are inquiring whether a particular bird, Tweety, is a woodpecker, and discover that it is ...
Una Stojnić, Matthew Stone
wiley +1 more source
SPERNER THEOREMS FOR UNRELATED COPIES OF POSETS AND GENERATING DISTRIBUTIVE LATTICES
For a finite poset (partially ordered set) \(U\) and a natural number \(n\), let \(S(U,n)\) denote the largest number of pairwise unrelated copies of \(U\) in the powerset lattice (AKA subset lattice) of an \(n\)-element set.
Gábor Czédli
doaj +1 more source
New Hopf Structures on Binary Trees [PDF]
The multiplihedra $\mathcal{M}_{\bullet} = (\mathcal{M}_n)_{n \geq 1}$ form a family of polytopes originating in the study of higher categories and homotopy theory. While the multiplihedra may be unfamiliar to the algebraic combinatorics community, it is
Stefan Forcey +2 more
doaj +1 more source
The representations of posets (partially ordered sets), introduced by L. A. Nazarova and A. V. Roiter in 1972, play an important role in the modern representation theory and its applications. M. M.
В. М. Бондаренко +1 more
doaj +1 more source
On computing local monodromy and the numerical local irreducible decomposition
Abstract Similarly to the global case, the local structure of a holomorphic subvariety at a given point is described by its local irreducible decomposition. Geometrically, the key requirement for obtaining a local irreducible decomposition is to compute the local monodromy action of a generic linear projection at the given point, which is always well ...
Parker B. Edwards +1 more
wiley +1 more source

