# Questions tagged [resultants]

The tag has no usage guidance.

32 questions
Filter by
Sorted by
Tagged with
219 views

136 views

### Using computer algebra to check if a family of algebras are pair-wise non-isomorphic

Given an infinite field $k$, consider a quiver $\Gamma$ with one vertex and two arrows $x,y$ and define $R=k\Gamma/(x,y)^2.$ This is a three-dimensional $k$-algebra. Now consider the additive group of ...
639 views

### Discriminant of $\alpha P(u) + (z-u) P'(u)$

I'm trying to find a “closed form” of $\textrm{Discriminant}_u(f(u))$, where $f(u) := \alpha P(u) + (z-u) P'(u)$. Here $P(u)$ is a monic polynomial of degree $d > 1$ with $u\in\mathbb{C}$, $\alpha$ ...
215 views

### Polynomial resultants restricted to intervals

The resultant of two polynomials, $R(f,g)$, is a polynomial in the coefficients of $f$ and $g$, and has the property that $R(f,g) = 0$ if and only if $f$ and $g$ share a common root (possibly in an ...
266 views

### Has vol. 3A of Cullis's "Matrices and Determinoids" been scanned and vol. 3B been archived?

This is a borderline question, but I'm going to risk posing it. Cuthbert Edmund Cullis (1875?-1955?) was a somewhat obscure British mathematician whose opus magnum was a multi-volume treatise called ...
358 views

### Polynomial defined recursively by a resultant

Cross posting from MSE. Definition: For any natural number $n\ge 3$, define the polynomial $P_{n}\left(x_1,x_2,...,x_{n-1},x_{n} \right)$, with indeterminates $x_{i}$, where $i\in\{1,2,...,n-1,n\}$, ...
822 views

### Polynomials that share at least one root

This is a generalization of an MSE question, Polynomials that share at least one root. Let $P(x)$ be a specific polynomial of degree $d$, with given real coefficients $A_i$ ($A_d=1$), and real roots: ...
269 views

### An explicit formula for characteristic polynomial of matrix tensor product [closed]

Consider two polynomials P and Q and their companion matrices. It seems that char polynomial of tensor product of said matrices would be a polynomial with roots that are all possible pairs product of ...
78 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 ...
122 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 ...
248 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 ...
293 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 ...
78 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 ...