相关论文: An algorithmic approach to Dold-Puppe complexes
Dold-Thom functors are generalizations of infinite symmetric products, where integer multiplicities of points are replaced by composable elements of a partial abelian monoid. It is well-known that for any connective homology theory, the…
We prove a class of equivalences of additive functor categories that are relevant to enumerative combinatorics, representation theory, and homotopy theory. Let $\mathscr{X}$ denote an additive category with finite direct sums and split…
We show under suitable finiteness conditions that a functor between abelian categories induces a (not necessarily additive) map between their Grothendieck groups. This is related to the derived functors of Dold and Puppe, and generalizes a…
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…
Every two-sided ideal $\mathfrak a$ in the integral group ring $\mathbb Z[G] $ of a group $G$ determines a normal subgroup $G \cap (1 + \mathfrak a)$ of $G$. In this paper certain problems related to the identification of such subgroups,…
We describe an algorithm that morphs between two planar orthogonal drawings $\Gamma_I$ and $\Gamma_O$ of a connected graph $G$, while preserving planarity and orthogonality. Necessarily $\Gamma_I$ and $\Gamma_O$ share the same combinatorial…
A weak dominance drawing $\Gamma$ of a DAG $G=(V,E)$, is a $d$-dimensional drawing such that there is a directed path from a vertex $u$ to a vertex $v$ in $G$ if $D(u) <D(v)$ for every dimension $D$ of $\Gamma$. We have a \emph{falsely…
Deep neural networks (DNNs) have recently been applied and used in many advanced and diverse tasks, such as medical diagnosis, automatic driving, etc. Due to the lack of transparency of the deep models, DNNs are often criticized for their…
Let $\Gamma$ denote a $Q$-polynomial distance-regular graph with diameter $D\geq 1$. For a vertex $x$ of $\Gamma$ the corresponding subconstituent algebra $T=T(x)$ is generated by the adjacency matrix $A$ of $\Gamma$ and the dual adjacency…
Given a ribbon graph $\Gamma$ with some extra structure, we define, using constructible sheaves, a dg category $CPM(\Gamma)$ meant to model the Fukaya category of a Riemann surface in the cell of Teichm\"uller space described by $\Gamma.$…
The unordered configuration space of $n$ points on a graph $\Gamma,$ denoted here by $UC^n(\Gamma),$ can be viewed as the space of all configurations of $n$ unlabeled robots on a system of one-dimensional tracks, which is interpreted as a…
The alpha complex is a fundamental data structure from computational geometry, which encodes the topological type of a union of balls $B(x; r) \subset \mathbb{R}^m$ for $x\in S$, including a weighted version that allows for varying radii.…
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 work, we establish a categorification of the classical Dold-Kan correspondence in the form of an equivalence between suitably defined $\infty$-categories of simplicial stable $\infty$-categories and connective chain complexes of…
The most difficult aspect of the realistic modeling of granular materials is how to capture the real shape of the particles. Here we present a method to simulate granular materials with complex-shaped particles. The particle shape is…
We establish a large class of homotopy coherent Morita-equivalences of Dold-Kan type relating diagrams with values in any weakly idempotent complete additive $\infty$-category; the guiding example is an $\infty$-categorical Dold-Kan…
The first part of the paper centers in the study of embeddability between partially commutative groups. In [KK], for a finite simplicial graph $\Gamma$, the authors introduce an infinite, locally infinite graph $\Gamma^e$, called the…
The Dynamical Graph Grammar (DGG) formalism can describe complex system dynamics with graphs that are mapped into a master equation. An exact stochastic simulation algorithm may be used, but it is slow for large systems. To overcome this…
Decisions made by convolutional neural networks(CNN) can be understood and explained by visualizing discriminative regions on images. To this end, Class Activation Map (CAM) based methods were proposed as powerful interpretation tools,…
We prove that Ringel duality in the category of strict polynomial functors can be interpreted as derived functors of non-additive functors (in the sense of Dold and Puppe). We give applications of this fact for both theories.