arXiv subjects
Publications and source records attributed to Elizabeth Vidaurre.
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 linear algebra to provide explicit methods for, and examples of, computing persistent (co)homology.
The purpose of this article is to study directed collapsibility of directed Euclidean cubical complexes. One application of this is in the nontrivial task of verifying the execution of concurrent programs. The classical definition of collapsibility involves certain conditions on a pair of cubes of the complex. The direction of the space can be taken into account by requiring that the past links of vertices remain homotopy equivalent after collapsing. We call this type of collapse a link-preserving directed collapse. In this paper, we give combinatorially equivalent conditions for preserving the topology of the links, allowing for the implementation of an algorithm for collapsing a directed Euclidean cubical complex. Furthermore, we give conditions for when link-preserving directed collapses preserve the contractability and connectedness of directed path spaces, as well as examples when link-preserving directed collapses do not preserve the number of connected components of the path space between the minimum and a given vertex.
In the directed setting, the spaces of directed paths between fixed initial and terminal points are the defining feature for distinguishing different directed spaces. The simplest case is when the space of directed paths is homotopy equivalent to that of a single path; we call this the trivial space of directed paths. Directed spaces that are topologically trivial may have non-trivial spaces of directed paths, which means that information is lost when the direction of these topological spaces is ignored. We define a notion of directed collapsibility in the setting of a directed Euclidean cubical complex using the spaces of directed paths of the underlying directed topological space relative to an initial or a final vertex. In addition, we give sufficient conditions for a directed Euclidean cubical complex to have a contractible or a connected space of directed paths from a fixed initial vertex. We also give sufficient conditions for the path space between two vertices in a Euclidean cubical complex to be disconnected. Our results have applications to speeding up the verification process of concurrent programming and to understanding partial executions in concurrent programs.
In this article, we study the cohomology ring of real moment-angle complexes over a simplicial complex $K$. Combinatorial generators for the cohomology can be given in terms of $K$. For $K$ the boundary of an $n$-gon, we give a full description of the multiplicative structure of the cohomology ring in terms of the combinatorial generators. As a consequence, it is evident that these generators do not form a symplectic basis, unlike the case for moment-angle complexes.
The construction of a simplicial complex given by polyhedral joins (introduced by Anton Ayzenberg), generalizes Bahri, Bendersky, Cohen and Gitler's $J$-construction and simplicial wedge construction. This article gives a cohomological decomposition of a polyhedral product over a polyhedral join for certain families of pairs of simplicial complexes. A formula for the Hilbert-Poincaré series is given, which generalizes Ayzenberg's formula for the moment-angle complex.
In his paper Stadler develops techniques for improving the security of existing secret sharing protocols by allowing to check whether the secret shares given out by the dealer are valid. In particular, the secret sharing is executed over abelian groups. In this paper we develop similar methods over non-abelian groups.