Searcharxiv⌕ Search

arXiv subjects

Bárbara Gutiérrez

Publications and source records attributed to Bárbara Gutiérrez.

4 recordsLinked to original sources
arXiv2021

Effectual Topological Complexity

We introduce the effectual topological complexity (ETC) of a $G$-space $X$. This is a $G$-equivariant homotopy invariant sitting in between the effective topological complexity of the pair $(X,G)$ and the (regular) topological complexity of the orbit space $X/G$. We study ETC for spheres and surfaces with antipodal involution, obtaining a full computation in the case of the torus. This allows us to prove the vanishing of twice the non-trivial obstruction responsible for the fact that the topological complexity of the Klein bottle is 4. In addition, this gives a counterexample to the possibility -- suggested in Pavešić's work on the topological complexity of a map -- that ETC of $(X,G)$ would agree with Farber's $TC(X)$ whenever the projection map $X\to X/G$ is finitely sheeted. We conjecture that ETC of spheres with antipodal action recasts the Hopf invariant one problem, and describe (conjecturally optimal) effectual motion planners.

math.AT↗
arXiv2016

Pairwise disjoint maximal cliques in random graphs and sequential motion planning on random right angled Artin groups

The clique number of a random graph in the Erdos-Renyi model G(n,p) yields a random variable which is known to be asymptotically (as n tends to infinity) almost surely within one of an explicit logarithmic (on n) function r(n,p). We extend this fact by showing that random graphs have, asymptotically almost surely, arbitrarily many pairwise disjoint complete subgraphs with as many vertices as r(n,p). The result is motivated by and applied to the sequential motion planning problem on random right angled Artin groups. Indeed, we give an asymptotical description of all the higher topological complexities of Eilenberg-MacLane spaces associated to random graph groups.

math.CO↗
arXiv2015

The higher topological complexity of subcomplexes of products of spheres---and related polyhedral product spaces

We construct "higher" motion planners for automated systems whose space of states are homotopy equivalent to a polyhedral product space $Z(K,\{(S^{k_i},\star)\})$, e.g. robot arms with restrictions on the possible combinations of simultaneously moving nodes. Our construction is shown to be optimal by explicit cohomology calculations. The higher topological complexity of other families of polyhedral product spaces is also determined.

math.AT↗