English
Related papers

Related papers: An algorithmic approach to Dold-Puppe complexes

200 papers

Machine learning models are a powerful theoretical tool for analyzing data from quantum simulators, in which results of experiments are sets of snapshots of many-body states. Recently, they have been successfully applied to distinguish…

Strongly chordal graphs are a subclass of chordal graphs. The interest in this subclass stems from the fact that many problems which are NP-complete for chordal graphs are solvable in polynomial time for this subclass. However, we are not…

Data Structures and Algorithms · Computer Science 2018-04-25 Md. Zamilur Rahman , Asish Mukhopadhyay , Yash P. Aneja

In this paper, we first construct some complete cotorson pairs on the category $\mathbb{C}_N(\mathcal{G})$ of unbounded $N$-complexes of Grothendieck category $\mathcal{G}$, from two given cotorsion pairs in $\mathcal{G}$. Next as an…

Representation Theory · Mathematics 2019-06-18 Payam Bahiraei

In this article, a novel cluster analysis algorithm was employed in the study of polymer coil to globule transition via single chain Monte Carlo simulations. The algorithm, which has been recently applied in Molecular Dynamics simulations…

Soft Condensed Matter · Physics 2013-11-21 T. E. Raptis , Vasilios E. Raptis

This paper presents the Functional Machine Calculus (FMC) as a simple model of higher-order computation with "reader/writer" effects: higher-order mutable store, input/output, and probabilistic and non-deterministic computation. The FMC…

Programming Languages · Computer Science 2023-06-22 Willem Heijltjes

For a simply connected (non-nilpotent) solvable Lie group $G$ with a lattice $\Gamma$ the de Rham and Dolbeault cohomologies of the solvmanifold $G/\Gamma$ are not in general isomorphic to the cohomologies of the Lie algebra $\mathfrak g$…

Differential Geometry · Mathematics 2016-05-24 Sergio Console , Anna Fino , Hisashi Kasuya

We give a specific cylinder functor for semifree dg categories. This allows us to construct a homotopy colimit functor explicitly. These two functors are "computable", specifically, the constructed cylinder functor sends a dg category of…

Category Theory · Mathematics 2024-05-07 Dogancan Karabas , Sangjin Lee

Fixing a subgroup $\Gamma$ in a group $G$, the full commensurability growth function assigns to each $n$ the cardinality of the set of subgroups $\Delta$ of $G$ with $[\Gamma: \Gamma \cap \Delta][\Delta : \Gamma \cap \Delta] \leq n$. For…

Group Theory · Mathematics 2018-09-28 Khalid Bou-Rabee , Tasho Kaletha , Daniel Studenmund

We present an algorithm to compute values L(s) and derivatives of L-functions of motivic origin numerically to required accuracy. Specifically, the method applies to any L-series whose Gamma-factor is a product of any number of…

Number Theory · Mathematics 2013-09-23 Tim Dokchitser

In this paper, we study the Reconstruction Conjecture for finite simple graphs. Let $\Gamma$ and $\Gamma'$ be finite simple graphs with at least three vertices such that there exists a bijective map $f:V(\Gamma) \rightarrow V(\Gamma')$ and…

Combinatorics · Mathematics 2021-06-22 Tetsuya Hosaka

Let $\Gamma$ denote an undirected, connected, regular graph with vertex set $X$, adjacency matrix $A$, and ${d+1}$ distinct eigenvalues. Let ${\mathcal A}={\mathcal A}(\Gamma)$ denote the subalgebra of Mat$_X({\mathbb C})$ generated by $A$.…

Combinatorics · Mathematics 2020-09-14 M. A. Fiol , Safet Penjić

In the mid thirties Murray and von Neumann found a natural way to associate a von Neumann algebra $L(\Gamma)$ to any countable discrete group $\Gamma$. Classifying $L(\Gamma)$ in term of $\Gamma$ is a notoriously complex problem as in…

Operator Algebras · Mathematics 2019-08-21 Wanchalerm Sucpikarnon

We show that the isomorphism problem is solvable in the class of central extensions of word-hyperbolic groups, and that the isomorphism problem for biautomatic groups reduces to that for biautomatic groups with finite centre. We describe an…

Geometric Topology · Mathematics 2015-05-27 Martin R. Bridson , Lawrence Reeves

We present an end-to-end algorithm for training deep neural networks to grasp novel objects. Our algorithm builds all the essential components of a grasping system using a forward-backward automatic differentiation approach, including the…

Robotics · Computer Science 2020-07-16 Min Liu , Zherong Pan , Kai Xu , Kanishka Ganguly , Dinesh Manocha

We consider cubic graphs formed with $k \geq 2$ disjoint claws $C_i \sim K_{1, 3}$ ($0 \leq i \leq k-1$) such that for every integer $i$ modulo $k$ the three vertices of degree 1 of $\ C_i$ are joined to the three vertices of degree 1 of…

Discrete Mathematics · Computer Science 2014-05-16 Jean-Luc Fouquet , Henri Thuillier , Jean-Marie Vanherpe

We construct an efficient cluster algorithm for ferromagnetic SU(N)-symmetric quantum spin systems. Such systems provide a new regularization for CP(N-1) models in the framework of D-theory, which is an alternative non-perturbative approach…

High Energy Physics - Lattice · Physics 2007-05-23 B. B. Beard , M. Pepe , S. Riederer , U. -J. Wiese

The Dollo model for reconstructing evolutionary trees from binary characters has been proposed as a generalization of the infinite sites model, also known as the Perfect Phylogeny. In particular, the Dollo model is considered more realistic…

Data Structures and Algorithms · Computer Science 2025-06-17 Paola Bonizzoni , Gianluca Della Vedova , Mauricio Soto Gomez , Gabriella Trucco

The Morse-Smale complex is a well studied topological structure that represents the gradient flow behavior between critical points of a scalar function. It supports multi-scale topological analysis and visualization of feature-rich…

Graphics · Computer Science 2023-11-07 Varshini Subhash , Karran Pandey , Vijay Natarajan

We analyze integral representation and $\Gamma$-convergence properties of functionals defined on \emph{piecewise rigid functions}, i.e., functions which are piecewise affine on a Caccioppoli partition where the derivative in each component…

Analysis of PDEs · Mathematics 2020-02-04 Manuel Friedrich , Francesco Solombrino

Let \( G \) be a finite non-cyclic group. Define \( \mathrm{Cyc}(G) \) as the set of all elements \( a \in G \) such that for any $b\in G$, the subgroup \( \langle a, b \rangle \) is cyclic. The \emph{non-cyclic graph} $\Gamma(G)$ of \( G…

Combinatorics · Mathematics 2025-04-22 Parveen Parveen , Bikash Bhattacharjya