Related papers: Limits, standard complexes and fr-codes
We introduce a new functor category: the category $\mathcal{P}_{d,n}$ of strict polynomial functors with bounded by $n$ domain of degree $d$ over a field of characteristic $p>0$. It is equivalent to the category of finite dimensional…
We develop the theory of (op)fibrations of 2-multicategories and use it to define abstract six-functor-formalisms. We also give axioms for Wirthm\"uller and Grothendieck formalisms (where either $f^!=f^*$ or $f_!=f_*$) or intermediate…
We obtain a sharp upper bound for the length of arbitrary non-associative algebra and present an example demonstrating the sharpness of our bound. To show this we introduce a new method of characteristic sequences based on linear algebra…
We show how categorial deduction can be implemented in higher-order (linear) logic programming, thereby realising parsing as deduction for the associative and non-associative Lambek calculi. This provides a method of solution to the parsing…
In this paper, we establish product and coproduct rules for three bases of the Hopf algebra $\textsf{QSym}_F$ of quasisymmetric functions over $F$, with $F$ being either $\mathbb{C}(q,t)$ or $\mathbb{C}(q)$. These results are derived…
From the work of Bauer and Lesnick, it is known that there is no functor from the category of pointwise finite-dimensional persistence modules to the category of barcodes and overlap matchings. In this work, we introduce sub-barcodes and…
In this paper, we introduce the notion of $q$-quasiadditivity of arithmetic functions, as well as the related concept of $q$-quasimultiplicativity, which generalise strong $q$-additivity and -multiplicativity, respectively. We show that…
New asymptotic upper bounds are presented on the rate of sequences of locally repairable codes (LRCs) with a prescribed relative minimum distance and locality over a finite field $F$. The bounds apply to LRCs in which the recovery functions…
We consider the numerical approximation of $f({\cal A})b$ where $b\in{\mathbb R}^{N}$ and $\cal A$ is the sum of Kronecker products, that is ${\cal A}=M_2 \otimes I + I \otimes M_1\in{\mathbb R}^{N\times N}$. Here $f$ is a regular function…
For any 1-reduced simplicial set $K$ we define a canonical, coassociative coproduct on $\Om C(K)$, the cobar construction applied to the normalized, integral chains on $K$, such that any canonical quasi-isomorphism of chain algebras from…
We introduce the notion of a definable category--a category equivalent to a full subcategory of a locally finitely presentable category that is closed under products, directed colimits and pure subobjects. Definable subcategories are…
We use non-standard analysis to define a category $^\star\!\operatorname{Hilb}$ suitable for categorical quantum mechanics in arbitrary separable Hilbert spaces, and we show that standard bounded operators can be suitably embedded in it. We…
We show that the unbounded derived category of a Grothendieck category with enough projective objects is the base category of a derivator whose category of diagrams is the full 2-category of small categories. With this structure, we give a…
We give a method of solution to the problem of iterating holomorphic functions to fractional or complex heights. We construct an auxiliary function from natural iterates of a holomorphic function; the auxiliary function will be…
The categorical models of the differential lambda-calculus are additive categories because of the Leibniz rule which requires the summation of two expressions. This means that, as far as the differential lambda-calculus and differential…
We explain the construction of minimal tilting complexes for objects of highest weight categories and we study in detail the minimal tilting complexes for standard objects and simple objects. For certain categories of representations of…
We derive new bounds on the b-number form factor $F(q^2)$ of the B meson. (Revised version of hep-ph/9306214).
We give explicit upper bounds for the coefficients of arbitrary weight $k$, level 2 cusp forms, making Deligne's well-known $O(n^{\frac{k-1}{2}+\epsilon})$ bound precise. We also derive asymptotic formulas and explicit upper bounds for the…
To solve hard problems, AI relies on a variety of disciplines such as logic, probabilistic reasoning, machine learning and mathematical programming. Although it is widely accepted that solving real-world problems requires an integration…
We recall the notions of a graded cocategory, conilpotent cocategory, morphisms of such (cofunctors), coderivations and define their analogs in $\mathbb L$-filtered setting. The difference with the existing approaches: we do not impose any…