Skip to main content

All Questions

Filter by
Sorted by
Tagged with
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 ...
TerronaBell's user avatar
  • 3,059
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 ...
Ingdas's user avatar
  • 371
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#...
mayer_vietoris's user avatar
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 $...
giulio bullsaver's user avatar
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 ...
Sic Vis's user avatar
  • 101
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 ...
Ben's user avatar
  • 1