Related papers: Analytic interpolation into the tetrablock and a $…

In the space of all entire functions it is solved the problem of interpolation taking into account multiplicities by sums of the series of exponentials with the exponents from a given set. It is found a criterion of solubility of the…

We give a new proof on the disk that a Pick problem can be solved by a rational function that is unimodular on the unit circle and for which the number of poles inside the disk is no more than the number of non-positive eigenvalues of the…

Cut-elimination is the bedrock of proof theory with a multitude of applications from computational interpretations to proof analysis. It is also the starting point for important meta-theoretical investigations including decidability,…

The aim of this paper is to describe a Matlab toolbox, called $\mu$-diff, for modeling and numerically solving two-dimensional complex multiple scattering by a large collection of circular cylinders. The approximation methods in $\mu$-diff…

We introduce a Schur-Agler type class associated with the tetrablock and establish a realization theorem for this class. Furthermore, we provide a tetrablock analog of the interpolation theorem, extension theorem, and the Toeplitz corona…

We review the concept of $\tau$-function for simple analytic curves. The $\tau$-function gives a formal solution to the 2D inverse potential problem and appears as the $\tau$-function of the integrable hierarchy which describes conformal…

Let (X j , d j , $\mu$ j), j = 0, 1,. .. , m be metric measure spaces. Given 0 < p $\kappa$ $\le$ $\infty$ for $\kappa$ = 1,. .. , m and an analytic family of multilinear operators T z : L p 1 (X 1) x $\bullet$ $\bullet$ $\bullet$ L p m (X…

We prove a finiteness principle for interpolation of data by nonnegative Cm functions. Our result raises the hope that one can start to understand constrained interpolation problems in which e.g. the interpolating function F is required to…

We present a novel feasibility criteria for the finite intersection of convex sets given by inequalities. This criteria allows us to easily assert the feasibility by analyzing the unconstrained minimum of a speci?fic convex function, that…

In various applications the problem of separation of the original signal and the noise arises. For example, in the identification problem for discrete linear and causal systems, the original signal consists of the values of transfer…

In a decision problem, observations are said to be material if they must be taken into account to perform optimally. Decision problems have an underlying (graphical) causal structure, which may sometimes be used to evaluate certain…

We consider the problem of obtaining interpolation constraints for function classes, i.e., necessary and sufficient constraints that a set of points, function values and (sub)gradients must satisfy to ensure the existence of a global…

Motivated by polynomial approximations of differential forms, we study analytical and numerical properties of a polynomial interpolation problem that relies on function averages over interval segments. The usage of segment data gives rise…

In \cite{Craig}, we introduced a syntactically defined and highly general class of calculi known as \emph{semi-analytic}. We then demonstrated that any sufficiently strong (modal) substructural logic with a semi-analytic calculus must…

For a rational matrix function $\Phi$ with poles outside the unit circle, we estimate the degree of the unique superoptimal approximation $\A\Phi$ by matrix functions analytic in the unit disk. We obtain sharp estimates in the case of…

In this paper we present a result about analytic functions f defined on the open unit disc and with a finite number of exceptional values containedin the real interval (0, 1). We find an upper bound for the modulus of f' in 0. This bound is…

The possibilities for limit functions on a Fatou component for the iteration of a single polynomial or rational function are well understood and quite restricted. In non-autonomous iteration, where one considers compositions of arbitrary…

We prove a complexity dichotomy theorem for the eight-vertex model. For every setting of the parameters of the model, we prove that computing the partition function is either solvable in polynomial time or \#P-hard. The dichotomy criterion…

It was recently shown that the theory of linear stochastic systems can be viewed as a particular case of the theory of linear systems on a certain commutative ring of power series in a countable number of variables. In the present work we…

Contour integration is a crucial technique in many numeric methods of interest in physics ranging from differentiation to evaluating functions of matrices. It is often important to determine whether a given contour contains any poles or…