English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

An \emph{$n$-cube antichain} is a subset of the unit $n$-cube $[0,1]^n$ thatdoes not contain two elements $\mathbf{x}=(x_1, x_2,\ldots, x_n)$ and$\mathbf{y}=(y_1, y_2,\ldots, y_n)$ satisfying $x_i\le y_i$ for all $i\in\{1,\ldots,n\}$. Using a chain partition of an adequate finite poset we showthat the Hausdorff dimension of an $n$-cube antichain is at most $n-1$.Weconjecture that the $(n-1)$-dimensional Hausdorff measure of an $n$-cubeantichain is at most $n$ times the Hausdorff measure of a facet of the unit$n$-cube and we verify this conjecture for $n=2$ as well as under theassumption that the $n$-cube antichain is a smooth surface. Our proofs employestimates on the Hausdorff measure of an $n$-cube antichain in terms of the sumof the Hausdorff measures of its injective projections. Moreover, by proceedingalong devil's staircase, we construct a $2$-cube antichain whose$1$-dimensional Hausdorff measure equals $2$. Additionally, we discuss aproblem with an intersection condition in a similar setting.

A fractal perspective on optimal antichains and intersecting subsets of the unit $n$-cube