Related papers: Bi-orthogonal Polynomials and the Five parameter A…
We introduce deformations of Kazhdan-Lusztig elements and specialised nonsymmetric Macdonald polynomials, both of which form a distinguished basis of the polynomial representation of a maximal parabolic subalgebra of the Hecke algebra. We…
We give a new method for the evaluation of a class of integrals of rational symmetric functions in N pairs of variables {x_a, y_a}_{a=1,... N} arising in coupled matrix models, valid for a broad class of two-variable measures. The result is…
A hypergeometric type equation satisfying certain conditions defines either a finite or an infinite system of orthogonal polynomials. We present in a unified and explicit way all these systems of orthogonal polynomials, the associated…
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 study the bi-commutators $[T_1, [b, T_2]]$ of pointwise multiplication and Calder\'on-Zygmund operators, and characterize their $L^{p_1}L^{p_2} \to L^{q_1}L^{q_2}$ boundedness for several off-diagonal regimes of the mixed-norm…
In this paper we show that a quasi-exactly solvable (normalizable or periodic) one-dimensional Hamiltonian satisfying very mild conditions defines a family of weakly orthogonal polynomials which obey a three-term recursion relation. In…
The algebraic diversity framework generalizes temporal averaging over multiple observations to algebraic group action on a single observation for second-order statistical estimation. The central open problem in this framework is…
We consider a family of linear systems $A_\mu \alpha=C$ with system matrix $A_\mu$ depending on a parameter $\mu$ and for simplicity parameter-independent right-hand side $C$. These linear systems typically result from the…
We generalize the concept of the symmetric hyperdeterminants for symmetric tensors to the E-determinants for general tensors. We show that the E-determinant inherits many properties of the determinant of a matrix. These properties include:…
We consider the biorthogonal polynomials associated to the two-matrix model where the eigenvalue distribution has potentials V_1,V_2 with arbitrary rational derivative and whose supports are constrained on an arbitrary union of intervals…
We consider biorthogonal polynomials that arise in the study of a generalization of two--matrix Hermitian models with two polynomial potentials V_1(x), V_2(y) of any degree, with arbitrary complex coefficients. Finite consecutive…
We study the partially asymmetric exclusion process with open boundaries. We generalise the matrix approach previously used to solve the special case of total asymmetry and derive exact expressions for the partition sum and currents valid…
The central object of study in this paper are infinite banded Hessenberg matrices admitting factorisations as products of bidiagonal matrices. In the two main novel results of this paper, we show that these Hessenberg matrices are…
We introduce matrix-valued weight functions of arbitrary size, which are analogues of the weight function for the Gegenbauer or ultraspherical polynomials for the parameter $\nu>0$. The LDU-decomposition of the weight is explicitly given in…
One object of interest in random matrix theory is a family of point ensembles (random point configurations) related to various systems of classical orthogonal polynomials. The paper deals with a one--parametric deformation of these…
We study the monic orthogonal polynomials with respect to a singularly perturbed Airy weight. By using Chen and Ismail's ladder operator approach, we derive a discrete system satisfied by the recurrence coefficients for the orthogonal…
The permanent vs. determinant problem is one of the most important problems in theoretical computer science, and is the main target of geometric complexity theory proposed by Mulmuley and Sohoni. The current best lower bound for the…
This paper studies symmetric tensor decompositions. For symmetric tensors, there exist linear relations of recursive patterns among their entries. Such a relation can be represented by a polynomial, which is called a generating polynomial.…
Effective computation of resultants is a central problem in elimination theory and polynomial system solving. Commonly, we compute the resultant as a quotient of determinants of matrices and we say that there exists a determinantal formula…
A new technique is presented to solve a class of linear boundary value problems (BVP). Technique is primarily based on an operational matrix developed from a set of modified Bernoulli polynomials. The new set of polynomials is an…