Related papers: Macaulay Style Formulas for Sparse Resultants
We present algorithms performing sparse univariate polynomial interpolation with errors in the evaluations of the polynomial. Based on the initial work by Comer, Kaltofen and Pernet [Proc. ISSAC 2012], we define the sparse polynomial…
We first relate an approximate $n^{th}$-order left derivative of $s(R, f^t)$ at the F-pure threshold $c$ to the F-splitting ratio $r_F(R, f^c)$. Next, we apply the methods developed by Monsky and Teixeira in their investigation of syzygy…
We consider the problem of estimating log-determinants of large, sparse, positive definite matrices. A key focus of our algorithm is to reduce computational cost, and it is based on sparse approximate inverses. The algorithm can be…
We present an explicit difference operator diagonalized by the Macdonald polynomials associated with an (arbitrary) admissible pair of irreducible reduced crystallographic root systems. By the duality symmetry, this gives rise to an…
In this paper, we derive novel formulas and identities connecting Cauchy numbers and polynomials with both ordinary and generalized Stirling numbers, binomial coefficients, central factorial numbers, Euler polynomials, $r$-Whitney numbers,…
The paper deals with the problem of finding sparse solutions to systems of polynomial equations possibly perturbed by noise. In particular, we show how these solutions can be recovered from group-sparse solutions of a derived system of…
If a reduced bivariate polynomial is quasi-homogeneous, then its discriminant is a monomial. Over fields of characteristic $0$, we show that if one adds another simple condition, this becomes an equivalence. We also give a third equivalent…
We compute the $\delta$-invariant of a curve singularity parameterized by generic sparse polynomials. We apply this to describe topological types of generic singularities of sparse resultants and ``algebraic knot diagrams'' (i.e. generic…
Finding the product of two polynomials is an essential and basic problem in computer algebra. While most previous results have focused on the worst-case complexity, we instead employ the technique of adaptive analysis to give an improvement…
We give a new probabilistic algorithm for interpolating a "sparse" polynomial f given by a straight-line program. Our algorithm constructs an approximation f* of f, such that their difference probably has at most half the number of terms of…
A method for computing global minima of real multivariate polynomials based on semidefinite programming was developed by N. Z. Shor, J. B. Lasserre and P. A. Parrilo. The aim of this article is to extend a variant of their method to…
The Cauchy polynomials with a $q$ parameter were recently defined, and several arithmetical properties were studied. In this paper, we establish explicit formulae for computing the Cauchy polynomials with a $q$ parameter in terms of…
This paper presents a method for expressing the determinant of an N {\times} N complex block matrix in terms of its constituent blocks. The result allows one to reduce the determinant of a matrix with N^2 blocks to the product of the…
In the sparse polynomial multiplication problem, one is asked to multiply two sparse polynomials f and g in time that is proportional to the size of the input plus the size of the output. The polynomials are given via lists of their…
This work studies the problem of learning appropriate low dimensional image representations. We propose a generic algorithmic framework, which leverages two classic representation learning paradigms, i.e., sparse representation and the…
Summation formulas, such as the Euler-Maclaurin expansion or Gregory's quadrature, have found many applications in mathematics, ranging from accelerating series, to evaluating fractional sums and analyzing asymptotics, among others. We show…
In this paper we present two algorithms for the multiplication of sparse Laurent polynomials and Poisson series (the latter being algebraic structures commonly arising in Celestial Mechanics from the application of perturbation theories).…
In the paper, the authors establish an explicit formula for computing Bernoulli polynomials at non-negative integer points in terms of $r$-Stirling numbers of the second kind.
We develop a sparse spectral method for a class of fractional differential equations, posed on $\mathbb{R}$, in one dimension. These equations can include sqrt-Laplacian, Hilbert, derivative and identity terms. The numerical method utilizes…
We consider Koornwinder's method for constructing orthogonal polynomials in two variables from orthogonal polynomials in one variable. If semiclassical orthogonal polynomials in one variable are used, then Koornwinder's construction…