English
Related papers

Related papers: Convolution Algebras: Relational Convolution, Gene…

200 papers

We prove a convolution formula for the conjugacy classes in symmetric groups conjectured by the second author. A combinatorial interpretation of coefficients is provided. As a main tool we introduce new semigroup of partial permutations. We…

Combinatorics · Mathematics 2007-05-23 Vladimir Ivanov , Sergei Kerov

Graded modal types systems and coeffects are becoming a standard formalism to deal with context-dependent computations where code usage plays a central role. The theory of program equivalence for modal and coeffectful languages, however, is…

Logic in Computer Science · Computer Science 2021-03-08 Ugo Dal Lago , Francesco Gavazzo

Coalgebras generalize various kinds of dynamical systems occuring in mathematics and computer science. Examples of systems that can be modeled as coalgebras include automata and Markov chains. We will present a coalgebraic representation of…

Logic in Computer Science · Computer Science 2014-08-04 Frank Roumen

This paper investigates some issues arising in categorical models of reversible logic and computation. Our claim is that the structural (coherence) isomorphisms of these categorical models, although generally overlooked, have decidedly…

Category Theory · Mathematics 2013-04-29 Peter Hines

A theoretical framework bridging General Relativity (GR) and Quantum Dynamics (QD) is introduced through the application of Kripke semantics and linear logic. While conventional unification efforts often rely on structural or geometrical…

Quantum Physics · Physics 2025-04-01 Arturo Tozzi , Michel Planat

Based on a recent development in the area of error control coding, we introduce the notion of convolutional factor graphs (CFGs) as a new class of probabilistic graphical models. In this context, the conventional factor graphs are referred…

Artificial Intelligence · Computer Science 2012-07-19 Yongyi Mao , Frank Kschischang , Brendan J. Frey

Effect algebras form a formal algebraic description of the structure of the so-called effects in a Hilbert space which serves as an event-state space for effects in quantum mechanics. This is why effect algebras are considered as logics of…

Logic · Mathematics 2019-08-16 Ivan Chajda , Helmut Länger

In an impressive series of papers, Krivine showed at the edge of the last decade how classical realizability provides a surprising technique to build models for classical theories. In particular, he proved that classical realizability…

Logic in Computer Science · Computer Science 2020-07-16 Étienne Miquey

Computational effects are commonly modelled by monads, but often a monad can be presented by an algebraic theory of operations and equations. This talk is about monads and algebraic theories for languages for inference, and their…

Logic in Computer Science · Computer Science 2023-12-29 Cristina Matache , Sean Moss , Sam Staton , Ariadne Si Suo

We present a novel investigation into the consistency operator ($\circ$), traditionally associated with paraconsistent logics, as a means of capturing non-normal modal classicalities within the Kripke framework. By semantically…

Logic · Mathematics 2026-02-25 Alfredo Roque Freire , Manuel António Martins

Convenient parameterizations of matrices in terms of vectors transform (certain classes of) matrix equations into covariant (hence rotation-invariant) vector equations. Certain recently introduced such parameterizations are tersely…

Exactly Solvable and Integrable Systems · Physics 2009-11-10 M. Bruschi , F. Calogero

For any discrete time dynamical system with a rational evolution, we define an entropy, which is a global index of complexity for the evolution map. We analyze its basic properties and its relations to the singularities and the…

chao-dyn · Physics 2009-10-31 M. P. Bellon , C. -M. Viallet

These are lecture notes on the algebraic approach to regular languages. The classical algebraic approach is for finite words; it uses semigroups instead of automata. However, the algebraic approach can be extended to structures beyond…

Formal Languages and Automata Theory · Computer Science 2020-08-27 Mikołaj Bojańczyk

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…

Rings and Algebras · Mathematics 2009-10-30 James Worthington

We employ the theory of canonical extensions to study residuation algebras whose associated relational structures are functional, i.e., for which the ternary relations associated to the expanded operations admit an interpretation as…

Logic · Mathematics 2018-04-24 Wesley Fussner , Alessandra Palmigiano

We introduce a class of convolutions on arithmetical functions that are regular in the sense of of Narkiewicz, homogeneous in the sense of Burnett et al, and bounded, in the sense that there exists a common finite bound for the rank of…

Number Theory · Mathematics 2025-04-30 Jan Snellman

An abstract mathematical framework is presented in this paper as a unification of several deformed or generalized algebra proposed recently in the context of generalized statistical theories intended to treat certain complex thermodynamic…

Statistical Mechanics · Physics 2020-10-20 Aziz El Kaabouchi , Laurent Nivanen , Qiuping A. Wang , Jean-Pierre Badiali , Alain Le Méhauté

We review the properties of transversality of distributions with respect to submersions. This allows us to construct a convolution product for a large class of distributions on Lie groupoids. We get a unital involutive algebra…

Operator Algebras · Mathematics 2015-11-09 Jean-Marie Lescure , Dominique Manchon , Stéphane Vassout

Motivated by the study of H\"ormander's sums-of-squares operators and their generalizations, we define the convolution algebra of transverse distributions associated to a singular foliation. We prove that this algebra is represented as…

Analysis of PDEs · Mathematics 2020-04-20 Iakovos Androulidakis , Omar Mohsen , Robert Yuncken

Workflows constitute an important language to represent knowledge about processes, but also increasingly to reason on such knowledge. On the other hand, there is a limit to which time constraints between activities can be expressed.…

Artificial Intelligence · Computer Science 2012-09-26 Valmi Dufour-Lussier , Florence Le Ber , Jean Lieber