Related papers: Reciprocity via Reciprocants

Let $\mathcal{R}:=\mathbb{F}[{\bf x};\sigma,\delta]$ be a multivariate skew polynomial ring over a division ring $\mathbb{F}$. In this paper, we introduce the notion of right and left $(\sigma,\delta)$-partial derivatives of polynomials in…

We introduce the concept of reflexive moment functional in two variables and the definition of reflexive orthogonal polynomial system. Also reverse matrices and their interesting algebraic properties are studied. Reverse matrices and…

We address the general mathematical problem of computing the inverse $p$-th root of a given matrix in an efficient way. A new method to construct iteration functions that allow calculating arbitrary $p$-th roots and their inverses of…

Let n be a positive integer. We consider the Sylvester Resultant of f and g, where f is a generic polynomial of degree 2 or 3 and g is a generic polynomial of degree n. If f is a quadratic polynomial, we find the resultant's height. If f is…

Hamiltonians are 2-by-2 positive semidefinite real symmetric matrix-valued functions satisfying certain conditions. In this paper, we solve the inverse problem for which recovers a Hamiltonian from the solution of a first-order system…

A meromorphic quadratic differential with poles of order two, on a compact Riemann surface, induces a measured foliation on the surface, with a spiralling structure at any pole that is determined by the complex residue of the differential…

We propose a construction of lattices from (skew-) polynomial codes, by endowing quotients of some ideals in both number fields and cyclic algebras with a suitable trace form. We give criteria for unimodularity. This yields integral and…

In this paper, we introduce a family of partially symmetric polynomials, which we call quantum corner polynomials, as a generalization of the Sergeev-Veselov super Macdonald polynomials. We show that these quantum corner polynomials are…

The problem of expressing a multivariate polynomial as the determinant of a monic (definite) symmetric or Hermitian linear matrix polynomial (LMP) has drawn a huge amount of attention due to its connection with optimization problems. In…

An algorithm is presented for the efficient and accurate computation of the coefficients of the characteristic polynomial of a general square matrix. The algorithm is especially suited for the evaluation of canonical traces in determinant…

In the current work, the author present a symbolic algorithm for finding the determinant of any general nonsingular cyclic heptadiagonal matrices and inverse of anti-cyclic heptadiagonal matrices. The algorithms are mainly based on the work…

We establish some partial fraction identities for rational functions whose denominators are implicit products of the cyclotomic polynomials. To achieve this, we first develop a general algebraic approach for partial fraction decomposition…

The more then hundred years old Bernstein inequality states that the supremum norm of the derivative of a trigonometric polynomial of fixed degree can be bounded from above by supremum norm of the polynomial itself. The reversed Bernstein…

A generating function for reciprocal binomial coefficients is written down, integral representations of this function are obtained, generating functions for sums of reciprocal binomial coefficients are derived, new identities are obtained,…

Let $f_n$ be a random polynomial of degree $n$, whose coefficients are independent and identically distributed random variables with mean-zero and variance one. Let $\Delta(f_n)$ denote the discriminant of $f_n$, that is $\Delta(f_n) =…

We give an explicit formula for the discriminant $\Delta_f (x)$ of the quadrinomials of the form $f (x)=x^n+ t (x^2+ax+b)$. The proof uses Bezoutians of polynomials.

The skew Schubert polynomials are those which are indexed by skew elements of the Weyl group, in the sense of arXiv:0812.0639. We obtain tableau formulas for the double versions of these polynomials in all four classical Lie types, where…

The efficient inversion of matrix polynomials is a critical challenge in computational mathematics. We design a procedure to determine the inverse of matrices polynomial of multidimensional Laplace matrices. The method is based on…

We study E-eigenvalues of a symmetric tensor $f$ of degree $d$ on a finite-dimensional Euclidean vector space $V$, and their relation with the E-characteristic polynomial of $f$. We show that the leading coefficient of the E-characteristic…

This paper investigates equivalence of square multivariate polynomial matrices with the determinant being some power of a univariate irreducible polynomial. We first generalized a global-local theorem of Vaserstein. Then we proved these…