The groebner-bases tag has no usage guidance.

**0**

votes

**2**answers

334 views

### Solving a system of equations using Gröbner basis

In Sage (or any other package) when using Gröbner basis to solve a system of equations (some of which are non-linear equations) does computing the Gröbner basis for the ideal ID generated by the ...

**1**

vote

**1**answer

174 views

### Solving Non-Linear Equations over a Finite Field of a Large Prime Order

I want to know is there is an efficient way to figure out whether or not a ( underdetermined) system of non-linear equations have a solution over a finite field of large prime order. The equations ...

**3**

votes

**1**answer

168 views

### How can I include irreducibility in a Groebner basis calculation?

I'm trying to prove impossibility of certain systems of differential/polynomial equations using Groebner basis techniques.
For example, consider the equation $qn = mf$, where each of the variables ...

**2**

votes

**0**answers

76 views

### Polynomial constraints triggered by irreducibility [closed]

I've come across an interesting connection between irreducible polynomials and polynomial constraints. For example, consider the basic quadratic:
$$af^2 + bf + c = 0$$
If we're working in a ring, ...

**10**

votes

**2**answers

282 views

### Free $k[x_1, \dots, x_n]^{S_n}$-module?

Let $\text{char}\,k = 0$ and $n \ge 2$. What is the easiest way to see that $k[x_1, \dots, x_n]$ is a free $k[x_1, \dots, x_n]^{S_n}$-module with basis$$x_2^{m_2}x_3^{m_3} \dots x_{n-1}^{m_{n-1}} ...

**0**

votes

**0**answers

35 views

### Deciding whether linear equations are solvable over specific subrings of $K(x_1,..,x_n)$

The definition of 'linear equations are solvable' which is meant here is
Let $R$ be a commutative ring (associative and with unity).
For given $m \in \mathbb{N}$ and $b \in R$,
it is decideable ...

**4**

votes

**1**answer

131 views

### Solving over-determined system of polynomials

