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

One of the biggest open problems in computational algebra is the design ofefficient algorithms for Gr{\"o}bner basis computations that take into accountthe sparsity of the input polynomials. We can perform such computations in thecase of unmixed polynomial systems, that is systems with polynomials having thesame support, using the approach of Faug{\`e}re, Spaenlehauer, and Svartz[ISSAC'14]. We present two algorithms for sparse Gr{\"o}bner bases computationsfor mixed systems. The first one computes with mixed sparse systems andexploits the supports of the polynomials. Under regularity assumptions, itperforms no reductions to zero. For mixed, square, and 0-dimensionalmultihomogeneous polynomial systems, we present a dedicated, and potentiallymore efficient, algorithm that exploits different algebraic properties thatperforms no reduction to zero. We give an explicit bound for the maximal degreeappearing in the computations.

Towards Mixed Gr{\"o}bner Basis Algorithms: the Multihomogeneous and Sparse Case