Related papers: Multivariate Interpolation Formula over Finite Fie…
A function $f\colon\mathbb R\to\mathbb R$ is called \emph{$k$-monotone} if it is $(k-2)$-times differentiable and its $(k-2)$nd derivative is convex. A point set $P\subset\mathbb R^2$ is \emph{$k$-monotone interpolable} if it lies on a…
Counterparts of several classical results of number theory are proven for the ring of polynomials with coefficients in a number field. A theorem of Milnor that determines the Witt ring of a function field is applied to prove an analogue of…
A multilevel kernel-based interpolation method, suitable for moderately high-dimensional function interpolation problems, is proposed. The method, termed multilevel sparse kernel-based interpolation (MLSKI, for short), uses both level-wise…
We consider how some methods of uniform and nonuniform interpolation by translates of radial basis functions -- specifically the so-called general multiquadrics -- perform in the presence of certain types of noise. These techniques provide…
An efficient procedure for error-value calculations based on fast discrete Fourier transforms (DFT) in conjunction with Berlekamp-Massey-Sakata algorithm for a class of affine variety codes is proposed. Our procedure is achieved by…
For $m,n \in \mathbb{N}$, $m\geq 1$ and a given function $f : \mathbb{R}^m\longrightarrow \mathbb{R}$, the polynomial interpolation problem (PIP) is to determine a unisolvent node set $P_{m,n} \subseteq \mathbb{R}^m$ of…
Video frame interpolation is an important low-level vision task, which can increase frame rate for more fluent visual experience. Existing methods have achieved great success by employing advanced motion models and synthesis networks.…
General error locator polynomials are polynomials able to decode any correctable syndrome for a given linear code. Such polynomials are known to exist for all cyclic codes and for a large class of linear codes. We provide some decoding…
Interferometers play an increasingly important role for spatially resolved observations. If employed at full potential, interferometry can probe an enormous dynamic range in spatial scale. Interpretation of the observed visibilities…
Multimodal evidence is critical in computational pathology: gigapixel whole slide images capture tumor morphology, while patient-level clinical descriptors preserve complementary context for prognosis. Integrating such heterogeneous signals…
Flux reconstruction provides a framework for solving partial differential equations in which functions are discontinuously approximated within elements. Typically, this is done by using polynomials. Here, the use of radial basis functions…
We consider the interpolation problem with the inverse multiquadric radial basis function. The problem usually produces a large dense linear system that has to be solved by iterative methods. The efficiency of such methods is strictly…
The Newton series which interpolate finite multiple harmonic sums are useful in the study of multiple zeta values (MZV's). In this paper, we prove that these Newton series can be written as multiple series. As an application, we give a…
This paper presents new fast algorithms for Hermite interpolation and evaluation over finite fields of characteristic two. The algorithms reduce the Hermite problems to instances of the standard multipoint interpolation and evaluation…
In this survey we review different instances in which the Drinfeld double of a finite group and its representations play a role, touching upon some of Tom Koornwinder's research interests: harmonic analysis, Lie algebras, quantum groups,…
In this paper we present a theorem that generalizes Sawyer's classic result about mixed weighted inequalities to the multilinear context. Let $\vec{w}=(w_1,...,w_m)$ and $\nu = w_1^\frac{1}{m}...w_m^\frac{1}{m}$, the main result of the…
A notion of Drinfeld polynomials is introduced for modules of two-parameter quantum affine algebras. Finite dimensional representations are then characterized by sets of $l$-tuples of pairs of Drinfeld polynomials with certain conditions.
We generalize the recent invariant polytope algorithm for computing the joint spectral radius and extend it to a wider class of matrix sets. This, in particular, makes the algorithm applicable to sets of matrices that have finitely many…
We formulate the classical decoding algorithm of alternant codes afresh based on interpolation as in Sudan's list decoding of Reed-Solomon codes, and thus get rid of the key equation and the linear recurring sequences in the theory. The…
Let $\mathfrak{M}_n$ be the multiplicative monoid of $n \times n$ matrices over a finite field. The monoid algebra $\mathbf{C}[\mathfrak{M}_n]$ has been studied for several decades. One of the important early results is Kov\'acs' theorem…