English
Related papers

Related papers: Proper Functors and Fixed Points for Finite Behavi…

200 papers

We study algebraicity and smoothness of fixed point stacks for flat group schemes which have a finite composition series whose factors are either reductive or proper, flat, finitely presented, acting on algebraic stacks with affine,…

Algebraic Geometry · Mathematics 2022-09-19 Matthieu Romagny

We introduce a general unifying framework for the investigation of pointlike sets. The pointlike functors are considered as distinguished elements of a certain lattice of subfunctors of the power semigroup functor; in particular, we exhibit…

Group Theory · Mathematics 2021-08-31 Karsten Henckell , Samuel Herman

We introduce the notion of accurate foundation sets and the accurate refinement property for right LCM semigroups. For right LCM semigroups with this property, we derive a more explicit presentation of the boundary quotient. In the context…

Operator Algebras · Mathematics 2016-11-04 Nathan Brownlowe , Nicolai Stammeier

Well-founded fixed points have been used in several areas of knowledge representation and reasoning and to give semantics to logic programs involving negation. They are an important ingredient of approximation fixed point theory. We study…

Discrete Mathematics · Computer Science 2015-12-02 Arnaud Carayol , Zoltan Esik

We develop a functorial framework for the ideal theory of commutative semirings using coherent frames and spectral spaces. Two central constructions-the radical ideal functor and the $k$-radical ideal functor-are shown to yield coherent…

Rings and Algebras · Mathematics 2025-06-17 Pronay Biswas , Amartya Goswami , Sujit Kumar Sardar

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

We define notions of regularity and (Barr-)exactness for 2-categories. In fact, we define three notions of regularity and exactness, each based on one of the three canonical ways of factorising a functor in Cat: as (surjective on objects,…

Category Theory · Mathematics 2013-04-22 John Bourke , Richard Garner

For endofunctors of varieties preserving intersections, a new description of the final coalgebra and the initial algebra is presented: the former consists of all well-pointed coalgebras. These are the pointed coalgebras having no proper…

Logic in Computer Science · Computer Science 2015-07-01 Jiří Adámek , Stefan Milius , Lawrence S Moss , Lurdes Sousa

We generalize some of the central results in automata theory to the abstraction level of coalgebras and thus lay out the foundations of a universal theory of automata operating on infinite objects. Let F be any set functor that preserves…

Logic in Computer Science · Computer Science 2015-07-01 C. Kupke , Y. Venema

We prove that every finitary polynomial endofunctor of a category $C$ has a final coalgebra if $C$ is locally Cartesian closed, has finite disjoint coproducts and a natural number object. More generally, we prove that the category of…

Category Theory · Mathematics 2007-05-23 Luigi Santocanale

Consider a finite l-group acting on the affine space of dimension n over a field k, whose characteristic differs from l. We prove the existence of a fixed point, rational over k, in the following cases: --- The field k is p-special for some…

Algebraic Geometry · Mathematics 2017-10-30 Olivier Haution

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

An algebraically exact category in one that admits all of the limits and colimits which every variety of algebras possesses and every forgetful functor between varieties preserves, and which verifies the same interactions between these…

Category Theory · Mathematics 2011-09-02 Richard Garner

We prove that if a group scheme of multiplicative type acts on an algebraic stack with affine, finitely presented diagonal then the stack of fixed points is algebraic. For this, we extend two theorems of [SGA3.2] on functors of subgroups of…

Algebraic Geometry · Mathematics 2021-01-08 Matthieu Romagny

We consider a fixed free and proper action of a locally compact group $G$ on a space $T$, and actions $\alpha:G\to \Aut A$ on $C^*$-algebras for which there is an equivariant embedding of $(C_0(T),\rt)$ in $(M(A),\alpha)$. A recent theorem…

Operator Algebras · Mathematics 2009-07-06 Astrid an Huef , S. Kaliszewski , Iain Raeburn , Dana P. Williams

This paper studies presentations of the Sierpinski gasket as a final coalgebra for functors on several categories of metric spaces with additional designated points. The three categories which we study differ on their morphisms: one uses…

In this paper we show how the abstract behaviours of higher-order systems can be modelled as final coalgebras of suitable behavioural functors. These functors have the challenging peculiarity to be circularly defined with their own final…

Logic in Computer Science · Computer Science 2016-07-12 Marco Peressotti

A simple criterion for a functor to be finitary is presented: we call $F$ finitely bounded if for all objects $X$ every finitely generated subobject of $FX$ factorizes through the $F$-image of a finitely generated subobject of $X$. This is…

Category Theory · Mathematics 2019-10-22 Jiří Adámek , Stefan Milius , Lurdes Sousa , Thorsten Wißmann

Final coalgebras as "categorical greatest fixed points" play a central role in the theory of coalgebras. Somewhat analogously, most proof methods studied therein have focused on greatest fixed-point properties like safety and bisimilarity.…

Logic in Computer Science · Computer Science 2017-04-18 Natsuki Urabe , Masaki Hara , Ichiro Hasuo

In the renormalisation analysis of critical phenomena in quasi-periodic systems, a fundamental role is often played by fixed points of functional recurrences of the form \begin{equation*} f_{n}(x) = \sum_{i=1}^\ell a_i(x) f_{n_i}…

Dynamical Systems · Mathematics 2013-11-12 Paul Verschueren , Ben D. Mestel