English
Related papers

Related papers: Initial Algebras Unchained -- A Novel Initial Alge…

200 papers

Nominal sets provide a framework to study key notions of syntax and semantics such as fresh names, variable binding and $\alpha$-equivalence on a conveniently abstract categorical level. Coalgebras for endofunctors on nominal sets model,…

Logic in Computer Science · Computer Science 2016-07-27 Stefan Milius , Lutz Schröder , Thorsten Wißmann

For a field $F$ and an integer $d\geq 1$, we consider the universal associative $F$-algebra $A$ generated by two sets of $d+1$ mutually orthogonal idempotents. We display four bases for the $F$-vector space $A$ that we find attractive. We…

Rings and Algebras · Mathematics 2009-06-23 Tatsuro Ito , Paul Terwilliger

It is shown that, given any finite dimensional, split basic algebra $\Lambda = K\Gamma/I$ (where $\Gamma$ is a quiver and $I$ an admissible ideal in the path algebra $K \Gamma$), there is a finite list of affine algebraic varieties, the…

Representation Theory · Mathematics 2014-07-10 Birge Huisgen-Zimmermann

A number of categories is presented that are algebraically complete and cocomplete, i.e., every endofunctor has an initial algebra and a terminal coalgebra. For all finitary (and, more generally, all precontinuous) set functors the initial…

Logic in Computer Science · Computer Science 2021-05-21 Jiri Adamek

A number of categories is presented that are algebraically complete and cocomplete, i.e., every endofunctor has an initial algebra and a terminal coalgebra. For all finitary (and, more generally, all precontinuous) set functors the initial…

Category Theory · Mathematics 2023-06-22 Jiří Adámek

Terms are a concise representation of tree structures. Since they can be naturally defined by an inductive type, they offer data structures in functional programming and mechanised reasoning with useful principles such as structural…

Logic in Computer Science · Computer Science 2015-07-01 Makoto Hamana

Alpay Algebra is introduced as a universal, category-theoretic framework that unifies classical algebraic structures with modern needs in symbolic recursion and explainable AI. Starting from a minimal list of axioms, we model each algebra…

General Mathematics · Mathematics 2025-05-29 Faruk Alpay

In this survey, we first present basic facts on A-infinity algebras and modules including their use in describing triangulated categories. Then we describe the Quillen model approach to A-infinity structures following K. Lefevre's thesis.…

Representation Theory · Mathematics 2007-05-23 Bernhard Keller

We consider two endofunctors of the form $~F:X\longrightarrow M\otimes X~$, where $~M~$ is a non degenerate module, related to the unit interval and the Sierpinski gasket, and their final co-algebras. The functors are defined on the…

Category Theory · Mathematics 2017-10-23 Annanthakrishna Manokaran , Romaine Jayewardene , Jayampathy Ratnayake

D'Alembert made the first serious attempt to prove the Fundamental Theorem of Algebra (FTA) in 1746. An elementary proof of (FTA) based on the same idea is given in Proofs from THE BOOK. We give a shorter and more transperant version of…

Complex Variables · Mathematics 2013-05-31 Tord Sjödin

We extend Barr's well-known characterization of the final coalgebra of a $Set$-endofunctor as the completion of its initial algebra to the Eilenberg-Moore category of algebras for a $Set$-monad $\mathbf{M}$ for functors arising as liftings.…

Category Theory · Mathematics 2010-05-07 Adriana Balan , Alexander Kurz

For every finitary monad $T$ on sets and every endofunctor $F$ on the category of $T$-algebras we introduce the concept of an ffg-Elgot algebra for $F$, that is, an algebra admitting coherent solutions for finite systems of recursive…

Logic in Computer Science · Computer Science 2021-09-10 Stefan Milius , Jiří Adámek , Henning Urbat

Motivated by applications in computable analysis, we study fixpoints of certain endofunctors over categories of containers. More specifically, we focus on fibred endofunctors over the fibrewise opposite of the codomain fibration that can be…

Logic in Computer Science · Computer Science 2026-05-12 Cécilia Pradic , Ian Price

To every finite-dimensional $\mathbb C$-algebra $\Lambda$ of finite representation type we associate an affine variety. These varieties are a large generalization of the varieties defined by "$u$ variables" satisfying "$u$-equations", first…

Representation Theory · Mathematics 2026-01-01 Nima Arkani-Hamed , Hadleigh Frost , Pierre-Guy Plamondon , Giulio Salvatori , Hugh Thomas

This thesis concerns embeddings and self-embeddings of foundational structures in both set theory and category theory. The first part of the work on models of set theory consists in establishing a refined version of Friedman's theorem on…

Logic · Mathematics 2019-07-31 Paul K. Gorbow

A special final coalgebra theorem, in the style of Aczel's, is proved within standard Zermelo-Fraenkel set theory. Aczel's Anti-Foundation Axiom is replaced by a variant definition of function that admits non-well-founded constructions.…

Logic in Computer Science · Computer Science 2016-08-31 Lawrence C. Paulson

Many a concrete theorem of abstract algebra admits a short and elegant proof by contradiction but with Zorn's Lemma (ZL). A few of these theorems have recently turned out to follow in a direct and elementary way from the Principle of Open…

Logic in Computer Science · Computer Science 2015-07-01 Peter M Schuster

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

Last years a number of papers were devoted to describing automorphisms of semigroups of endomorphisms of free finitely generated universal algebras of some varieties: groups, semigroups, associative commutative algebras, inverse semigroups,…

General Mathematics · Mathematics 2007-05-23 Grigori Zhitomirski

In this paper, we introduce and study a class of algebras which we call ada algebras. An artin algebra is ada if every indecomposable projective and every indecomposable injective module lies in the union of the left and the right parts of…

Representation Theory · Mathematics 2011-02-08 Ibrahim Assem , Diane Castonguay , Marcelo Lanzilotta , Rossana Vargas