All Questions
Tagged with groebner-bases algorithms
11 questions
0
votes
0
answers
52
views
Solving sparse bilinear systems with a relatively large number of variables
I'm trying to solve a bilinear system of equations over a finite field. (More specifically: I'm trying to find a single solution, if one exists.) The system consists of equations of the form
$$y^T A_i ...
- 101
3
votes
1
answer
271
views
Resultants and elimination theory
Consider an ideal $I = \langle f_1,\dotsc,f_n\rangle$ in the ring $k[x_1,\dotsc,x_m]$.
Define the $i$-th elimination ideal to be $I_i = I \cap k[x_{i+1},\dotsc,x_m]$.
For any two polynomials $f$ and $...
- 1,435
4
votes
0
answers
197
views
Buchberger's criterion for Gröbner bases in $k$-algebras with multiplicative basis and admissible order
Let $R$ be an associative $k$-algebra with multiplicative basis $\mathcal B$ with an admissible order on $\mathcal B$.
Let $G \subseteq R$ be a subset.
A multiplicative basis $\mathcal B$ means that $...
- 141
0
votes
0
answers
55
views
Dependence of the complexity of solving polynomial sytems on the multidegree
Let $f_1,\ldots,f_n\in \mathbb{Q}[X_1,\ldots,X_n]$ be a system of $n$ polynomials in $n$ indeterminant, which only has finitely many solutions. Supose that the each of the variables $X_i$ appears at ...
- 1
5
votes
2
answers
983
views
Automatic proof in Euclidean Geometry using Theory of Groebner Bases
I've done the same question in math.stackexchange here "https://math.stackexchange.com/questions/1938261/automatic-proof-in-euclidean-geometry-using-theory-of-groebner-bases?noredirect=1#...
- 441
4
votes
1
answer
201
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 ...
- 41
6
votes
0
answers
316
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 $\...
- 7,609
14
votes
1
answer
2k
views
Gröbner basis for Sudoku
I'm trying to write a program that solves Sudokus using Gröbner bases. I introduced $81$ variables, $x_1$ to $x_{81}$, this is a linearisation of the Sudoku board.
The space of valid Sudokus is ...
- 371
7
votes
1
answer
735
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 ...
- 7,328
7
votes
2
answers
815
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 ...
- 1,528
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