Related papers: Algorithmic canonical stratifications of simplicia…

The discrete logarithm problem in Jacobians of curves of high genus $g$ over finite fields $\FF_q$ is known to be computable with subexponential complexity $L_{q^g}(1/2, O(1))$. We present an algorithm for a family of plane curves whose…

This thesis deals with the algorithmic representation of constructible sheaves of abelian groups on the \'etale site of a variety over an algebraically closed field, as well as the explicit computation of their cohomology. We describe three…

We outline a novel clustering scheme for simplicial complexes that produces clusters of simplices in a way that is sensitive to the homology of the complex. The method is inspired by, and can be seen as a higher-dimensional version of,…

Valiant introduced matchgate computation and holographic algorithms. A number of seemingly exponential time problems can be solved by this novel algorithmic paradigm in polynomial time. We show that, in a very strong sense, matchgate…

Subspace clustering has become widely adopted for the unsupervised analysis of hyperspectral images (HSIs). Recent model-aware deep subspace clustering methods often use a two-stage framework, involving the calculation of a…

We reveal a complexity chasm, separating the trinomial and tetranomial cases, for solving univariate sparse polynomial equations over certain local fields. First, for any fixed field $K\in\{\mathbb{Q}_2,\mathbb{Q}_3,\mathbb{Q}_5,\ldots\}$,…

In an earlier paper of Cadek, Vokrinek, Wagner, and the present authors, we investigated an algorithmic problem in computational algebraic topology, namely, the computation of all possible homotopy classes of maps between two topological…

Any finite simplicial complex K and a partition of the vertex set of K determines a canonical quotient space of the moment-angle complex of K. We prove that the cohomology groups of such a space can be computed via some Hochster's type…

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…

Intersection homology is a topological invariant which detects finer information in a space than ordinary homology. Using ideas from classical simple homotopy theory, we construct local combinatorial transformations on simplicial complexes…

This paper proves that the homotopy type of a pointed, simply-connected, 2-reduced simplicial set is determined by the chain-complex augmented by functorial diagonal and higher diagonal maps (a simple generalization of the ones used to…

This paper presents a set of tools to compute topological information of simplicial complexes, tools that are applicable to extract topological information from digital pictures. A simplicial complex is encoded in a (non-unique)…

We propose an algorithm for quickly evaluating polynomials. It pre-conditions a complex polynomial $P$ of degree $d$ in time $O(d\log d)$, with a low multiplicative constant independent of the precision. Subsequent evaluations of $P$…

Using the notion of contiguity of simplicial maps, we adapt Farber's topological complexity to the realm of simplicial complexes. We show that, for a finite simplicial complex $K$, our discretized concept recovers the topological complexity…

Let $Y$ be a locally complete intersection over $\mathcal{O}_K$ containing a $p$-power root of unity $\zeta_p$. We classify the derived category of prismatic crystals on the absolute prismatic site of $Y$ by studying quasi-coherent…

The topology of periodic spaces has attracted a lot of interest in recent years in order to study and classify crystalline structures and other large homogeneous data sets, such as the distribution of galaxies in cosmology. In practice,…

This survey describes some useful properties of the local homology of abstract simplicial complexes. Although the existing literature on local homology is somewhat dispersed, it is largely dedicated to the study of manifolds, submanifolds,…

In this paper we define and study for a finite partially ordered set P a class of simplicial complexes on the set P_r of r-element multichains from P. The simplicial complexes depend on a strictly monotone function from [r] to [2r]. We show…

We present approximation algorithms for maximum independent set of pseudo-disks in the plane, both in the weighted and unweighted cases. For the unweighted case, we prove that a local search algorithm yields a \PTAS. For the weighted case,…

For any orbifold M, we explicitly construct a simplicial complex S(M) from a given triangulation of the `coarse' underlying space together with the local isotropy groups of M. We prove that, for any local system on M, this complex S(M) has…