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

In this note we provide an improved upper bound on the biplanar crossingnumber of the 8-dimensional hypercube. The $k$-planar crossing number of agraph $cr_k(G)$ is the number of crossings required when every edge of $G$ mustbe drawn in one of $k$ distinct planes. It was shown in Czabarka et al. that$cr_2(Q_8) \leq 256$ which we improve to $cr_2(Q_8) \leq 128$. Our approachhighlights the relationship between symmetric drawings and the study of$k$-planar crossing numbers. We conclude with several open questions concerningthis relationship.

New Bounds on the Biplanar Crossing Number of Low-dimensional Hypercubes