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 Tools annual

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 Tools monthly

Global: Zendy Plus monthly

Presents the access of premium content as premium feature

Premium Content

Global: Zendy Plus annual

Global: Zendy Free Plan

An $r$-identifying code on a graph $G$ is a set $C\subset V(G)$ such that forevery vertex in $V(G)$, the intersection of the radius-$r$ closed neighborhoodwith $C$ is nonempty and different. Here, we provide an overview on codes forthe $n$-dimensional lattice, discussing the case of 1-identifying codes,constructing a sparse code for the 4-dimensional lattice as well as showingthat for fixed $n$, the minimum density of an $r$-identifying code is$\Theta(1/r^{n-1})$.

Vertex identifying codes for the n-dimensional lattice