Related papers: Limits, standard complexes and fr-codes
Classical homological algebra considers chain complexes, resolutions, and derived functors in additive categories. We describe "track algebras in dimension n", which generalize additive categories, and we define higher order chain…
We present a new aspect of the study of higher derived limits. More precisely, we introduce a complexity measure for the elements of higher derived limits over the directed set $\Omega$ of functions from $\mathbb{N}$ to $\mathbb{N}$ and…
Some aspects of basic category theory are developed in a finitely complete category $\C$, endowed with two factorization systems which determine the same discrete objects and are linked by a simple reciprocal stability law. Resting on this…
For a Hopf DG-algebra corresponding to a derived algebraic group, we compute the homotopy limit of the associated cosimplicial system of DG-algebras given by the classifying space construction. The homotopy limit is taken in the model…
We introduce a notion of complexity of diagrams (and in particular of objects and morphisms) in an arbitrary category, as well as a notion of complexity of functors between categories equipped with complexity functions. We discuss several…
In this article we mainly study linear codes over $\mathbb{F}_{2^n}$ and their binary subfield codes. We construct linear codes over $\mathbb{F}_{2^n}$ whose defining sets are the certain subsets of $\mathbb{F}_{2^n}^m$ obtained from…
We prove an NP upper bound on a theory of integer-indexed integer-valued arrays that extends combinatory array logic with an ordering relation on the index set and the ability to express sums of elements. We compare our fragment with seven…
We investigate fractional sums of arithmetic functions over products of two or three integers, with emphasis on fixed greatest common divisors and multiplicative weights. Let $f$ be an arithmetic function satisfying $f(n) \ll n^\alpha$ for…
Certain simplicial complexes are used to construct a subset $D$ of $\mathbb{F}_{2^n}^m$ and $D$, in turn, defines the linear code $C_{D}$ over $\mathbb{F}_{2^n}$ that consists of $(v\cdot d)_{d\in D}$ for $v\in \mathbb{F}_{2^n}^m$. Here we…
Let $\mathcal{A}$ be an abelian category. Denote by $\mathrm{D}^{b}(\mathcal{A})$ the bounded derived category of $\mathcal{A}$. In this paper, we investigate the lower bounds for the levels of objects in $\mathrm{D}^{b}(\mathcal{A})$ with…
We are concerned with relating derived categories of all modules of two dual Koszul algebras defined by a locally bounded quiver. We first generalize the well known Acyclic Assembly Lemma and formalize an old method of extending a functor…
Let $(\mathfrak{C},\mathbb{E},\mathfrak{s})$ be an Ext-finite, Krull-Schmidt and $k$-linear extriangulated category with $k$ a commutative artinian ring. We define an additive subcategory $\mathfrak{C}_r$ (respectively, $\mathfrak{C}_l$) of…
Asymptotic expansions are derived for associated Legendre functions of degree $\nu$ and order $\mu$, where one or the other of the parameters is large. The expansions are uniformly valid for unbounded real and complex values of the argument…
Let $A$ be a unital associative algebra over a field $k$. All unital associative algebras containing $A$ as a subalgebra of a given codimension $\mathfrak{c}$ are described and classified. For a fixed vector space $V$ of dimension…
We prove a closed formula for the derivative, of any order, of a implicit function, in terms of some binomial building blocks, and explain the combinatorics behind the coefficients appearing in the formula.
By relating the number of images of a function with finite domain to a certain parameter, we obtain both an upper and lower bound for the image set. Even though the arguments are elementary, the bounds are, in some sense, best possible. The…
We propose a new framework for integrating quantifiers with other logical connectives in a higher-categorical setting. Our method systematically incorporates key coherence conditions-including those akin to the Beck-Chevalley property-and…
A complex spherical code is a finite subset on the unit sphere in $\mathbb{C}^d$. A fundamental problem on complex spherical codes is to find upper bounds for those with prescribed inner products. In this paper, we determine the irreducible…
We continue the study of the effective content of $K$-theory for C*-algebras, with a focus on AF algebras. We show that from a c.e. presentation of an AF algebra it is possible to compute a representation of the algebra as an inductive…
Colimits are a powerful tool for the combination of objects in a category. In the context of modeling and specification, they are used in the institution-independent semantics (1) of instantiations of parameterised specifications (e.g. in…