English
Related papers

Related papers: The Tensor-Plus Calculus

200 papers

Coherence theorems for covariant structures carried by a category have traditionally relied on the underlying term rewriting system of the structure being terminating and confluent. While this holds in a variety of cases, it is not a…

Category Theory · Mathematics 2007-05-31 Jonathan A. Cohen

We consider the tube algebra of a spherical semisimple multitensor category $\mathcal{X}$, and construct a braided monoidal structure with twist for its representations. We further show that this category is braided tensor equivalent with…

Quantum Algebra · Mathematics 2025-11-12 David Jaklitsch , Makoto Yamashita

We propose a new statistical model suitable for machine learning of systems with long distance correlations such as natural languages. The model is based on directed acyclic graph decorated by multi-linear tensor maps in the vertices and…

Computation and Language · Computer Science 2017-10-31 Vasily Pestun , Yiannis Vlassopoulos

We investigate commutative images of languages recognised by register automata and grammars. Semi-linear and rational sets can be naturally extended to this setting by allowing for orbit-finite unions instead of only finite ones. We prove…

Formal Languages and Automata Theory · Computer Science 2021-04-27 Piotr Hofman , Marta Juzepczuk , Sławomir Lasota , Mohnish Pattathurajan

The search for linguistic patterns, stylometry and forensic linguistics have in the theory of complex networks, their structures and associated mathematical tools, allies with which to model and analyze texts. In this paper we present a new…

Combinatorics · Mathematics 2022-09-14 Angeles Criado-Alonso , David Aleja , Miguel Romance , Regino Criado

Let $\mathcal C$ be a category with finite colimits, and let $(\mathcal E,\mathcal M)$ be a factorisation system on $\mathcal C$ with $\mathcal M$ stable under pushouts. Writing $\mathcal C;\mathcal M^{\mathrm{op}}$ for the symmetric…

Category Theory · Mathematics 2017-03-30 Brendan Fong

A number of models of linear logic are based on or closely related to linear algebra, in the sense that morphisms are "matrices" over appropriate coefficient sets. Examples include models based on coherence spaces, finiteness spaces and…

Logic in Computer Science · Computer Science 2022-04-25 Takeshi Tsukada , Kazuyuki Asada

We provide a categorical framework for mathematical objects for which there is both a sort of "independent" and "dependent" composition. Namely we model them as duoidal categories in which both monoidal structures share a unit and the first…

Category Theory · Mathematics 2025-01-27 Brandon T. Shapiro , David I. Spivak

We give a classification of all quasitriangular structures and ribbon elements of $\mathcal{D}(G)$ explicitly in terms of group homomorphisms and central subgroups. This can equivalently be interpreted as an explicit description of all…

Quantum Algebra · Mathematics 2017-08-23 Marc Keilberg

Let $X$ be a locally compact Hausdorff space with $n$ proper continuous self maps $\tau_i:X \to X$ for $1 \le i \le n$. To this we associate two topological conjugacy algebras which emerge as the natural candidates for the universal algebra…

Operator Algebras · Mathematics 2011-11-09 Kenneth R. Davidson , Elias G. Katsoulis

A graph is 1-planar if it can be drawn on a plane so that each edge is crossed by at most one other edge. In this paper, we first give a useful structural theorem for 1-planar graphs, and then apply it to the list edge and list total…

Combinatorics · Mathematics 2019-12-17 Xin Zhang , Bei Niu , Jiguo Yu

We derive a uniqueness result for non-Cartesian composition of systems in a large class of process theories, with important implications for quantum theory and linguistics. Specifically, we consider theories of wavefunctions valued in…

Quantum Physics · Physics 2018-03-05 Bob Coecke , Fabrizio Genovese , Stefano Gogioso , Dan Marsden , Robin Piedeleu

Inference in expressive probabilistic models is generally intractable, which makes them difficult to learn and limits their applicability. Sum-product networks are a class of deep models where, surprisingly, inference remains tractable even…

Machine Learning · Computer Science 2016-11-14 Abram L. Friesen , Pedro Domingos

Models of complex systems are widely used in the physical and social sciences, and the concept of layering, typically building upon graph-theoretic structure, is a common feature. We describe an intuitionistic substructural logic called…

Logic in Computer Science · Computer Science 2023-06-22 Simon Docherty , David Pym

In this work we define formal grammars in terms of free monoidal categories, along with a functor from the category of formal grammars to the category of automata. Generalising from the Booleans to arbitrary semirings, we extend our…

Formal Languages and Automata Theory · Computer Science 2020-01-13 Dan Shiebler , Alexis Toumi , Mehrnoosh Sadrzadeh

In this chapter a general mathematical framework for probabilistic theories of operationally understood circuits is laid out. Circuits are comprised of operations and wires. An operation is one use of an apparatus and a wire is a…

Quantum Physics · Physics 2010-06-04 Lucien Hardy

In this book i treat linear algebra over division ring. A system of linear equations over a division ring has properties similar to properties of a system of linear equations over a field. However, noncommutativity of a product creates a…

General Mathematics · Mathematics 2014-10-14 Aleks Kleyn

We develop a functorial framework for the ideal theory of commutative semirings using coherent frames and spectral spaces. Two central constructions-the radical ideal functor and the $k$-radical ideal functor-are shown to yield coherent…

Rings and Algebras · Mathematics 2025-06-17 Pronay Biswas , Amartya Goswami , Sujit Kumar Sardar

For each object in a tensor triangulated category, we construct a natural continuous map from the object's support---a closed subset of the category's triangular spectrum---to the Zariski spectrum of a certain commutative ring of…

Category Theory · Mathematics 2013-09-17 Beren Sanders

With a view on applications in computing, in particular concurrency theory and higher-dimensional rewriting, we develop notions of $n$-fold monoid and comonoid objects in $n$-fold monoidal categories and bicategories. We present a series of…

Category Theory · Mathematics 2024-11-07 James Cranch , Georg Struth
‹ Prev 1 8 9 10 Next ›