Related papers: Discriminants of Symmetric Polynomials

Let $R$ be a real closed field. We consider basic semi-algebraic sets defined by $n$-variate equations/inequalities of $s$ symmetric polynomials and an equivariant family of polynomials, all of them of degree bounded by $2d < n$. Such a…

We show how to compute any symmetric Boolean function on $n$ variables over any field (as well as the integers) with a probabilistic polynomial of degree $O(\sqrt{n \log(1/\epsilon)})$ and error at most $\epsilon$. The degree dependence on…

Let f be an irreducible polynomial of degree d>=3 with no fixed prime divisor. We derive an asymptotic formula for the number of primes p<x such that f(p) is (d-1)-free.

The problem of finding superintegrable Hamiltonians and their integrals of motion can be reduced to solving a series of compatibility equations that result from the overdetermination of the commutator or Poisson bracket relations. The…

We calculate admissible values of r such that a square-free polynomial with integer coefficients, no fixed prime divisor and irreducible factors of degree at most 3 takes infinitely many values that are a product of at most r distinct…

Denote the alternating and symmetric groups of degree $n$ by $A_n$ and $S_n$ respectively. Consider a permutation $\sigma\in S_n$ all of whose nontrivial cycles are of the same length. We find the minimal polynomials of $\sigma$ in the…

In this paper we present a new method of solving certain quartic and higher degree homogeneous polynomial diophantine equations in four variables. The method can also be extended to solve simultaneous homogeneous polynomial diophantine…

We show that positivity on $\mathbb{R}_+^n$ and on $\mathbb{R}^n$ of real symmetric polynomials of degree at most $p$ in $n\ge2$ variables is solvable by algorithms running in $\mathrm{poly}(n)$ time. For real symmetric quartics, we find…

The problem of finding a nontrivial factor of a polynomial f(x) over a finite field F_q has many known efficient, but randomized, algorithms. The deterministic complexity of this problem is a famous open question even assuming the…

In the first part of this paper we give a precise description of all the minimal decompositions of any bi-homogeneous polynomial $p$ (i.e. a partially symmetric tensor of $S^{d_1}V_1\otimes S^{d_2}V_2$ where $V_1,V_2$ are two complex,…

The symmetrized Slater determinants of orthogonal polynomials with respect to a non-negative Borel measure are shown to be represented by constant multiple of Hankel determinants of two other families of polynomials, and they can also be…

Given a probability measure $\mu$ with infinite support on the unit circle $\partial\mathbb{D}=\{z:|z|=1\}$, we consider a sequence of paraorthogonal polynomials $\h_n(z,\lambda)$ vanishing at $z=\lambda$ where $\lambda \in \T$ is fixed. We…

To prove that a polynomial is nonnegative on R^n one can try to show that it is a sum of squares of polynomials (SOS). The latter problem is now known to be reducible to a semidefinite programming (SDP) computation much faster than…

For each $n$, let RD$(n)$ denote the minimum $d$ for which there exists a formula for the general polynomial of degree $n$ in algebraic functions of at most $d$ variables. In this paper, we recover an algorithm of Sylvester for determining…

We use the symmetric product to describe the resultant scheme and discriminant scheme of polynomials two variables.

Together with David Schlang we computed the discriminants of the invariant Hermitian forms for all indicator $o$ even degree absolutely irreducible characters of the ATLAS groups supplementing the tables of orthogonal determinants computed…

Consider the $n$th degree polynomial equation, $X^n+A_{n-1}X^{n-1}+...+A_1X+A_0=0$ over the ring of 2 by 2 complex matrices. If this equation has more than ${2n \choose 2}$ solutions, then it has infinitely many solutions. We show here that…

Let F,G in C[x_1,...,x_n] be two polynomials in n variables x_1,...,x_n over the complex numbers field C. In this paper, we prove that if the degree of the Poisson bracket [F,G] is small enough then there are strict constraints for…

We present an algorithm for computing discriminants and prime ideal decomposition in number fields. The algorithm is a refinement of a p-adic factorization method based on Newton polygons of higher order. The running-time and memory…

We show that integrating a polynomial of degree t on an arbitrary simplex (with respect to Lebesgue measure) reduces to evaluating t homogeneous polynomials of degree j = 1, 2,. .. , t, each at a unique point $\xi$ j of the simplex. This…