相关论文: Macaulay Style Formulas for Sparse Resultants
We prove an Euler-Maclaurin formula for double polygonal sums and, as a corollary, we obtain approximate quadrature formulas for integrals of smooth functions over polygons with integer vertices. Our Euler-Maclaurin formula is in the spirit…
We show that, for a system of univariate polynomials given in sparse encoding, we can compute a single polynomial defining the same zero set, in time quasi-linear in the logarithm of the degree. In particular, it is possible to determine…
In this note, by using the Hasse-Teichm\"uller derivatives, we obtain two explicit expressions for the related numbers of higher order Appell polynomials. One of them presents a determinant expression for the related numbers of higher order…
Polynomial algebra offers a standard approach to handle several problems in geometric modeling. A key tool is the discriminant of a univariate polynomial, or of a well-constrained system of polynomial equations, which expresses the…
We give a concise direct proof of the orthogonality of interpolation Macdonald polynomials with respect to the Fourier pairing and briefly discuss some immediate applications of this orthogonality, such as the symmetry of the Fourier…
Let $n\in\mathbb{N}$ be fixed, $Q>1$ be a real parameter and $\mathcal{P}_n(Q)$ denote the set of polynomials over $\mathbb{Z}$ of degree $n$ and height at most $Q$. In this paper we investigate the following counting problems regarding…
Sparse spectral methods for solving partial differential equations have been derived in recent years using hierarchies of classical orthogonal polynomials on intervals, disks, and triangles. In this work we extend this methodology to a…
We describe an algorithm for computing Macaulay dual spaces for multi-graded ideals. For homogeneous ideals, the natural grading is inherited by the Macaulay dual space which has been leveraged to develop algorithms to compute the Macaulay…
This article focuses on optimization of polynomials in noncommuting variables, while taking into account sparsity in the input data. A converging hierarchy of semidefinite relaxations for eigenvalue and trace optimization is provided. This…
Many computer vision applications require robust and efficient estimation of camera geometry from a minimal number of input data measurements, i.e., solving minimal problems in a RANSAC framework. Minimal problems are usually formulated as…
We introduce concepts of "recursive polynomial remainder sequence (PRS)" and "recursive subresultant," and investigate their properties. In calculating PRS, if there exists the GCD (greatest common divisor) of initial polynomials, we…
A compound determinant identity for minors of rectangular matrices is established. As an application, we derive Vandermonde type determinant formulae for classical group characters.
The present paper is a continuation of our work [11], where we introduced a fractional operator calculus related to a fractional ${\psi}-$Fueter operator in the one-dimensional Riemann-Liouville derivative sense in each direction of the…
We introduce the subsum polynomial of a partition $\lambda=(\lambda_1, \lambda_2, \ldots, \lambda_k)$ defined by $\mathrm{sp}(\lambda, x)=\prod_{i=1}^k(1+x^{\lambda_i})$. We study the sum of reciprocals of $\mathrm{sp}(\lambda, x)$ over all…
We introduce a simple algorithm that efficiently computes tensor products of Pauli matrices. This is done by tailoring the calculations to this specific case, which allows to avoid unnecessary calculations. The strength of this strategy is…
This paper studies the copositive optimization problem whose objective is a sparse polynomial, with linear constraints over the nonnegative orthant. We propose sparse Moment-SOS relaxations to solve it. Necessary and sufficient conditions…
We establish necessary and sufficient conditions for a polynomial to be divisible by a cyclotomic polynomials and derive new formulas involving Ramanujan sums as an application of our results. Additionally, we provide new insights into the…
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 derive analytical expression of matrix factorization/completion solution by variational Bayes method, under the assumption that observed matrix is originally the product of low-rank dense and sparse matrices with additive noise. We…
Spivey presented a new approach to evaluate combinatorial sums by using finite differences. We present some closed forms for sums involving the binomial coefficients, Fibonacci and Lucas numbers in terms of the falling factorial.