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

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 monthly

Global: Zendy Plus monthly

Presents the access of premium content as premium feature

Premium Content

Global: Zendy Plus annual

Global: Zendy Free Plan

Given a cubic equation $x_1y_1z_1+x_2y_2z_2+\cdots +x_ny_nz_n=b$ over a finite field, it is necessary to determine the minimal number of systems of linear equations over the same field such that the union of their solutions exactly coincides with the set of solutions of the initial equation. The problem is solved for arbitrary size of the field. A covering with almost minimum complexity is constructed.

On Coset Coverings of Solutions of Homogeneous Cubic Equations over Finite Fields