English
Related papers

Related papers: Combinatory Completeness in Structured Multicatego…

200 papers

We exhibit an adjunction between a category of abstract algebras of partial functions and a category of set quotients. The algebras are those atomic algebras representable as a collection of partial functions closed under relative…

Logic · Mathematics 2022-06-15 Célia Borlido , Brett McLean

We construct an internal language for cartesian closed bicategories. Precisely, we introduce a type theory modelling the structure of a cartesian closed bicategory and show that its syntactic model satisfies an appropriate universal…

Logic in Computer Science · Computer Science 2019-04-16 Marcelo Fiore , Philip Saville

We initiate a systematic study of the perfection of affine group schemes of finite type over fields of positive characteristic. The main result intrinsically characterises and classifies the perfections of reductive groups, and obtains a…

Representation Theory · Mathematics 2024-11-20 Kevin Coulembier , Geordie Williamson

We define the completion of an associative algebra $A$ in a set $M=\{M_1,\dots,M_r\}$ of $r$ right $A$-modules in such a way that if $\mathfrak a\subseteq A$ is an ideal in a commutative ring $A$ the completion $A$ in the (right) module…

Algebraic Geometry · Mathematics 2024-10-23 Arvid Siqveland

Despite ample evidence that our concepts, our cognitive architecture, and mathematics itself are all deeply compositional, few models take advantage of this structure. We therefore propose a radically compositional approach to computational…

Neurons and Cognition · Quantitative Biology 2019-11-18 Toby B. St Clere Smithe

In complete analogy with the classical situation (which is briefly reviewed) it is possible to define bi-Hamiltonian descriptions for Quantum systems. We also analyze compatible Hermitian structures in full analogy with compatible Poisson…

Mathematical Physics · Physics 2009-11-11 G. Marmo , G. Scolarici , A. Simoni , F. Ventriglia

We study the computational model of polygraphs. For that, we consider polygraphic programs, a subclass of these objects, as a formal description of first-order functional programs. We explain their semantics and prove that they form a…

Logic in Computer Science · Computer Science 2015-07-01 Guillaume Bonfante , Yves Guiraud

Combinatorial Exploration is a new domain-agnostic algorithmic framework to automatically and rigorously study the structure of combinatorial objects and derive their counting sequences and generating functions. We describe how it works and…

We use a category-theoretic formulation of Aczel's Fullness Axiom from Constructive Set Theory to derive the local cartesian closure of an exact completion. As an application, we prove that such a formulation is valid in the homotopy…

Category Theory · Mathematics 2020-12-18 Jacopo Emmenegger

We show that every additive category with kernels and cokernels admits a maximal exact structure. Moreover, we discuss two examples of categories of the latter type arising from functional analysis.

Functional Analysis · Mathematics 2014-06-30 Dennis Sieg , Sven-Ake Wegner

A hypergeometric type equation satisfying certain conditions defines either a finite or an infinite system of orthogonal polynomials. We present in a unified and explicit way all these systems of orthogonal polynomials, the associated…

Mathematical Physics · Physics 2007-05-23 Nicolae Cotfas

We prove a theorem stating that any semantics can be encoded as a compositional semantics, which means that, essentially, the standard definition of compositionality is formally vacuous. We then show that when compositional semantics is…

cmp-lg · Computer Science 2008-02-03 Wlodek Zadrozny

We investigate whether the group algebra of a finite group over a localisation of the integers is semiperfect. The main result is a necessary and sufficient arithmetic criterion in the ordinary case. In the modular case, we propose a…

Rings and Algebras · Mathematics 2025-10-10 Dylan Johnston , Dmitriy Rumynin

We take a unifying and new approach toward polynomial and trigonometric approximation in an arbitrary number of variables, resulting in a precise and general ready-to-use tool that anyone can easily apply in new situations of interest. The…

Classical Analysis and ODEs · Mathematics 2023-05-31 Marcel de Jeu

It is shown the construction of a module structure [2] with universe over a set of a particular kind of mathematical proofs, the base ring of this module will be built on a maximal consistent extension of a set of propositions, this…

Logic · Mathematics 2013-07-25 Kevin Davila Castellar , Ismael Gutierrez Garcia

Observables in a quantum system, represented by a Hilbert space, are given by the orthogonal bases of the aforementioned Hilbert space. Categorical Quantum Mechanics provides further abstraction of such observables, allowing for a…

Quantum Physics · Physics 2024-06-19 Aqilah Rasat

The notion of composite system made up of distinguishable parties is investigated in the context of arbitrary convex spaces.

Quantum Physics · Physics 2019-08-21 Florio M. Ciaglia , Alberto Ibort , Giuseppe Marmo

We give characterizations of unital uniform topological algebras and saturated locally multiplicatively convex algebras by means of multiplicative linear functionals. Some automatic continuity theorems in advertibly complete uniform…

Functional Analysis · Mathematics 2014-01-03 M. El Azhari

There are two ways to turn a categorical model for pure quantum theory into one for mixed quantum theory, both resulting in a category of completely positive maps. One has quantum systems as objects, whereas the other also allows classical…

Category Theory · Mathematics 2015-11-06 Oscar Cunningham , Chris Heunen

We discuss a selection of recent developments in arithmetic combinatorics having to do with ``approximate algebraic structure'' together with some of their applications.

Number Theory · Mathematics 2014-04-02 Ben Green
‹ Prev 1 3 4 5 6 7 10 Next ›