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/

Zendy Plus

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

Zendy Tools

Zendy Open

A concept of approximate factorization of multivariate polynomial is introduced and an algorithm for approximate factorization is presented. The algorithm handles polynomials with complex coefficients represented approximately, hence it can be used to test the absolute irreducibility of multivariate polynomials. The algorithm works as follows: given a monic square-free polynomialF(x,y,…,z), it calculates the roots ofF(x,y  o , ...,z 0) numerically, wherey o, … z0 are suitably chosen numbers, then it constructs power series F1, …, Fn such thatF(x,y, …, z) ∈F1 (x,y., ...,z)...F  n (x,y, ...z) (mod Se+2), where n=degx (F),S=(y-y 0, ...,z-z 0), ande=max{degy(F), …, degx (F)}; finally it finds the approximate divisors ofF as products of elements of {F 1, …,F n}.

Approximate factorization of multivariate polynomials and absolute irreducibility testing