Questions tagged [elimination-theory]
Elimination theory is the study of necessary and sufficient conditions for polynomial equations (E) to have solutions.In the homogeneous case, if the number of variables is equal to the number of equations, this leads to the study of the Resultant (polynomial in the coefficients of (E), obtained by "eliminating" the variables ). In the general case, one get a Resultant ideal, generated by polynomial relations in the coefficients of the equations (E).
12
questions with no upvoted or accepted answers
12
votes
0
answers
279
views
Entropy in elimination theory, or a brief remark by Gelfand-Kapranov-Zelevinsky
In the introduction to their book "Discriminants, resultants and multidimensional determinant", the authors state a very intriguing observation concerning the coefficients of monomials appearing in $A$...
4
votes
0
answers
203
views
Effective bounds for a Bertini-type result
Suppose $X$ is a projective subvariety of $\mathbb{P}^n$ of codimension $r$ over $\mathbb{C}$, defined set-theoretically by $r$ homogeneous polynomials $P_1,\dots,P_r$ of degree at most $d$. By ...
4
votes
0
answers
104
views
Division of bivariate polynomials
The following theorem (lemma 4.2.18 on page 97) is proven in thesis "Computationally efficient Error-Correcting Codes and Holographic Proofs" by Daniel Alan Spielman:
Let $E(X, Y)$ be a polynomial ...
2
votes
0
answers
157
views
Degree of polynomials describing projection of algebraic set
Consider an algebraic subset $V\subseteq \mathbb{R}^{n+1}$ defined as the zero set of polynomials ${f_i}$ and the projection map $\pi: \mathbb{R}^{n+1}\to \mathbb{R}^n$ deleting the last entry.
By the ...
2
votes
0
answers
166
views
Solving solutions to systems of polynomial equations over $\mathbb Z$
Macaulay Resultants help identify common root in $\mathbb P^{n-1}(\mathbb K)$ of $n$ homogeneous polynomials in $n$ variables when $\mathbb K$ is algebraically closed. Is it possible that some type of ...
2
votes
0
answers
147
views
Algebraic approach to showing trigonometric equations have no solution
I have very little background in algebra and algebraic geometry, so please bear with me.
I am trying to show that certain systems of trigonometric polynomial equations generally have no solution. One ...
1
vote
0
answers
95
views
Expression for the single common root
Let $ \mathbb{F} $ be a field, consider the polynomial ring $ \mathbb{F} \left[ x\right] $ and suppose that the polynomials $f,g \in \mathbb{F} \left[ x\right]$ have degrees $2,2^n$, respectively, ...
1
vote
0
answers
53
views
Elimination theory for variables packaged in a matrix
I am wondering if the elimination theory in computational algebraic geometry can be more efficiently carried out if all variables lies within some given matrices.
For instance, consider the following:
...
0
votes
0
answers
122
views
Does positivstellensatz and SOS proof system help here?
I have a system of $m$ homogeneous degree $2$ polynomial equations in $\mathbb Z[x_1,\dots,x_n]$ where $m=poly(n)$. Take
$$f_1(x_1,\dots,x_n)=0$$
$$\dots$$
$$f_m(x_1,\dots,x_n)=0$$
to be the system.
...
0
votes
0
answers
125
views
Do many homogeneous polynomials help in faster integer root extraction?
Given $n$ homogeneous algebraically independent total degree $2$ polynomials with no $x_1^2,\dots,x_n^2$ variable in $\mathbb Z[x_1,\dots,x_n]$ with promise that it has non-zero integer roots with ...
0
votes
0
answers
128
views
Final step in Coppersmith?
In the final step in Coppersmith technique we have $n$ polynomials (possibly non-homogeneous) in $\mathbb Z[x_1,\dots,x_m]$ where $m\leq n$ and using elimination theory we extract the common integer ...
-2
votes
0
answers
132
views
Elimination over $\mathbb F_p[x,y]$
Let $p$ be a prime. Consider the two independent modular equations:
$$a_1x^2+b_1y^2+c_1xy\equiv d_1\bmod p$$
$$a_2x^2+b_2y^2+c_2xy\equiv d_2\bmod p$$
Is it possible to extract the common roots $(x,y)\...