相关论文: MOPS: Multivariate Orthogonal Polynomials (symboli…

We provide conditions and algorithmic tools so as to classify and construct the smallest possible determinantal formulae for multihomogeneous resultants arising from Weyman complexes associated to line bundles in products of projective…

We describe two main classes of one-sided trigonometric and hyperbolic Jacobi-type algorithms for computing eigenvalues and eigenvectors of Hermitian matrices. These types of algorithms exhibit significant advantages over many other…

In this paper we present methods for the synthesis of polynomial invariants for probabilistic transition systems. Our approach is based on martingale theory. We construct invariants in the form of polynomials over program variables, which…

Geometric modeling of multivariate reliability polynomials is based on algebraic hypersurfaces, constant level sets, rulings etc. The solved basic problems are: (i) find the reliability polynomial using the Maple and Matlab software…

In this paper we obtain $L^1$-weighted norms of classical orthogonal polynomials (Hermite, Laguerre and Jacobi polynomials) in terms of the zeros of these orthogonal polynomials; these expressions are usually known as quadrature rules. In…

Recently examples of Riemannian homogeneous spaces with linear Jacobi relations were found. We calculate the Singer invariants of these spaces with the computer algebra program Maple and discuss the results by means of the Jet Isomorphism…

We describe a new formula for weight multiplicities and characters of semisimple Lie algebras. Our formula expresses these weight multiplicities as sums of positive rational numbers. In fact, the formula works more generally for the Jacobi…

We develop an algorithm for sampling from the unitary invariant random matrix ensembles. The algorithm is based on the representation of their eigenvalues as a determinantal point process whose kernel is given in terms of orthogonal…

The most popular method for computing the matrix logarithm is a combination of the inverse scaling and squaring method in conjunction with a Pad\'e approximation, sometimes accompanied by the Schur decomposition. The main computational…

Complementary polynomials of Legendre polynomials are briefly presented, as well as those for the confluent and hypergeometric functions, relativistic Hermite polynomials and corresponding new pre-Laguerre polynomials. The generating…

This paper studies geometric properties of the Iterated Matrix Multiplication polynomial and the hypersurface that it defines. We focus on geometric aspects that may be relevant for complexity theory such as the symmetry group of the…

We study sampling algorithms for $\beta$-ensembles with time complexity less than cubic in the cardinality of the ensemble. Following Dumitriu & Edelman (2002), we see the ensemble as the eigenvalues of a random tridiagonal matrix, namely a…

An enhancement of the dynamic geometry system GeoGebra for the automatic symbolic computation of algebraic loci and envelopes is presented. Given a GeoGebra construction, the prototype, after rewriting the construction as a polynomial…

Polynomial optimization problems over binary variables can be expressed as integer programs using a linearization with extra monomials in addition to those arising in the given polynomial. We characterize when such a linearization yields an…

We establish a simple recurrence formula for the number $Q_g^n$ of rooted orientable maps counted by edges and genus. We also give a weighted variant for the generating polynomial $Q_g^n(x)$ where $x$ is a parameter taking the number of…

Generalizations of the Hermite polynomials to many variables and/or to the complex domain have been located in mathematical and physical literature for some decades. Polynomials traditionally called complex Hermite ones are mostly…

Persymmetric Jacobi matrices are invariant under reflection with respect to the anti-diagonal. The associated orthogonal polynomials have distinctive properties that are discussed. They are found in particular to be also orthogonal on the…

This paper introduces a novel approach for learning polynomial representations of physical objects. Given a point cloud data set associated with a physical object, we solve a one-class classification problem to bound the data points by a…

We present new algorithms that efficiently approximate the hypergeometric function of a matrix argument through its expansion as a series of Jack functions. Our algorithms exploit the combinatorial properties of the Jack function, and have…

A hierarchy of matrix-valued polynomials which generalize the Jacobi polynomials is found. Defined by a Rodrigues formula, they are also products of a sequence of differential operators. Each class of polynomials is complete, satisfies a…