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

There are several ways to construct omega-categories from combinatorial objects such as pasting schemes or parity complexes. We make these constructions into a functor on a category of chain complexes with additional structure, which we…

A capsule is a group of neurons whose activity vector models different properties of the same entity. This paper extends the capsule to a generative version, named variational capsules (VCs). Each VC produces a latent variable for a…

Flow-Imaging Microscopy (FIM) is commonly used in both academia and industry to characterize subvisible particles (those $\le 25 \mu m$ in size) in protein therapeutics. Pharmaceutical companies are required to record vast volumes of FIM…

We present a novel algorithm for calculating fix-points. The algorithm calculates fix-points of an endo-function f on a distributive lattice, by performing reachability computation a graph derived from the dual of f; this is in comparison…

In this paper, we show how a construction of an implicit complexity model can be implemented using concepts coming from the core of von Neumann algebras. Namely, our aim is to gain an understanding of classical computation in terms of the…

The two-dimensional one-component plasma ---2dOCP--- is a system composed by $n$ mobile particles with charge $q$ over a neutralizing background in a two-dimensional surface. The Boltzmann factor of this system, at temperature $T$, takes…

The current paper is dedicated to the study of the classical $K_1$ groups of graded rings. Let $A$ be a $\Gamma$ graded ring with identity $1$, where the grading $\Gamma$ is an abelian group. We associate a category with suspension to the…

The power graph $\mathcal{P}(G)$ of a finite group $G$ is the graph whose vertex set is $G$, and two elements in $G$ are adjacent if one of them is a power of the other. The purpose of this paper is twofold. First, we find the complexity of…

Content-based analysis and retrieval of digital images found in scientific articles is often hindered by images consisting of multiple subfigures (compound figures). We address this problem by proposing a method to automatically classify…

We present a Mathematica package for doing computations with gamma matrices, spinors, tensors and other objects, in any dimension and signature. The approach we use is based on defining the commutation relations of the relevant matrices,…

A framework to represent and compute two-loop $N$-point Feynman diagrams as double-integrals is discussed. The integrands are 'generalised one-loop type" multi-point functions multiplied by simple weighting factors. The final integrations…

Gluing of two pseudo functors has been studied by Deligne, Ayoub, and others in the construction of extraordinary direct image functors in \'etale cohomology, stable homotopy, and mixed motives of schemes. In this article, we study more…

We describe a provably complete algorithm for the generation of a tight, possibly exact superset of all combinatorially distinct simple n-facet polytopes in R^d, along with their graphs, f-vectors, and face lattices. The technique applies…

The dynamics of the family of maps $\displaystyle{f_{\alpha, \beta, \gamma, \delta}(z)=\frac{\alpha z + \beta}{\gamma z^2 +\delta z}}$ in complex plane is investigated computationally. This dynamical system $z_{n+1}=f_{\alpha, \beta,…

For each integral dominant weight $\lambda$, we construct a twisted global section functor $\Gamma^{\lambda}$ from the category of critical twisted $D$-modules on affine Grassmannian to the category of $\lambda$-regular modules of affine…

For a finite dimensional algebra $\Lambda$ of finite representation type and an additive generator $M$ for $\mathrm{mod}\,\Lambda$, we investigate the properties of the Yoneda algebra $\Gamma=\bigoplus_{i \geq…

The form factor of the unitary group U(N) endowed with the Haar measure characterizes the correlations within the spectrum of a typical unitary matrix. It can be decomposed into a sum over pairs of ``periodic orbits'', where by periodic…

For a graph $G = (V, E)$, the $\gamma$-graph of $G$, denoted $G(\gamma) = (V(\gamma), E(\gamma))$, is the graph whose vertex set is the collection of minimum dominating sets, or $\gamma$-sets of $G$, and two $\gamma$-sets are adjacent in…

This paper focuses on the derivations and automorphism groups of certain finite-dimensional associative algebras over the field of complex numbers. Using classification results for algebras of dimensions two, three, and four, along with…

As an important physical quantity to understand the internal structure of polymer chains, the structure factor is being studied both in theory and experiment. Theoretically, the structure factor of Gaussian chains have been solved…