Related papers: Fast Evaluation of Generalized Todd Polynomials: A…
The aim of this paper is to construct generating functions for some families of special finite sums with the aid of the Newton-Mercator series, hypergeometric series, and $p$-adic integral (the Volkenborn integral). By using these…
This paper presents a program analysis method that generates program summaries involving polynomial arithmetic. Our approach builds on prior techniques that use solvable polynomial maps for summarizing loops. These techniques are able to…
We first summarize joint work on several preliminary canonical Lambert series factorization theorems. Within this article we establish new analogs to these original factorization theorems which characterize two specific primary cases of the…
Products of shifted characteristic polynomials, and ratios of such products, averaged over the classical compact groups are of great interest to number theorists as they model similar averages of L-functions in families with the same…
The Macdonald operator is known to coincide with a certain element of the quantum toroidal $\mathfrak{gl}(1)$ algebra in the Fock representation of levels $(1,0)$. A generalization of this operator to higher levels $(r,0)$ can be built…
The Brenke type generating functions are the polynomial generating functions of the form $$\sum_{n=0}^{\infty}{P_n(x )\over n!}t^n=A(t)B(xt), $$ where $A$ and $B$ are two formal power series subject to the conditions…
We illustrate an efficient new method for handling polynomial systems with degenerate solution sets. In particular, a corollary of our techniques is a new algorithm to find an isolated point in every excess component of the zero set (over…
We give reconstruction algorithms for subclasses of depth-3 arithmetic circuits. In particular, we obtain the first efficient algorithm for finding tensor rank, and an optimal tensor decomposition as a sum of rank-one tensors, when given…
We investigate Newton's method as a root finder for complex polynomials of arbitrary degree. While polynomial root finding continues to be one of the fundamental tasks of computing, with essential use in all areas of theoretical…
Here we will embark on a journey starting with some ostensibly inauspicious boxes. Carefully stacking them in different ways yields amazing identities. From humble beginnings at the integer version: `how many steps does it take to get from…
We give a polynomial time algorithm to decode multivariate polynomial codes of degree $d$ up to half their minimum distance, when the evaluation points are an arbitrary product set $S^m$, for every $d < |S|$. Previously known algorithms can…
We give an elementary proof of the development of Macdonald polynomials in terms of "modified complete" and elementary symmetric functions.
In this paper, we introduce an algorithm for extracting topological data from translation invariant generalized Pauli stabilizer codes in two-dimensional systems, focusing on the analysis of anyon excitations and string operators. The…
We design two deterministic polynomial time algorithms for variants of a problem introduced by Edmonds in 1967: determine the rank of a matrix M whose entries are homogeneous linear polynomials over the integers. Given a linear subspace B…
This paper naturally extends and generalizes our previous work "Thue-Morse constant is not badly approximable", arXiv:1407.3182 [math.NT]. Here we consider the Laurent series $f_d(x) = \prod_{n=0}^\infty (1 - x^{-d^n})$, $d\in\mathbb{N}$,…
We explore the relation of the super Macdonald polynomials and the BPS state counting on the blow-up of $\mathbb{P}^2$, which is mathematically described by framed stable perverse coherent sheaves. Fixed points of the torus action on the…
In continuation to our recent work on noncommutative polynomial factorization, we consider the factorization problem for matrices of polynomials and show the following results. (1) Given as input a full rank $d\times d$ matrix $M$ whose…
Let $A \in \mathbb{Z}^{m \times n}$ be an integer matrix with components bounded by $\Delta$ in absolute value. Cook et al.~(1986) have shown that there exists a universal matrix $B \in \mathbb{Z}^{m' \times n}$ with the following property:…
Motivated by the convolutive behavior of the counting function for partitions with designated summands in which all parts are odd, we consider coefficient sequences $(a_n)_{n\ge 0}$ of primitive eta-products that satisfy the generic…
Computation of (approximate) polynomials common factors is an important problem in several fields of science, like control theory and signal processing. While the problem has been widely studied for scalar polynomials, the scientific…