Related papers: Explicit expressions for real roots of a quartic e…
We determine explicit quantum seeds for classes of quantized matrix algebras. Furthermore, we obtain results on centers and block diagonal forms {of these algebras.} In the case where $q$ is {an arbitrary} root of unity, this further…
The use of complexified quaternions and $i$-complex geometry in formulating the Dirac equation allows us to give interesting geometric interpretations hidden in the conventional matrix-based approach.
We prove that all arrangements (consistent with the Rolle theorem and some other natural restrictions) of the real roots of a real polynomial and of its $s$-th derivative are realizable by real polynomials.
For any real diagonalizable matrix with complex eigenvalues we provide a real, coordinate free decomposition with a clear geometric interpretation.
We give an algorithm for computing all roots of polynomials over a univariate power series ring over an exact field $\mathbb{K}$. More precisely, given a precision $d$, and a polynomial $Q$ whose coefficients are power series in $x$, the…
As showed in (Fiedler, 1990), any polynomial can be expressed as a characteristic polynomial of a complex symmetric arrowhead matrix. This expression is not unique. If the polynomial is real with only real distinct roots, the matrix can be…
Over the split-octonion algebra defined over an arbitrary field, we solve all polynomial equations whose coefficients are scalar except for the constant term. As an application, we determine the square and cubic roots of an octonion.
In this article, we establish necessary and sufficient conditions for a polynomial of degree $n$ to have exactly $n$ real roots. A complete study of polynomials of degree five is carried out. The results are compared with those obtained…
Certain explicit solutions to the Korteweg-de Vries equation in the first quadrant of the $xt$-plane are presented. Such solutions involve algebraic combinations of truly elementary functions, and their initial values correspond to rational…
A new numerical method is presented to find full complex roots of a complex dispersion equation. For the application of the solution, the complex dispersion equation of a cylindrical metallic nanowire is investigated. By using this method,…
Meromorphic solutions of autonomous nonlinear ordinary differential equations are studied. An algorithm for constructing meromorphic solutions in explicit form is presented. General expressions for meromorphic solutions (including rational,…
This paper provides two characterizations of the primitive roots of unity in quadratic cyclotomic extensions over arbitrary fields. Firstly, we introduce a mapping from $\mathbb{N}$ to $\mathbb{N}$ crucial for describing these roots,…
The aim of this article is to obtain a formula giving, for a positive integer $n$, the number of roots of the $n^{th}$ continuant polynomial over a finite local ring. In particular, we will give counting formulae for the roots of the…
In this paper, we prove a number of results providing either necessary or sufficient conditions guaranteeing that the number of real roots of real polynomials of a given degree is either less or greater than a given number. We also provide…
It is proved that the roots of combinations of matrix polynomials with real roots can be recast as eigenvalues of combinations of real symmetric matrices, under certain hypotheses. The proof is based on recent solution of the Lax…
We explain how to determine equations describing the ramification of an outer simple linear projection of a projective scheme in a way suited for explicit computations.
A solution to the problem of topological classification of real cubic fourfolds is presented. It is shown that the real locus of a real non-singular cubic fourfold is obtained from a projective 4-space either by adding several trivial one-…
We give a parameterized generalization of the sum formula for quadruple zeta values. The generalization has four parameters, and is invariant under a cyclic group of order four. By substituting special values for the parameters, we also…
We propose an efficient algorithm to compute the real roots of a sparse polynomial $f\in\mathbb{R}[x]$ having $k$ non-zero real-valued coefficients. It is assumed that arbitrarily good approximations of the non-zero coefficients are given…
Eventually positive matrices are real matrices whose powers become and remain strictly positive. As such, eventually positive matrices are a fortiori matrix roots of positive matrices, which motivates us to study the matrix roots of…