Related papers: Higher limits, homology theories and fr-codes
The Theory of Functional Connections (TFC) is most often used for constraints over the field of real numbers. However, previous works have shown that it actually extends to arbitrary fields. The evidence for these claims is restricting…
Functorial semi-norms are semi-normed refinements of functors such as singular (co)homology. We investigate how different types of representability affect the (non-)triviality of finite functorial semi-norms on certain functors or classes.…
For groups of a topological origin, such as braid groups and mapping class groups, an important source of interesting and highly non-trivial representations is given by their actions on the twisted homology of associated spaces; these are…
We study the notion of fundamental group in the framework of descent-exact homological categories. This setting is sufficiently wide to include several categories of "algebraic" nature such as the almost abelian categories, the semi-abelian…
We prove new vanishing results on the growth of higher torsion homologies for suitable arithmetic lattices, Artin groups and mapping class groups. The growth is understood along Farber sequences, in particular, along residual chains. For…
This article is an introduction to the basic generalized category theory used in recent work on an extension of the theory of categories and categorical logic, including parts of topos theory. We discuss functors, equivalences, natural…
A theory of a derivator version of six-functor-formalisms is developed, using an extension of the notion of fibered multiderivator due to the author. Using the language of (op)fibrations of 2-multicategories this has (like a usual fibered…
The goal of this work is to describe a categorical formalism for (Extended) Topological Quantum Field Theories (TQFTs) and present them as functors from a suitable category of cobordisms with corners to a linear category, generalizing 2d…
An approach to identify the normal subgroups determined by ideals in free group rings with the help of the derived functors of non-additive functors is explored. A similar approach, i.e., via derived functors, for computing limits of…
This paper presents a new system of logic, LF, that is intended to be used as the foundation of the formalization of science. That is, deductive validity according to LF is to be used as the criterion for assessing what follows from the…
Given a DG-category A we introduce the bar category of modules Modbar(A). It is a DG-enhancement of the derived category D(A) of A which is isomorphic to the category of DG A-modules with A-infinity morphisms between them. However, it is…
We write down a series of basic laws for (strict) higher-order circuit diagrams. More precisely, we define higher-order circuit theories in terms of: (a) nesting, (b) temporal and spatial composition, and (c) equivalence between lower-order…
Upper bounds on the maximum number of codewords in a binary code of a given length and minimum Hamming distance are considered. New bounds are derived by a combination of linear programming and counting arguments. Some of these bounds…
Various feature descriptions are being employed in logic programming languages and constrained-based grammar formalisms. The common notational primitive of these descriptions are functional attributes called features. The descriptions…
A Gray code for a combinatorial class is a method for listing the objects in the class so that successive objects differ in some prespecified, small way, typically expressed as a bounded Hamming distance. In a previous work, the authors of…
Approximation Fixpoint Theory (AFT) is an algebraic framework designed to study the semantics of non-monotonic logics. Despite its success, AFT is not readily applicable to higher-order definitions. To solve such an issue, we devise a…
Higher homological algebra, basically done in the framework of an $n$-cluster tilting subcategory $\mathcal{M}$ of an abelian category $\mathcal{A}$, has been the topic of several recent researches. In this paper, we study a relative…
Expansions of abelian categories are introduced. These are certain functors between abelian categories and provide a tool for induction/reduction arguments. Expansions arise naturally in the study of coherent sheaves on weighted projective…
In this paper, we study operations on functors in the category of abelian groups simplar to the derivation in the sense of Dold-Puppe. They are defined as derived limits of a functor applied to the relation subgroup over a category of free…
Let $A_q(n,d)$ be the maximum order (maximum number of codewords) of a $q$-ary code of length $n$ and Hamming distance at least $d$. And let $A(n,d,w)$ that of a binary code of constant weight $w$. Building on results from algebraic graph…