Related papers: Polynomial interpolation in higher dimension: from…
We introduce constrained polynomial zonotopes, a novel non-convex set representation that is closed under linear map, Minkowski sum, Cartesian product, convex hull, intersection, union, and quadratic as well as higher-order maps. We show…
Known or essentially known results about duals of interpolation spaces are presented, taking a point of view sometimes slightly different from the usual one. Particular emphasis is placed on Alberto Calderon's theorem describing the duals…
We give an attempt to build a classification of planar integral point sets. For two obtained classes, we provide general constructions of upper bounds for minimal diameter of integral point sets in higher dimensions of certain cardinality.…
To every poset P, Stanley (1986) associated two polytopes, the order polytope and the chain polytope, whose geometric properties reflect the combinatorial qualities of P. This construction allows for deep insights into combinatorics by way…
Interpolation polynomials were introduced by Knop--Sahi in type $A$, and Okounkov in type $BC$. They are inhomogeneous polynomials whose top terms are Jack and Macdonald polynomials. Thus the expansion coefficients for the product of two…
The colourful simplicial depth conjecture states that any point in the convex hull of each of d+1 sets, or colours, of d+1 points in general position in R^d is contained in at least d^2+1 simplices with one vertex from each set. We verify…
A generalization of the reduction technique for ODEs recently introduced by Gao and Liu is given. It is shown that the use of algebraic methods allows the extension of the procedure to much more general flows, as well as the derivation of…
An $n$-correct node set $\mathcal{X}$ is called $GC_n$ set if the fundamental polynomial of each node is a product of $n$ linear factors. In 1982 Gasca and Maeztu conjectured that for every $GC_n$ set there is a line passing through $n+1$…
We survey the concept of multiplicativity from its initial appearance in the theory of Poisson-Lie groups to the far-reaching generalizations, for multivectors and differential forms in the geometry and the generalized geometry of Lie…
Commutative complex numbers of the form u=x+\alpha y+\beta z+\gamma t in 4 dimensions are studied, the variables x, y, z and t being real numbers. Four distinct types of multiplication rules for the complex bases \alpha, \beta and \gamma…
We prove some functional equations involving the (classical) matching polynomials of path and cycle graphs and the $d$-matching polynomial of a cycle graph. A matching in a (finite) graph $G$ is a subset of edges no two of which share a…
Galois/monodromy groups attached to parametric systems of polynomial equations provide a method for detecting the existence of symmetries in solution sets. Beyond the question of existence, one would like to compute formulas for these…
In this note we develop a systematic combinatorial definition for constructed earlier supersymmetric polynomial families. These polynomial families generalize canonical Schur, Jack and Macdonald families so that the new polynomials depend…
We prove several long-standing conjectures by Chen--Nagano on cohomological descriptions of the cardinalities of maximal antipodal sets in symmetric spaces. We actually extend these conjectures to the setting of generalised symmetric spaces…
Defining distances over finite fields formally by $||x-y||:=(x_1-y_1)^2+\cdots + (x_d-y_d)^2$ for $x,y\in \mathbb{F}_q^d$, distance problems naturally arise in analogy to those studied by Erd\H{o}s and Falconer in Euclidean space. Given a…
We give a Newton type rational interpolation formula (Theorem \ref{theo}). It contains as a special case the original Newton interpolation, as well as the recent interpolation formula of Zhi-Guo Liu, which allows to recover many important…
We construct big generalized Heegner classes by interpolating $p$-adically the generalized Heegner classes associated to quaternionic modular forms along a Coleman (finite slope) family, following the approach introduced by…
The seminal concept of characteristic polygon of an embedded algebroid surface, first developed by Hironaka, seems well suited for combinatorially (perhaps even effectively) tracking of a resolution process. However, the way this object…
We show the existence of and explicitly construct generic polynomials for various groups, over fields of positive characteristic. The methods we develop apply to a broad class of connected linear algebraic groups defined over finite fields…
Generalized $t$-designs, which form a common generalization of objects such as $t$-designs, resolvable designs and orthogonal arrays, were defined by Cameron [P.J. Cameron, A generalisation of $t$-designs, \emph{Discrete Math.}\ {\bf 309}…