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 chain of groupswe may form the corresponding chain of their representation rings, together with induction and restriction operators. Letdenote the operator which restricts down  l  steps, and similarly forObserve thatis an operator from any particular representation ring to itself. We provide explicit rigid constraints that a group of chain with surjective restriction operators satisfying the polynomial property must obey. The central question that this paper addresses is: “What happens if theoperator is a polynomial in theoperator?” It is well known that chains of wreath productshave this property. In this paper, we deduce rigid numerical constraints any arbitrary chains of groups with surjective restriction operator and the aforementioned polynomial property must satisfy. These polynomials can be obtained from the orders of the groups, and are uniquely parametrized by two integers. We deduce the desired parametrization from deducing character theoretic properties of group chains with the desired polynomials.

Polynomial relations between operators on chains of representation rings