Related papers: Generalized characteristic polynomials and Gaussia…
Orthogonal polynomials in two variables on cubic curves are considered, including the case of elliptic curves. For an integral with respect to an appropriate weight function defined on a cubic curve, an explicit basis of orthogonal…
We extend the close interplay between continued fractions, orthogonal polynomials, and Gaussian quadrature rules to several variables in a special but natural setting which we characterize in terms of moment sequences. The crucial condition…
This paper introduces a notion of 2-orthogonality for a sequence of polynomials to give extended versions of the Meixner and Feinsilver characterization results based on orthogonal polynomials. These new versions subsume the Letac-Mora…
The typical definition of the characteristic polynomial seems totally ad hoc to me. This note gives a canonical construction of the characteristic polynomial as the minimal polynomial of a "generic" matrix. This approach works not just for…
Generalized numberings are an extension of Ershov's notion of numbering, based on partial combinatory algebra (pca) instead of the natural numbers. We study various algebraic properties of generalized numberings, relating properties of the…
We introduce a generalization of bivariate Griffiths polynomials depending on an additional parameter $\lambda$. These $\lambda$-Griffiths polynomials are bivariate, bispectral and biorthogonal. For two specific values of the parameter…
An infinite family of Boolean polynomials which correspond to the discrete average maps, defined in [2], is constructed and their algebraic and combinatorial properties are investigated. They turn out to be balanced, and some recurrence…
This paper proves that the characteristic polynomial is a complete unitary invariant for pairs of projection matrices. Some special cases involving three or more projections are also considered.
Let $W$ be a $G$-graded algebra over a field of characteristic zero, where $G$ is a finite group. We develope a theory of generalized $G$-graded polynomial identities satisfied by any finite-dimensional $W$-algebra $A$, by mean of the…
We characterize characteristic polynomials of elements in a central simple algebra. We also give an account for the theory of rational canonical forms for separable linear transformations over a central division algebra, and a description…
The estimates of the uniform norm of the Chebyshev polynomial associated with a compact set $K$ consisting of a finite number of continua in the complex plane are established. These estimates are exact (up to a constant factor) in the case…
A family of minimal cubature rules is established on an unbounded domain, which is the first such family known on unbounded domains. The nodes of such cubature rules are common zeros of certain orthogonal polynomials on the unbounded…
The techniques for polynomial interpolation and Gaussian quadrature are generalized to matrix-valued functions. It is shown how the zeros and rootvectors of matrix orthonormal polynomials can be used to get a quadrature formula with the…
The (generalised) Mellin transforms of certain Chebyshev and Gegenbauer functions based upon the Chebyshev and Gegenbauer polynomials, have polynomial factors $p_n(s)$, whose zeros lie all on the `critical line' $\Re\,s=1/2$ or on the real…
We construct scattering diagrams for Chekhov-Shapiro's generalized cluster algebras where exchange polynomials are factorized into binomials, generalizing the cluster scattering diagrams of Gross, Hacking, Keel and Kontsevich. They turn out…
The nodes of certain minimal cubature rule are real common zeros of a set of orthogonal polynomials of degree $n$. They often consist of a well distributed set of points and interpolation polynomials based on them have desired convergence…
Some properties of generalized convexity for sets and for functions are identified in case of the reliability polynomials of two dual minimal networks. A method of approximating the reliability polynomials of two dual minimal network is…
This paper describes an algorithm which computes the characteristic polynomial of a matrix over a field within the same asymptotic complexity, up to constant factors, as the multiplication of two square matrices. Previously, this was only…
We present and study two families of polynomials with coefficients in the center of the universal enveloping algebra. These polynomials are analogues of a determinant and a characteristic polynomial of a certain non-commutative matrix,…
Generalized Pascal matrix whose elements are generalized binomial coefficients is included in the group of generalized Riordan arrays. There is a special set of generalized Riordan arrays defined by parameter $q$. If $q=0$, they are…