Related papers: Planar order on vertex poset
A variety is a category of ordered (finitary) algebras presented by inequations between terms. We characterize categories enriched over the category of posets which are equivalent to a variety. This is quite analogous to Lawvere's classical…
The power graph $\mathcal{P}(G)$ is a graph with group elements as vertex set and two elements are adjacent if one is a power of the other. The order supergraph $\mathcal{S}(G)$ of the power graph $\mathcal{P}(G)$ is a graph with vertex set…
We show that weighted path orders are special instances of a variant of semantic path orders. Exploiting this fact, we introduce a generalization of weighted path orders that goes beyond the realm of simple termination. Experimental data…
The present work is dedicated to searching parameters, alternative to entropy, applicable for description of highly organized systems. The general concept has been offered, in which the system complexity and order are functions of the order…
In this paper, we study properties of nodal orders defined over arbitrary base fields. In particular we give a classification of complete real nodal orders.
Let $\mathcal{G}$ be the set of all connected graphs on vertex set $[n]$. Define the partial ordering $<$ on $\mathcal{G}$ as follows: for $G,H\in \mathcal{G}$ let $G<H$ if $E(G)\subset E(H)$. The poset $(\mathcal{G},<)$ is graded, each…
A quotient of a poset $P$ is a partial order obtained on the equivalence classes of an equivalence relation $\theta$ on $P$; $\theta$ is then called a congruence if it satisfies certain conditions, which vary according to different…
We define, for an arbitrary partially ordered set, a multi-variable polynomial generalizing the hook polynomial.
We define a class of partial orders on a Coxeter group associated with sets of reflections. In special cases, these lie between the left weak order and the Bruhat order. We prove that these posets are graded by the length function and that…
We introduce two topological non-$\Sigma$ operad structures on planar line arrangements subject to a certain geometric order condition, ensuring a well-defined notion of particle ordering on a distinguished line. This is interpreted in…
We prove that every finite poset has a directed cut with at least one half of the poset's pairwise order relations. The bound is tight. Also, the largest directed cut in a poset can be found in linear time.
An ordered graph is a graph enhanced with a linear order on the vertex set. An ordered graph is a core if it does not have an order-preserving homomorphism to a proper subgraph. We say that $H$ is the core of $G$ if (i) $H$ is a core, (ii)…
An order-theoretic forest is a countable partial order such that the set of elements larger than any element is linearly ordered. It is an order-theoretic tree if any two elements have an upper-bound. The order type of a branch can be any…
A monotone drawing of a planar graph $G$ is a planar straight-line drawing of $G$ where a monotone path exists between every pair of vertices of $G$ in some direction. Recently monotone drawings of planar graphs have been proposed as a new…
Partially ordered groups, also known as po-groups, are groups with a compatible partial order. Results from M.I. Zajceva and H.-H. Teh are combined in order to provide a full characterisation of linear order extensions of a given order on a…
We characterize the order of principal congruences of a bounded lattice as a bounded ordered set. We also state a number of open problems in this new field.
A linear-interval order is the intersection of a linear order and an interval order. For this class of orders, several structural results have been known. This paper introduces a new subclass of linear-interval orders. We call a partial…
An elegant description of the general form of order automorphisms of effect algebras has been known in the complex case. We present a much simpler proof based on the projective geometry which works also in the real case. As an application…
An {\em ordered $r$-graph} is an $r$-uniform hypergraph whose vertex set is linearly ordered. Given $2\leq k\leq r$, an ordered $r$-graph $H$ is {\em interval} $k$-{\em partite} if there exist at least $k$ disjoint intervals in the ordering…
We prove that the ordered configuration spaces of planar graphs have the highest possible topological complexity generically, as predicted by a conjecture of Farber. Our argument establishes the same generic maximality for all higher…