The connection problem for orthogonal polynomials is, given a polynomial expressed in the basis of one set of orthogonal polynomials, computing the coefficients with respect to a different set of orthogonal polynomials. Expansions in terms of orthogonal polynomials are very common in many applications. While the connection problem may be solved by directly computing the change–of–basis matrix, ...

In this talk we present some recent results related to Schubert and Grothendieck polynomials. These polynomials represent Schubert classes, which form the natural bases of the cohomology and K-theory of the complex flag variety. We present background information on several combinatorial constructions of Schubert and Grothendieck polynomials. Then we present the solution to a conjecture concerni...

Algebraic cryptanalysis usually requires to recover the secret key by solving polynomial equations. Gröbner bases algorithm is a well-known method to solve this problem. However, a serious drawback exists in the Gröbner bases based algebraic attacks, namely, any information won’t be got if we couldn’t work out the Gröbner bases of the polynomial equations system. In this paper, firstly, a gener...

Two fundamental questions in the theory of Gröbner bases are decision (‘Is a basis G of a polynomial ideal a Gröbner basis?’) and transformation (‘If it is not, how do we transform it into a Gröbner basis?’) This paper considers the first question. It is well known that G is a Gröbner basis if and only if a certain set of polynomials (the S-polynomials) satisfy a certain property. In general th...

The Ball basis was introduced for cubic polynomials by Ball, and two different generalizations for higher degree m polynomials have been called the Said–Ball and the Wang–Ball basis, respectively. In this paper, we analyze some shape preserving and stability properties of these bases. We prove that the Wang–Ball basis is strictly monotonicity preserving for all m. However, it is not geometrical...

We prove that the resultant of two “sufficiently generic” bivariate polynomials over a finite field can be computed in quasi-linear expected time, using randomized algorithm Las Vegas type. A similar complexity bound is proved for computation lexicographical Gröbner basis ideal generated by polynomials.

In their classic 1914 paper, Polýa and Schur introduced and characterized two types of linear operators acting diagonally on the monomial basis of R[x], sending real-rooted polynomials (resp. polynomials with all nonzero roots of the same sign) to real-rooted polynomials. Motivated by fundamental properties of amoebae and discriminants discovered by Gelfand, Kapranov, and Zelevinsky, we introdu...

We introduce the so-called Clifford–Hermite polynomials in the framework of Dunkl operators, based on the theory of Clifford analysis. Several properties of these polynomials are obtained, such as a Rodrigues formula, a differential equation and an explicit relation connecting them with the generalized Laguerre polynomials. A link is established with the generalized Hermite polynomials related ...

For a class of orthogonal polynomials related to the q-Meixner polynomials corresponding to an indeterminate moment problem we give a one-parameter family of orthogonality measures. For these measures we complement the orthogonal polynomials to an orthogonal basis for the corresponding weighted L-space explicitly. The result is proved in two ways; by a spectral decomposition of a suitable opera...

On the SU(2) quantum group the notion of (zonal) spherical element is generalized by considering left and right invariance in the infinitesimal sense with respect to twisted primitive elements of the sl(2) quantized universal enveloping algebra. The resulting spherical elements belonging to irreducible representations of quantum SU(2) turn out to be expressible as a two-parameter family of Aske...