All Questions
Tagged with groebner-bases computer-algebra
21 questions
1
vote
0
answers
41
views
Example polynomial system where Macaulay bound is tight
I have been solving systems of polynomial equations by forming the Macaulay matrix of different degrees and computing its null space. If the degree is large enough, namely at or above the degree of ...
- 11
2
votes
1
answer
130
views
Efficiency of Groebner basis for constraints of the form $(a_i x_i+b_i)(a_j x_j+b_j)$
This is based on numerical experiments in sage.
Let $K$ be a ring and define the ideal where each polynomial
is of the form $(a_i x_i+b_i)(a_j x_j+b_j)$ for constant $a_i,b_i,a_j,b_j$.
Q1 Is it true ...
- 25.4k
2
votes
0
answers
88
views
Gröbner implicitization with relationships between the variables
I have the following parametric equations, where cost$=\cos t$, cos2t$=\cos 2t$, and $A^2+B^2=1$:
...
- 2,560
0
votes
1
answer
213
views
Grobner basis of a submodule of a free module over polynomial ring
Let $A=\mathbb{Q} [x_1,\dots,x_n]$ be the ring of polynomials with rational coefficients. Let $T$ be an $m\times n$ matrix with entries from $A$. Consider it as a morphism of $A$-modules $T\colon A^n\...
- 21.8k
1
vote
0
answers
259
views
Computer algebra programs that can solve polynomial systems on algebraically closed fields besides MAGMA
I was wondering which computer algebra programs out there can solve polynomial systems on the algebraic closure of $\mathbb{Q}$ analytically and efficiently.
So far, I only found MAGMA with its ...
- 21
4
votes
0
answers
122
views
Recommendations for distributed calculations of Groebner Bases
There are many computer algebra systems available which can compute a Groebner basis, including:
Mathematica
Singular
Macaulay2
Magma
Maple
CoCoA
However (please correct me if I've missed something) ...
- 61
2
votes
1
answer
668
views
Efficiently computing Gröbner basis to prove no solution to polynomial constraints
In a similar vein to these now quite old questions on advice for calculating a Gröbner basis:
Fast computation of a Groebner basis. What is possible?
What is the state of art in Groebner bases
I am ...
- 21
21
votes
5
answers
6k
views
Fast computation of a Groebner basis. What is possible?
I need to compute a Groebner basis of 18 polynomials in 19 variables the terms of which have degree at most 3. My aim is to exploit a symmetry in a PDE problem and I am not an expert in algebra or ...
- 1,256
1
vote
1
answer
174
views
Sufficient syntactic conditions for zero-dimensionality of polynomial systems
Consider a system $S$ of polynomial equations, $p_1=0,...,p_m=0$, for $p_i\in K[x_1,...,x_n]$, for a field $K$: the system $S$ is zero-dimensional if it has finitely many solutions. It is well-known ...
- 333
28
votes
4
answers
3k
views
Can Gröbner bases be used to compute solutions to large, real-world problems?
In particular, suppose I have an affine algebraic variety over $\mathbb{R}^n$ described by generators of a radical ideal $I$ and I want to find (perhaps not all of the) points in the variety. Several ...
- 3,059
16
votes
2
answers
721
views
From polynomial ideal over $\mathbb{Q}$ to polynomial ideal over $\mathbb{Z}$
Is there an algorithm to compute, given a polynomial ideal $I\subset \mathbb{Q}[x_1,\dotsc,x_n]$, the ideal $I\cap \mathbb{Z}[x_1,\dotsc,x_n]$ in $\mathbb{Z}[x_1,\dotsc,x_n]$?
The input and output ...
- 7,836
8
votes
2
answers
592
views
Solving the field membership problem using Grobner bases
Is there an easy way to determine whether a set of elements in a field generates the whole field or only a subfield?
Specifically, I have a subfield of $k(x,y)$ described in terms of a canonical set ...
- 851
0
votes
0
answers
71
views
Low rank approximation
Can we solve low rank approximation problem by using concept of Gröbner basis? I was trying to find it by Macaulay2 but didn't find the answer. I was trying to do by toric ideals as for them Gröbner ...
1
vote
1
answer
108
views
Finding a characteristic for which the zero-locus of an ideal is not empty
I have a set of polynomials $f_1, \dots, f_m \in \mathbb{Z}[x_1, \dots, x_n]$ and I am interested in finding if these polynomials have a common root inside either $\mathbb{C}[x_1, \dots, x_n]$ or $\...
- 113
2
votes
1
answer
286
views
Memory usage of Gröbner basis computation
I've been calculating some Gröbner bases in preparation for finding non-commutative Hilbert series (and, once I recreate that, characters of group actions). Specifically, I've been using the ...
4
votes
0
answers
98
views
Compute equalizer of maps of polynomial rings, perhaps using Gröbner bases
Suppose that $k$ is a field and I have two ring homomorphisms
$$
\phi, \psi :k[x_1,...,x_m] \to k[y_1,...,y_n].
$$
How can I use Gröbner bases (or other computational tools) to compute the subring of ...
- 4,254
5
votes
1
answer
319
views
Groebner bases for differential operators with field coefficients (reference request)
Let $K$ be a field, $\partial_i$ be commuting derivations on $K$, and consider the ring $R=K[\partial_1\ldots \partial_n]$ (it is implicitly assumed that the derivations do not commute with elements ...
- 1,488
5
votes
0
answers
196
views
Computations in Weyl algebra with rational function coefficients
I am looking for a software to perform calculations with modules over the algebra $R_n=\mathbb{C}(x_1\ldots x_n)\langle \partial_1\ldots\partial_n\rangle$ of differential operators with rational ...
- 1,488
1
vote
0
answers
35
views
Grobner basis of the toric ideal $I_{A_P}$ with respect to $<_{rev}$ consists of those binomials $t_αt_β − t_{α\cap β} t_{α\cup β}$
I try to understand the proof of the Theorem. 10.1.3.(page 185) from ''Monomial Ideals'' by Herzog & Hibi.
The reduced Grobner basis of the toric ideal $I_{A_P}$ with respect
to $<_{rev}$ ...
- 163
10
votes
2
answers
526
views
Monomial orderings in noncommutative setting
An ordering of monomials in the free associative algebra $k\langle x_1,\ldots,x_n\rangle$ is called a monomial ordering (EDIT: it seems that an equally common term used in this context is "term ...
- 16.9k
8
votes
1
answer
742
views
Reasonable implementation of finding Gröbner bases over non-field coefficient rings
Gröbner bases are usually considered in the ring of polynomials over a field. However, there are useful definitions and algorithms for Gröbner bases over other coefficient rings; see, for instance, ...
- 7,328