Related papers: Promotion Sorting
Several important properties of positive semidefinite processes of Ornstein--Uhlenbeck type are analysed. It is shown that linear operators of the form $X\mapsto AX+XA^{\mathrm{T}}$ with $A\in M_d(\mathbb{R})$ are the only ones that can be…
Let $X=(X_t)$ be a one-dimensional Ornstein-Uhlenbeck process with an initial density function $f$ supported on the positive real-line that is a regularly varying function with exponent $-(1+\eta)$, with $\eta\in (0,1)$. We prove the…
We extend the preorder on k-tuples of dominant weights of a simple complex Lie algebra g of classical type adding up to a fixed weight $\lambda$ defined by V. Chari, D. Sagaki and the author. We show that the induced extended partial order…
The rowmotion action on order ideals or on antichains of a finite partially ordered set has been studied (under a variety of names) by many authors. Depending on the poset, one finds unexpectedly interesting orbit structures, instances of…
The set of all perfect matchings of a plane (weakly) elementary bipartite graph equipped with a partial order is a poset, moreover the poset is a finite distributive lattice and its Hasse diagram is isomorphic to $Z$-transformation directed…
S.Janson [Poset limits and exchangeable random posets, Combinatorica 31 (2011), 529--563] defined limits of finite posets in parallel to the emerging theory of limits of dense graphs. We prove that each poset limit can be represented as a…
Part-of-Speech (POS) tagging is an old and fundamental task in natural language processing. While supervised POS taggers have shown promising accuracy, it is not always feasible to use supervised methods due to lack of labeled data. In this…
We will investigate proof-theoretic and linguistic aspects of first-order linear logic. We will show that adding partial order constraints in such a way that each sequent defines a unique linear order on the antecedent formulas of a sequent…
One of possible cryptomorphic definitions of a partially ordered set (= a poset) $P$ on a non-empty finite basic set $N$ is in terms of the set ${\cal L}(P)$ of all its linear extensions, that is, in terms of the set of total orders of $N$…
Kahn and Kim (J. Comput. Sci., 1995) have shown that for a finite poset $P$, the entropy of the incomparability graph of $P$ (normalized by multiplying by the order of $P$) and the base-$2$ logarithm of the number of linear extensions of…
In this note we consider a Ramsey type result for partially ordered sets. In particular, we give an alternative short proof of a theorem for a posets with multiple linear extensions recently obtained by Solecki and Zhao.
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…
The notion of level posets is introduced. This class of infinite posets has the property that between every two adjacent ranks the same bipartite graph occurs. When the adjacency matrix is indecomposable, we determine the length of the…
Ailon et al. (SICOMP 2011) proposed a self-improving sorter that tunes its performance to an unknown input distribution in a training phase. The input numbers $x_1,x_2,\ldots,x_n$ come from a product distribution, that is, each $x_i$ is…
After fixing a canonical ordering (or labeling) of the elements of a finite poset, one can associate each linear extension of the poset with a permutation. Some recent papers consider specific families of posets and ask how many linear…
For a partially ordered set P, we denote by Co(P) the lattice of order-convex subsets of P. We find three new lattice identities, (S), (U), and (B), such that the following result holds. Theorem. Let L be a lattice. Then L embeds into some…
A variety of possible extensions of mappings between posets to their Dedekind order completion is presented. One of such extensions has recently been used for solving large classes of nonlinear systems of partial differential equations with…
Sorting is one of the most used and well investigated algorithmic problem [1]. Traditional postulation supposes the sorting data archived, and the elementary operation as comparisons of two numbers. In a view of appearance of new processors…
Define an expansion poset to be the poset of monomials of a cluster variable attached to an arc in a polygon, where each monomial is represented by the corresponding combinatorial object from some fixed combinatorial cluster expansion…
In sorting situations where the final destination of each item is known, it is natural to repeatedly choose items and place them where they belong, allowing the intervening items to shift by one to make room. (In fact, a special case of…