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

We show that the set of homomorphisms between two supersolvable groups can belocally list decoded up to the minimum distance of the code, extending theresults of Dinur et al who studied the case where the groups are abelian.Moreover, when specialized to the abelian case, our proof is more streamlinedand gives a better constant in the exponent of the list size. The constant isimproved from about 3.5 million to 105.

List decoding group homomorphisms between supersolvable groups