Results 11 to 20 of about 2,431,660 (294)

Graphical partially ordered sets [PDF]

open access: yesDiscrete Applied Mathematics, 1987
The main results of this paper can be found in a generalization of reconstruction properties to a large class of combinatorial structures by a concept of g-graph. For example in the section 3, the author shows many results about the reconstruction conjecture: many of them are known for graphs, but author's proof generalizes them for digraphs ...
Borzacchini, L.
openaire   +3 more sources

Geometries on partially ordered sets [PDF]

open access: yesJournal of Combinatorial Theory, Series B, 1980
AbstractGeometries on finite partially ordered sets extend the concept of matroids on finite sets to partially ordered sets. Geometries are defined in terms of closure operators on partially ordered sets. The lattice of closed sets is semimodular, and every finite semimodular lattice is isomorphic to the lattice of closed sets of some geometry.
Faigle, Ulrich
openaire   +4 more sources

Shaprly transitive partially ordered sets [PDF]

open access: yesDiscrete Mathematics, 1986
If \(\Lambda\) is a p.o. set, \(A=Aut(\Lambda,\leq)\) will denote its group of automorphisms. If for each \(\lambda_ 1,\lambda_ 2\in \Lambda\) there is a unique \(a\in A\) such that \(\lambda_ 1a=\lambda_ 2\), we say that \(\Lambda\) is sharply transitive. It is easily seen that any sharply transitive p.o. set is connected or has just 2 elements.
Behrendt, Gerhard
openaire   +2 more sources

Correlation in partially ordered sets [PDF]

open access: yesDiscrete Applied Mathematics, 1992
Basic results concerning correlation within ordered sets that focus on distributive lattices, systems of subsets ordered by proper inclusion and the family of linear extensions of an arbitrary finite ordered set are reviewed in this paper. Let us quote some interesting results: the Ahlswede-Daykin theorem, the FKG theorem, the universal correlation ...
Fishburn, Peter C.
openaire   +4 more sources

Pattern classes of permutations via bijections between linearly ordered sets [PDF]

open access: yes, 2008
A pattern class is a set of permutations closed under pattern involvement or, equivalently, defined by certain subsequence avoidance conditions. Any pattern class X which is atomic, i.e.
Ruškuc, Nik   +2 more
core   +1 more source

Visualizing Partially Ordered Sets for Socioeconomic Analysis

open access: yesRevista Colombiana de Estadística, 2014
In this paper, we develop a visualization process for partial orders derived from considering many numerical indicators on a statistical population. The issue is relevant, particularly in the field of socio-economic evaluation, where explicitly taking ...
MARCO FATTORE   +2 more
doaj   +1 more source

The symmetric monoidal closed category of cpo $M$-sets [PDF]

open access: yesCategories and General Algebraic Structures with Applications, 2020
In this paper, we show that the category of directed complete posets with bottom elements (cpos) endowed with an action of a monoid $M$ on them forms a monoidal category. It is also proved that this category is symmetric closed.
Halimeh Moghbeli
doaj   +1 more source

Word posets, with applications to Coxeter groups [PDF]

open access: yesElectronic Proceedings in Theoretical Computer Science, 2011
We discuss the theory of certain partially ordered sets that capture the structure of commutation classes of words in monoids. As a first application, it follows readily that counting words in commutation classes is #P-complete.
Matthew J. Samuel
doaj   +1 more source

Representations of bornologies

open access: yesApplied General Topology, 2022
Bornologies abstract the properties of bounded sets of a metric space. But there are unbounded bornologies on a metric space like $\mathcal{P}(\RR)$ with the Euclidean metric.
Homeira Pajoohesh
doaj   +1 more source

Scott-topology based on transitive binary relation [PDF]

open access: yesJournal of Mahani Mathematical Research, 2022
In the study of partially ordered sets, topologies such as Scott-topology have shown to be of paramount importance. In order to have analogous topology-like tools in the more general setting of quantitative domains, we introduce a method to construct ...
Osama Sayed, Nabil Hassan Sayed
doaj   +1 more source

Home - About - Disclaimer - Privacy