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

Global: Zendy Free Plan

Global: Zendy Tools monthly

Global: Zendy Plus monthly

Given a finite covering of graphs, it is not always the case thatis spanned by lifts of primitive elements of. In this article, we study graphs for which this is not the case, and we give here the simplest known nontrivial examples of covers with this property, with covering degree as small as 128. Our first step is focusing our attention on the special class of graph covers where the deck group is a finite  p -group. For such covers, there is a representation-theoretic criterion for identifying deck groups for which there exist covers with the property. We present an algorithm for determining if a finite  p -group satisfies this criterion that uses only the character table of the group. Finally, we provide a complete census of all finite  p -groups of rankand order &lt; 1000 satisfying this criterion, all of which are new examples.

Graph Coverings and (Im)primitive Homology: Examples of Low Degree