Related papers: On better-quasi-ordering classes of partial orders

This paper supplements [17], showing that categorically the layered theory is the same as the theory of ordered monoids (e.g. the max-plus algebra) used in tropical mathematics. A layered theory is developed in the context of categories,…

Generalized trees, we call them O-trees, are defined as hierarchical partial orders, i.e., such that the elements larger than any one are linearly ordered. Quasi-trees are, roughly speaking, undirected O-trees. For O-trees and quasi-trees,…

Let alpha = (a,b,...) be a composition. Consider the associated poset F(alpha), called a fence, whose covering relations are x_1 < x_2 < ... < x_{a+1} > x_{a+2} > ... > x_{a+b+1} < x_{a+b+2} < ... . We study the associated distributive…

The lattice of partitions of a set and its d-divisible generalization have been much studied for their combinatorial, topological, and representation-theoretic properties. An ordered set partition is a set partition where the subsets are…

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…

We combine ideas of Scott and Swarup on good position for almost invariant subsets of a group with ideas of Sageev on constructing cubings from such sets. We construct cubings which are more canonical than in Sageev's original construction.…

A mixed lattice is a partially ordered set with two mixed partial orderings that are linked by asymmetric upper and lower envelopes. These notions generalize the join and meet operations of a lattice. In the present paper, we study…

The main goal of this note is to suggest an algebraic approach to the quasi-isometric classification of partially commutative groups (alias right-angled Artin groups). More precisely, we conjecture that if the partially commutative groups…

Abelian groups having partial orderings compatible with their binary operations have long been studied in the literature. In particular, lattice-ordered abelian groups constitute a universal-algebraic variety, and thus form a category which…

We construct a convergent family of outer approximations for the problem of optimizing polynomial functions over convex bodies subject to polynomial constraints. This is achieved by generalizing the polarization hierarchy, which has…

We prove that the strong immersion order is a well-quasi-ordering on the class of semi-complete digraphs, thereby strengthening a result of Chudnovsky and Seymour that this holds for the class of tournaments.

We introduce the notion of a quasi-matroidal class of ordered simplicial complexes: an approximation to the idea of a matroid cryptomorphism in the landscape of ordered simplicial complexes. A quasi-matroidal class contains pure shifted…

We prove necessary and sufficient conditions on a family of (generalised) gridding matrices to determine when the corresponding permutation classes are partially well-ordered. One direction requires an application of Higman's Theorem and…

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…

Richard P. Stanley conjectured that finite trees can be distinguished by their chromatic symmetric functions. In this paper, we prove an analogous statement for posets: Finite rooted trees can be distinguished by their order quasisymmetric…

We introduce a sequent calculus with a simple restriction of Lambek's product rules that precisely captures the classical Tamari order, i.e., the partial order on fully-bracketed words (equivalently, binary trees) induced by a…

In this paper, we introduce the notions of quasi-triangular and factorizable Poisson bialgebras. A factorizable Poisson bialgebra induces a factorization of the underlying Poisson algebra. We prove that the Drinfeld classical double of a…

This paper examines the characterization and learning of grammars defined with enriched representational models. Model-theoretic approaches to formal language theory traditionally assume that each position in a string belongs to exactly one…

Lattice path matroids form a subclass of transversal matroids and were introduced by Bonin, de Mier and Noy. Transversal matroids are not well-quasi-ordered, even when the branch-width is restricted. Though lattice path matroids are not…

We propose a revised definition of quasi-distributions within the framework of large-momentum effective theory (LaMET) that improves convergence towards the large-momentum limit. Since the definition of quasi-distributions is not unique,…