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

For a finite lattice $L$, let Gm($L$) denote the least $n$ such that $L$ canbe generated by $n$ elements. For integers $r>2$ and $k>1$, denote by FD$(r)^k$the $k$-th direct power of the free distributive lattice FD($r$) on $r$generators. We determine Gm(FD$(r)^k$) for many pairs $(r,k)$ either exactly orwith good accuracy by giving a lower estimate that becomes an upper estimate ifwe increase it by 1. For example, for $(r,k)=(5,25\,000)$ and $(r,k)=(20,\1.489\cdot 10^{1789})$, Gm(FD$(r)^k$) is $300$ and $6000$, respectively. Toreach our goal, we give estimates for the maximum number of pairwise unrelatedcopies of some specific posets (called full segment posets) in the subsetlattice of an $n$-element set. In addition to analogous earlier results inlattice theory, a connection with cryptology is also mentioned among themotivations.

Minimum-sized generating sets of the direct powers of free distributive lattices