English
Related papers

Related papers: Parametric Distributive Laws: uniform monad compos…

200 papers

Presenting systems of differential equations in the form of diagrams has become common in certain parts of physics, especially electromagnetism and computational physics. In this work, we aim to put such use of diagrams on a firm…

Mathematical Physics · Physics 2022-06-20 Evan Patterson , Andrew Baas , Timothy Hosgood , James Fairbanks

Technology of data collection and information transmission is based on various mathematical models of encoding. The words "Geometry of information" refer to such models, whereas the words "Moufang patterns" refer to various sophisticated…

Information Theory · Computer Science 2022-03-03 Noemie Combe , Yuri I. Manin , Matilde Marcolli

We consider uniform random permutations drawn from a family enumerated through generating trees. We develop a new general technique to establish a central limit theorem for the number of consecutive occurrences of a fixed pattern in such…

Probability · Mathematics 2021-12-22 Jacopo Borga

The words-as-classifiers model of grounded lexical semantics learns a semantic fitness score between physical entities and the words that are used to denote those entities. In this paper, we explore how such a model can incrementally…

Computation and Language · Computer Science 2019-11-11 Daniele Moro , Stacy Black , Casey Kennington

Paraphrase generation is an important and challenging natural language processing (NLP) task. In this work, we propose a deep generative model to generate paraphrase with diversity. Our model is based on an encoder-decoder architecture. An…

Computation and Language · Computer Science 2019-10-01 Zhecheng An , Sicong Liu

Given a monoidal category C, an ordinary category M, and a monad T in M, the lifts in a strict sense of a fixed action of C on M to an action of C on the Eilenberg-Moore category of T-modules in M are in a bijective correspondence with…

Category Theory · Mathematics 2007-05-23 Zoran Skoda

Elaborating on our joint work with Abramsky in quant-ph/0402130 we further unravel the linear structure of Hilbert spaces into several constituents. Some prove to be very crucial for particular features of quantum theory while others…

Quantum Physics · Physics 2007-05-23 Bob Coecke

In this article, we present a fresh perspective on language, combining ideas from various sources, but mixed in a new synthesis. As in the minimalist program, the question is whether we can formulate an elegant formalism, a universal…

Computation and Language · Computer Science 2023-03-10 Loe Feijs

This work proposes a novel methodology for measuring compositional behavior in contemporary language embedding models. Specifically, we focus on adjectival modifier phenomena in adjective-noun phrases. In recent years, distributional…

Computation and Language · Computer Science 2024-12-19 Danilo S. Carvalho , Edoardo Manino , Julia Rozanova , Lucas Cordeiro , André Freitas

Categories can be identified -- up to isomorphism -- with polynomial comonads on Set. The left Kan extension of a functor along itself is always a comonad -- called the density comonad -- so it defines a category when its carrier is…

Category Theory · Mathematics 2025-04-28 David I. Spivak

Recently, Boehm and Stefan constructed duplicial (paracyclic) objects from distributive laws between (co)monads. Here we define the category of factorisations of a distributive law, show that it acts on this construction, and give some…

Category Theory · Mathematics 2014-09-29 Ulrich Kraehmer , Paul Slevin

Given a finite group with a generating subset there is a well-established notion of length for a group element given in terms of its minimal length expression as a product of elements from the generating set. Recently, certain quantities…

We establish an assume-guarantee (AG) framework for compositional reasoning about multi-objective queries in parametric probabilistic automata (pPA) - an extension to probabilistic automata (PA), where transition probabilities are functions…

Logic in Computer Science · Computer Science 2025-06-11 Hannah Mertens , Tim Quatmann , Joost-Pieter Katoen

For a small quantaloid $\mathcal{Q}$ we consider four fundamental 2-monads $\mathbb{T}$ on $\mathcal{Q}\text{-}{\bf Cat}$, given by the presheaf 2-monad $\mathbb{P}$ and the copresheaf 2-monad $\mathbb{P}^{\dagger}$, as well as by their two…

Category Theory · Mathematics 2017-07-13 Hongliang Lai , Lili Shen , Walter Tholen

Within the context of the mathematical formulation of Merge and the Strong Minimalist Thesis, we present a mathematical model of the morphology-syntax interface. In this setting, morphology has compositional properties responsible for word…

Computation and Language · Computer Science 2025-07-02 Isabella Senturia , Matilde Marcolli

Data often are formed of multiple modalities, which jointly describe the observed phenomena. Modeling the joint distribution of multimodal data requires larger expressive power to capture high-level concepts and provide better data…

Machine Learning · Computer Science 2020-09-09 Sasho Nedelkoski , Mihail Bogojeski , Odej Kao

We develop a combinatorial approach to the study of semigroups and monoids with finite presentations satisfying small overlap conditions. In contrast to existing geometric methods, our approach facilitates a sequential left-right analysis…

Rings and Algebras · Mathematics 2007-12-04 Mark Kambites

We give a lightweight alternative construction of Jacobs's distributive law for multisets and distributions that does not involve any combinatorics. We first give a distributive law for lists and distributions, then apply a general theorem…

Logic in Computer Science · Computer Science 2024-03-05 Dexter Kozen , Alexandra Silva

Arrangement theory plays an essential role in the study of the unfolding model used in many fields. This paper describes how arrangement theory can be usefully employed in solving the problems of counting (i) the number of admissible…

Combinatorics · Mathematics 2013-01-11 Hidehiko Kamiya , Akimichi Takemura , Norihide Tokushige

We modularly build increasingly larger fragments of the ZX-calculus by modularly adding new generators and relations, at each point, giving some concrete semantics in terms of some category of spans. This is performed using Lack's technique…

Category Theory · Mathematics 2021-03-16 Cole Comfort