English
Related papers

Related papers: Dimension bounds on classes of interval orders wit…

200 papers

Rabinovitch showed in 1978 that the interval orders having a representation consisting of only closed unit intervals have order dimension at most 3. This article shows that the same dimension bound applies to two other classes of posets:…

Combinatorics · Mathematics 2022-01-05 Mitchel T. Keller , Ann N. Trenk , Stephen J. Young

We study poset limits given by sequences of finite interval orders or, as a special case, finite semiorders. In the interval order case, we show that every such limit can be represented by a probability measure on the space of closed…

Combinatorics · Mathematics 2011-04-08 Svante Janson

A poset $P = (X,\prec)$ has an interval representation if each $x \in X$ can be assigned a real interval $I_x$ so that $x \prec y$ in $P$ if and only if $I_x$ lies completely to the left of $I_y$. Such orders are called \emph{interval…

Combinatorics · Mathematics 2017-07-26 Simona Boyadzhiyska , Garth Isaak , Ann N Trenk

A poset $P= (X, \prec)$ has an interval representation if each $x \in X$ can be assigned a real interval $I_x$ so that $x \prec y$ in $P$ if and only if $I_x$ lies completely to the left of $I_y$. Such orders are called \emph{interval…

Combinatorics · Mathematics 2018-04-11 Simona Boyadzhiyska , Garth Isaak , Ann Trenk

Dimension is a standard and well-studied measure of complexity of posets. Recent research has provided many new upper bounds on the dimension for various structurally restricted classes of posets. Bounded dimension gives a succinct…

Combinatorics · Mathematics 2017-05-26 William T. Trotter , Bartosz Walczak

The interval poset of a permutation catalogues the intervals that appear in its one-line notation, according to set inclusion. We study this poset, describing its structural, characterizing, and enumerative properties.

Combinatorics · Mathematics 2021-09-01 Bridget Eileen Tenner

In a recent study by Tenner, the concept of the interval poset of a permutation was introduced to effectively represent all intervals and their inclusions within a permutation. In this paper, we present a new geometric viewpoint on interval…

Combinatorics · Mathematics 2025-09-30 Eli Bagno , Estrella Eisenberg , Shulamit Reches , Moriha Sigron

The interval poset of a permutation is the set of intervals of a permutation, ordered with respect to inclusion. It has been introduced and studied recently in [B. Tenner, arXiv:2007.06142]. We study this poset from the perspective of the…

Combinatorics · Mathematics 2024-06-11 Mathilde Bouvel , Lapo Cioni , Benjamin Izart

The dimension is a key measure of complexity of partially ordered sets. Small dimension allows succinct encoding. Indeed if $P$ has dimension $d$, then to know whether $x \leq y$ in $P$ it is enough to check whether $x\leq y$ in each of the…

Combinatorics · Mathematics 2019-12-12 Stefan Felsner , Tamás Mészáros , Piotr Micek

A poset $P = (X,\prec)$ is a unit OC interval order if there exists a representation that assigns an open or closed real interval $I(x)$ of unit length to each $x \in P$ so that $x \prec y$ in $P$ precisely when each point of $I(x)$ is less…

Combinatorics · Mathematics 2015-01-27 Alan Shuchat , Randy Shull , Ann Trenk

In this paper we combine ideas from tolerance orders with recent work on OC interval orders. We consider representations of posets by unit intervals $I_v$ in which the interval endpoints ($L(v)$ and $R(v)$) may be open or closed as well as…

Combinatorics · Mathematics 2017-07-26 Alan Shuchat , Randy Shull , Ann N Trenk

The Interval poset of a permutation is an effective way of capturing all the intervals of the permutation and the inclusions between them and was introduced recently by Tenner. Thi paper explores the geometric interpretation of interval…

Discrete Mathematics · Computer Science 2024-06-25 Eli Bagno , Estrella Eisenberg , Shulamit Reches , Moriah Sigron

The interval count problem, a classical question in the study of interval orders, was introduced by Ronald Graham in the 1980s. This problem asks: given an interval order $P$, what is the minimum number of distinct interval lengths required…

Combinatorics · Mathematics 2024-11-19 Csaba Biró , André E. Kézdy , Jenő Lehel

We consider the dimensions of finite type of representations of a partially ordered set, i.e. such that there is only finitely many isomorphism classes of representations of this dimension. We give a criterion for a dimension to be of…

Representation Theory · Mathematics 2012-01-24 Yuriy A. Drozd , Eugene A. Kubichka

For a finite partially ordered set we calculate the dimension of the variety of its subspace representations having fixed dimension vector. The dimension is given in terms of the Euler quadratic form associated with a partially ordered set,…

Representation Theory · Mathematics 2019-02-27 Claudia Cavalcante Fonseca , Kostiantyn Iusenko

The dimension of a partially ordered set $P$ (poset for short) is the least positive integer $d$ such that $P$ is isomorphic to a subposet of $\mathbb{R}^d$ with the natural product order. Dimension is arguably the most widely studied…

Combinatorics · Mathematics 2025-12-19 Heather Smith Blake , Jędrzej Hodor , Piotr Micek , Michał T. Seweryn , William T. Trotter

The weak Bruhat order on $ { \mathcal S }_n $ is the partial order $\prec$ so that $\sigma \prec \tau$ whenever the set of inversions of $\sigma$ is a subset of the set of inversions of $\tau$. We investigate the time complexity of…

Combinatorics · Mathematics 2015-07-03 Joshua Cooper , Anna Kirkpatrick

We give an attempt to build a classification of planar integral point sets. For two obtained classes, we provide general constructions of upper bounds for minimal diameter of integral point sets in higher dimensions of certain cardinality.…

Combinatorics · Mathematics 2021-11-23 N. N. Avdeev , R. E. Zvolinsky , E. A. Momot

We study two constructions related to the intervals of finite posets. The first one is a poset. The second one is more complicated. Loosely speaking it can be seen as a poset with some extra zero-relations. As main result, we show that…

Combinatorics · Mathematics 2018-01-17 Frederic Chapoton , Sefi Ladkani , Baptiste Rognerud

S.Janson [Poset limits and exchangeable random posets, Combinatorica 31 (2011), 529--563] defined limits of finite posets in parallel to the emerging theory of limits of dense graphs. We prove that each poset limit can be represented as a…

Combinatorics · Mathematics 2013-11-05 Jan Hladky , Andras Mathe , Viresh Patel , Oleg Pikhurko
‹ Prev 1 2 3 10 Next ›