Related papers: Persistent homology of semi-algebraic sets
Let $U_l$ be a quantum group at an $l$th root of unity. Many tilting modules for $U_l$ have been shown to have what we call a balanced semisimple filtration, or a Loewy series whose semisimple layers are symmetric about some middle layer.…
We consider a refinement of the partition function of graph homomorphisms and present a quasi-polynomial algorithm to compute it in a certain domain. As a corollary, we obtain quasi-polynomial algorithms for computing partition functions…
We give the first sorting algorithm with bounds in terms of higher-order entropies: let $S$ be a sequence of length $m$ containing $n$ distinct elements and let (H_\ell (S)) be the $\ell$th-order empirical entropy of $S$, with (n^{\ell + 1}…
We describe a nearly-linear time algorithm to solve the linear system $L_1x = b$ parameterized by the first Betti number of the complex, where $L_1$ is the 1-Laplacian of a simplicial complex $K$ that is a subcomplex of a collapsible…
Consider a semi-algebraic set A in R^d constructed from the sets which are determined by inequalities p_i(x)>0, p_i(x)\ge 0, or p_i(x)=0 for a given list of polynomials p_1,...,p_m. We prove several statements that fit into the following…
Assume that a finite set of points is randomly sampled from a subspace of a metric space. Recent advances in computational topology have provided several approaches to recovering the geometric and topological properties of the underlying…
Motivated by applications to topological data analysis, we give an efficient algorithm for computing a (minimal) presentation of a bigraded $K[x,y]$-module $M$, where $K$ is a field. The algorithm takes as input a short chain complex of…
To analyze the topological properties of the given discrete data, one needs to consider a continuous transform called filtration. Persistent homology serves as a tool to track changes of homology in the filtration. The outcome of the…
The present paper is devoted to the description of finite-dimensional semisimple Leibniz algebras over complex numbers, their derivations and automorphisms.
Building on work of van Engelen and van Mill, we show that a zero-dimensional Borel space is homeomorphic to a semifilter if and only if it is homogeneous and not locally compact. Under $\mathbf{\Sigma}^1_1$-Determinacy, this result extends…
Green and Schroll give an easy criterion for a monomial algebra $A$ to be quasi-hereditary with respect to some partial order $\leq_A$. A natural follow-up question is under which conditions a monomial quasi-hereditary algebra $(A, \leq_A)$…
A multicomplex structure is defined from an ordered lattice of multigraphs. This structure will help us to observe the features of Persistent Homology in this context, its interaction with the ordering and the repercussions of the process…
We show that if $T$ is any of four semigroups of two elements that are not groups, there exists a finite dimensional associative $T$-graded algebra over a field of characteristic $0$ such that the codimensions of its graded polynomial…
We describe an algorithm computing the monodromy and the pole order filtration on the Milnor fiber cohomology of any reduced projective plane curve $C$. The relation to the zero set of Bernstein-Sato polynomial of the defining homogeneous…
Let $\ell$ be a prime, $k$ a finitely generated field of characteristic different from $\ell$, and $X$ a smooth geometrically connected curve over $k$. Say a semisimple representation of $\pi_1^{\mathrm{et}}(X_{\bar k})$ is arithmetic if it…
Persistent homology has emerged as a popular technique for the topological simplification of big data, including biomolecular data. Multidimensional persistence bears considerable promise to bridge the gap between geometry and topology.…
Delorme suggested that the set of all complete intersection numerical semigroups can be computed recursively. We have implemented this algorithm, and particularized it to several subfamilies of this class of numerical semigroups: free and…
We investigate numerical semigroups generated by any quadratic sequence with initial term zero and an infinite number of terms. We find an efficient algorithm for calculating the Ap\'ery set, as well as bounds on the elements of the Ap\'ery…
We consider the problem of constructing semisimple subalgebras of real (semi-) simple Lie algebras. We develop computational methods that help to deal with this problem. Our methods boil down to solving a set of polynomial equations. In…
Motivated by problems of uncertainty propagation and robust estimation we are interested in computing a polynomial sublevel set of fixed degree and minimum volume that contains a given semialgebraic set K. At this level of generality this…