arXiv subjects

Aleksandra Franc

Publications and source records attributed to Aleksandra Franc.

4 recordsLinked to original sources

arXiv2023

Rigidity of terminal simplices in persistent homology

Given a filtration function on a finite simplicial complex, stability theorem of persistent homology states that the corresponding barcode is continuous with respect to changes in the filtration function. However, due to the discrete setting of simplicial complexes, the critical simplices terminating matched bars cannot change continuously for arbitrary perturbations of filtration functions. In this paper we provide a sufficient condition for rigidity of a terminal simplex, i.e., a condition on $ε> 0$ implying that the terminal simplex of a homology class or a bar in persistent homology remains constant through $ε$-perturbations of filtration function. The condition for a homology class or a bar in dimension n depends on the barcodes in dimensions n and n+1.

math.AT↗

arXiv2013

Lower bounds for topological complexity

We introduce fibrewise Whitehead- and fibrewise Ganea definitions of monoidal topological complexity. We then define several lower bounds for the topological complexity, which improve on the standard lower bound in terms of nilpotency of the cohomology ring. The relationships between these lower bounds are studied.

math.AT↗

arXiv2012

Spaces with high topological complexity

By a formula of Farber the topological complexity TC(X) of a (p-1)-connected, m-dimensional CW-complex X is bounded above by (2m+1)/p+1. There are also various lower estimates for TC(X) such as the nilpotency of the ring $H^*(X\times X,Δ(X))$, and the weak and stable topological compexity wTC(X) and $σ\TC(X)$. In general the difference between these upper and lower bounds can be arbitrarily large. In this paper we investigate spaces whose topological complexity is close to the maximal value given by Farber's formula and show that in these cases the gap between the lower and upper bounds is narrow and that TC(X) often coincides with the lower bounds.

math.AT↗

arXiv2011

Topological complexity of the telescope

We use an alternative definition of topological complexity to show that the topological complexity of the mapping telescope of a sequence $X_1\rightarrow X_2\rightarrow X_3\rightarrow...$ is bounded above by $2max{TC(X_i); i=1,2,...}$.

math.AT↗