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

An algorithm to give an explicit description of all the solutions to anytropical linear system $A\odot x=B\odot x$ is presented. The given system isconverted into a finite (rather small) number $p$ of pairs $(S,T)$ of classicallinear systems: a system $S$ of equations and a system $T$ of inequalities. Thenotion, introduced here, that makes $p$ small, is called compatibility. Theparticular feature of both $S$ and $T$ is that each item (equation orinequality) is bivariate, i.e., it involves exactly two variables; one variablewith coefficient $1$, and the other one with $-1$. $S$ is solved by Gaussianelimination. We explain how to solve $T$ by a method similar to Gaussianelimination. To achieve this, we introduce the notion of sub--special matrix.The procedure applied to $T$ is, therefore, called sub--specialization.

An algorithm to describe the solution set of any tropical linear system $A\odot x=B\odot x$