Related papers: Fast Evaluation of Generalized Todd Polynomials: A…
We suggest a further generalization of the hypergeometric-like series due to M. Noumi and J. Shiraishi by substituting the Pochhammer symbol with a nearly arbitrary function. Moreover, this generalization is valid for the entire Shiraishi…
Gradient-based algorithms, popular strategies to optimization problems, are essential for many modern machine-learning techniques. Theoretically, extreme points of certain cost functions can be found iteratively along the directions of the…
We introduce a class of orthogonal polynomials in two variables which generalizes the disc polynomials and the 2-$D$ Hermite polynomials. We identify certain interesting members of this class including a one variable generalization of the…
A positroid is a matroid realized by a matrix such that all maximal minors are non-negative. Positroid polytopes are matroid polytopes of positroids. In particular, they are lattice polytopes. The Ehrhart polynomial of a lattice polytope…
We analyse and compare the complexity of several algorithms for computing modular polynomials. We show that an algorithm relying on floating point evaluation of modular functions and on interpolation, which has received little attention in…
We study generating functions of ordinary and plane partitions coloured by the action of a finite subgroup of the corresponding special linear group. After reviewing known results for the case of ordinary partitions, we formulate a…
In quantum computation we are given a finite set of gates and we have to perform a desired operation as a product of them. The corresponding computational problem is approximating an arbitrary unitary as a product in a topological…
Two methods of constructing 2D Toda $\tau$-functions that are generating functions for certain geometrical invariants of a combinatorial nature are related. The first involves generation of paths in the Cayley graph of the symmetric group…
Using the cyclotomic identity we compute sums over d-tuples of monic polynomials in F_q[x] weighted by the multiplicity of their irreducible factors. As consequences we determine explicit expressions for the number of d-tuples of…
We show that for any constant d, complex roots of degree d univariate rational (or Gaussian rational) polynomials---given by a list of coefficients in binary---can be computed to a given accuracy by a uniform TC^0 algorithm (a uniform…
We investigate polynomials, called m-polynomials, whose generator polynomial has coefficients that can be arranged as a matrix, where q is a positive integer greater than one. Orthogonality relations are established and coefficients are…
Polynomial system solving is a classical problem in mathematics with a wide range of applications. This makes its complexity a fundamental problem in computer science. Depending on the context, solving has different meanings. In order to…
A generalization of the Vandermonde matrices which arise when the power basis is replaced by the Said-Ball basis is considered. When the nodes are inside the interval (0,1), then those matrices are strictly totally positive. An algorithm…
A general family of matrix valued Hermite type orthogonal polynomials is introduced and studied in detail by deriving Pearson equations for the weight and matrix valued differential equations for these matrix polynomials. This is used to…
We study a new kind of symmetric polynomials P_n(x_1,...,x_m) of degree n in m real variables, which have arisen in the theory of numerical semigroups. We establish their basic properties and find their representation through the power sums…
Suppose that $a_1(n),a_2(n),...,a_s(n),m(n)$ are integer-valued polynomials in $n$ with positive leading coefficients. This paper presents Popoviciu type formulas for the generalized restricted partition function…
We give a deterministic algorithm for approximately counting satisfying assignments of a degree-$d$ polynomial threshold function (PTF). Given a degree-$d$ input polynomial $p(x_1,\dots,x_n)$ over $R^n$ and a parameter $\epsilon> 0$, our…
An overview of the basic results on Macdonald(-Koornwinder) polynomials and double affine Hecke algebras is given. We develop the theory in such a way that it naturally encompasses all known cases. Among the basic properties of the…
Let $A=\{{\bf a}_1,...,{\bf a}_m\} \subset \mathbb{Z}^n$ be a vector configuration and $I_A \subset K[x_1,...,x_m]$ its corresponding toric ideal. The paper consists of two parts. In the first part we completely determine the number of…
Singular nonsymmetric Macdonald polynomials are constructed by use of the representation theory of the Hecke algebras of the symmetric groups. These polynomials are labeled by quasistaircase partitions and are associated to special…