Related papers: Continuant, Chebyshev polynomials, and Riley polyn…
Through dualities on representations on tensor powers and symmetric powers respectively, the partition algebra and multiset partition algebra have been used to study long-standing questions in the representation theory of the symmetric…
Given a symmetric polynomial $P$ in $2n$ variables, there exists a unique symmetric polynomial $Q$ in $n$ variables such that \[ P(x_1,\ldots,x_n,x_1^{-1},\ldots,x_n^{-1}) =Q(x_1+x_1^{-1},\ldots,x_n+x_n^{-1}). \] We denote this polynomial…
The A-polynomial is a knot invariant related to the space of $SL_2(\mathbb{C})$ representations of the knot group. In this paper our interests lies in the logarithmic Gauss map of the A-polynomial. We develop a homological point of view on…
Chebyshev polynomials of the first and second kind for a set K are monic polynomials with minimal L $\infty$-and L 1-norm on K, respectively. This articles presents numerical procedures based on semidefinite programming to compute these…
Recursive algebraic construction of two infinite families of polynomials in $n$ variables is proposed as a uniform method applicable to every semisimple Lie group of rank $n$. Its result recognizes Chebyshev polynomials of the first and…
An explicit formula for the $A$-polynomial of the knot with Conway's notation $C(2n,3)$ is obtained from the explicit Riley-Mednykh polynomial of it.
We give a proof of the generalized Cauchy identity for double Grothendieck polynomials, a combinatorial interpretation of the stable double Grothendieck polynomials in terms of triples of tableaux, and an interpolation between the stable…
H. Lenstra has pointed out that a cubic polynomial of the form (x-a)(x-b)(x-c) + r(x-d)(x-e), where {a,b,c,d,e} is some permutation of {0,1,2,3,4}, is irreducible modulo 5 because every possible linear factor divides one summand but not the…
We present a polynomiality property of the Littlewood-Richardson coefficients c_{\lambda\mu}^{\nu}. The coefficients are shown to be given by polynomials in \lambda, \mu and \nu on the cones of the chamber complex of a vector partition…
We prove the bivariate Cayley-Hamilton theorem, a powerful generalization of the classical Cayley-Hamilton theorem. The bivariate Cayley-Hamilton theorem has three direct corollaries that are usually proved independently: The classical…
Gaussian polynomial, which is also known as $q$-binomial coefficient, is one of the fundamental concepts in the theory of partitions. Zeilberger provided a combinatorial proof of Gaussian polynomial, which is called Algorithm Z by Andrews…
The principal character of a representation of the free group of rank two into PSL(2, C) is a triple of complex numbers that determines an irreducible representation uniquely up to conjugacy. It is a central problem in the geometry of…
In 1980, Lusztig introduced the periodic Kazhdan-Lusztig polynomials, which are conjectured to have important information about the characters of irreducible modules of a reductive group over a field of positive characteristic, and also…
An elementary introduction to Khovanov construction of superpolynomials. Despite its technical complexity, this method remains the only source of a definition of superpolynomials from the first principles and therefore is important for…
The classical Eulerian polynomials can be expanded in the basis $t^{k-1}(1+t)^{n+1-2k}$ ($1\leq k\leq\lfloor (n+1)/2\rfloor$) with positive integral coefficients. This formula implies both the symmetry and the unimodality of the Eulerian…
The adjoint polynomial of $G$ is \[h(G,x)=\sum_{k=1}^n(-1)^{n-k}a_k(G)x^k,\] where $a_k(G)$ denotes the number of ways one can cover all vertices of the graph $G$ by exactly $k$ disjoint cliques of $G$. In this paper we show the the adjoint…
We construct an integer polynomial whose coefficients enumerate the Kauffman states of the two-bridge knot with Conway's notation C(n,r).
We use the Chebyshev knot diagram model of Koseleff and Pecker in order to introduce a random knot diagram model by assigning the crossings to be positive or negative uniformly at random. We give a formula for the probability of choosing a…
We define 2-decompositions of ribbon graphs, which generalise 2-sums and tensor products of graphs. We give formulae for the Bollobas-Riordan polynomial of such a 2-decomposition, and derive the classical Brylawski formula for the Tutte…
We study certain kind of polynomials associated with Lissajous curves, called Chebyshev-Lissajous polynomials. We investigate their irreducibilities over the real numbers and complex numbers, thus comfirming two conjectures proposed by…