Results 101 to 110 of about 6,492 (203)

A study on strongly convex hyper S-subposets in hyper S-posets

open access: yesOpen Mathematics, 2020
In this paper, we study various strongly convex hyper S-subposets of hyper S-posets in detail. To begin with, we consider the decomposition of hyper S-posets.
Tang Jian, Xie Xiang-Yun, Davvaz Bijan
doaj   +1 more source

A Voronoi poset

open access: yesJournal for Geometry and Graphics, 1999
14 pages 4 ...
openaire   +5 more sources

Interval number of special posets and random posets

open access: yesDiscrete Mathematics, 1995
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Tom Madej, Douglas B. West
openaire   +2 more sources

Geometric Applications of Posets

open access: yesComputational Geometry, 1997
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Michael Segal 0001, Klara Kedem
openaire   +3 more sources

Representable posets

open access: yesJournal of Applied Logic, 2016
A poset is representable if it can be embedded in a field of sets in such a way that existing finite meets and joins become intersections and unions respectively (we say finite meets and joins are preserved). More generally, for cardinals $α$ and $β$ a poset is said to be $(α,β)$-representable if an embedding into a field of sets exists that preserves ...
openaire   +2 more sources

The Combinatorics of Poset Associahedra [PDF]

open access: yes
In this dissertation, we study poset associahedra and the combinatorics surrounding them. We provide a simple realization of poset associahedra and affine poset cyclohedra.
Sack, Andrew Ian
core   +1 more source

On multipartite posets

open access: yesDiscrete Mathematics, 2008
6 ...
openaire   +2 more sources

Producing posets

open access: yesDiscrete Mathematics, 1981
AbstractMany of the well-known selection and sorting problems can be understood as the production of certain partial orders, using binary comparisons. The paper discusses the complexity of the production of arbitrary posets all of a given size n (on a totally ordered ground-set).
openaire   +2 more sources

Reducing the lengths of slim planar semimodular lattices without changing their congruence lattices [PDF]

open access: yesMathematica Bohemica
Following G. Grätzer and E. Knapp (2007), a slim planar semimodular lattice, SPS lattice for short, is a finite planar semimodular lattice having no $M_3$ as a sublattice.
Gábor Czédli
doaj   +1 more source

Home - About - Disclaimer - Privacy