Related papers: Polynomial interpolation in higher dimension: from…
In contrast to the univariate case, interpolation with polynomials of a given maximal total degree is not always possible even if the number of interpolation points and the space dimension coincide. Due to that, numerous constructions for…
Polytope complexes are the generalisation of polygon meshes in geo-information systems (GIS) to arbitrary dimension, and a natural concept for accessing spatio-temporal information. Complexes of each dimension have a straight-forward…
There are many different algebraic, geometric and combinatorial objects that one can attach to a complex polynomial with distinct roots. In this article we introduce a new object that encodes many of the existing objects that have…
In this paper we study some relationships between polyhedral convex sets (PCS) and generalized polyhedral convex sets (GPCS). In particular, we clarify by a counterexample that the necessary and sufficient conditions for the separation of a…
We introduce the sequence of generalized Gon\v{c}arov polynomials, which is a basis for the solutions to the Gon\v{c}arov interpolation problem with respect to a delta operator. Explicitly, a generalized Gon\v{c}arov basis is a sequence…
Cyclic polytopes have been studied since at least the early last century by Caratheodory and others.A generalization is a construction of a class of polytopes such that the polytopes have some of their properties.The best known example is…
The Knop-Sahi interpolation Macdonald polynomials are inhomogeneous and nonsymmetric generalisations of the well-known Macdonald polynomials. In this paper we apply the interpolation Macdonald polynomials to study a new type of basic…
We find new characterizations for the points in the \textit{symmetrized polydisc} $\mathbb G_n$, a family of domains associated with the spectral interpolation, defined by \[ \mathbb G_n :=\left\{ \left(\sum_{1\leq i\leq n} z_i,\sum_{1\leq…
We prove that interpolation matrices for Generalized MultiQuadrics (GMQ) of order greater than one are almost surely nonsingular without polynomial addition, in any dimension and with any continuous random distribution of sampling points.…
Generalized complex geometry, introduced by Hitchin, encompasses complex and symplectic geometry as its extremal special cases. We explore the basic properties of this geometry, including its enhanced symmetry group, elliptic deformation…
A notion of gcd chain has been introduced by the author at ISSAC 2017 for two univariate monic polynomials with coefficients in a ring R = k[x_1, ..., x_n ]/(T) where T is a primary triangular set of dimension zero. A complete algorithm to…
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…
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…
We first extend Generalized Differential Calculus (GDC) to higher structures and create generalized G-invariant bilinear forms. In addition, we also focus on developing generalized 2- and 3-connection theories in the framework of GDC. Then,…
This paper puts forward a new generalized polynomial dimensional decomposition (PDD), referred to as GPDD, comprising hierarchically ordered measure-consistent multivariate orthogonal polynomials in dependent random variables. Unlike the…
Each graph and choice of a commutative ring gives rise to an associated graphical group. In this article, we introduce and investigate graph polynomials that enumerate conjugacy classes of graphical groups over finite fields according to…
In 1996, Knop and Sahi introduced a remarkable family of inhomogeneous symmetric polynomials, defined via vanishing conditions, whose top homogeneous parts are exactly the Macdonald polynomials. Like the Macdonald polynomials, these…
We introduce the notion of a generalized complex (GC) Stein manifold and provide complete characterizations in three fundamental aspects. First, we extend Cartan's Theorem A and B within the framework of GC geometry. Next, we define…
We consider the problem of computing matrix polynomials $p(X)$, where $X$ is a large dense matrix, with as few matrix-matrix multiplications as possible. More precisely, let $\Pi_{2^{m}}^*$ represent the set of polynomials computable with…
We give a natural geometric condition that ensures that sequences of Chung-Yao interpolation polynomials (of fixed degree) of sufficiently differentiable functions converge to a Taylor polynomial.