Related papers: A Coupled Alpha Complex
Computing the state-space topology of a dynamical system from scalar data requires accurate reconstruction of those dynamics and construction of an appropriate simplicial complex from the results. The reconstruction process involves a…
The homotopy type of the complement of a complex coordinate subspace arrangement is studied by fathoming out the connection between its topological and combinatorial structures. A family of arrangements for which the complement is homotopy…
We build free, bigraded bidifferential algebra models for the forms on a complex manifold, with respect to a strong notion of quasi-isomorphism and compatible with the conjugation symmetry. This answers a question of Sullivan. The resulting…
It is shown that if T is a connected nontrivial graph and X is an arbitrary finite simplicial complex, then there is a graph G such that the complex Hom(T,G) is homotopy equivalent to X. The proof is constructive, and uses a nerve lemma.…
We present a distributed algorithm to compute the first homology of a simplicial complex. Such algorithms are very useful in topological analysis of sensor networks, such as its coverage properties. We employ spanning trees to compute a…
We study the cost of multiplication modulo triangular families of polynomials. Following previous work by Li, Moreno Maza and Schost, we propose an algorithm that relies on homotopy and fast evaluation-interpolation techniques. We obtain a…
We study abelian lattice gauge theory defined on a simplicial complex with arbitrary topology. The use of dual objects allows one to reformulate the theory in terms of new dynamical variables; however, we avoid the use of the dual lattice…
The realization problem asks: When does an algebraic complex arise, up to homotopy, from a geometric complex? In the case of 2- dimensional algebraic complexes, this is equivalent to the D2 problem, which asks when homological methods can…
Computation of homology or cohomology is intrinsically a problem of high combinatorial complexity. Recently we proposed a new efficient algorithm for computing cohomologies of Lie algebras and superalgebras. This algorithm is based on…
For simple graphs $G$ and $H$, the Hom complex $\mathrm{Hom}(G,H)$ is a polyhedral complex whose vertices are the graph homomorphisms $G\to H$ and whose edges connect the pairs of homomorphisms which differ in a single vertex of $G$. Hom…
In this work, we propose a novel approach to the homotopy transfer procedure starting from a set of homotopy data such that the first differential complex is a differential graded module over the second one. We show that the module…
Let $V$ be a degree $d$, reduced hypersurface in $\mathbb{CP}^{n+1}$, $n \geq 1$, and fix a generic hyperplane, $H$. Denote by $\mathcal{U}$ the (affine) hypersurface complement, $\mathbb{CP}^{n+1}- V \cup H$, and let $\mathcal{U}^c$ be the…
The purpose of this paper is to define an $\alpha$-type cohomology, which we call $\alpha$-type Chevalley-Eilenberg cohomology, for Hom-Lie algebras. We relate it to the known Chevalley-Eilenberg cohomology and provide explicit computations…
The intended model of the homotopy type theories used in Univalent Foundations is the infinity-category of homotopy types, also known as infinity-groupoids. The problem of higher structures is that of constructing the homotopy types needed…
A general method for constructing simplicial complex from observed time series of dynamical systems based on the delay coordinate reconstruction procedure is presented. The obtained simplicial complex preserves all pertinent topological…
The strict globular $\omega$-categories formalize the execution paths of a parallel automaton and the homotopies between them. One associates to such (and any) $\omega$-category $\C$ three homology theories. The first one is called the…
The two pillars of Algebraic topology - Homology and homotopy theory rely on the availability of basic building blocks called cells. Cells take the form of simplexes, and have properties such as faces, sub-cells, convexity and…
We study the complexity of a classic problem in computational topology, the homology problem: given a description of some space $X$ and an integer $k$, decide if $X$ contains a $k$-dimensional hole. The setting and statement of the homology…
A hom-associative algebra is an algebra whose associativity is twisted by an algebra homomorphism. We show that the Hochschild type cochain complex of a hom-associative algebra carries a homotopy G-algebra structure. As a consequence, we…
The dual complex of a singularity is defined, up-to homotopy, using resolutions of singularities. In many cases, for instance for isolated singularities, we identify and study a "minimal" representative of the homotopy class that is well…