0
votes
1answer
123 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
2answers
425 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} ...
5
votes
3answers
282 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
2answers
253 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
0answers
243 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 ...
4
votes
1answer
318 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, ...
2
votes
1answer
232 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
1answer
348 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 ...
3
votes
1answer
341 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 ...
4
votes
4answers
349 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
1answer
253 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 ...