Related papers: Interpolating d-tuples of Matrices
We study sequences of partitions of the unit interval into subintervals, starting from the trivial partition, in which each partition is obtained from the one before by splitting its subintervals in two, according to a given rule, and then…
We consider the moduli spaces $\mathcal{M}_d(\ell)$ of a closed linkage with n links and prescribed lengths in d-dimensional Euclidean space. For d>3 these spaces are no longer manifolds generically, but they have the structure of a…
We study properties of truncations in the dual and intertwining process in the monotone case. The main properties are stated for the time-reversed process and the time of absorption of the truncated intertwining process.
We study a reproducing kernel Hilbert space of functions defined on the positive integers and associated to the binomial coefficients. We introduce two transforms, which allow us to develop a related harmonic analysis in this Hilbert space.…
Polar decompositions of quaternion matrices with respect to a given indefinite inner product are studied. Necessary and sufficient conditions for the existence of an $H$-polar decomposition are found. In the process an equivalent to Witt's…
We describe the complete interpolating sequences for the Paley-Wiener spaces $L^p_\pi$ ($1<p<\infty$) in terms of Muckenhoupt's $(A_p)$ condition. For $p=2$, this description coincides with those given by Pavlov (1979), Nikol'skii (1980),…
In kernel methods, temporal information on the data is commonly included by using time-delayed embeddings as inputs. Recently, an alternative formulation was proposed by defining a gamma-filter explicitly in a reproducing kernel Hilbert…
We characterize sampling and interpolating sets with derivatives in weighted Fock spaces on the complex plane in terms of their weighted Beurling densities.
If a tuple of matrices has a common invariant subspace, its projective joint spectrum has an algebraic component. In general, the converse is not true, and there might be algebraic components in the projective joint spectrum without…
Peak interpolation is concerned with a foundational kind of mathematical task: building functions in a fixed algebra $A$ which have prescribed values or behaviour on a fixed closed subset (or on several disjoint subsets). In this paper we…
We reduce the question whether a given quantum mixed state is separable or entangled to the problem of existence of a certain full family of commuting normal matrices whose matrix elements are partially determined by components of the pure…
In this paper we study nonlinear interpolation problems for interpolation and peak-interpolation sets of function algebras. The subject goes back to the classical Rudin-Carleson interpolation theorem. In particular, we prove the following…
Kernel interpolation is a fundamental technique for approximating functions from scattered data, with a well-understood convergence theory when interpolating elements of a reproducing kernel Hilbert space. Beyond this classical setting,…
We present a comprehensive and self-contained discussion of the use of the transfer matrix to study propagation in one-dimensional lossless systems, including a variety of examples, such as superlattices, photonic crystals, and optical…
We consider nonnegative r-potent matrices with finite dimensions and study their decomposability. We derive the precise conditions under which an r-potent matrix is decomposable. We further determine a general structure for the r-potent…
Computing modular coincidences can show whether a given substitution system, which is supported on a point lattice in R^d, consists of model sets or not. We prove the computatibility of this problem and determine an upper bound for the…
In this paper, we introduce two new forms of the dual Hartwig-Spindelb{\"o}ck decomposition and employ them to derive explicit representations for several classes of dual generalized inverses. Building on these representations, we further…
A retrieval model should not only interpolate the training data but also extrapolate well to the queries that are different from the training data. While neural retrieval models have demonstrated impressive performance on ad-hoc search…
From the matrix point of view, we use the recursion to discuss four combinatorial numbers in terms of the integer lattice paths, this is different from Andr\'a's method (Andra). We give four tables and matrices, and their relations, and…
We describe combinatorial properties of the defining row of a circulant Hadamard matrix by exploiting its orthogonality to subsequent rows, and show how to exclude several particular forms of these matrices.