Related papers: Fixpoint operators for 2-categorical structures
In a category $\mathcal{C}$ with a proper $(\mathcal{E}, \mathcal{M})$-factorization system, we study the notions of strict, co-strict, initial and final morphisms with respect to a topogenous order. Besides showing that they allow…
Structural operational semantics can be studied at the general level of distributive laws of syntax over behaviour. This yields specification formats for well-behaved algebraic operations on final coalgebras, which are a domain for the…
We show a first rectification result for homotopy chain coalgebras over a field. On the one hand, we consider the $\infty$-category obtained by localizing differential graded coalgebras over an operad with respect to quasi-isomorphisms; on…
The Lefschetz fixed point theorem follows easily from the identification of the Lefschetz number with the fixed point index. This identification is a consequence of the functoriality of the trace in symmetric monoidal categories. There are…
In this article, we consider a formulation of biset functors using the 2-category of finite sets with variable finite group actions. We introduce a 2-category $\mathbb{S}$, on which a biset functor can be regarded as a special kind of…
We consider an infinite-dimensional non-linear operator related to a hard core (HC) model with a countable set $\mathbb{N}$ of spin values. It is known that finding the fixed points of an infinite-dimensional operator is generally…
A 2-dimensional point-line framework is a collection of points and lines in the plane which are linked by pairwise constraints that fix some angles between pairs of lines and also some point-line and point-point distances. It is rigid if…
With the increased interest in machine learning, and deep learning in particular, the use of automatic differentiation has become more wide-spread in computation. There have been two recent developments to provide the theoretical support…
The humble $\dagger$ ("dagger") is used to denote two different operations in category theory: Taking the adjoint of a morphism (in dagger categories) and finding the least fixed point of a functional (in categories enriched in domains).…
We formulate a framework for describing behaviour of effectful higher-order recursive programs. Examples of effects are implemented using effect operations, and include: execution cost, nondeterminism, global store and interaction with a…
We completely describe a new domain for abstract interpretation of numerical programs. Fixpoint iteration in this domain is proved to converge to finite precise invariants for (at least) the class of stable linear recursive filters of any…
Recently, a novel fixed point operation has been introduced over certain non-monotonic functions between stratified complete lattices and used to give semantics to logic programs with negation and boolean context-free grammars. We prove…
We present a version of Krasnosel'skii fixed point theorem for operators acting on Cartesian products of normed linear spaces, under cone-compression and cone-expansion conditions of norm type. Our approach, based on the fixed point index…
By means of fixed point index theory for multi-valued maps, we provide an analogue of the classical Birkhoff--Kellogg Theorem in the context of discontinuous operators acting on affine wedges in Banach spaces. Our theory is fairly general…
We give a new proof of Cartan's fixed point theorem using topological fixed point theory. For an odd dimensional, simply connected and complete manifold having non-positive curvature, we further prove that every isometry with finite order…
Iterative algorithms are fundamental tools for approximating fixed-points of nonexpansive operators in real Hilbert spaces. Among them, Krasnosel'ski\u{\i}--Mann iteration and Halpern iteration are two widely used schemes. In this work, we…
Fixed points represent equilibrium states, stability, and solutions to a range of problems. It has been an active field of research. In this paper, we provide an overview of the main branches of fixed point theory. We discuss the key…
In this paper, we present two alternative approaches to defining answer sets for logic programs with arbitrary types of abstract constraint atoms (c-atoms). These approaches generalize the fixpoint-based and the level mapping based answer…
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,…
In this paper we extensively investigate the class of conditionally positive definite operators, namely operators generating conditionally positive definite sequences. This class itself contains subnormal operators, $2$- and $3$-isometries…