Related papers: The Schur Algorithm in Terms of System Realization
Let the formal power series f in d variables with coefficients in an arbitrary field be a symmetric function decomposed as a series of Schur functions, and let f be a rational function whose denominator is a product of binomials of the form…
Given a collection of test functions, one defines the associated Schur-Agler class as the intersection of the contractive multipliers over the collection of all positive kernels for which each test function is a contractive multiplier. We…
In the context of the complex-analytic structure within the unit disk centered at the origin of the complex plane, that was presented in a previous paper, we show that a certain class of non-integrable real functions can be represented…
We establish a new description of the Schur-Agler norm of a holomorphic function on the polydisc as the solution of a convex optimization problem. Consequences of this description are explored both from a theoretical and from a practical…
It is well known that conventional simulation algorithms are inefficient for the statistical description of macroscopic systems exactly at the critical point due to the divergence of the corresponding relaxation time (critical slowing…
We investigate a generalization of the classical notion of a Schur functor associated to a ribbon diagram. These functors are defined with respect to an arbitrary algebra, and in the case that the underlying algebra is the…
Using techniques from integrable systems, we obtain a number of exact results for random partitions. In particular, we prove a simple formula for correlation functions of what we call the Schur measure on partitions (which is a far reaching…
The aim of the course is to lead to an understanding of homogenisation processes in an operator-theoretic sense. In fact, using solely operator-theoretic means not referring to the particular form of the coefficients, we will identify an…
This work presents a novel computer architecture that extends the Von Neumann model with a dedicated Reasoning Unit (RU) to enable native artificial general intelligence capabilities. The RU functions as a specialized co-processor that…
The theory of Schur functors provides a powerful and elegant approach to the representation theory of GL_n - at least to the so-called polynomial representations - especially to questions about how the theory varies with n. We develop…
The notion of a unitary realization is used to estimate derivatives of arbitrary order of functions in the Schur-Agler class on the polydisk and unit ball.
The Schur transform is a unitary operator that block diagonalizes the action of the symmetric and unitary groups on an $n$ fold tensor product $V^{\otimes n}$ of a vector space $V$ of dimension $d$. Bacon, Chuang and Harrow \cite{BCH07}…
Schur-type methods in \cite{Chu2} and \cite{GCQX} solve the robust pole assignment problem by employing the departure from normality of the closed-loop system matrix as the measure of robustness. They work well generally when all poles to…
We reconsider some classical natural semantics of integers (namely iterators of functions, cardinals of sets, index of equivalence relations), in the perspective of Kolmogorov complexity. To each such semantics one can attach a simple…
Grover's algorithm relies on the superposition and interference of quantum mechanics, which is more efficient than classical computing in specific tasks such as searching an unsorted database. Due to the high complexity of quantum…
The algorithm of Shor for prime factorization is a hybrid algorithm consisting of a quantum part and a classical part. The main focus of the classical part is a continued fraction analysis. The presentation of this is often short, pointing…
State-space smoothing has found many applications in science and engineering. Under linear and Gaussian assumptions, smoothed estimates can be obtained using efficient recursions, for example Rauch-Tung-Striebel and Mayne-Fraser algorithms.…
Abstract simulation of one transition system by another is introduced as a means to simulate a potentially infinite class of similar transition sequences within a single transition sequence. This is useful for proving confluence under…
We present a set of algebraic relations among Schur functions which are a multi-time generalization of the ``discrete Hirota relations'' known to hold among the Schur functions of rectangular partitions. We prove the relations as an…
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…