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

Let $\mathbb{K}[x_1, \dots, x_n]$ be a multivariate polynomial ring over afield $\mathbb{K}$. Let $(u_1, \dots, u_n)$ be a sequence of $n$ algebraicallyindependent elements in $\mathbb{K}[x_1, \dots, x_n]$. Given a polynomial $f$in $\mathbb{K}[u_1, \dots, u_n]$, a subring of $\mathbb{K}[x_1, \dots, x_n]$generated by the $u_i$'s, we are interested infinding the unique polynomial$f_{\rm new}$ in $\mathbb{K}[e_1,\dots, e_n]$, where $e_1, \dots, e_n$ are newvariables, such that $f_{\mathrm{new}}(u_1, \dots, u_n) = f(x_1, \dots, x_n)$.We provide an algorithm and analyze its arithmetic complexity to compute$f_{\mathrm{new}}$ knowing $f$ and $(u_1, \dots, u_n)$.

On the complexity of invariant polynomials under the action of finite reflection groups