相关论文: An algorithmic approach to Dold-Puppe complexes

An algorithm for the automatic Feynman diagram (FD) generation is presented in this paper. The algorithm starts directly from the definition formula of FD, and is simple in concept and easy for coding. The symmetry factor for each FD is…

Capsule networks are a neural network architecture specialized for visual scene recognition. Features and pose information are extracted from a scene and then dynamically routed through a hierarchy of vector-valued nodes called 'capsules'…

An algorithm, based on numerical description of the terms of many-body perturbation theory (Goldstone diagrams), is presented. The algorithm allows the use of the same piece of computer code to evaluate any particular diagram in any…

Let $G$ be 2-generated group. The generating graph $\Gamma(G)$ of $G$ is the graph whose vertices are the elements of $G$ and where two vertices $g$ and $h$ are adjacent if $G = \langle g, h \rangle.$ This definition can be extended to a…

A locally compact group $G$ is a cocompact envelope of a group $\Gamma$ if $G$ contains a copy of $\Gamma$ as a discrete and cocompact subgroup. We study the problem that takes two finitely generated groups $\Gamma,\Lambda$ having a common…

Current image processing methods usually operate on the finest-granularity unit; that is, the pixel, which leads to challenges in terms of efficiency, robustness, and understandability in deep learning models. We present an improved…

We establish rigidity theorems for graph product von Neumann algebras $M_\Gamma=*_{v,\Gamma}M_v$ associated to finite simple graphs $\Gamma$ and families of tracial von Neumann algebras $(M_v)_{v\in\Gamma}$. We consider the following three…

For a nice holomorphic function $f(s, z)$ in two variables, a respective holomorphic Gamma function $\Gamma = \Gamma_f$ is constructed, such that $f(s, \Gamma(s)) = \Gamma(s + 1)$. Along the way, we fall through a rabbit hole of infinite…

Every (full) finite Gabor system generated by a unit-norm vector $g\in \mathbb{C}^d$ is a finite unit-norm tight frame (FUNTF), and can thus be associated with a (Gabor) positive operator valued measure (POVM). Such a POVM is…

Complex networks have been widely used in science and technology because of their ability to represent several systems. One of these systems is found in Biochemistry, in which the synthesis of new nanoparticles is a hot topic. However, the…

We study exact sequences of finite tensor categories of the form $\Rep G \to \C \to \D$, where $G$ is a finite group. We show that, under suitable assumptions, there exists a group $\Gamma$ and mutual actions by permutations $\rhd: \Gamma…

The value semigroup $\Gamma$ and the value set $\Lambda$ of $1$-forms are, respectively, a topological and an analytical invariant of a plane branch. Giving a plane branch $\mathcal{C}$ with semigroup $\Gamma$ there are a finitely number of…

We prove a Dold-Kan type correspondence between the category of dendroidal abelian groups and a suitably constructed category of dendroidal complexes. Our result naturally extends the classical Dold-Kan correspondence between the category…

In this paper, we introduce an explainable algorithm designed from a multi-modal foundation model, that performs fast and explainable image classification. Drawing inspiration from CLIP-based Concept Bottleneck Models (CBMs), our method…

A new calculus on fractal curves, such as the von Koch curve, is formulated. We define a Riemann-like integral along a fractal curve F, called F-alpha-integral, where alpha is the dimension of F. A derivative along the fractal curve called…

The CREAM GAP package computes automorphisms, congruences, endomorphisms and subalgebras of algebras with an arbitrary number of binary and unary operations; it also decides if between two such algebras there exists a monomorphism, an…

We develop an algorithm for the computation of general Fourier integral operators associated with canonical graphs. The algorithm is based on dyadic parabolic decomposition using wave packets and enables the discrete approximate evaluation…

We give an algorithm to morph planar graph drawings that achieves small grid size at the expense of allowing a constant number of bends on each edge. The input is an $n$-vertex planar graph and two planar straight-line drawings of the graph…

We study the homotopy category $\mathsf{K}_{N}(\mathcal{B})$ of $N$-complexes of an additive category $\mathcal{B}$ and the derived category $\mathsf{D}_{N}(\mathcal{A})$ of an abelian category $\mathcal{A}$. First we show that both…

Computational Group Theory is applied to indexed objects (tensors, spinors, and so on) with dummy indices. There are two groups to consider: one describes the intrinsic symmetries of the object and the other describes the interchange of…