Related papers: Fast Evaluation of Generalized Todd Polynomials: A…
Using diagrammatic resummation techniques, we investigate the double-logarithmic series of the "soft-overlap" contribution to $B_c \to \eta_c$ transition form factors at large hadronic recoil, assuming the scale hierarchy $m_b \gg m_c \gg…
We study the generating functions of cylindric partitions having profile $c=(c_1, c_2, \ldots, c_r)$ with rank $2$ and levels $2, 3$ and $4$. As a result, we give expressions alternative to Borodin's formula for these generating functions.…
The Bernstein-Sato polynomial (or global b-function) is an important invariant in singularity theory, which can be computed using symbolic methods in the theory of D-modules. After surveying algorithms for computing the global b-function,…
A function g, with domain the natural numbers, is a quasi-polynomial if there exists a period m and polynomials p_0,p_1,...,p_{m-1} such that g(t)=p_i(t) for t=i mod m. Quasi-polynomials classically -- and "reasonably" -- appear in Ehrhart…
We prove that for any fixed d the generating function of the projection of the set of integer points in a rational d-dimensional polytope can be computed in polynomial time. As a corollary, we deduce that various interesting sets of lattice…
A generalization of the Macdonald polynomials depending upon both commuting and anticommuting variables has been introduced recently. The construction relies on certain orthogonality and triangularity relations. Although many…
We present a multivariate generating function for all n x n nonnegative integral matrices with all row and column sums equal to a positive integer t, the so called semi-magic squares. As a consequence we obtain formulas for all coefficients…
We derive exact matrix integral representations for different sums over partitions. The characteristic feature of all obtained matrix models is the presence of logarithmic (or, vice versa, exponential) terms in the potential. Our derivation…
We give an algorithm for computing approximate PSD factorizations of nonnegative matrices. The running time of the algorithm is polynomial in the dimensions of the input matrix, but exponential in the PSD rank and the approximation error.…
We study a broad class of polynomial optimization problems whose constraints and objective functions exhibit sparsity patterns. We give two characterizations of the number of critical points to these problems, one as a mixed volume and one…
We study the triple convolution sum of the generalised divisor functions $$\sum_{n\leq x} d_k(n+h)d_l(n)d_m(n-h),$$ where $h \le x^{1-\epsilon}$ for any $\epsilon>0$ and $d_k(n)$ denotes the generalised divisor function which counts the…
We introduce a new family of symmetric multivariate polynomials, whose coefficients are meromorphic functions of two parameters $(q,t)$ and polynomial in a further two parameters $(u,v)$. We evaluate these polynomials explicitly as a matrix…
The purpose of this paper consists to study the sums of the type $P(n) + P(n - d) + P(n - 2 d) + \dots$, where $P$ is a real polynomial, $d$ is a positive integer and the sum stops at the value of $P$ at the smallest natural number of the…
This paper investigates the asymptotics of the number of prime values taken by a polynomial in several variables with integer coefficients. Based on probabilistic heuristics and the multidimensional Bateman Horn conjecture, the expected…
We adapt the time-evolving block decimation (TEBD) algorithm, originally devised to simulate the dynamics of 1D quantum systems, to simulate the time-evolution of non-equilibrium stochastic systems. We describe this method in detail; a…
The content of a polynomial $f(t)$ is the ideal generated by its coefficients. Our aim here is to consider a beautiful formula of Dedekind-Mertens on the content of the product of two polynomials, to explain some of its features from the…
Using the theory of Macdonald, Gordon showed that the graded characters of the simple modules for the restricted rational Cherednik algebra by Etingof and Ginzburg associated to the symmetric group $\mathfrak{S}_n$ are given by…
We study the problem of computing the isolated regular solutions of a system \((f_1,\ldots,f_n)\) of \(n\) polynomial equations in \(n\) variables \((X_1, \dots, X_n)\) over a field of characteristic zero \(k\). We focus on systems with a…
For any polynomial $P(x)\in\mathbb{Z}[x],$ we study arithmetic dynamical systems generated by $\displaystyle{F_P(n)=\prod_{k\le n}}P(n)(\text{mod}\ p),$ $n\ge 1.$ We apply this to improve the lower bound on the number of distinct quadratic…
We study polynomial systems with prescribed monomial supports in the Cox rings of toric varieties built from complete polyhedral fans. We present combinatorial formulas for the dimensions of their associated subvarieties under genericity…