Related papers: Rotundus: triangulations, Chebyshev polynomials, a…

We prove that any invariant of a 4-quiver, that is piecewise polynomial, moreover, polynomial for fixed signs of entries, is a function of determinant of a quiver.

We define a triangular change of basis in which the form is diagonal and explicitly compute the diagonal entries of this matrix as products of quotients of Chebyshev polynomials, corroborating the determinant computation of Ko and…

We express the colored Jones polynomial as the inverse of the quantum determinant of a matrix with entries in the $q$-Weyl algebra of $q$-operators, evaluated at the trivial function (plus simple substitutions). The Kashaev invariant is…

The main object of the paper is to reveal connections between Chebyshev polynomials of the first and second kinds and Fibonacci polynomials introduced by Catalan. This is achieved by relating the respective (ordinary and exponential)…

Let t be any integer and fix an odd prime ell. Let Phi(x) = T_ell^n(x)-t denote the n-fold composition of the Chebyshev polynomial of degree ell shifted by t. If this polynomial is irreducible, let K = bbq(theta), where theta is a root of…

In this note, we explore certain determinantal descriptions of the Robbins numbers. Techniques used for this include continued fractions, Riordan arrays and series inversion. Proven and conjectured representations involve the determinants…

Phylogenetic invariants are certain polynomials in the joint probability distribution of a Markov model on a phylogenetic tree. Such polynomials are of theoretical interest in the field of algebraic statistics and they are also of practical…

We introduce a new family of symmetric polynomials $\mathfrak{G}^{(\mathbf{u},\mathbf{v})}_{\lambda}$ arising from exactly solvable lattice models associated with the quantised loop algebra $\mathcal{U}_{q}(\mathfrak{sl}_{2}[z^\pm])$. The…

There is a digraph corresponding to every square matrix over $\mathbb{C}$. We generate a recurrence relation using the Laplace expansion to calculate the characteristic, and permanent polynomials of a square matrix. Solving this recurrence…

In this paper we study polynomial maps of vector spaces and their eigenvectors and eigenvalues. The new quantity called complanart is defined. Complanarts determine complanarity of solution vectors of systems of polynomial equations.…

In this paper we introduce and discuss some classes of orthogonal polynomials in several non-commuting variables. The emphasis is on a non-commutative version of the orthogonal polynomials on the real line. We introduce recurrence equations…

We establish a new extremal property of the classical Chebyshev polynomials in the context of best rank-one approximation of tensors. We also give some necessary conditions for a tensor to be a minimizer of the ratio of spectral and…

A Littlewood polynomial is a single-variable polynomial all of whose coefficients lie in $\{ \pm 1\}$. We establish the leading term asymptotics of the number of reciprocal or skew-reciprocal Littlewood polynomials with square discriminant.…

For certain tame abelian covers of arithmetic surfaces X/Y we obtain striking formulas, involving a quadratic form derived from intersection numbers, for the equivariant Euler characteristics of both the canonical sheaf !X/Y and also its…

The analytical solution of the three--dimensional linear pendulum in a rotating frame of reference is obtained, including Coriolis and centrifugal accelerations, and expressed in terms of initial conditions. This result offers the…

We exhibit explicit expressions, in terms of components, of discriminants, determinants, characteristic polynomials and polynomial identities for matrices of higher rank. We define permutation tensors and in term of them we construct…

We show that the ungraded ruling invariants of a Legendrian link can be realized as certain coefficients of the Kauffman polynomial which are non-vanishing if and only if the upper bound for the Bennequin number given by the Kauffman…

We consider systems of Laurent polynomials with support on a fixed point configuration. In the non-defective case, the closure of the locus of coefficients giving a non-degenerate multiple root of the system is defined by a polynomial…

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…

In this article, the 2-iterated Sheffer polynomials are introduced by means of generating function and operational representation. Using the theory of Riordan arrays and relations between the Sheffer sequences and Riordan arrays, a…