Related papers: The resultant divisor is negative

We present an algorithm to solve a system of diagonal polynomial equations over finite fields when the number of variables is greater than some fixed polynomial of the number of equations whose degree depends only on the degree of the…

We observe that the Dieudonn\'{e} determinant induces a non-negative degree function on the ring of matrices over a skew polynomial ring. We then apply this degree function to two examples. In the first one, we find an expression for the…

Expansive polynomials (whose roots are greater than 1 in modulus) often arise in dynamical systems and other computational problems. This paper examines the expansivity gap (the gap between 1 and the smallest modulus of the roots) of these…

We study the minimal resultant divisor of self-maps of the projective line over a number field or a function field and its relation to the conductor. The guiding focus is the exploration of a dynamical analog to Theorem 1.1, which bounds…

Let $D(n)$ be the maximal determinant for $n \times n$ $\{\pm 1\}$-matrices, and ${\mathcal R}(n) = D(n)/n^{n/2}$ be the ratio of $D(n)$ to the Hadamard upper bound. We give several new lower bounds on ${\mathcal R}(n)$ in terms of $d$,…

We characterize polynomials having the same set of nonzero cyclic resultants. Generically, for a polynomial $f$ of degree $d$, there are exactly $2^{d-1}$ distinct degree $d$ polynomials with the same set of cyclic resultants as $f$.…

Let $k$ be a field with algebraic closure $\bar{k}$ and $D \subset \mathbb{P}^{1}_{\bar{k}}$ a reduced, effective divisor of degree $n \ge 3$, write $k(D)$ for the field of moduli of $D$. A. Marinatto proved that when $n$ is odd, or $n =…

We describe families of MLDEs whose solutions are modular forms of level one that converge, $2$-adically, to a Hauptmodul on $\Gamma_0(2)$ by using a theorem of Serre. Then, we apply this to show that the image of the character map on the…

Let $n\in\mathbb{N}$ be fixed, $Q>1$ be a real parameter and $\mathcal{P}_n(Q)$ denote the set of polynomials over $\mathbb{Z}$ of degree $n$ and height at most $Q$. In this paper we investigate the following counting problems regarding…

We define the second discriminant $D_2$ of a univariate polynomial $f$ of degree greater than $2$ as the product of the linear forms $2\,r_k-r_i-r_j$ for all triples of roots $r_i, r_k, r_j$ of $f$ with $i<j$ and $j\neq k, k\neq i$. $D_2$…

A polynomial is called self-reciprocal (or palindromic) if the sequence of its coefficients is palindromic. In this paper we obtain improved error bounds for the number of irreducible polynomials and self-reciprocal irreducible monic…

We study two-parameter oscillator variations of the classical theorem on harmonic polynomials, associated with noncanonical oscillator representations of sl(n) and o(n). We find the condition when the homogeneous solution spaces of the…

For any finite field $\mathbb{F}$ and any positive integer $n$ we count the number of monic polynomials of degree $n$ over $\mathbb{F}$ with nonzero constant coefficient and a self-reciprocal factor of any specified degree. An application…

There is a natural conjugation action on the set of endomorphism of $\P^N$ of fixed degree $d \geq 2$. The quotient by this action forms the moduli of degree $d$ endomorphisms of $\P^N$, denoted $\mathcal{M}_d^N$. We construct invariant…

Let $k$ be an arbitrary field and $d$ a positive integer. For each degenerate symmetric or antisymmetric bilinear form $M$ on $k^{d}$ we determine the structure of the Lie algebra of matrices that preserve $M$, and of the Lie algebra of…

A homogeneous polynomial of degree $d$ in $n+1$ variables is identifiable if it admits a unique additive decomposition in powers of linear forms. Identifiability is expected to be very rare. In this paper we conclude a work started more…

The work in this paper is to initiate a theory of testing monomials in multivariate polynomials. The central question is to ask whether a polynomial represented by certain economically compact structure has a multilinear monomial in its…

The linear complete differential resultant of a finite set of linear ordinary differential polynomials is defined. We study the computation by linear complete differential resultants of the implicit equation of a system of $n$ linear…

In this paper, we investigate property testing whether or not a degree d multivariate poly- nomial is a sum of squares or is far from a sum of squares. We show that if we require that the property tester always accepts YES instances and…

We present fully polynomial approximation schemes for a broad class of Holant problems with complex edge weights, which we call Holant polynomials. We transform these problems into partition functions of abstract combinatorial structures…