Stack Exchange Network

Stack Exchange network consists of 174 Q&A communities including Stack Overflow, the largest, most trusted online community for developers to learn, share their knowledge, and build their careers.

Visit Stack Exchange

Questions tagged [resultants]

The tag has no usage guidance.

0
votes
0answers
102 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 ...
4
votes
1answer
204 views

Resultants for compactly represented product form polynomials?

Typically computing resultnt of $n+1$ different $n+1$-variate homogeneous polynomials takes $O(poly(\prod_{i=1}^{d_{i}}))$ time where $d_i$ is degree of $i$th polynomial. In certain cases the ...
2
votes
0answers
98 views

Intersection number of two projective curves using the resultant and tangent lines

For my thesis, I'm working on the intersection of projective plane curves over $\mathbb{C}$. We define the intersection number of projective plane curves (see for example Gibson - Elementary Geometry ...
2
votes
1answer
60 views

Efficient algorithm to compute resultants of sparse polynomials?

Consider two polynomials $f,g\in\mathbb{F}_2$ of degree $O(2^n)$, with the property that they are extremely sparse (say, only $O(n)$ of the coefficients are non-zero). Is there a way to calculate ...
9
votes
0answers
122 views

Irreducibility of the Sylvester resultant

If $r$ and $s$ are positive integers, $R$ a commutative ring and $a_0,\dots,a_r$, $b_0,\dots,b_s$ independent variables, we can consider the polynomials $f=\sum_{i=0}^ra_iX^i$ and $g=\sum_{j=0}^sb_iX^...
1
vote
0answers
41 views

Solutions to a certain Birkhoff-interpolation problem

$\newcommand{\CC}{\mathbb{C}}$ Let for $n > 1$ and $m = n-1$ $$ p = x^n + a_1 x^{n-1} + \cdots + a_m x $$ be a polynomial with $a_i \in \CC$. Call $p^{(i)}(x) = \frac{d^ip}{dx^i}(x)$. The ...
4
votes
0answers
69 views

Gröbner bases of resultants and their monomial ideals

$\newcommand{QQ}{\mathbb{Q}}$ Consider the ring $R = \QQ[x, a_1,\ldots,a_m]$ for a certain integer $m$ and the homogeneous polynomial $$ f = x^{m+1} + \sum_{i=1}^m a_i^i x^{m+1 - i} $$ Now let $$ ...
16
votes
1answer
281 views

Splitting the Resultant, as when the Determinant becomes the square of the Pfaffian

The Determinant of an $n\times n$ matrix, viewed as a polynomial in the entries, is irreducible. But when it is restricted to the subspace of alternate matrices, it becomes reducible, actually the ...
12
votes
1answer
596 views

Determinant is to Pfaffian as resultant is to what?

This is an irresponsible question: I do not have done any thinking on it, or even literature search. I just became curious whether there is some modification of the notion of a common root of two ...
6
votes
4answers
600 views

What is the essence of the constant factor in the standard definitions of the discriminant?

Let $f(x) = x^m+\sum_{j=0}^{m-1}f_{m-j}x^j\in P[x]$ be a monic polynomial over a field $P$ and let $f(x) = (x-\alpha_1)\cdot\ldots\cdot(x-\alpha_m)$ be a factorization of $f$ over an extension field $...
7
votes
0answers
116 views

Resultant of two special trinomials

Consider $f(x)=x^n-x^s-1$ and $g(x)=x^i-x^j-1$ , I want to find $Resultant(f,g)$. It is well known that it is determinant of a Sylvester matrix but, I am finding it to obscure to evaluate in that way. ...
0
votes
0answers
421 views

How to find solutions for four polynomial equations with four unknown variables using Resultant Theory

Can I use resultant theory (or polynomial resultant method) to find solutions for four simultaneous polynomial equations with four unknown variables? So far, I could only find examples which uses two ...
17
votes
0answers
202 views

GPS calculations under $L^p$ norms

GPS calculations require finding a sphere externally tangent to four given spheres, an Apollonian problem in $\mathbb{R}^3$. The center of that fifth sphere is one of the $16$ possible solutions to ...
1
vote
1answer
271 views

Irreducibility of a resultant of real and imaginary parts of a characteristic polynomial

The following question is motivated by the study of a stability border for a robust linear time-invariant control system. Let us we have an affine family of $n\times n$ matrices with indeterminate ($\...
7
votes
1answer
312 views

Combinatorics of resultants

This is a crosspost of https://math.stackexchange.com/questions/446470/combinatorics-of-resultants which received no answer. [EDIT: I deleted the initial copy of the question on MathSE]. Let $f(z)=\...
1
vote
3answers
587 views

Resultant of system with 3 polynomials and 3 variables

Let us say I have a system of 3 polynomials, f1(x,y,z), f2(x,y,z), f3(x,y,z). How to find the resultant of these 3 polynomials? What I mean is: is there any special method to do this? Does the ...
2
votes
2answers
460 views

The resultant of two degree n and n - 1 functions in two variables of t

I'm currently studying the implicitization of bezier curves (that is, finding a function that f(x, y) = 0 for any x and y pairs of a curve p(t)) as part of an algorithm for curve intersection. The ...
3
votes
2answers
348 views

When is the Wendt binomial circulant determinant divisible by 3?

The Wendt binomial circulant determinant $W_n$ can be defined quite simply as a resultant: $$ W_n = \operatorname{res}(x^n-1, (x+1)^n-1). $$ Truer to its name, one may also define it as the ...
9
votes
5answers
2k views

Multipolynomial resultants

We know that the resultant of two polynomials can be computed as the determinant of their Sylvester matrix ( http://en.wikipedia.org/wiki/Sylvester_matrix ). How do we compute the resultant of more ...