A note on the dimension of a poset

It is shown that the dimension of a poset is the smallest cardinal number such that there is an embedding of the poset into a strict product of linear orders.     

A counterexample about poset reconstruction

We give a negative answer to two questions of B. Sands related to poset reconstruction.     

The order dimension of multinomial lattices

Using the notion of Ferrers dimension of incidence structures, the order dimension of multi-nomial lattices (i.e. lattices of multi-permutations) is determined. In particular, it is shown that the lattice of all permutations on ann-element set has dimensionn–1.     

Weak orders admitting a perpendicular linear order

Two orders on the same set are perpendicular if the constant maps and the identity map are the only maps preserving both orders. We characterize the finite weak orders admitting a perpendicular linear order.     

On the greedy dimension of a partial order

This paper introduces a new concept of dimension for partially ordered sets. Dushnik and Miller in 1941 introduced the concept of dimension of a partial order P, as the minimum cardinality of a realizer, (i.e., a set of linear extensions of P whose intersection is P). Every poset has a greedy realizer (i.e., a realizer consisting of greedy linear extensions). We begin the study of the notion of greedy dimension of a poset and its relationship with the usual dimension by proving that equality holds for a wide class of posets including N-free posets, two-dimensional posets and distributive lattices.     

Interval dimension and MacNeille completion

Equality between the interval dimensions of a poset and its MacNeille completion, announced in [7], has been obtained by the authors as a byproduct of their study of Galois lattices in [8]. The purpose of this note is to give a direct proof, similar to the classical proof of Baker's result stating that the dimension (in the Dushnik-Miller sense) of a poset and its MacNeille completion are the same.Supported by French PRC Math-Info.     

The dimension of orthomodular posets constructed by pasting Boolean algebras

The main aim of this paper is the calculation of the dimension of certain atomic amalgams. These consist of finite Boolean algebras (blocks) pasted together in such a way that a pair of blocks intersects either trivially in the bounds, or the intersection consists of the bounds, an atom, and its complement.     

Planar graphs and poset dimension

We view the incidence relation of a graph G=(V. E) as an order relation on its vertices and edges, i.e. a<_G b if and only of a is a vertex and b is an edge incident on a. This leads to the definition of the order-dimension of G as the minimum number of total orders on V E whose intersection is <_G. Our main result is the characterization of planar graphs as the graphs whose order-dimension does not exceed three. Strong versions of several known properties of planar graphs are implied by this characterization. These properties include: each planar graph has arboricity at most three and each planar graph has a plane embedding whose edges are straight line segments. A nice feature of this embedding is that the coordinates of the vertices have a purely combinatorial meaning.     

Generalized dimension of an ordered set and its MacNeille completion

We investigate generalizations of the order dimension, as for example the interval dimension, and study the question for which classes the generalized dimension of an ordered set and its MacNeille completion is the same. We present proofs for a number of classes, however disprove a more general conjecture.The second author acknowledges the support by the Deutsche Forschungsgemeinschaft.     

On the connectedness of the complement of the zero-divisor graph of a poset

Abstract

In this paper, connectedness is completely characterized for the complements of the zero-divisor graphs of partially ordered sets. These results are applied to annihilating ideal graphs and intersection graphs of submodules, generalizing some of the work that has recently appeared in the literature.     

The order dimension of two levels of the Boolean lattice

LetB _n(s, t) denote the partially ordered set consisting of alls-subsets andt-subsets of ann-element underlying set where these sets are ordered by inclusion. Answering a question of Trotter we prove that dim(B _n(k, n–k))=n–2 for 3k<(1/7)n ^1/3. The proof uses extremal hypergraph theory.     

A partial order for the set of meanders

In this paper, we present a new approach for studying meanders in terms of noncrossing partitions. We show how this approach leads to a natural partial order on the set of meanders. In particular, meanders form a graded poset with regard to this partial order.     

A chain complete poset with no infinite antichain has a finite core

It is well known that dismantling a finite posetP leads to a retract, called the core ofP, which has the fixed-point property if and only ifP itself has this property. The PT-order, or passing through order, of a posetP is the quasi order defined onP so thatab holds if and only if every maximal chain ofP which passes througha also passes throughb. This leads to a generalization of the dismantling procedure which works for arbitrary chain complete posets which have no infinite antichain. We prove that such a poset also has a finite core, i.e. a finite retract which reflects the fixed-point property forP.This research was written while the first author was visiting the University of Calgary.Research supported by NSERC grant #69-0982.     

The convexity lattice of a poset

The authors investigate the lattice Co(P) of convex subsets of a general partially ordered set P. In particular, they determine the conditions under which Co(P) and Co(Q) are isomorphic; and give necessary and sufficient conditions on a lattice L so that L is isomorphic to Co(P) for some P.     

On the Boolean dimension of spherical orders

It is well known that if a planar order P is bounded, i.e. has only one minimum and one maximum, then the dimension of P (LD(P)) is at most 2, and if we remove the restriction that P has only one maximum then LD(P)3. However, the dimension of a bounded order drawn on the sphere can be arbitrarily large.The Boolean dimension BD(P) of a poset P is the minimum number of linear orders such that the order relation of P can be written as some Boolean combination of the linear orders. We show that the Boolean dimension of bounded spherical orders is never greater than 4, and is not greater than 5 in the case the poset has more than one maximal element, but only one minimum. These results are obtained by a characterization of spherical orders in terms of containment between circular arcs.Part of this work was carried out while both authors were visiting the Department of Applied Mathematics (KAM) of Charles University, Prague. The authors acknowledge support from the EU HCM project DONET.     

The dimension of suborders of the Boolean lattice

We consider the order dimension of suborders of the Boolean latticeB _n . In particular we show that the suborder consisting of the middle two levels ofB _n dimension at most of 6 log₃ n. More generally, we show that the suborder consisting of levelss ands+k ofB _n has dimensionO(k ² logn).The research of the second author was supported by Office of Naval Research Grant N00014-90-J-1206.The research of the third author was supported by Grant 93-011-1486 of the Russian Fundamental Research Foundation.     

The dimension of interior levels of the Boolean lattice

LetP(k,r;n) denote the containment order generated by thek-element andr-element subsets of ann-element set, and letd(k,r;n) be its dimension. Previous research in this area has focused on the casek=1.P(1,n–1;n) is the standard example of ann-dimensional poset, and Dushnik determined the value ofd(1,r;n) exactly, whenr2 . Spencer used the Erdös-Szekeres theorem to show thatd(1, 2;n) lg lgn, and he used the concept of scrambling families of sets to show thatd(1,r;n)=(lg lgn) for fixedr. Füredi, Hajnal, Rödl and Trotter proved thatd(1, 2;n)=lg lgn+(1/2+o(1))lg lg lgn. In this paper, we concentrate on the casek2. We show thatP(2,n–2;n) is (n–1)-irreducible, and we investigated(2,r;n) whenr2 , obtaining the exact value for almost allr.The research was supported in part by NSF grant DMS 9201467.The research was supported in part by the Universities in Russia program.     

The poset on connected induced subgraphs of a graph need not be Sperner

SupposeG is a finite connected graph. LetC(G) denote the inclusion ordering on the connected vertex-induced subgraphs ofG. Penrice asked whetherC(G) is Sperner for general graphsG. Answering Penrice's question in the negative, we present a treeT such thatC(T) is not Sperner. We also construct a related distributive lattice that is not Sperner.