Related papers: Annotating Simplices with a Homology Basis and Its…

We describe how to solve simultaneous Pad\'e approximations over a power series ring $K[[x]]$ for a field $K$ using $O~(n^{\omega - 1} d)$ operations in $K$, where $d$ is the sought precision and $n$ is the number of power series to…

Various NLP tasks require a complex hierarchical structure over nodes, where each node is a cluster of items. Examples include generating entailment graphs, hierarchical cross-document coreference resolution, annotating event and subevent…

Topological data analysis can extract effective information from higher-dimensional data. Its mathematical basis is persistent homology. The persistent homology can calculate topological features at different spatiotemporal scales of the…

Counting homomorphisms of a constant sized pattern graph $H$ in an input graph $G$ is a fundamental computational problem. There is a rich history of studying the complexity of this problem, under various constraints on the input $G$ and…

In [6], the authors construct a cochain complex $C\!H^*(\mathcal{Z}_{\mathcal{K}})$ on the cohomology of a moment-angle complex $\mathcal{Z}_{\mathcal{K}}$ and call the resulting cohomology the double cohomology,…

We introduce harmonic persistent homology spaces for filtrations of finite simplicial complexes. As a result we can associate concrete subspaces of cycles to each bar of the barcode of the filtration. We prove stability of the harmonic…

We present and evaluate an approach for human-in-the-loop specification of shape reconstruction with annotations for basic robot-object interactions. Our method is based on the idea of model annotation: the addition of simple cues to an…

We present an algorithm that computes a shortest non-contractible and a shortest non-separating cycle on an orientable combinatorial surface of bounded genus in O(n \log n) time, where n denotes the complexity of the surface. This solves a…

Let $p: S\to S_g$ be a finite covering of an orientable closed surface of genus $g$. We prove that, for $g\geq 3$, the rational homology group $H_1(S;{\mathbb Q})$ is generated by cycles supported on simple closed curves $\gamma\subset S$…

Human annotation of training samples is expensive, laborious, and sometimes challenging, especially for Natural Language Processing (NLP) tasks. To reduce the labeling cost and enhance the sample efficiency, Active Learning (AL) technique…

Given a weighted, undirected graph $G$ cellularly embedded on a topological surface $S$, we describe algorithms to compute the second shortest and third shortest closed walks of $G$ that are neither homotopically trivial in $S$ nor…

We introduce a new algorithm for the structural analysis of finite abstract simplicial complexes based on local homology. Through an iterative and top-down procedure, our algorithm computes a stratification $\pi$ of the poset $P$ of…

Let H be a Hopf algebra. By definition a modular crossed H-module is a vector space M on which H acts and coacts in a compatible way. To every modular crossed H-module M we associate a cyclic object Z(H,M). The cyclic homology of Z(H,M)…

Persistent homology is a topological feature used in a variety of applications such as generating features for data analysis and penalizing optimization problems. We develop an approach to accelerate persistent homology computations…

Zigzag filtrations of simplicial complexes generalize the usual filtrations by allowing simplex deletions in addition to simplex insertions. The barcodes computed from zigzag filtrations encode the evolution of homological features.…

We show that the existence of a homomorphism from an $n$-vertex graph $G$ to an $h$-vertex graph $H$ can be decided in time $2^{O(n)}h^{O(1)}$ and polynomial space if $H$ comes from a family of graphs that excludes a topological minor. The…

In this paper we discuss how semantic annotations can be used to introduce mathematical algorithmic information of the underlying imperative code to enable compilers to produce code transformations that will enable better performance. By…

Given a symmetric $n\times n$ matrix $P$ with $0 \le P(u, v)\le 1$, we define a random graph $G_{n, P}$ on $[n]$ by independently including any edge $\{u, v\}$ with probability $P(u, v)$. For $k\ge 1$ let $\mathcal{A}_k$ be the property of…

Genome assembly is a fundamental problem in Bioinformatics, where for a given set of overlapping substrings of a genome, the aim is to reconstruct the source genome. The classical approaches to solving this problem use assembly graphs, such…

Current foundation models have shown impressive performance across various tasks. However, several studies have revealed that these models are not effective for everyone due to the imbalanced geographical and economic representation of the…