Related papers: On the Complete Solution to the Most General Fifth…
A multidimensional generalization of Melvin's solution for an arbitrary simple Lie algebra $\cal G$ is considered. The gravitational model in $D$ dimensions, $D \geq 4$, contains $n$ 2-forms and $l \geq n$ scalar fields, where $n$ is the…
In this article we solve a general class of sextic equations. The solution follows if we consider the $j$-invariant and relate it with the polynomial equation's coefficients. The form of the solution is a relation of Rogers-Ramanujan…
This article proposes a bivariate polynomial problem for finite-order real matrices that endows a \textit{`sufficient condition'} for a map from the standard vector spaces of finite-order real matrices to the same dimensional bivariate…
Graph polynomials encode fundamental combinatorial invariants of graphs. Their computation is investigated using tree and path decomposition frameworks, with formal definitions of treewidth, k-trees, and pathwidth establishing the…
We determine the roots in F_{q^3} of the polynomial X^{2q^k+1} + X + c for each positive integer k and each c in F_q, where q is a power of 2. We introduce a new approach for this type of question, and we obtain results which are more…
A hierarchy of matrix-valued polynomials which generalize the Jacobi polynomials is found. Defined by a Rodrigues formula, they are also products of a sequence of differential operators. Each class of polynomials is complete, satisfies a…
A problem that is frequently encountered in a variety of mathematical contexts, is to find the common invariant subspaces of a single, or set of matrices. A new method is proposed that gives a definitive answer to this problem. The key idea…
The roots of any polynomial of degree m with integer coefficients, can be computed by manipulation of sequences made from 2m distinct symbols and counting the different symbols in the sequences. This method requires only 'primitive'…
We present explicit representations in terms of hypergeometric functions for the scaling functions in the $C^0$ orthogonal multiresolution analyses associated with piecewise continuous polynomials. Closed formulas for the Mellin transform…
Newton's method for polynomial root finding is one of mathematics' most well-known algorithms. The method also has its shortcomings: it is undefined at critical points, it could exhibit chaotic behavior and is only guaranteed to converge…
A combination of rational mappings and Schlesinger transformations for a matrix form of the hypergeometric equation is used to construct higher order transformations for the Gauss hypergeometric function.
This paper revisits the notion of classical orthogonal polynomials from a broader functional-analytic point of view. It is intended neither as a survey of known results nor as a review of the literature, but rather as a conceptual…
We show that a polynomial equation of degree less than 5 and with real parameters can be solved by regarding the variable in which the polynomial depends as a complex variable. For do it so, we only have to separate the real and imaginary…
Complex polynomial optimization has recently gained more and more attention in both theory and practice. In this paper, we study the optimization of a real-valued general conjugate complex form over various popular constraint sets including…
Univariate polynomial root-finding is both classical and important for modern computing. Frequently one seeks just the real roots of a polynomial with real coefficients. They can be approximated at a low computational cost if the polynomial…
Inspired by the work about solutions of a system of real polynomial equations done by Hermite, this paper introduces a Hermitian form, which encodes information about solutions of a system of complex polynomial equations with conjugate…
The methods of classical invariant theory are used to construct generic polynomials for groups $S_5$ and $A_5$, along with explicit reductions to specializations of the generic polynomials defining any desired field extension with those…
In this paper we present a complete method for finding the roots of all polynomials of the form $\phi(z)=c_n z^n+c_{n-1} z^{n-1}+\dots+c_1 z+c_0$ over a given octonion division algebra. When $\phi(z)$ is monic we also consider the companion…
Many combinatorial and topological invariants of a hyperplane arrangement can be computed in terms of its Tutte polynomial. Similarly, many invariants of a hypertoric arrangement can be computed in terms of its arithmetic Tutte polynomial.…
Given n polynomials in n variables with a finite number of complex roots, for any of their roots there is a local residue operator assigning a complex number to any polynomial. This is an algebraic, but generally not rational, function of…