Related papers: Partially ordered sets in Macaulay2
The aim of the present paper is to investigate the half-spaces in the convexity structure of all quasiorders on a given set and to use them in an alternative approach to classical order dimension. The main result states that linear orders…
The aim of this paper is to present a very simple set of conditions, necessary for the management of knowledge of a poset $T$ of two agents, which are partially ordered by the capabilities available in the system. We build up a formal…
In this paper, we proposed a pose estimation system based on rendered image training set, which predicts the pose of objects in real image, with knowledge of object category and tight bounding box. We developed a patch-based multi-class…
The queue-number of a poset is the queue-number of its cover graph viewed as a directed acyclic graph, i.e., when the vertex order must be a linear extension of the poset. Heath and Pemmaraju conjectured that every poset of width $w$ has…
An update of the ODEtools Maple package, for the analytical solving of 1st and 2nd order ODEs using Lie group symmetry methods, is presented. The set of routines includes an ODE-solver and user-level commands realizing most of the relevant…
We introduce two new partial orders on the standard Young tableaux of a given partition shape, in analogy with the strong and weak Bruhat orders on permutations. Both posets are ranked by the major index statistic offset by a fixed shift.…
The dirichletprocess package provides software for creating flexible Dirichlet process objects. Users can perform nonparametric Bayesian analysis using Dirichlet processes without the need to program their own inference algorithms. Instead,…
Interval-order partially ordered multisets with interfaces (ipomsets) have shown to be a versatile model for executions of concurrent systems in which both precedence and concurrency need to be taken into account. In this paper, we develop…
Numerical Algebraic Geometry uses numerical data to describe algebraic varieties. It is based on the methods of numerical polynomial homotopy continuation, an alternative to the classical symbolic approaches of computational algebraic…
We consider a category of all finite partial orderings with quotient maps as arrows and construct a Fra\"iss\'e sequence in this category. Then we use commonly known relations between partial orders and lattices to construct a sequence of…
Three families of posets depending on a nonnegative integer parameter $m$ are introduced. The underlying sets of these posets are enumerated by the $m$-Fuss Catalan numbers. Among these, one is a generalization of Stanley lattices and…
This paper introduces key machine learning operations that allow the realization of robust, joint 6D pose estimation of multiple instances of objects either densely packed or in unstructured piles from RGB-D data. The first objective is to…
Partially ordered patterns (POPs) generalize the notion of classical patterns studied in the literature in the context of permutations, words, compositions and partitions. In this paper, we give a number of general, and specific enumerative…
This paper introduces a new kind of propositional encoding for reasoning about partial orders. The symbols in an unspecified partial order are viewed as variables which take integer values and are interpreted as indices in the order. For a…
One partially ordered set, $Q$, is a Tukey quotient of another, $P$, denoted $P \geq_T Q$, if there is a map $\phi : P \to Q$ carrying cofinal sets of $P$ to cofinal sets of $Q$. Let $X$ be a space and denote by $\mathcal{K}(X)$ the set of…
The rational homology group of the order complex of non-even partitions of a finite set is calculated. A twisted version of the Goresky-MacPherson approach to similar homology calculations is proposed.
We use the method of monotone iterations to obtain fixed point and coupled fixed point results for mixed monotone operators in the setting of partially ordered sets, with no additional assumptions on the partial order and with no…
The article contains some important classes of multisets. Combinatorial proofs of problems on the number of m-submultisets and m-permutations of multiset elements are considered and effective algorithms for their calculation are given. In…
In this paper, we study partitions of positive integers into distinct quasifibonacci numbers. A digraph and poset structure is constructed on the set of such partitions. Furthermore, we discuss the symmetric and recursive relations between…
For any finite poset we define a generating polynomial counting upsets, downsets, and their intersection. We investigate the behaviour of this polynomial with respect to poset operations, show that it distinguishes series-parallel posets,…