Related papers: Circuit algebras are wheeled props
Circuit algebras are a symmetric analogue of Jones's planar algebras introduced to study finite-type invariants of virtual knotted objects. Circuit algebra structures appear, in different forms, across mathematics. This paper provides a…
Circuit algebras are a symmetric version of Jones's planar algebras. They originated in quantum topology as a framework for encoding virtual crossings. This paper extends existing results for modular operads to construct a graphical…
Most classical results in circuit complexity theory concern circuits over the Boolean domain. Besides their simplicity and the ease of comparing different languages, the actual architecture of computers is also an important motivating…
We generalize Jones' planar algebras by internalising the notion to a pivotal braided tensor category $\mathcal{C}$. To formulate the notion, the planar tangles are now equipped with additional `anchor lines' which connect the inner circles…
Circuit algebras, used in the study of finite-type knot invariants, are a symmetric analogue of Jones's planar algebras. They are very closely related to circuit operads, which are a variation of modular operads admitting an extra monoidal…
These are expanded notes of author's talk at the ECM 2008 attempting to give an elementary introduction into the main ideas of the theory of wheeled props for beginners, and also a survey of its most recent major applications (ranging from…
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…
An 'arithmetic circuit' is a labeled, acyclic directed graph specifying a sequence of arithmetic and logical operations to be performed on sets of natural numbers. Arithmetic circuits can also be viewed as the elements of the smallest…
The loop algebra construction by Allison, Berman, Faulkner, and Pianzola, describes graded-central-simple algebras with split centroid in terms of central simple algebras graded by a quotient of the original grading group. Here the…
To every minimal model of a complete local isolated cDV singularity Donovan--Wemyss associate a finite dimensional symmetric algebra known as the contraction algebra. We construct the first known standard derived equivalences between these…
We introduce a new class of algebras, which we call cluster-tilted. They are by definition the endomorphism algebras of tilting objects in a cluster category. We show that their representation theory is very close to the representation…
Cluster algebras were introduced by S. Fomin and A. Zelevinsky in math.RT/0104151; their study continued in math.RA/0208229, math.RT/0305434. This is a family of commutative rings designed to serve as an algebraic framework for the theory…
Circuit quantization is an extraordinarily successful theory that describes the behavior of quantum circuits with high precision. The most widely used approach of circuit quantization relies on introducing a classical Lagrangian whose…
Cluster algebras were introduced by S. Fomin and A. Zelevinsky in connection with dual canonical bases. To a cluster algebra of simply laced Dynkin type one can associate the cluster category. Any cluster of the cluster algebra corresponds…
Cluster algebras are commutative rings with a set of distinguished generators having a remarkable combinatorial structure. They were introduced by Fomin and Zelevinsky in 2000 in the context of Lie theory, but have since appeared in many…
This paper presents a general framework for linear circuit analysis based on elementary aspects of projective geometry. We use a flexible approach in which no a priori assignment of an electrical nature to the circuit branches is necessary.…
A bialgebra is a structure which is simultaneously an algebra and a coalgebra, such that the algebraic and coalgebraic parts are "compatible". Bialgebras are normally studied over a field or commutative ring. In this paper, we show how to…
The purpose of this paper is to make the theory of vertex algebras trivial. We do this by setting up some categorical machinery so that vertex algebras are just ``singular commutative rings'' in a certain category. This makes it easy to…
In this paper, a monad-based denotational model is introduced and shown adequate for the Proto-Quipper family of calculi, themselves being idealized versions of the Quipper programming language. The use of a monadic approach allows us to…
This thesis details a project to define a fully compositional theory of synchronous sequential circuits built from primitive components, motivated by applying techniques successfully used in programming languages to hardware. The first part…