相关论文: Explicit formulas for the multivariate resultant
In this work, new closed-form formulas for the matrix exponential are provided. Our method is direct and elementary, it gives tractable and manageable formulas not current in the extensive literature on this essential subject. Moreover,…
In this paper, we study the computational complexity of the commutative determinant polynomial computed by a class of set-multilinear circuits which we call regular set-multilinear circuits. Regular set-multilinear circuits are commutative…
We give the first exact determinantal formula for the resultant of an unmixed sparse system of four Laurent polynomials in three variables with arbitrary support. This follows earlier work by the author on exact formulas for bivariate…
We generalize linear superalgebra to higher gradings and commutation factors, given by arbitrary abelian groups and bicharacters. Our central tool is an extension, to monoidal categories of modules, of the Nekludova-Scheunert faithful…
Flajolet and Salvy pointed out that every Euler sum is a $\mathbb{Q}$-linear combination of multiple zeta values. However, in the literature, there is no formula completely revealing this relation. In this paper, using permutations and…
For bivariate polynomials of degree $n\le 5$ we give fast numerical constructions of determinantal representations with $n\times n$ matrices. Unlike some other available constructions, our approach returns matrices of the smallest possible…
By polynomial (or extended binomial) coefficients, we mean the coefficients in the expansion of integral powers, positive and negative, of the polynomial $1+t +\cdots +t^{m}$; $m\geq 1$ being a fixed integer. We will establish several…
We generalize Sylvester single sums to multisets (sets with repeated elements), and show that these sums compute subresultants of two univariate polyomials as a function of their roots independently of their multiplicity structure. This is…
The Mahler measures of certain polynomials of up to five variables are given in terms of multiple polylogarithms. Each formula is homogeneous and its weight coincides with the number of variables of the corresponding polynomial.
We present an overview of the existing methods for computing functional determinants, and outline a possible way forward for Hamiltonians of higher dimensions without radial symmetry.
A generalization of the Catalan numbers is considered. New results include binomial identities, recursive relations and a close formula for the multivariate generating function. A simple expression for the Catalan determinant is derived.
We define the non-commutative multiple bi-orthogonal polynomial systems, which simultaneously generalize the concepts of multiple orthogonality, matrix orthogonal polynomials and of the bi-orthogonality. We present quasideterminantal…
We give a simple formula for some determinants, and an analogous formula for pfaffians, both of which are polynomial identities. The second involve some expressions that interpolate between determinants and pfaffians. We give several…
We study the Macaulay coefficients induced by the ideal and quotient segments of a degree-$\delta$ monomial in $n$ variables. We give explicit formulas for these coefficients and establish a duality between the two theories. Our main result…
We consider a scalar-valued implicit function of many variables, and provide two closed formulae for all of its partial derivatives. One formula is based on products of partial derivatives of the defining function, the other one involves…
We exhibit explicit expressions, in terms of components, of discriminants, determinants, characteristic polynomials and polynomial identities for matrices of higher rank. We define permutation tensors and in term of them we construct…
We give a formula for the determinant of an $n\times n$ matrix with entries from a commutative ring with unit. The formula can be evaluated by a "straight-line program" performing only additions, subtractions and multiplications of ring…
It is shown how to compute quotients efficiently in non-commutative univariate polynomial rings. This extends earlier work where efficient generic quotients were studied with a primary focus on commutative domains. Fast algorithms are given…
The goal of this work is to formulate a systematical method for looking for the simple closed form or continued fraction representation of a class of rational series. As applications, we obtain the continued fraction representations for the…
Let $\cP$ be a system of $n$ linear nonhomogeneous ordinary differential polynomials in a set $U$ of $n-1$ differential indeterminates. Differential resultant formulas are presented to eliminate the differential indeterminates in $U$ from…