Related papers: Operator systems for tolerance relations on finite…
As graph representations of data emerge in multiple domains, data analysts need to be able to intelligently select among a magnitude of different data graphs based on the effects different graph operators have on them. Exhaustive execution…
It is well-known that the controllability of finite-dimensional nonlinear systems can be established by showing the controllability of the linearized system. However, this classical result does not generalize to infinite-dimensional…
In this paper, we construct, for a certain class of semigroup dynamical systems, two operator algebras that are universal with respect to their corresponding covariance conditions: one being self-adjoint, and another being non-self-adjoint.…
We initiate and study the theory of ``real decomposable maps" between real operator systems. Formally, this is new even in the complex case, which hitherto has restricted itself to the case where the systems are complex C*-algebras. We…
In this paper we show how to produce a large number of representations of a graph C*-algebra in the space of the bounded linear operators in $L^2(X,\mu)$. These representations are very concrete and, in the case of graphs that satisfy…
Functional analysis, especially the theory of Hilbert spaces and of operators on these, form an important area in mathematics. We formalized the Isabelle/HOL library Complex_Bounded_Operators containing a large amount of theorems about…
We classify operator systems $S\subseteq \mathcal B(H)$ that act on finite dimensional Hilbert spaces by making use of the noncommutative Choquet boundary. S is said to be {\em reduced} when its boundary ideal is 0. In the category of…
Given a directed graph, there exists a universal operator algebra and universal C*-algebra associated to the directed graph. In this paper we give intrinsic constructions of these objects. We provide an explicit construction for the maximal…
For operators generated by a certain class of infinite band matrices with matrix elements we establish a characterization of the resolvent set in terms of polynomial solutions of the underlying higher order finite difference equations. This…
Modular operads are a special type of operad: in fact, they bear the same relationship to operads that graphs do to trees (i.e. simply connected graphs). One of the basic examples of a modular operad is the collection of…
The transfer of the generating operations of an algebra to a homotopy equivalent chain complex produces higher operations. The first goal of this paper is to describe precisely the higher structure obtained when the unary operations commute…
We analyze matrix-valued transfer operators. We prove that the fixed points of transfer operators form a finite dimensional $C^*$-algebra. For matrix weights satisfying a low-pass condition we identify the minimal projections in this…
Linearly bounded Turing machines have been mainly studied as acceptors for context-sensitive languages. We define a natural class of infinite automata representing their observable computational behavior, called linearly bounded graphs.…
It is well known that "bad" quotient spaces (typically: non-Hausdorff) can be studied by associating to them the groupoid C*-algebra of an equivalence relation, that in the "nice" cases is Morita equivalent to the C*-algebra of continuous…
Let $\Gamma$ be a finitely generated discrete exact group. We consider operators on $l^2(\Gamma)$ which are composed by operators of multiplication by a function in $l^\infty (\Gamma)$ and by the operators of left-shift by elements of…
The goal of the paper is to apply the general operator theoretic construction known as the Schur complement for computation of the spectrum of certain infinite graphs which can be viewed as finite graphs with the ray attached to them. The…
Vertex operator algebras are mathematically rigorous objects corresponding to chiral algebras in conformal field theory. Operads are mathematical devices to describe operations, that is, $n$-ary operations for all $n$ greater than or equal…
We generalize Loewner's method for proving that matrix monotone functions are operator monotone. The relation x \leq y on bounded operators is our model for a definition for C*-relations of being residually finite dimensional. Our main…
Traditionally, finite automata theory has been used as a framework for the representation of possibly infinite sets of strings. In this work, we introduce the notion of second-order finite automata, a formalism that combines finite automata…
Infinite-dimensional differential algebraic equations (short DAEs) with input and output are studied. The concepts of operator nodes and system nodes are extended to systems which additionally may include algebraic constraints.…