English
Related papers

Related papers: Distributive Laws, Spans and the ZX-Calculus

200 papers

We prove the existence of quasi-projective coarse moduli spaces parametrising certain complete flags of subschemes of a fixed projective space $\mathbb{P}(V)$ up to projective automorphisms. The flags of subschemes being parametrised are…

Algebraic Geometry · Mathematics 2024-10-08 George Cooper

We present a new method, the Subdivision Construction, for proving the finite model property (the fmp) for broad classes of modal logics and modal rule systems. The construction builds on the framework of stable canonical rules, and…

Logic · Mathematics 2026-05-13 Tenyo Takahashi

In this paper we describe an approach to construct large extendable collections of vectors in predefined spaces of given dimensions. These collections are useful for neural network latent space configuration and training. For classification…

Algebraic Geometry · Mathematics 2025-12-05 Igor V. Netay

Nonrigid mathematical structures may no longer form usual Eilenberg - Mac Lane categories, but more general ones, as illustrated by pseudo-topologies. A rather general concept of pseudo-topology was used in constructing differential…

General Mathematics · Mathematics 2007-05-23 Elemer E Rosinger

This paper studies the complexity of distributed construction of purely additive spanners in the CONGEST model. We describe algorithms for building such spanners in several cases. Because of the need to simultaneously make decisions at far…

Data Structures and Algorithms · Computer Science 2016-07-20 Keren Censor-Hillel , Telikepalli Kavitha , Ami Paz , Amir Yehudayoff

We prove that the problem of deciding the consequence relation of the full Lambek calculus with weakening is complete for the class HAck of hyper-Ackermannian problems (i.e., level F_{\omega}^{\omega} of the ordinal-indexed hierarchy of…

Logic in Computer Science · Computer Science 2024-06-25 Vitor Greati , Revantha Ramanayake

We introduce here a new axiomatisation of the rational fragment of the ZX-calculus, a diagrammatic language for quantum mechanics. Compared to the previous axiomatisation introduced in [8], our axiomatisation does not use any metarule , but…

Quantum Physics · Physics 2018-10-15 Emmanuel Jeandel

The stabilizer ZX-calculus is a rigorous graphical language for reasoning about quantum mechanics. The language is sound and complete: one can transform a stabilizer ZX-diagram into another one using the graphical rewrite rules if and only…

Quantum Physics · Physics 2023-06-22 Miriam Backens , Simon Perdrix , Quanlong Wang

We prove that for any finite-dimensional differential graded algebra with separable semisimple part the category of perfect modules is equivalent to a full subcategory of the category of perfect complexes on a smooth projective scheme with…

Algebraic Geometry · Mathematics 2020-03-18 Dmitri Orlov

Distributive laws give a way of combining two algebraic structures expressed as monads; in this paper we propose a theory of distributive laws for combining algebraic structures expressed as Lawvere theories. We propose four approaches,…

Category Theory · Mathematics 2024-08-07 Eugenia Cheng

We associate two linear categories with two objects to a module over the subalgebra of coinvariants of a Hopf-Galois extension, and prove that they are isomorphic. The structure Theorem for cleft extensions, and the Militaru \cStefan…

Rings and Algebras · Mathematics 2015-03-17 S. Caenepeel

We present a categorical theory of monads and distributive laws in substructural contexts. In the study of distributive laws, the roles of (the absence of) structural rules for variable contexts have been recognized; our theory formalizes…

Logic in Computer Science · Computer Science 2026-05-14 Soichiro Fujii , Yun Chen Tsai , Yoàv Montacute , Ichiro Hasuo

We prove an identity for five arguments, valid in the lattice of natural numbers with gcd and lcm as lattice operations. More generally, this identity characterizes arbitrary distributive lattices. Fixing three of the five arguments, we…

Group Theory · Mathematics 2020-06-09 Wolfgang Bertram

The class of quasiseparable matrices is defined by the property that any submatrix entirely below or above the main diagonal has small rank, namely below a bound called the order of quasiseparability. These matrices arise naturally in…

Symbolic Computation · Computer Science 2019-10-22 Clement Pernet , Arne Storjohann

We propose a mathematical framework for a unification of the distributional theory of meaning in terms of vector space models, and a compositional theory for grammatical types, for which we rely on the algebra of Pregroups, introduced by…

Computation and Language · Computer Science 2010-03-24 Bob Coecke , Mehrnoosh Sadrzadeh , Stephen Clark

We give a combinatorial construction, not involving a presentation, of almost all untwisted affine Kac--Moody algebras modulo their one-dimensional centres in terms of signed raising and lowering operators on a certain distributive lattice…

Combinatorics · Mathematics 2007-05-23 R. M. Green

For a quantale ${\sf{V}}$, the category $\sf V$-${\bf Top}$ of ${\sf{V}}$-valued topological spaces may be introduced as a full subcategory of those ${\sf{V}}$-valued closure spaces whose closure operation preserves finite joins. In…

Logic in Computer Science · Computer Science 2023-06-22 Hongliang Lai , Walter Tholen

We introduce a non-growth model that generates the power-law distribution with the Zipf exponent. There are N elements, each of which is characterized by a quantity, and at each time step these quantities are redistributed through binary…

Statistical Mechanics · Physics 2012-04-27 Suhan Ree

We give a systematic construction of semiorthogonal decompositions of derived categories of coherent sheaves on quasi-smooth derived algebraic stacks over $\mathbb{C}$, where the summands are subcategories defined by weight conditions, and…

Algebraic Geometry · Mathematics 2026-05-26 Chenjing Bu , Tudor Pădurariu , Yukinobu Toda

Compact categories have lately seen renewed interest via applications to quantum physics. Being essentially finite-dimensional, they cannot accomodate (co)limit-based constructions. For example, they cannot capture protocols such as quantum…

Logic in Computer Science · Computer Science 2016-04-20 Chris Heunen