Related papers: Representable posets and their order components
We call a poset factorable if its characteristic polynomial has all positive integer roots. Inspired by inductive and divisional freeness of a central hyperplane arrangement, we introduce and study the notion of inductive posets and their…
An ordered semiring is a commutative semiring equipped with a compatible preorder. Ordered semirings generalise both distributive lattices and commutative rings, and provide a convenient framework to unify certain aspects of lattice theory…
A collection of linear orders on $X$, say $\mathcal{L}$, is said to \emph{realize} a partially ordered set (or poset) $\mathcal{P} = (X, \preceq)$ if, for any two distinct $x,y \in X$, $x \preceq y$ if and only if $x \prec_L y$, $\forall L…
The following representation theorem is proven: A partially ordered commutative ring $R$ is a subring of a ring of almost everywhere defined continuous real-valued functions on a compact Hausdorff space $X$ if and only if $R$ is archimedean…
Let $\G$ denote a bipartite distance-regular graph with vertex set $X$ and diameter $D \ge 3$. Fix $x \in X$ and let $L$ (resp. $R$) denote the corresponding lowering (resp. raising) matrix. We show that each $Q$-polynomial structure for…
This paper provides a general characterization of preferences that admit a Richter-Peleg representation without imposing completeness or transitivity. We establish that a binary relation on a nonempty set admits a Richter-Peleg…
We investigate a certain class of posets arising from semilattice actions. Let $S$ be a semilattice with identity. Let $S$ act on a set $C$. For $c,d\in C$ put $c\leq d$ iff there is some $s\in S$ with $ds=c$. Then $(C,\leq)$ is a poset.…
Given a separable nonconstant polynomial $f(x)$ with integer coefficients, we consider the set $S$ consisting of the squarefree parts of all the rational values of $f(x)$, and study its behavior modulo primes. Fixing a prime $p$, we…
We establish a necessary and sufficient condition for a representation of a lattice ordered semigroup to be regular, in the sense that certain extensions are completely positive definite. This result generalizes a theorem due to Brehmer…
In this paper, we study the irreducible representations of skew braces of order \( pq \), which is equivalent to studying the representation theory of groups of order \( p^2q^2 \) arising from skew left braces, where \( p > q \) are primes.…
We propose a matrix approach for generating naturally labeled posets by representing each poset $P$ on the set $[n]$ as a Boolean poset matrix $A$. This algebraic representation enables a systematic handling of partial orderings through…
For any two finite posets $P$ and $Q$, let $\Hom(P,Q)$ be the hom-poset consisting of all order preserving maps from $P$ to $Q$, and $J(Q)$ the collection of all order ideals of $Q$. In this paper, we study some basic properties of the…
If $S,T$ are stationary subsets of a regular uncountable cardinal $\kappa$, we say that $S$ reflects fully in $T$, $S<T$, if for almost all $\alpha \in T$ (except a nonstationary set) $S \cap \alpha$ is stationary in $\alpha .$ This…
A partial order $\prec$ on $[n]$ is naturally labelled (NL) if $x\prec y$ implies $x<y$. We establish a bijection between {3, 2+2}-free NL posets and 12-34-avoiding permutations, determine functional equations satisfied by their generating…
Starting from the data of an arbor, which is a rooted tree with vertices decorated by disjoint sets, we introduce a lattice polytope and a partial order on its lattice points. We give recursive algorithms for various classical invariants of…
Birkhoff's representation theorem (Birkhoff, 1937) defines a bijection between elements of a distributive lattice and the family of upper sets of an associated poset. Although not used explicitly, this result is at the backbone of the…
We define a partial order $\mathcal{P}_n$ on permutations of any given size $n$, which is the image of a natural partial order on inversion sequences. We call this the ``middle order''. We demonstrate that the poset $\mathcal{P}_n$ refines…
We consider complete lattices equipped with preorderings indexed by the ordinals less than a given (limit) ordinal subject to certain axioms. These structures, called stratified complete lattices, and weakly monotone functions over them,…
Consider a convex set S defined by a matrix inequality of polynomials or rational functions over a domain. The set S is called semidefinite programming (SDP) representable or just semidefinite representable if it equals the projection of a…
Motivated by recent advances in solution methods for mixed-integer convex optimization (MICP), we study the fundamental and open question of which sets can be represented exactly as feasible regions of MICP problems. We establish several…