Related papers: Circuit algebras are wheeled props
We define Jones's planar algebra as a map of multicategories and constuct a planar algebra starting from a 1-cell in a pivotal strict 2-category. We prove finiteness results for the affine representations of finite depth planar algebras. We…
We start studying chiral algebras (as defined by A. Beilinson and V. Drinfeld) from the point of view of deformation theory. First, we define the notion of deformation of a chiral algebra on a smooth curve $X$ over a bundle of local…
For associative commutative algebras $A$ with Rota-Baxter operator $R$ identities of the algebra $AR=(A,\circ)$, where $a\circ b= aR(b),$ are found.
Boolean and quantum circuits have commonalities and differences. To formalize the syntactical commonality we introduce syntactic circuits where the gates are black boxes. Syntactic circuits support various semantics. One semantics is…
Starting from a biased definition of a properad, we describe explicitly algebras over the cobar construction of a properad. Equivalent description in terms of solutions of generalized master equations, which can be interpreted as…
A class of algebras called down-up algebras was introduced by G. Benkart and T. Roby. We classify the finite dimensional simple modules over Noetherian down-up algebras and show that in some cases every finite dimensional module is…
Biserial algebras are a classical class in the representation theory of algebras, generalizing Nakayama algebras. They were further generalized by Green and Schroll to multiserial algebras, which share many structural properties with…
We present some general theorems about operator algebras that are algebras of functions on sets, including theories of local algebras, residually finite dimensional operator algebras and algebras that can be represented as the scalar…
Cirquent calculus is a proof system manipulating circuit-style constructs rather than formulas. Using it, this article constructs a sound and complete axiomatization CL16 of the propositional fragment of computability logic (the…
The past decade has seen a significant interest in learning tractable probabilistic representations. Arithmetic circuits (ACs) were among the first proposed tractable representations, with some subsequent representations being instances of…
Hom-algebras are generalizations of algebras obtained using a twisting by a linear map. But there is a priori a freedom on where to twist. We enumerate here all the possible choices in the Lie and associative categories and study the…
The central open question of algebraic complexity is whether VP is unequal to VNP, which is saying that the permanent cannot be represented by families of polynomial-size algebraic circuits. For symmetric algebraic circuits, this has been…
We have previously proposed a study of arrangements of small circles which also surround regions in the plane realized as the images of natural real algebraic maps yielding Morse-Bott functions by projections. Among studies of arrangements,…
Calculi of string diagrams are increasingly used to present the syntax and algebraic structure of various families of circuits, including signal flow graphs, electrical circuits and quantum processes. In many such approaches, the semantic…
We introduce the notion of an algebraic cocycle as the algebraic analogue of a map to an Eilenberg-MacLane space. Using these cocycles we develop a ``cohomology theory" for complex algebraic varieties. The theory is bigraded, functorial,…
Approximable algebras were defined by Chen in his proof of the Fujita theorem in the arithmetic context. These were shown to not be necessarily subalgebras of section rings of big line bundles in a previous prepreint of the author. Here, we…
Theoretical computer scientists have been debating the role of oracles since the 1970's. This paper illustrates both that oracles can give us nontrivial insights about the barrier problems in circuit complexity, and that they need not…
A compatible associative algebra is a vector space equipped with two associative multiplication structures that interact in a certain natural way. This article presents the classification of these algebras with dimension less than four, as…
We develop a generalised gauge theory in which the role of gauge group is played by a coalgebra and the role of principal bundle by an algebra. The theory provides a unifying point of view which includes quantum group gauge theory,…
We study the computational complexity of sequences of projective varieties. We define analogues of the complexity classes P and NP for these and prove the NP-completeness of a sequence called the universal circuit resultant. This is the…