Related papers: Interpolating Matrices
We define recurrence matrices and study a few properties (links with automatic sequences, branch groups etc.) of them.
We bring an abstract model theory perspective to interpolation. We ask, what is the role of interpolation in the study of extensions of first order logic, such as infinitary logics, generalized quantifiers and higher order logics? The…
We give some extensions of Mercer's theorem to continuous Carleman kernels inducing unbounded integral operators.
The standard theorem for regular stochastic matrices is generalized to matrices with no sign restriction on the entries. The condition that column sums be equal to 1 is kept, but the regularity condition is replaced by a condition on the…
A multiresolution analysis is a nested chain of related approximation spaces.This nesting in turn implies relationships among interpolation bases in the approximation spaces and their derived wavelet spaces. Using these relationships, a…
We formalize a technique for embedding Riemann sufraces properly into \C^2, and we generalize all known embedding results to allow interpolation on prescribed discrete sequences.
We look at thin interpolating sequences and the role they play in uniform algebras, Hardy spaces, and model spaces.
This expository thesis contains a study of four interpolation theorems, the requisite background material, and a few applications. The materials introduced in the first three sections of Chapter 1 are used to motivate and prove the…
Entanglement is fundamental inasmuch because it rephrases the quest for the classical-quantum demarcation line, and it also has potentially enormous practical applications in modern information technology. In this work, employing the…
The properties of the compactness of interpolation sets of algebras of generalized analytic functions are investigated and convenient sufficient conditions for interpolation are given.
The necessary and suffcient condition for a set of matrices to commute is given and proven.
To give positive answer to a question of Frantzikinakis, we study a class of subsets of $\mathbb{N}$, called interpolation sets, on which every bounded sequence can be extended to an almost periodic sequence on $\mathbb{N}$. Strzelecki has…
In this paper, we show that the monomial basis is generally as good as a well-conditioned polynomial basis for interpolation, provided that the condition number of the Vandermonde matrix is smaller than the reciprocal of machine epsilon.…
Mirsky proved that, for the existence of a complex matrix with given eigenvalues and diagonal entries, the obvious necessary condition is also sufficient. We generalize this theorem to matrices over any field and provide a short proof.…
We treat interpolation for various logics.
We develop an interpolation-based framework for noisy linear systems with unknown system matrix with bounded norm (implying bounded growth or non-increasing energy), and bounded process noise energy. The proposed approach characterizes all…
The Taylor expansion is a widely used and powerful tool in all branches of Mathematics, both pure and applied. In Probability and Mathematical Statistics, however, a stronger version of Taylor's classical theorem is often needed, but only…
In this paper, we provide an algebraic condition on any $2n \times 2n$ real symmetric positive definite matrix which is necessary and sufficient for the matrix to be diagonalized by an orthosymplectic matrix in the sense of Williamson's…
We show that the Chern-Schwartz-MacPherson class of a hypersurface X in a nonsingular variety M `interpolates' between two other notions of characteristic classes for singular varieties, provided that the singular locus of X is smooth and…
We give sufficient conditions on a matrix A ensuring the existence of a partition of this matrix into two submatrices with extremely small norm of the image of any vector. Under some weak conditions on a matrix A we obtain a partition of A…