Related papers: Categorifying induction formulae via divergent ser…
A new method is given for computing generators of the homology groups with integer coefficients for any finite $T_0$-space. An important role in this method is played by irreducible cycles which are defined here and give rise to continuous…
Many combinatorial proofs rely on induction. When these proofs are formulated in traditional language, they can be bulky and unmanageable. Coalgebras provide a language which can reduce reduce many inductive proofs in graded poset theory to…
We present a system for generating parsers based directly on the metaphor of parsing as deduction. Parsing algorithms can be represented directly as deduction systems, and a single deduction engine can interpret such deduction systems so as…
Coalgebras for analytic functors uniformly model graph-like systems where the successors of a state may admit certain symmetries. Examples of successor structure include ordered tuples, cyclic lists and multisets. Motivated by goals in…
We compute the $RO(C_4)$ integral homology of a point with complete information as a Green functor, and we show that it is generated, in a slightly generalized sense, by the Euler and orientation classes of the irreducible real…
Our overall goal is to unify and extend some results in the literature related to the approximation of generating functions of finite and infinite sequences over a field by rational functions. In our approach, numerators play a significant…
A criterion for M\"uger centralizer of a fusion subcategory of a braided non-degenerate fusion category is given. Along the way we extend some identities on the space of class functions of a fusion category introduced by Shimizu in…
In this survey article (which hitherto is an ongoing work-in-progress) we present the formulation of the induction and coinduction principles using the language and conventions of each of order theory, set theory, programming languages'…
A simplicial set is said to be non-singular if the representing map of each non-degenerate simplex is degreewise injective. The inclusion into the category of simplicial sets, of the full subcategory whose objects are the non-singular…
The set of natural integers is fundamental for at least two reasons: it is the free induction algebra over the empty set (and at such allows definitions of maps by primitive recursion) and it is the free monoid over a one-element set, the…
It is known that reflection coefficients for bulk fields of a rational conformal field theory in the presence of an elementary boundary condition can be obtained as representation matrices of irreducible representations of the classifying…
In this article, we prove some factorization results for several classes of polynomials having integer coefficients, which in particular yield several classes of irreducible polynomials. Such classes of polynomials are devised by imposing…
Inference systems are a widespread framework used to define possibly recursive predicates by means of inference rules. They allow both inductive and coinductive interpretations that are fairly well-studied. In this paper, we consider a…
An inductive inference system for proving validity of formulas in the initial algebra $T_{\mathcal{E}}$ of an order-sorted equational theory $\mathcal{E}$ is presented. It has 20 inference rules, but only 9 of them require user interaction;…
It is shown that every Feynman integral can be interpreted as Green function of some linear differential operator with constant coefficients. This definition is equivalent to usual one but needs no regularization and application of…
In Goodwillie calculus, unpublished work of Dwyer and Rezk provides a classification of reduced filtered colimit preserving $d$-excisive functors from pointed spaces to spectra as spectrum-valued functors on the category of finite sets of…
We give an introduction to constructive category theory by answering two guiding computational questions. The first question is: how do we compute the set of all natural transformations between two finitely presented functors like…
This introduction to Green's functions is based on their role as kernels of differential equations. The procedures to construct solutions to a differential equation with an external source or with an inhomogeneity term are put together to…
We decompose the K-theory space of a Waldhausen category in terms of its Dwyer-Kan simplicial localization. This leads to a criterion for functors to induce equivalences of K-theory spectra that generalizes and explains many of the criteria…
A new theory of data types which allows for the definition of types as initial algebras of certain functors Fam(C) -> Fam(C) is presented. This theory, which we call positive inductive-recursive definitions, is a generalisation of Dybjer…