Related papers: Multivariate Difference Gon\v{c}arov Polynomials
Geometric Invariant Theory (GIT) produces quotients of algebraic varieties by reductive groups. If the variety is projective, this quotient depends on a choice of polarisation; by work of Dolgachev-Hu and Thaddeus, it is known that two…
We recover the Tutte polynomial of a matroid, up to change of coordinates, from an Ehrhart-style polynomial counting lattice points in the Minkowski sum of its base polytope and scalings of simplices. Our polynomial has coefficients of…
We develop an algorithmic theory of convex optimization over discrete sets. Using a combination of algebraic and geometric tools we are able to provide polynomial time algorithms for solving broad classes of convex combinatorial…
In the paper, the planar polynomial geometric interpolation of data points is revisited. Simple sufficient geometric conditions that imply the existence of the interpolant are derived in general. They require data points to be convex in a…
The space of polynomials in two real variables with values in a 2-dimensional irreducible module of a dihedral group is studied as a standard module for Dunkl operators. The one-parameter case is considered (omitting the two-parameter case…
We consider polynomials of bi-degree $(n,1)$ over the skew field of quaternions where the indeterminates commute with each other and with all coefficients. Polynomials of this type do not generally admit factorizations. We recall a…
A family of multivariate orthogonal polynomials generalizing the standard (univariate) Charlier polynomials is shown to arise in the matrix elements of the unitary representation of the Euclidean group E(d) on oscillator states. These…
Let $\mathcal{A}$ be a real line arrangement and $\mathcal{D}(\mathcal{A})$ the module of $\mathcal{A}$--derivations. First, we give a dynamical interpretation of $\mathcal{D}(\mathcal{A})$ as the set of polynomial vector fields which…
We develop certain combinatorial tools for the study of discriminants of general systems of polynomial equations. Applying these tools in a sequel paper, we completely classify components of such discriminants, generalizing the classical…
In this paper we generalize the Ritt-Kolchin method of characteristic sets and the classical Gr\"obner basis technique to prove the existence and obtain methods of computation of multivariate difference-differential dimension polynomials…
A unified theory of orthogonal polynomials of a discrete variable is presented through the eigenvalue problem of hermitian matrices of finite or infinite dimensions. It can be considered as a matrix version of exactly solvable Schr\"odinger…
We derive raising and lowering operators for orthogonal polynomials on the unit circle and find second order differential and $q$-difference equations for these polynomials. A general functional equation is found which allows one to relate…
In this paper, we show that the classical discrete orthogonal univariate polynomials (namely, Hahn polynomials on an equidistant lattice with unit weights) of sufficiently high degrees have extremely small values near the endpoints (we call…
This paper is devoted to present new error bounds of regularized gap functions for polynomial variational inequalities with exponents explicitly determined by the dimension of the underlying space and the number/degree of the involved…
This paper presents a first result of a long term research project dealing with the construction of d-orthogonal polynomials with Hahn's property. We shall show that the latter class could be characterized by expanding a polynomial as a…
Matching fields were introduced by Sturmfels and Zelevinsky to study certain Newton polytopes and more recently have been shown to give rise to toric degenerations of various families of varieties. Whenever a matching field gives rise to a…
We show that various identities from [1] and [3] involving Gould-Hopper polynomials can be deduced from the real but also complex orthogonal invariance of multivariate Gaussian distributions. We also deduce from this principle a useful…
In this article we give a computational study of combinatorics of the discriminantal arrangements. The discriminantal arrangements are parametrized by two positive integers n and k such that n>k. The intersection lattice of the…
The goal of this paper is to estimate the total variation distance between two general stochastic polynomials. As a consequence one obtains an invariance principle for such polynomials. This generalizes known results concerning the total…
This paper's aim is to present recent combinatorial considerations on r-Dyck paths, r-Parking functions, and the r-Tamari lattices. Giving a better understanding of the combinatorics of these objects has become important in view of their…