Results 31 to 40 of about 467 (189)

Base Axioms of Modular Supermatroids

open access: yesJournal of Applied Mathematics, 2014
This paper studies axiom systems of supermatroids. Barnabei et al.'s base axioms concerning poset matroids (i.e., distributive supermatroids) are generalized to modular supermatroids, and a mistake in the proof of base axioms of poset matroids is pointed
Xiaonan Li, Sanyang Liu
doaj   +1 more source

On the homological classification of pomonoids: atomic posemilattices [PDF]

open access: yes, 2013
Between dierent and relatively well investigated so-called flatness properties of S-posets there is a property called property (Pw) which, so far, has not received much attention.
Kilp, Mati
core   +2 more sources

Maximal 0-1-fillings of moon polyominoes with restricted chain lengths and rc-graphs [PDF]

open access: yesDiscrete Mathematics & Theoretical Computer Science, 2011
We show that maximal 0-1-fillings of moon polynomials, with restricted chain lengths, can be identified with certain rc-graphs, also known as pipe dreams.
Martin Rubey
doaj   +1 more source

Dominions, zigzags and epimorphisms for partially ordered semigroups [PDF]

open access: yes, 2014
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

open access: yes, 2017
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

Random and deterministic versions of extremal poset problems [PDF]

open access: yes, 2016
Let P(n) denote the set of all subsets of {1,...,n} and let P(n,p) be the set obtained from P(n) by selecting elements independently at random with probability p. The Boolean lattice is a partially ordered set, or poset, consisting of the elements of P(n)
Hogenson, Kirsten Ann
core   +2 more sources

The topology of restricted partition posets [PDF]

open access: yesDiscrete Mathematics & Theoretical Computer Science, 2011
For each composition $\vec{c}$ we show that the order complex of the poset of pointed set partitions $Π ^• _{\vec{c}}$ is a wedge of $β\vec{c}$ spheres of the same dimensions, where $β\vec{c}$ is the number of permutations with descent composition ^$\vec{
Richard Ehrenborg, JiYoon Jung
doaj   +1 more source

Classifying topoi in synthetic guarded domain theory

open access: yes, 2022
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

Climate Change and (Mal)Adaptation in Tourism‐Intensive Alpine Regions

open access: yesThe Political Quarterly, EarlyView.
Abstract Tourism, especially in winter, accounts for a large share of economic income in Alpine regions. At the same time, these regions are more severely affected by climate change, leading to shorter winter seasons and reduced snow cover. This presents a pressing issue for areas reliant on income from winter tourism through activities such as skiing.
Valentina Ausserladscheider
wiley   +1 more source

How to get the weak order out of a digraph ? [PDF]

open access: yesDiscrete Mathematics & Theoretical Computer Science, 2015
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

Home - About - Disclaimer - Privacy