Related papers: Test Functions, Kernels, Realizations and Interpol…

We prove a refined Agler decomposition for bounded analytic functions on the bidisk and show how it can be used to reprove an interesting result of Guo et al. related to extending holomorphic functions without increasing their norm. In…

The Schur class, denoted by $\mathcal{S}(\mathbb{D})$, is the set of all functions analytic and bounded by one in modulus in the open unit disc $\mathbb{D}$ in the complex plane $\mathbb{C}$, that is \[ \mathcal{S}(\mathbb{D}) = \{\varphi…

This note comprises a synthesis of certain results in the theory of exact interpolation between Hilbert spaces. In particular, we examine various characterizations of interpolation spaces and their relations to a number of results in…

We present polygraphic programs, a subclass of Albert Burroni's polygraphs, as a computational model, showing how these objects can be seen as first-order functional programs. We prove that the model is Turing complete. We use polygraphic…

Using results from theory of operators on a Hilbert space, we prove approximation results for matrix-valued holomorphic functions on the unit disc and the unit bidisc. The essential tools are the theory of unitary dilation of a contraction…

Let, J, be an m-by-m-signature matrix and let D be the open unit disk in the complex plane. Denote by P{J,0}(D) the class of all meromorphic m-by-m-matrix-valued functions, f, in D which are holomorphic at 0 and take J-contractive values at…

we start the study of Schur analysis in the quaternionic setting using the theory of slice hyperholomorphic functions. The novelty of our approach is that slice hyperholomorphic functions allows to write realizations in terms of a suitable…

We study the generalization error of functions that interpolate prescribed data points and are selected by minimizing a weighted norm. Under natural and general conditions, we prove that both the interpolants and their generalization errors…

We compute the generating function of column-strict plane partitions with parts in {1,2,...,n}, at most c columns, p rows of odd length and k parts equal to n. This refines both, Krattenthaler's ["The major counting of nonintersecting…

The Herglotz representation theorem for holomorphic functions with non-negative real part is a fundamental result in the theory of holomorphic functions. In this paper, we reinterpret the Herglotz representation in the context of modern…

Craig interpolation is a fundamental property of classical and non-classic logics with a plethora of applications from philosophical logic to computer-aided verification. The question of which interpolants can be obtained from an…

A certain class of matrix-valued Borel matrix functions is introduced and it is shown that all functions of that class naturally operate on any operator T in a finite type I von Neumann algebra M in a way such that uniformly bounded…

This article treats Nevanlinna-Pick interpolation in the setting of a special class of algebraic curves called distinguished varieties. An interpolation theorem, along with additional operator theoretic results, is given using a family of…

The paper discusses a series of results concerning reproducing kernel Hilbert spaces, related to the factorization of their kernels. In particular, it is proved that for a large class of spaces isometric multipliers are trivial. One also…

For a collection of reproducing kernels k which includes those for the Hardy space of the polydisk and ball and for the Bergman space, k is a complete Pick kernel if and only if the multiplier algebra of the Hilbert space H^2(k) associated…

A numeral system is an infinite sequence of different closed normal $\lambda$-terms intended to code the integers in $\lambda$-calculus. H. Barendregt has shown that if we can represent, for a numeral system, the functions : Successor,…

Automatic and efficient verification of multiplier designs, especially through a provably correct method, is a difficult problem. We show how to utilize a theorem prover, ACL2, to implement an efficient rewriting algorithm for multiplier…

In this work, we consider the problem of learning nonlinear operators that correspond to discrete-time nonlinear dynamical systems with inputs. Given an initial state and a finite input trajectory, such operators yield a finite output…

This work investigates theoretically the interplay between interpolation and aggregation in regression. We establish that the $\gamma$-graph dimension characterizes learnability for a broad class of natural aggregation procedures.…

From the method of realization of bialgebras developped in a preceding paper, we obtain the Duality Theorem and apply it to the study of the ideal of relations for each realized bialgebra. This is detailed in the english version of the…