Related papers: Logical Characterization of Algebraic Circuit Clas…
We identify the set of extreme points and apply Choquet theory to a normalized matrix-measure ball subject to finitely many linear side constraints. As an application we obtain integral representation formulas for the Herglotz class of…
Regular and higher regular graded algebras (in simplest case satisfying Von Neumann regularity $\Theta_{1}\Theta_{2}\Theta_{1}=\Theta_{1}$ instead of anticommutativity) are introduced and their properties are studied. They are described in…
We establish new metric characterizations for the norm (respectively, ultraweak) closure of the convex hull of a bounded set in an arbitrary $C^*$-algebra (respectively, von Neumann algebra), and provide applications of these results to the…
The Newlander-Nirenberg theorem says that a formally integrable complex structure is locally equivalent to the standard complex structure in the complex Euclidean space. In this paper, we consider two natural generalizations of the…
This article reviews some recent progress in our understanding of the structure of Rational Conformal Field Theories, based on ideas that originate for a large part in the work of A. Ocneanu. The consistency conditions that generalize…
In this paper we revisit a theorem by Rockafellar on representing the relative interior of the graph of a convex set-valued mapping in terms of the relative interior of its domain and function values. Then we apply this theorem to provide a…
The paper deals with a construction of a separating system of rational invariants for finite dimensional generic algebras. In the process of dealing an approach to a rough classification of finite dimensional algebras is offered by…
This paper brings together two lines of research: factor-based models of case-based reasoning (CBR) and the logical specification of classifiers. Logical approaches to classifiers capture the connection between features and outcomes in…
A majority of established quantum generalizations of discrete structures are shown to be instances of a single quantum generalization. In particular, the quantum graphs of Duan, Severini and Winter, the quantum metric spaces of Kuperberg…
We present a hierarchical viewpoint on the operator-algebraic formulation of quantum systems, in which $C^{*}$-algebras are responsible for the universal and intrinsic description, whereas von Neumann algebras provide the detailed account…
We present a novel approach to the representation theory of finite dimensional algebras motivated by the emerging theory of graph limits. We introduce the rank spectrum of a finite dimensional algebra $R$ over a finite field. The elements…
The concept of a supercharacter theory of a finite group was introduced by Diaconis and Isaacs as an alternative to the usual irreducible character theory, and exemplified with a particular construction in the case of finite algebra groups.…
In this paper we derive some basic results of circuit theory using `Implicit Linear Algebra' (ILA). This approach has the advantage of simplicity and generality. Implicit linear algebra is outlined in [1]. We denote the space of all vectors…
We bring forward a logical system of transition algebras that enhances many-sorted first-order logic using features from dynamic logics. The sentences we consider include compositions, unions, and transitive closures of transition…
In this note, we introduce a new concept of a {\it generalized algebraic rational identity} to investigate the structure of division rings. The main theorem asserts that if a non-central subnormal subgroup $N$ of the multiplicative group…
This paper is divided into two parts. The first is a review, through categorical lenses, of the classical theory of regular-singular differential systems over $C((x))$ and $\mathbb P^1_C\smallsetminus\{0,\infty\}$, where $C$ is…
In his seminal Inventiones paper from 1972 Grauert proved the existence of a semiuniversal deformation of an arbitrary complex analytic isolated singularity. For the proof he invented an approximation theorem for solving a system of…
Arakelian's classical approximation theorem \cite{Ar} gives necessary and sufficient conditions such that functions can be uniformly approximated in (unbounded) closed sets $F\subset \mathbb{C}$ by entire functions. The conditions are…
We introduce the notion of domain of finite type $\mathscr{D}\subset\mathbb{R}^n$ generalizing an earlier work of Bodin, Popescu-Pampu and Sorea. Then, we prove that every finite graph admitting a good orientation whose vertices have degree…
The circuit equivalence problem of a finite algebra $\mathbf A$ is the computational problem of deciding whether two circuits over $\mathbf A$ define the same function or not. This problem not just generalises the equivalence problem for…