Related papers: Proof of a conjecture on the shape-Wilf-equivalenc…
Extending the classical pop-stack sorting map on the lattice given by the right weak order on $S_n$, Defant defined, for any lattice $M$, a map $\mathsf{Pop}_{M}: M \to M$ that sends an element $x\in M$ to the meet of $x$ and the elements…
In this manuscript we show that two partial orders defined on the set of standard Young tableaux of shape $\alpha$ are equivalent. In fact, we give two proofs for the equivalence of the box order and the dominance order for {tableaux}. Both…
A sectionally pseudocomplemented poset P is one which has the top element and in which every principal order filter is a pseudocomplemented poset. The sectional pseudocomplements give rise to an implication-like operation on P which…
This paper is concerned with structures of general graphs with perfect matchings. We first reveal a partially ordered structure among factor-components of general graphs with perfect matchings. Our second result is a generalization of…
We study an alternative model of infinitary term rewriting. Instead of a metric on terms, a partial order on partial terms is employed to formalise convergence of reductions. We consider both a weak and a strong notion of convergence and…
Consider a mapping $f\colon X\to Y$ between two metric measure spaces. We study generalized versions of the local Lipschitz number $\mathrm{Lip} f$, as well as of the distortion number $H_f$ that is used to define quasiconformal mappings.…
Some partial orderings which compare probability distributions with the expo- nential distribution, are found to be very useful to understand the phenomenon of ageing. Here, we introduce some new generalized partial orderings which de-…
We consider an extension of the setting of label ranking, in which the learner is allowed to make predictions in the form of partial instead of total orders. Predictions of that kind are interpreted as a partial abstention: If the learner…
In this paper, we first show that for a countable family of random elements taking values in a partially ordered Polish space (POP), association (both positive and negative) of all finite dimensional marginals implies that of the infinite…
Stankova and West proved in 2002 that the patterns 231 and 312 are shape-Wilf-equivalent. Their proof was nonbijective and fairly complicated. We give a new characterization of 231 and 312 avoiding full rook placements and use this to give…
We propose a new order, the small polynomial path order (sPOP* for short). The order sPOP* provides a characterisation of the class of polynomial time computable function via term rewrite systems. Any polynomial time computable function…
Comparing the ranking of candidates by different voters is an important topic in social and information science with a high relevance from the point of view of practical applications. In general, ties and pairs of incomparable candidates…
This paper is concerned with the automated complexity analysis of term rewrite systems (TRSs for short) and the ramification of these in implicit computational complexity theory (ICC for short). We introduce a novel path order with multiset…
The past years have seen a drastic rise in studies devoted to the investigation of colexification patterns in individual languages families in particular and the languages of the world in specific. Specifically computational studies have…
We establish a general inequality on the Poisson space, yielding an upper bound for the distance in total variation between the law of a regular random variable with values in the integers and a Poisson distribution. Several applications…
We propose and examine two optimal $(0,1)$-matrix completion problems with majorization ordered objectives. They elevate the seminal study by Gale and Ryser from feasibility to optimality in partial order programming (POP), referring to…
In this paper, we study the Wilf-type equivalence relations among multiset permutations. We identify all multiset equivalences among pairs of patterns consisting of a pattern of length three and another pattern of length at most four. To…
We consider positively supported Borel measures for which all moments exist. On the set of compactly supported measures in this class a partial order is defined via eventual dominance of the moment sequences. Special classes are identified…
Orbits of automorphism groups of partially ordered sets are not necessarily congruence classes, i.e. images of an order homomorphism. Based on so-called orbit categories a framework of factorisations and unfoldings is developed that…
The order polytope $\mathcal{O}(P)$ and the chain polytope $\mathcal{C}(P)$ associated to a partially ordered set $P$ are studied. In this paper, we introduce the convex polytope $\Gamma(\mathcal{O}(P), -\mathcal{C}(Q))$ which is the convex…