I am trying to solve the following over determined system of polynomials
\begin{align}
& p_1(x_1,x_2,\ldots,x_n)=0, \\
& p_2(x_1,x_2,\ldots,x_n)=0, \\
& \vdots \\
& p_m(x_1,x_2, ...

**8**

votes

**3**answers

475 views

### Polynomials vanishing modulo some integer $n$

It is well-known that a polynomial $q \in \mathbb Z[t]$ vanishes modulo $p$ only if it lies in the ideal $J_p$ generated by $p$ and $t^p-t$. This means that either the degree is large (at least $p$) ...

**6**

votes

**1**answer

270 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 ...

**2**

votes

**2**answers

163 views

### Pseudo-decision procedures for first order arithmetic

I was reading this paper http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.117.2911&rep=rep1&type=pdf in which the author describes an algorithm, based on Groebner basis, ...

**0**

votes

**1**answer

302 views

### cup-length of the first Chern class of complex grassmannian

Let $G_2(\mathbb{C}^{n+1})$ be the complex grassmannian.
Then the cohomology ring $H^*(G_2(\mathbb{C}^{n+1});\mathbb{C})=\mathbb{C}[c_1,c_2]/(f_n,f_{n+1})$, where ...

**2**

votes

**3**answers

261 views

### ideals of polynomial ring with complex number coefficients

Let $\mathbb{C}[x,y]$ be the polynomial ring with variables $x,y$ and coefficient in $\mathbb{C}$.
Let $f,g\in \mathbb{C}[x,y]$.
Let $(f,g)$ be the ideal of $\mathbb{C}[x,y]$ generated by $f,g$.
...

**0**

votes

**0**answers

89 views

### Maximal elements for ideals and subrings ordered by inclusion with fixed number of minimal generating polynomials

Let $R=\mathbb{R}[X_1,\dots,X_n]$, and
$$\mathfrak{I}_d=\{ \text{ideals for which there is minimal generating system with $d$ elements} \}\setminus \{\text{ ideals generated by $d$ monomials}\}$$
...

**1**

vote

**1**answer

296 views

### Is there a Gröbner basis analogue that exists for vector spaces?

Suppose I have a coordinate system $t_1,\ldots t_N$ with a lexicographical ordering. Let LT denote choosing the lowest term of a polynomial with respect to this ordering. e.g. LT$(t_1 + t_2)=t_2$.
...

**10**

votes

**1**answer

728 views

### Ways to show a system of polynomial equations has no solution

I came across the following system of polynomial equations on $X_1,\dots,X_{m-2}$:
$$
\begin{cases}
2X_{2s}+\sum\limits_{t=1}^{2s-1}(-1)^tX_tX_{2s-t}=0,\quad s=1,\dots,\frac{m}{2}-1,\\
...

**8**

votes

**4**answers

800 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 ...

**4**

votes

**0**answers

131 views

### Bound for the height of equations defining the singular locus of a variety

Fix positive integers $m, n, d$.
In what follows, the height of an algebraic number will mean the absolute multiplicative height.
Let $V \subset \bar{\mathbb{Q}}^n$ be an affine algebraic variety ...

**2**

votes

**1**answer

60 views

### Degenerations and spanning monomials

Let $R = \mathbb{C}[x_1,…,x_n]$, let $J\subset R$ be a graded ideal, and consider the initial monomial ideal $\operatorname{in}(J)$ with respect to some term order. Suppose that we are given a linear ...

**0**

votes

**2**answers

209 views

### Computing toric ideals via saturation and Groebner bases of toric ideals

About a month ago I asked this question on math.stackexchange and unfortunately there was no response. Perhaps someone here knows the answer.
Let $A \in \mathbb{Z}^{m \times n}$ be a matrix of full ...

**7**

votes

**2**answers

529 views

### Dimension of a homogeneous polynomial system

Let $m\geq4$ be an even integer, $V\subset\mathbb{C}^{m-1}$ be the solution set of the following polynomial equations:
\begin{cases}
...

**4**

votes

**1**answer

113 views

### Algorithm to detect if an element of a (commutative) ring is in a subring?

For rings finitely-generated over a field, the theory of Groebner bases gives us quite an efficient algorithm for determining whether an element of the ring is in a given ideal of the ring.
Is there ...

**-1**

votes

**1**answer

64 views

### How to recover the ideal from grobner basis of kernel of ann(x)

M -> ann(x)
i can find the grobner basis of kernel of ann(x) and need the final step to recover this basis to ideal
as i know, eliminate is not for all cases, what is the general practice to treat ...

**0**

votes

**0**answers

236 views

### Can we find a Groebner Basis?

I would like to ask the following. Given only the leading terms of an ideal $I$, namely the set $LT(I)$, is it possible to find a Groebner Basis of $I$? If not always, then when is it possible? We ...

**5**

votes

**3**answers

352 views

### Groebner bases for power series rings (reference request)

Hello,
Could you help me with a reference to elementary properties of Groebner bases in rings of formal power series over a field? I am especially interested in generic initial ideals.
Thank you in ...

**7**

votes

**2**answers

279 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 ...

**5**

votes

**0**answers

247 views

### Testing isomorphism of finitely generated algebras

Let $A=\mathbf{Q}[x_1,\ldots,x_n]$ be the polynomial ring in $n$ variables over the rational numbers. Let $B=\mathbf{Q}[f_1,\ldots,f_r]$ and
$C=\mathbf{Q}[g_1,\ldots,g_s]$ be two finitely generated ...

**6**

votes

**1**answer

394 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, ...

**8**

votes

**2**answers

308 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 ...

**3**

votes

**0**answers

240 views

### Bounding the degrees in a Bézout relation for integer polynomials

Let $A$ and $B$ be two polynomials in $\mathbf Z[X]$ which generate $\mathbf Z[X]$, that is assume that there exist polynomials $U$ and $V$ in $\mathbf Z[X]$ such that
$$
A \cdot U + B \cdot V=1.
$$
...

**2**

votes

**1**answer

237 views

### What does the d-slice of a weighted polynomial algebra look like?

This question comes from the explicit construction of a smooth projective model of a hyperelliptic curve. Nevertheless it is fully elementary and, to me, more interesting than hyperelliptic curves.
...

**6**

votes

**1**answer

394 views

### Can we make Buchberger's algorithm faster for a given ideal if we are allowed to vary the monomial order?

Suppose we have a finite set of generators for an ideal $I \subset R := \Bbbk[x_1,\dotsc, x_n]$, where $\Bbbk$ is a field. If we choose a monomial ordering, then Buchberger's algorithm allows us to ...

**2**

votes

**1**answer

1k views

### Existence of a real-valued solution to system of multivariate polynomial equations

Given a system of multivariate, polynomial equations, is there a way to determine if it has a solution in a given field (for instance the set of all reals). I don't care what the solution is, I just ...

**5**

votes

**1**answer

602 views

### PBW theorem over a Q-algebra, without freeness or flatness

Let $k$ be a commutative ring with $1$. Let $L$ be a $k$-Lie algebra, which is not necessarily free as a $k$-module. Let $S\left(L\right)$ denote the symmetric algebra of $L$ (over $k$), constructed ...

**2**

votes

**2**answers

459 views

### Nonstandard monomial orders?

Are there any articles/books/examples where a non-standard monomial order is used?
What are the applications of these monomial orders? In particular, uses in groebner bases and variable elimination.
...

**3**

votes

**2**answers

2k views

### Numerical solution for a system of multivariate polynomial equations

Hi all,
I have a system of 6th-order polynomial equations in 4 variables $q_1, q_2, q_3, q_4$ (i.e. polynomials with all the terms such as $q_1^6, q_2^6, q_2^4 q_3^2$):
$P_k(q_1, q_2, q_3, q_4) = 0$ ...

**3**

votes

**1**answer

349 views

### Is the first part of Eisenbud's Proposition 15.15's proof o.k?

In the chapter on Gröbner bases from Eisenbud's "Commutative Algebra" the following statement appears as Proposition 15.15 (page 344):
Let $F$ be a free $S$ module with basis and monomial order ...

**3**

votes

**4**answers

961 views

### Systems of polynomial equations

Hi all,
I'm an engineer assigned to determine some parameters of a manipulator (ie., calibration). It has a number of parameters, but after some manipulations of its dynamic equations, I can have the ...

**6**

votes

**2**answers

616 views

### Differential ideal membership problem

We know that in the ordinary algebra ideal case, the ideal membership problem can be solved by the Grobner Base theory, then, is there a counterpart theory in the differential ideal case?
To be ...

**4**

votes

**4**answers

359 views

### Lower bounds on the degrees of representatives of $u^n$ as $n \to \infty$

Let $k$ be an algebraically closed field and $A$ a finitely generated $k$-algebra, together with a specified surjective morphism $\phi \colon k[x_1, \dotsc, x_n] \to A$. For $f \in A$, define ...

**1**

vote

**1**answer

291 views

### Any implemented algorithm to compute the closure of an affine variety in a product of projective spaces?

Let $I$ be an ideal of $k[x_1, \ldots, x_m, y_1, \ldots, y_n]$, $k$ being a field. Does any of the computer algebra systems implement any algorithm to calculate the generators of the ...