Related papers: From boxes to polynomials: a story of generalisati…
Mathematical proofs are both paradigms of certainty and some of the most explicitly-justified arguments that we have in the cultural record. Their very explicitness, however, leads to a paradox, because the probability of error grows…
Motivated by applications to the fractional quantum Hall effect and, in particular, to the Bernevig-Haldane conjectures, we investigates the behavior of Macdonald polynomials under specializations of the form q a t b = 1. Our main focus is…
A new polynomial sieve is presented and used to show that almost all integers have at most one representation as a sum of two values of a given polynomial of degree at least 3.
The Collatz conjecture is explored using polynomials based on a binary numeral system. It is shown that the degree of the polynomials, on average, decreases after a finite number of steps of the Collatz operation, which provides a weak…
The triad refers to embedding the Macdonald polynomials into the Noumi-Shiraishi functions and their reduction to solutions of simple linear equations at particular values of $t$. It provides an alternative definition of Macdonald theory.…
We present an explicit formula for the transition matrix $\mathcal{C}$ from the type $C_n$ degeneration of the Koornwinder polynomials $P_{(1^r)}(x\,|\,a,-a,c,-c\,|\,q,t)$ with one column diagrams, to the type $C_n$ monomial symmetric…
We prove that a $q$-deformation $\Disc k\X q$ of the powers of the discriminant is equal, up to a normalization, to a specialization of a Macdonald polynomial indexed by a staircase partition. We investigate the expansion of $\Disc k\X q$…
In a recent work, Maciej Do\l{}e\k{}ga and the author have given a formula of the expansion of the Jack polynomial $J^{(\alpha)}_\lambda$ in the power-sum basis as a non-orientability generating series of bipartite maps whose edges are…
The inverse of a large matrix can often be accurately approximated by a polynomial of degree significantly lower than the order of the matrix. The iteration polynomial generated by a run of the GMRES algorithm is a good candidate, and its…
A general theorem on factorization of matrices with polynomial entries is proven and it is used to reduce polynomial Darboux matrices to linear ones. Some new examples of linear Darboux matrices are discussed.
In this article we give a combinatorial formula for a certain class of Koornwinder polynomials, also known as Macdonald polynomials of type $\tilde{C}$. In particular, we give a combinatorial formula for the Koornwinder polynomials…
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…
We identify pairs of positive integers $(t, d)$ with the property that the integer sequence with general term $\lfloor{n^t/d\rfloor}$ contains at most finitely many primes.
The close relationship among the polynomial functions and Fibonacci numerical sequences is shown in this paper. These numerical sequences are defined by the recurrence equation $x_{k + n} = \displaystyle\sum_{j = 0}^{n-1}\alpha_j x_{k +…
We give an interpretation of the t=1 specialization of the modified Macdonald polynomial as a generating function of the energy statistics defined on the set of paths arising in the context of Box-Ball Systems (BBS-paths for short). We also…
We investigate the relationship between several enumeration complexity classes and focus in particular on problems having enumeration algorithms with incremental and polynomial delay (IncP and DelayP respectively). We show that, for some…
Wreath Macdonald polynomials arise from the geometry of $\Gamma$-fixed loci of Hilbert schemes of points in the plane, where $\Gamma$ is a finite cyclic group of order $r\ge 1$. For $r=1$, they recover the classical (modified) Macdonald…
It is well known that ascents, descents and plateaux are equidistributed over the set of classical Stirling permutations. Their common enumerative polynomials are the second-order Eulerian polynomials, which have been extensively studied by…
In this sequel to my previous paper, "Is String Theory in Knots?" I explore ways of constructing symmetries through an algebraic stepping process using knotted graphs. The hope is that this may lead to an algebraic formulation of string…
We provide sufficient conditions for systems of polynomial equations over general (real or complex) algebras to have a solution. This generalizes known results on quaternions, octonions and matrix algebras. We also generalize the…