Related papers: Polynomial-exponential decomposition from moments
In this paper we apply a method of Robinson and Taulbee for computing Kronecker coefficients together with other ingredients and show that the multiplicity of each component in a Kronecker square can be obtained from an evaluation of a…
A semi-infinite weighted Hankel matrix with entries defined in terms of basic hypergeometric series is explicitly diagonalized as an operator on $\ell^{2}(\mathbb{N}_{0})$. The approach uses the fact that the operator commutes with a…
We analyze a random lozenge tiling model of a large regular hexagon, whose underlying weight structure is periodic of period $2$ in both the horizontal and vertical directions. This is a determinantal point process whose correlation kernel…
We study Wronskians of Hermite polynomials labelled by partitions and use the combinatorial concepts of cores and quotients to derive explicit expressions for their coefficients. These coefficients can be expressed in terms of the…
The starting point for this work is an identity that relates the number of minimal matrices with prescribed 1-marginals and coefficient sequence to a linear combination of Kronecker coefficients. In this paper we provide a bijection that…
We define the non-commutative multiple bi-orthogonal polynomial systems, which simultaneously generalize the concepts of multiple orthogonality, matrix orthogonal polynomials and of the bi-orthogonality. We present quasideterminantal…
We consider systems of polynomial equations and inequalities in $\mathbb{Q}[\boldsymbol{y}][\boldsymbol{x}]$ where $\boldsymbol{x} = (x_1, \ldots, x_n)$ and $\boldsymbol{y} = (y_1, \ldots,y_t)$. The $\boldsymbol{y}$ indeterminates are…
The theory of the Kauffman bracket, which describes the Jones polynomial as a sum over closed circles formed by the planar resolution of vertices in a knot diagram, can be straightforwardly lifted from sl(2) to sl(N) at arbitrary N -- but…
We suggest a novel approach to polynomial processes solely based on a polynomial action operator. With this approach, we can analyse such processes on general state spaces, going far beyond Banach spaces. Moreover, we can be very flexible…
The standard way of solving a polynomial eigenvalue problem associated with a matrix polynomial starts by embedding the matrix coefficients of the polynomial into a matrix pencil, known as a strong linearization. This process transforms the…
In this paper we use the technique of Hopf algebras and quasi-symmetric functions to study the combinatorial polytopes. Consider the free abelian group $\mathcal{P}$ generated by all combinatorial polytopes. There are two natural bilinear…
We elaborate on the simple alternative from arXiv:1308.5759 to the matrix-factorization construction of Khovanov-Rozansky (KR) polynomials for arbitrary knots and links in the fundamental representation of arbitrary SL(N). Construction…
We increase the scope of previous work on change of basis between finite bases of polynomials by defining ascending and descending bases and introducing three techniques for defining them from known ones. The minimum degrees of polynomials…
The computation of Kronecker coefficients is a challenging problem with a variety of applications. In this paper we present an approach based on methods from symplectic geometry and residue calculus. We outline a general algorithm for the…
Cylindrical Algebraic Decomposition (CAD) has long been one of the most important algorithms within Symbolic Computation, as a tool to perform quantifier elimination in first order logic over the reals. More recently it is finding…
This paper defines and investigates nonsymmetric Macdonald polynomials with values in an irreducible module of the Hecke algebra of type $A_{N-1}$. These polynomials appear as simultaneous eigenfunctions of Cherednik operators. Several…
Many high-dimensional uncertainty quantification problems are solved by polynomial dimensional decomposition (PDD), which represents Fourier-like series expansion in terms of random orthonormal polynomials with increasing dimensions. This…
The first half of this paper is largely expository, wherein we present a systematic combinatorial approach to the theory of polynomial (semi)invariants and multilinear invariants of several vectors and covectors, for the classical groups.…
A $P_{k+2}$ polynomial lifting operator is defined on polygons and polyhedrons. It lifts discontinuous polynomials inside the polygon/polyhedron and on the faces to a one-piece $P_{k+2}$ polynomial. With this lifting operator, we prove that…
We focus on two central themes in this dissertation. The first one is on decomposing polytopes and polynomials in ways that allow us to perform nonlinear optimization. We start off by explaining important results on decomposing a polytope…