Related papers: Chain Homotopies for Object Topological Representa…
In this paper, we investigate discrete topological complexity $TC(K)$ introduced for situations where the configuration space possesses a simplicial structure. %Simplicial complexes are well-known and commonly used in programming for…
When studying deformations of an $A$-module $M$, Laudal and Yau showed that one can consider 1-cocycles in the Hochschild cohomology of $A$ with coefficients in the bi-module $End_k(M).$ With this in mind, the use of higher order Hochschild…
Symmetric edge polytopes are a recent and well-studied family of centrally symmetric polytopes arising from graphs. In this paper, we introduce a generalization of this family to arbitrary simplicial complexes. We show how topological…
Classical unsupervised learning methods like clustering and linear dimensionality reduction parametrize large-scale geometry when it is discrete or linear, while more modern methods from manifold learning find low dimensional representation…
A special subcomplex of the singular chain complex for a topological space, historically called oriented singular chain complex is used here with the new name "alternative" singular chain complex. It was already known that this subcomplex…
We present a development of cellular cohomology in homotopy type theory. Cohomology associates to each space a sequence of abelian groups capturing part of its structure, and has the advantage over homotopy groups in that these abelian…
Many applications modeled by polynomial systems have positive dimensional solution components (e.g., the path synthesis problems for four-bar mechanisms) that are challenging to compute numerically by homotopy continuation methods. A…
We outline the main features of the definitions and applications of crossed complexes and cubical $\omega$-groupoids with connections. These give forms of higher homotopy groupoids, and new views of basic algebraic topology and the…
The cohomology ring with coefficients in $\Z_p$, where $p$ is a prime integer, of a Seifert manifold $M$, orientable or not orientable is obtained from a simplicial decomposition of $M$. Many choices must be made before applying…
A product of cochains in a polyhedral complex is constructed. The multiplication algorithm depends on the choice of a parameter. The parameter is a linear functional on the ambient space. Cocycles form a subring of the ring of cochains,…
The persistent homology with coefficients in a field F coincides with the same for cohomology because of duality. We propose an implementation of a recently introduced algorithm for persistent cohomology that attaches annotation vectors…
This paper proposes a new cubical space model for the representation of continuous objects and surfaces in the n-dimensional Euclidean space by discrete sets of points. The cubical space model concerns the process of converting a continuous…
For a topological space $X$, we introduce a criterion for the $\rm FI$ module $H^i({\rm Conf}_n(X))$ to be finitely generated and give several applications. For instance, if $C$ is a finite connected $CW$ complex, then $X = C \times…
We study the spectral sequence associated to the filtration by powers of the augmentation ideal on the (twisted) equivariant chain complex of the universal cover of a connected CW-complex X. In the process, we identify the d^1 differential…
Given any model category, or more generally any category with weak equivalences, its simplicial localization is a simplicial category which can rightfully be called the "homotopy theory" of the model category. There is a model category…
This paper shows a mathematical formalization, algorithms and computation software of volume optimal cycles, which are useful to understand geometric features shown in a persistence diagram. Volume optimal cycles give us concrete and…
It is proved that fundamental groups of boolean representable simplicial complexes are free and the rank is determined by the number and nature of the connected components of their graph of flats for dimension $\geq 2$. In the case of…
In this paper we develop a novel mathematical formalism for the modeling of neural information networks endowed with additional structure in the form of assignments of resources, either computational or metabolic or informational. The…
In a previous paper we have suggested a number of ideas to attack circuit size complexity with cohomology. As a simple example, we take circuits that can only compute the AND of two inputs, which essentially reduces to SET COVER. We show a…
Numerical Algebraic Geometry uses numerical data to describe algebraic varieties. It is based on the methods of numerical polynomial homotopy continuation, an alternative to the classical symbolic approaches of computational algebraic…