Related papers: DG Structure on Length 3 Trimming Complexes and Ap…
We study stratifying ideals for rings in the context of relative homological algebra. Using LU-decompositions, which are a special type of twisted products, we give a sufficient condition for an idempotent ideal to be (relative)…
We show that ideal submodules and closed ternary ideals in Hilbert modules are the same. We use this insight as a little peg on which to hang a little note about interrelations with other notions regarding Hilbert modules. In Section 3, we…
Tensor completion recovers a multi-dimensional array from a limited number of measurements. Using the recently proposed tensor ring (TR) decomposition, in this paper we show that a d-order tensor of dimensional size n and TR rank r can be…
Conditions on the Koszul complex of a noetherian local ring $R$ guarantee that $\mathrm{Tor}^{R}_{i}(M,N)$ is non-zero for infinitely many $i$, when $M$ and $N$ are finitely generated $R$-modules of infinite projective dimension. These…
To any periodic module over any algebra, this paper introduces an associated trivial extension DG-algebra T. After first passing to a strictly unital $A_\infty$-minimal model, it then constructs a particular $A_\infty$-algebra N, called the…
Characteristic class relations in Dolbeault cohomology follow from the existence of a holomorphic geometric structure (for example, holomorphic conformal structures, holomorphic Engel distributions, holomorphic projective connections, and…
Topological Data Analysis has grown in popularity in recent years as a way to apply tools from algebraic topology to large data sets. One of the main tools in topological data analysis is persistent homology. This paper uses undergraduate…
The goal of this article is the study of homogeneous Riemannian structure tensors within the framework of reduction under a group $H$ of isometries. In a first result, $H$ is a normal subgroup of the group of symmetries associated to the…
The segment tree is an extremely versatile data structure. In this paper, a new heap based implementation of segment trees is proposed. In such an implementation of segment tree, the structural information associated with the tree nodes can…
We study the computational content of various theorems with reverse mathematical strength around Arithmetical Transfinite Recursion ($\mathsf{ATR}_0$) from the point of view of computability-theoretic reducibilities, in particular Weihrauch…
In combinatorial commutative algebra and algebraic statistics many toric ideals are constructed from graphs. Keeping the categorical structure of graphs in mind we give previous results a more functorial context and generalize them by…
In the perfect tiling problem, we aim to cover the vertices of a hypergraph~$G$ with pairwise vertex-disjoint copies of a hypergraph $F$. There are three essentially necessary conditions for such a perfect tiling, which correspond to…
We introduce the notion of a complex cell, a complexification of the cells/cylinders used in real tame geometry. For $\delta\in(0,1)$ and a complex cell $\mathcal{C}$ we define its holomorphic extension…
Let $G$ be a group which admits the structure of an iterated semidirect product of finitely generated free groups. We construct a finite, free resolution of the integers over the group ring of $G$. This resolution is used to define…
A free semigroupoid algebra is the weak operator topology closed algebra generated by the left regular representation of a directed graph. We establish lattice isomorphisms between ideals and invariant subspaces, and this leads to a…
A decomposition of a graph is a set of subgraphs whose edges partition those of $G$. The 3-decomposition conjecture posed by Hoffmann-Ostenhof in 2011 states that every connected cubic graph can be decomposed into a spanning tree, a…
Given an associative, not necessarily commutative, ring R with identity, a formal matrix calculus is introduced and developed for pairs of matrices over R. This calculus subsumes the theory of homogeneous systems of linear equations with…
A method of {\it topological grammars} is proposed for multidimensional data approximation. For data with complex topology we define a {\it principal cubic complex} of low dimension and given complexity that gives the best approximation for…
Generalizing the decomposition of a connected planar graph into a tree and a dual tree, we prove a combinatorial analog of the classic Helmholz-Hodge decomposition of a smooth vector field. Specifically, we show that for every polyhedral…
Topology applied to real world data using persistent homology has started to find applications within machine learning, including deep learning. We present a differentiable topology layer that computes persistent homology based on level set…