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

A family $\cF\subseteq 2^{[n]}$ of sets is said to be $l$-trace $k$-Spernerif for any $l$-subset $L \subset [n]$ the family $\cF|_L=\{F|_L:F \in \cF\}=\{F\cap L: F \in \cF\}$ is $k$-Sperner, i.e. does not contain any chain of length$k+1$. The maximum size that an $l$-trace $k$-Sperner family $\cF \subseteq2^{[n]}$ can have is denoted by $f(n,k,l)$. For pairs of integers $l<k$, if ina family $\cG$ every pair of sets satisfies $||G_1|-|G_2||<k-l$, then $\cG$possesses the $(n-l)$-trace $k$-Sperner property. Among such families, thelargest one is $\cF_0=\{F\in 2^{[n]}: \lfloor \frac{n-(k-l)}{2}\rfloor+1 \le|F| \le \lfloor \frac{n-(k-l)}{2}\rfloor +k-l\}$ and also $\cF'_0=\{F\in2^{[n]}: \lfloor \frac{n-(k-l)}{2}\rfloor \le |F| \le \lfloor\frac{n-(k-l)}{2}\rfloor +k-l-1\}$ if $n-(k-l)$ is even. In an earlier paper,we proved that this is asymptotically optimal for all pair of integers $l<k$,i.e. $f(n,k,n-l)=(1+o(1))|\cF_0|$. In this paper we consider the case when$l=1$, $k\ge 2$, and prove that $f(n,k,n-1)=|\cF_0|$ provided $n$ is largeenough. We also prove that the unique $(n-1)$-trace $k$-Sperner family withsize $f(n,k,n-1)$ is $\cF_0$ and also $\cF'_0$ when $n+k$ is odd.

Families that remain $k$-Sperner even after omitting an element of their ground set