On the order dimension of 1-sets versus k-sets

Research output: Contribution to journalArticle

15 Citations (Scopus)

Abstract

A family F of s-subsets of [t] is a (θ, s, t)-family iff the intersection of any two distinct elements of F has cardinality less than θ. Let f(θ, s, t) be the greatest integer n such that there exists an (θ, s, t)-family of cardinality n. Let dim(1, k; n) denote the dimension of Bn(1, k), the suborder of the Boolean lattice on [n] consisting of 1-subsets and k-subsets of [n]. We use upper and lower bounds on f(θ, s, t) to derive new lower and upper bounds on dim(1, k; n). In particular we answer a question of Trotter by showing that dim(1, log n; n) = Ω(log3 n/log log n). The estimation of dim(1, log n; n) plays a critical role in the determination of the maximum dimension of an ordered set with fixed maximum degree. Previously it was only known that (log2 n/4 < dim(1, log n; n) <log3 n.

Original languageEnglish (US)
Pages (from-to)219-228
Number of pages10
JournalJournal of Combinatorial Theory. Series A
Volume73
Issue number2
StatePublished - 1996

Fingerprint

Order Dimension
Boolean algebra
Set theory
Subset
Upper and Lower Bounds
Cardinality
Boolean Lattice
Ordered Set
Maximum Degree
Intersection
Denote
Distinct
Integer
Family

ASJC Scopus subject areas

  • Discrete Mathematics and Combinatorics
  • Theoretical Computer Science

Cite this

On the order dimension of 1-sets versus k-sets. / Kierstead, Henry.

In: Journal of Combinatorial Theory. Series A, Vol. 73, No. 2, 1996, p. 219-228.

Research output: Contribution to journalArticle

@article{0d640fc9e4b74870b9833b57d3fd40a4,
title = "On the order dimension of 1-sets versus k-sets",
abstract = "A family F of s-subsets of [t] is a (θ, s, t)-family iff the intersection of any two distinct elements of F has cardinality less than θ. Let f(θ, s, t) be the greatest integer n such that there exists an (θ, s, t)-family of cardinality n. Let dim(1, k; n) denote the dimension of Bn(1, k), the suborder of the Boolean lattice on [n] consisting of 1-subsets and k-subsets of [n]. We use upper and lower bounds on f(θ, s, t) to derive new lower and upper bounds on dim(1, k; n). In particular we answer a question of Trotter by showing that dim(1, log n; n) = Ω(log3 n/log log n). The estimation of dim(1, log n; n) plays a critical role in the determination of the maximum dimension of an ordered set with fixed maximum degree. Previously it was only known that (log2 n/4 < dim(1, log n; n) 3 n.",
author = "Henry Kierstead",
year = "1996",
language = "English (US)",
volume = "73",
pages = "219--228",
journal = "Journal of Combinatorial Theory - Series A",
issn = "0097-3165",
publisher = "Academic Press Inc.",
number = "2",

}

TY - JOUR

T1 - On the order dimension of 1-sets versus k-sets

AU - Kierstead, Henry

PY - 1996

Y1 - 1996

N2 - A family F of s-subsets of [t] is a (θ, s, t)-family iff the intersection of any two distinct elements of F has cardinality less than θ. Let f(θ, s, t) be the greatest integer n such that there exists an (θ, s, t)-family of cardinality n. Let dim(1, k; n) denote the dimension of Bn(1, k), the suborder of the Boolean lattice on [n] consisting of 1-subsets and k-subsets of [n]. We use upper and lower bounds on f(θ, s, t) to derive new lower and upper bounds on dim(1, k; n). In particular we answer a question of Trotter by showing that dim(1, log n; n) = Ω(log3 n/log log n). The estimation of dim(1, log n; n) plays a critical role in the determination of the maximum dimension of an ordered set with fixed maximum degree. Previously it was only known that (log2 n/4 < dim(1, log n; n) 3 n.

AB - A family F of s-subsets of [t] is a (θ, s, t)-family iff the intersection of any two distinct elements of F has cardinality less than θ. Let f(θ, s, t) be the greatest integer n such that there exists an (θ, s, t)-family of cardinality n. Let dim(1, k; n) denote the dimension of Bn(1, k), the suborder of the Boolean lattice on [n] consisting of 1-subsets and k-subsets of [n]. We use upper and lower bounds on f(θ, s, t) to derive new lower and upper bounds on dim(1, k; n). In particular we answer a question of Trotter by showing that dim(1, log n; n) = Ω(log3 n/log log n). The estimation of dim(1, log n; n) plays a critical role in the determination of the maximum dimension of an ordered set with fixed maximum degree. Previously it was only known that (log2 n/4 < dim(1, log n; n) 3 n.

UR - http://www.scopus.com/inward/record.url?scp=0042479214&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0042479214&partnerID=8YFLogxK

M3 - Article

VL - 73

SP - 219

EP - 228

JO - Journal of Combinatorial Theory - Series A

JF - Journal of Combinatorial Theory - Series A

SN - 0097-3165

IS - 2

ER -