Related papers: Fast Evaluation of Generalized Todd Polynomials: A…
Classically, a single weight on an interval of the real line leads to moments, orthogonal polynomials and tridiagonal matrices. Appropriately deforming this weight with times t=(t_1,t_2,...), leads to the standard Toda lattice and…
We find new universal factorization identities for generalized Macdonald polynomials on the topological locus. We prove the identities (which include all previously known forumlas of this kind) using factorization identities for matrix…
The Macdonald polynomials with prescribed symmetry are obtained from the nonsymmetric Macdonald polynomials via the operations of $t$-symmetrisation, $t$-antisymmetrisation and normalisation. Motivated by corresponding results in Jack…
Sparse (or toric) elimination exploits the structure of polynomials by measuring their complexity in terms of Newton polytopes instead of total degree. The sparse, or Newton, resultant generalizes the classical homogeneous resultant and its…
We show how some special production matrices may be used to define families of generalized Eulerian triangles. We furthermore show that these generalized Eulerian triangles are the coefficient arrays of polynomials which are the moments of…
A general explicit form for generating functions for approximating fractional derivatives is derived. To achieve this, an equivalent characterisation for consistency and order of approximations established on a general generating function…
Elementary symmetric polynomials $S_n^k$ are used as a benchmark for the bounded-depth arithmetic circuit model of computation. In this work we prove that $S_n^k$ modulo composite numbers $m=p_1p_2$ can be computed with much fewer…
Multiplication of polynomials is among key operations in computer algebra which plays important roles in developing techniques for other commonly used polynomial operations such as division, evaluation/interpolation, and factorization. In…
Suppose we are given an $n$-dimensional order-3 symmetric tensor $T \in (\mathbb{R}^n)^{\otimes 3}$ that is the sum of $r$ random rank-1 terms. The problem of recovering the rank-1 components is possible in principle when $r \lesssim n^2$…
The polynomial multiplication problem has attracted considerable attention since the early days of computer algebra, and several algorithms have been designed to achieve the best possible time complexity. More recently, efforts have been…
In the $1970$s, Nicolas proved that the partition function $p(n)$ is log-concave for $ n > 25$. In \cite{HNT21}, a precise conjecture on the log-concavity for the plane partition function $\func{pp}(n)$ for $n >11$ was stated. This was…
Determining the Jordan canonical form of the tensor product of Jordan blocks has many applications including to the representation theory of algebraic groups, and to tilting modules. Although there are several algorithms for computing this…
In this paper we use the double affine Hecke algebra to compute the Macdonald polynomial products $E_\ell P_m$ and $P_\ell P_m$ for type $SL_2$ and type $GL_2$ Macdonald polynomials. Our method follows the ideas of Martha Yip but executes a…
We introduce and investigate multivariate Tutte polynomials, dichromatic polynomials, subset-corank polynomials, size-corank polynomials, and rank generating polynomials of semimatroids, which generalize the corresponding polynomial…
We use the equivariant cohomology ring of the permutohedral variety to study matroids and their invariants. Investigating the pushforward of matroid Chern classes defined by A. Berget, C. Eur, H. Spink and D. Tseng to the product space…
For an arbitrary solution to the KdV hierarchy, the generating series of logarithmic derivatives of the tau-function of the solution can be expressed by the basic matrix resolvent via algebraic manipulations. Based on this we develop in…
We consider a few modifications of the Big prime modular $\gcd$ algorithm for polynomials in $\Z[x]$. Our modifications are based on bounds of degrees of modular common divisors of polynomials, on estimates of the number of prime divisors…
Define the codewords of the Tensor Reed-Muller code $\mathsf{TRM}(r_1,m_1;r_2,m_2;\dots;r_t,m_t)$ to be the evaluation vectors of all multivariate polynomials in the variables $\left\{x_{ij}\right\}_{i=1,\dots,t}^{j=1,\dots m_i}$ with…
Our main contribution is a polynomial-time algorithm to reduce a $k$-colorable gammoid to a $(2k-2)$-colorable partition matroid. It is known that there are gammoids that can not be reduced to any $(2k-3)$-colorable partition matroid, so…
A \emph{quasi-polynomial} is a function defined of the form $q(k) = c_d(k) k^d + c_{d-1}(k) k^{d-1} + ... + c_0(k)$, where $c_0, c_1, ..., c_d$ are periodic functions in $k \in \Z$. Prominent examples of quasi-polynomials appear in…