Projection inequalities for antichains

Link:
Autor/in:
Erscheinungsjahr:
2020
Medientyp:
Text
Schlagworte:
  • Intersecting Family
  • Extremal Set Theory
  • Ramsey Number
  • Graph In Graph Theory
  • Coloring
  • Graphic Methods
  • Intersecting Family
  • Extremal Set Theory
  • Ramsey Number
  • Graph In Graph Theory
  • Coloring
  • Graphic Methods
Beschreibung:
  • Let n be an integer with n ≥ 2. A set A ⊆ ℝn is called an antichain (resp. weak antichain) if it does not contain two distinct elements x = (x1, …, xn) and y = (y1, …, yn) satisfying xiyi (resp. xi < yi) for all i ∈ {1, …, n}. We show that the Hausdorff dimension of a weak antichain A in the n-dimensional unit cube [0, 1]n is at most n − 1 and that the (n − 1)-dimensional Hausdorff measure of A is at most n, which are the best possible bounds. This result is derived as a corollary of the following projection inequality, which may be of independent interest: The (n −1)- dimensional Hausdorff measure of a (weak) antichain A ⊆ [0, 1]n cannot exceed the sum of the (n − 1)-dimensional Hausdorff measures of the n orthogonal projections of A onto the facets of the unit n-cube containing the origin. For the proof of this result we establish a discrete variant of the projection inequality applicable to weak antichains in ℤn and combine it with ideas from geometric measure theory.
Lizenz:
  • info:eu-repo/semantics/closedAccess
Quellsystem:
Forschungsinformationssystem der UHH

Interne Metadaten
Quelldatensatz
oai:www.edit.fis.uni-hamburg.de:publications/d2d67c45-aa81-4fe2-b155-efa84bd816dc