相关论文: From well-quasi-ordered sets to better-quasi-order…

We introduce two polynomials (in $q$) associated with a finite poset $P$ that encode some information on the covering relation in $P$. If $P$ is a distributive lattice, and hence $P$ is isomorphic to the poset of dual order ideals in a…

A causal set is a countably infinite poset in which every element is above finitely many others; causal sets are exactly the posets that have a linear extension with the order-type of the natural numbers -- we call such a linear extension a…

We associate in a natural way to any partially ordered set $(P,\leq)$ a directed graph $E_P$ (where the vertices of $E_P$ correspond to the elements of $P$, and the edges of $E_P$ correspond to related pairs of elements of $P$), and then…

We conduct a condition number analysis of a Hybrid High-Order (HHO) scheme for the Poisson problem. We find the condition number of the statically condensed system to be independent of the number of faces in each element, or the relative…

We study systems of orientations on triples that satisfy the following so-called interiority condition: $\circlearrowleft(ABD)=~\circlearrowleft(BCD)=~\circlearrowleft(CAD)=1$ implies $\circlearrowleft(ABC)=1$ for any $A,B,C,D$. We call…

The concept of the order parameter is extremely useful in physics. Here, I discuss extensions of this concept to cases when the order parameter is no longer a constant but fluctuates or oscillates in space and time. This allows one to…

For a given subset $A\subseteq \mathbb F_q^*$, we study the problem of finding a large packing set $B$ of $A$, that is, a set $B \subseteq \mathbb F_q^*$ such that $|AB|=|A||B|$. We prove the existence of such a $B$ of size $|B|\ge…

The problem of lifting a preference order on a set of objects to a preference order on a family of subsets of this set is a fundamental problem with a wide variety of applications in AI. The process is often guided by axioms postulating…

For any finite poset $P$ we have the poset of isotone maps $\text{Hom}(P,\mathbb{N})$, also called $P^{op}$-partitions. To any poset ideal ${\mathcal J}$ in $\text{Hom}(P,\mathbb{N})$, finite or infinite, we associate monomial ideals: the…

A balanced pair in a finite ordered set $P=(V,\leq)$ is a pair $(x,y)$ of elements of $V$ such that the proportion of linear extensions of $P$ that put $x$ before $y$ is in the real interval $[1/3, 2/3]$. We prove that every finite $N$-free…

We show that the order complex of intervals of a poset, ordered by inclusion, is a Tchebyshev triangulation of the order complex of the original poset. Besides studying the properties of this transformation, we show that the dual of the…

We consider a very weak chain condition for a poset, that is the absence of subsets which are order isomorphic to the set of real numbers in their natural ordering; we study generalised radical groups in which this finiteness condition is…

Partially ordered sets (posets) play a universal role as an abstract structure in many areas of mathematics. For finite posets, an explicit enumeration of distinct partial orders on a set of unlabelled elements is known only up to a…

A Peskun ordering between two samplers, implying a dominance of one over the other, is known among the Markov chain Monte Carlo community for being a remarkably strong result. It is however also known for being a result that is notably…

A poset ${\mathbb{P}}$ is called reversible iff every bijective homomorphism $f:{\mathbb{P}} \rightarrow {\mathbb{P}}$ is an automorphism. Let ${\mathcal{W}}$ and ${\mathcal{W}} ^*$ denote the classes of well orders and their inverses…

We propose a new method for constructing Turing ideals satisfying principles of reverse mathematics below the Chain-Antichain Principle (CAC). Using this method, we are able to prove several new separations in the presence of Weak Konig's…

In this paper we consider the question of well quasi-order for classes defined by a single obstruction within the classes of all graphs, digraphs and tournaments, under the homomorphic image ordering (in both its standard and strong forms).…

We establish that every second countable completely regularly preordered space (E,T,\leq) is quasi-pseudo-metrizable, in the sense that there is a quasi-pseudo-metric p on E for which the pseudo-metric p\veep^-1 induces T and the graph of…

The partition problem is a well-known basic NP-complete problem. We mainly consider the optimization version of it in this paper. The problem has been investigated from various perspectives for a long time and can be solved efficiently in…

We introduce partially ordered sets (posets) with an additional structure given by a collection of vector subspaces of an algebra $A$. We call them algebraically equipped posets. Some particular cases of these, are generalized equipped…