Related papers: Dimension bounds on classes of interval orders wit…
The Dushnik--Miller dimension of a poset $P$ is the least $d$ for which $P$ can be embedded into a product of $d$ chains. Lewis and Souza showed that the dimension of the divisibility order on the interval of integers $[N/\kappa, N]$ is…
We show that the order dimension of the weak order on a Coxeter group of type A, B or D is equal to the rank of the Coxeter group, and give bounds on the order dimensions for the other finite types. This result arises from a unified…
In order theory, a rank function measures the vertical "level" of a poset element. It is an integer-valued function on a poset which increments with the covering relation, and is only available on a graded poset. Defining a vertical measure…
It has been known for 30 years that posets with bounded height and with cover graphs of bounded maximum degree have bounded dimension. Recently, Streib and Trotter proved that dimension is bounded for posets with bounded height and planar…
The notion of interval order was introduced by Norbert Wiener \cite{wie} in order to clarify the relation between the notion of an instant of time and that of a period of time. This was a problem on which Bertrand Russell \cite{rus} worked…
A variety of possible extensions of mappings between posets to their Dedekind order completion is presented. One of such extensions has recently been used for solving large classes of nonlinear systems of partial differential equations with…
We consider the concept of rank as a measure of the vertical levels and positions of elements of partially ordered sets (posets). We are motivated by the need for algorithmic measures on large, real-world hierarchically-structured data…
We study the reverse mathematics of interval orders. We establish the logical strength of the implications between various definitions of the notion of interval order. We also consider the strength of different versions of the…
We introduce a broad class of equations that are described by a graph, which includes many well-studied systems. For these, we show that the number of solutions (or the dimension of the solution set) can be bounded by studying certain…
For any finite totally ordered set, the multisets of intervals form an abelian category. Various classes of subcategories admit natural combinatorial descriptions, and counting them yields familiar integer sequences. Surprisingly, in some…
The Pareto dominance relation of a preference profile is (the asymmetric part of) a partial order. For any integer n, the problem of the existence of an n-agent preference profile that generates the given Pareto dominance relation is to…
Intermediate dimensions were recently introduced to interpolate between the Hausdorff and box-counting dimensions of fractals. Firstly, we show that these intermediate dimensions may be defined in terms of capacities with respect to certain…
We introduce a continuum of dimensions which are `intermediate' between the familiar Hausdorff and box dimensions. This is done by restricting the families of allowable covers in the definition of Hausdorff dimension by insisting that $|U|…
Let A be a set of integers dense in a finite interval. We establish upper and lower bounds for the longest regularly-spaced and convex subsets of A and of A-A.
In 1981, Kelly showed that planar posets can have arbitrarily large dimension. However, the posets in Kelly's example have bounded Boolean dimension and bounded local dimension, leading naturally to the questions as to whether either…
The intermediate dimensions are a family of dimensions which interpolate between the Hausdorff and box dimensions of sets. We prove a necessary and sufficient condition for a given function $h(\theta)$ to be realized as the intermediate…
We prove that posets of bounded height whose cover graphs belong to a fixed class with bounded expansion have bounded dimension. Bounded expansion, introduced by Ne\v{s}et\v{r}il and Ossona de Mendez as a model for sparsity in graphs, is a…
The aim of the paper is twofold. Firstly, by using the constant rank level set theorem from differential geometry, we establish sharp upper bounds for the dimensions of the solution sets of polynomial variational inequalities under mild…
We introduce a partial order structure on the set of interval orders of a given size, and prove that such a structure is in fact a lattice. We also provide a way to compute meet and join inside this lattice. Finally, we show that, if we…
Order dimension theory measures the complexity of partially ordered sets by quantifying how far they are from being linearly ordered. In this paper we study classical bounding results for order dimension within the framework of reverse…