English
Related papers

Related papers: Quotients in monadic programming: Projective algeb…

200 papers

We define a new notion of an algebraic model structure, in which the cofibrations and fibrations are retracts of coalgebras for comonads and algebras for monads, and prove "algebraic" analogs of classical results. Using a modified version…

Category Theory · Mathematics 2011-03-14 Emily Riehl

Domain theory has been developed as a mathematical theory of computation and to give a denotational semantics to programming languages. It helps us to fix the meaning of language concepts, to understand how programs behave and to reason…

Logic in Computer Science · Computer Science 2026-03-03 Simcha van Collem , Niels van der Weide , Herman Geuvers

Geometric algebra is an optimal frame work for calculating with vectors. The geometric algebra of a space includes elements that represent all the its subspaces (lines, planes, volumes, ...). Conformal geometric algebra expands this…

Computer Vision and Pattern Recognition · Computer Science 2013-06-07 Eckhard Hitzer

In the last decade, interest in projective MV-algebras has grown greatly; see [1], [5] e [6]. In this paper we establish a necessary and sufficient condition for n elements of the free n-generator MV-algebra to generate a projective…

Rings and Algebras · Mathematics 2014-11-17 Francesco Lacava , Donatop Saeli

We present module theory and linear maps as a powerful generalised and computationally efficient framework for the relational data model, which underpins today's relational database systems. Based on universal constructions of modules we…

Programming Languages · Computer Science 2022-07-05 Fritz Henglein , Robin Kaarsgaard , Mikkel Kragh Mathiesen

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

Consider the polynomial optimization problem whose objective and constraints are all described by multivariate polynomials. Under some genericity assumptions, %% on these polynomials, we prove that the optimality conditions always hold on…

Optimization and Control · Mathematics 2008-02-12 Jiawang Nie , Kristian Ranestad

We show that a separable C*-algebra is an inductive limits of projective C*-algebras if and only if it has trivial shape, that is, if it is shape equivalent to the zero C*-algebra. In particular, every contractible C*-algebra is an…

Operator Algebras · Mathematics 2017-12-15 Hannes Thiel

Adiabatic quantum computation has recently attracted attention in the physics and computer science communities, but its computational power was unknown. We describe an efficient adiabatic simulation of any given quantum algorithm, which…

Quantum Physics · Physics 2007-11-22 Dorit Aharonov , Wim van Dam , Julia Kempe , Zeph Landau , Seth Lloyd , Oded Regev

Below, by space we mean a separable metrizable zero-dimensional space. It is studied when the space can be embedded in a Cantor set while maintaining the algebraic structure. Main results of the work: every space is an open retract of a…

General Topology · Mathematics 2023-06-13 Evgenii Reznichenko

Concrete two-set (module-like and algebra-like) algebraic structures are investigated from the viewpoint that the initial arities of all operations are arbitrary. Relations between operations arising from the structure definitions, however,…

Rings and Algebras · Mathematics 2019-04-11 Steven Duplij

Pebble games are a powerful tool in the study of finite model theory, constraint satisfaction and database theory. Monads and comonads are basic notions of category theory which are widely used in semantics of computation and in modern…

Logic in Computer Science · Computer Science 2017-04-19 Samson Abramsky , Anuj Dawar , Pengming Wang

We present a generic partition refinement algorithm that quotients coalgebraic systems by behavioural equivalence, an important task in system analysis and verification. Coalgebraic generality allows us to cover not only classical…

Data Structures and Algorithms · Computer Science 2023-06-22 Thorsten Wißmann , Ulrich Dorsch , Stefan Milius , Lutz Schröder

Based on results of Harding, Heunen, Lindenhovius and Navara, (2019), we give a connection between the category of AW*-algebras and their normal Jordan homomorphisms and a category COG of orthogemetries, which are structures that are…

Operator Algebras · Mathematics 2019-09-02 John Harding , Bert Lindenhovius

Metric algebras are metric variants of $\Sigma$-algebras. They are first introduced in the field of universal algebra to deal with algebras equipped with metric structures such as normed vector spaces. Recently a similar notion of…

Logic in Computer Science · Computer Science 2016-12-27 Wataru Hino

We prove that on separated algebraic surfaces every coherent sheaf is a quotient of a locally free sheaf. This class contains many schemes that are neither normal, reduced, quasiprojective or embeddable into toric varieties. Our methods…

Algebraic Geometry · Mathematics 2019-02-20 Philipp Gross

Considering homogeneous four-dimensional space-time geometries within real projective geometry provides a mathematically well-defined framework to discuss their deformations and limits without the appearance of coordinate singularities. On…

Mathematical Physics · Physics 2025-05-22 Daniel Spitz

This paper is the first of two articles which develop the notion of protoperads. In this one, we construct a new monoidal product on the category of reduced S-modules. We study the associated monoids, called protoperads, which are a…

Algebraic Topology · Mathematics 2019-01-18 Johan Leray

We adapt the notion of an algebraic theory to work in the setting of quasicategories developed recently by Joyal and Lurie. We develop the general theory at some length. We study one extended example in detail: the theory of commutative…

Algebraic Topology · Mathematics 2011-09-09 James Cranch

Taking a quotient roughly means changing the notion of equality on a given object, set or type. In a quantitative setting, equality naturally generalises to a distance, measuring how much elements are similar instead of just stating their…

Category Theory · Mathematics 2024-12-17 Francesco Dagnino , Fabio Pasquali
‹ Prev 1 4 5 6 7 8 10 Next ›