Related papers: Persistent homology of semi-algebraic sets

We prove new bounds on the Betti numbers of real varieties and semi-algebraic sets that have a more refined dependence on the degrees of the polynomials defining them than results known before. Our method also unifies several different…

We study the homological properties of $\Delta_{\mathbf{r}}(n_1, \dots, n_e)$, a simplicial complex formed by sequentially gluing complete graphs along $(r_i-1)$-simplices. This construction generates precisely the chordal clique complexes,…

Persistent homology is a popular and powerful tool for capturing topological features of data. Advances in algorithms for computing persistent homology have reduced the computation time drastically -- as long as the algorithm does not…

We generalize the geometric sequence $\{a^p, a^{p-1}b, a^{p-2}b^2,...,b^p\}$ to allow the $p$ copies of $a$ (resp. $b$) to all be different. We call the sequence $\{a_1a_2a_3\cdots a_p, b_1a_2a_3\cdots a_p, b_1b_2a_3\cdots a_p,\ldots,…

Solving polynomial systems arising from applications is frequently made easier by the structure of the systems. Weighted homogeneity (or quasi-homogeneity) is one example of such a structure: given a system of weights…

Recently, significant progress has been made on semantic segmentation. However, the success of supervised semantic segmentation typically relies on a large amount of labelled data, which is time-consuming and costly to obtain. Inspired by…

We study the homology of an explicit finite-index subgroup of the automorphism group of a partially commutative group, in the case when its defining graph is a tree. More concretely, we give a lower bound on the first Betti number of this…

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…

Persistence diagrams, combining geometry and topology for an effective shape description used in pattern recognition, have already proven to be an effective tool for shape representation with respect to a certainfiltering function.…

We study the class of pseudo BL-algebras whose every maximal filter is normal. We present an equational base for this class and we extend these results for the class of basic pseudo hoops with fixed strong unit.

The catenary degree is an invariant that measures the distance between factorizations of elements within a numerical semigroup. In general, all possible catenary degrees of the elements of the numerical semigroups occur as the catenary…

In this paper we state the homological domination principle for random multi-parameter simplicial complexes, claiming that the Betti number in one specific dimension (which is explicitly determined by the probability multi-parameter)…

Second-order superintegrable systems in dimensions two and three are essentially classified. With increasing dimension, however, the non-linear partial differential equations employed in current methods become unmanageable. Here we propose…

We derive the duality relation for the Hilbert series H(d^m;z) of almost symmetric numerical semigroup S(d^m) combining it with its dual H(d^m;z^{-1}). On this basis we establish the bijection between the multiset of degrees of the syzygy…

We introduce a new class of "filtered" schemes for some first order non-linear Hamilton-Jacobi-Bellman equations. The work follows recent ideas of Froese and Oberman (SIAM J. Numer. Anal., Vol 51, pp.423-444, 2013). The proposed schemes are…

Let $\mathrm{R}$ be a real closed field and $\mathrm{D} \subset \mathrm{R}$ an ordered domain. We consider the algorithmic problem of computing the generalized Euler-Poincar\'e characteristic of real algebraic as well as semi-algebraic…

We deal with equations over free semilattice of infinite rank and prove that any infinite consistent system of equations is equivalent to its finite subsystem. Moreover, we describe irreducible algebraic sets and solve some algorithmic…

We discuss recent developments in the study of semiorthogonal decompositions of algebraic varieties with an emphasis on their behaviour in families. First, we overview new results concerning homological projective duality. Then we introduce…

In this paper, we revisit the problem of classifying real algebraic and semialgebraic sets by their topological types, focusing on establishing the effectiveness of bounds rather than deriving new quantitative estimates. Building on Hardt's…

For each integer $k\ge 1$, we define an algorithm which associates to a partition whose maximal value is at most $k$ a certain subset of all partitions. In the case when we begin with a partition $\lambda$ which is square, i.e…