Results 21 to 30 of about 908,506 (166)
Oracle-supported drawing of the Gröbner escalier
The aim of this note is to discuss the following quite queer problem: to compute the Gröbner basis of an ideal I w.r.t. a term-ordering ≺ without knowing neither the ideal nor the term-ordering but only a degree bound of the required Gröbner basis, being
Maria Emilia Alonso +2 more
doaj +1 more source
Chiral rings, Futaki invariants, plethystics, and Gröbner bases
We study chiral rings of 4d N $$ \mathcal{N} $$ = 1 supersymmetric gauge theories via the notion of K-stability. We show that when using Hilbert series to perform the computations of Futaki invariants, it is not enough to only include the test symmetry ...
Jiakang Bao, Yang-Hui He, Yan Xiao
doaj +1 more source
In this paper, we introduce the notion of “dynamical Gröbner bases” of polynomial ideals over a principal ring. As application, we solve dynamically a fundamental algorithmic question in the theory of multivariate polynomials over the integers called ...
Yengui, Ihsen
core +1 more source
An alternative approach to comprehensive Gröbner bases [PDF]
We give an alternative definition of comprehensive Gröbner bases in terms of Gröbner bases in polynomial rings over commutative Von Neumann regular rings.
Suzuki, Akira, Sato, Yosuke
core +1 more source
An Algebraic Approach to Identifiability
This paper addresses the problem of identifiability of nonlinear polynomial state-space systems. Such systems have already been studied via the input-output equations, a description that, in general, requires differential algebra.
Daniel Gerbet, Klaus Röbenack
doaj +1 more source
Fundamentos y Aplicaciones de las Bases de Gröbner en la Resolución de Ecuaciones Polinomiales
Este artículo de revisión examina investigaciones sobre las bases de Gröbner aplicadas a sistemas de ecuaciones polinomiales, con el objetivo de presentar una revisión exhaustiva de sus aplicaciones en la resolución de estos sistemas.
Zayda Julissa Blandón-Chavarría +2 more
doaj +1 more source
Some algorithms for singularity theory and algebraic geometry The use of Grobner basis computations for treating systems of polynomial equations has become an important tool in many areas.
Hans Schonemann
doaj
Elevating PGBMain algorithm performance through strategic minimal Dickson basis selection [PDF]
In this paper, we enhance the PGBMain algorithm, an efficient method for computing Gröbner bases of parametric polynomial ideals, or Gröbner systems. A key step in the PGBMain algorithm involves computing a minimal Dickson basis in each iteration, which ...
Mahdi Dehghani Darmian
doaj +1 more source
Geometric vertex decomposition and liaison
Geometric vertex decomposition and liaison are two frameworks that have been used to produce similar results about similar families of algebraic varieties. In this paper, we establish an explicit connection between these approaches.
Patricia Klein, Jenna Rajchgot
doaj +1 more source
Non-commutative Gröbner Bases and Applications [PDF]
Commutative Gröbner bases have a lot of applications in theory and practice, because they have many nice properties, they are computable, and there exist many efficient improvements of their computations.
Xiu, Xingqiang
core +2 more sources

