On the computation of Gröbner bases for matrix-weighted homogeneous systems

02/11/2022
by   Thibaut Verron, et al.
0

In this paper, we examine the structure of systems that are weighted homogeneous for several systems of weights, and how it impacts the computation of Gröbner bases. We present several linear algebra algorithms for computing Gröbner bases for systems with this structure, either directly or by reducing to existing structures. We also present suitable optimization techniques. As an opening towards complexity studies, we discuss potential definitions of regularity and prove that they are generic if non-empty. Finally, we present experimental data from a prototype implementation of the algorithms in SageMath.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/27/2022

New efficient algorithms for computing Gröbner bases of saturation ideals (F4SAT) and colon ideals (Sparse-FGLM-colon)

This paper is concerned with linear algebra based methods for solving ex...
research
02/01/2019

Gröbner Basis over Semigroup Algebras: Algorithms and Applications for Sparse Polynomial Systems

Gröbner bases is one the most powerful tools in algorithmic non-linear a...
research
05/01/2018

Gröbner Bases of Modules and Faugère's F_4 Algorithm in Isabelle/HOL

We present an elegant, generic and extensive formalization of Gröbner ba...
research
05/16/2017

A Tropical F5 algorithm

Let K be a field equipped with a valuation. Tropical varieties over K ca...
research
08/08/2021

Macaulay bases of modules

We define Macaulay bases of modules, which are a common generalization o...
research
03/08/2023

Complexity and scalability of defeasible reasoning in 1 many-valued weighted knowledge bases

Weighted knowledge bases for description logics with typicality under a ...
research
01/04/2017

On the Usability of Probably Approximately Correct Implication Bases

We revisit the notion of probably approximately correct implication base...

Please sign up or login with your details

Forgot password? Click here to reset