Related papers: On the growth of topological complexity
A method of {\it topological grammars} is proposed for multidimensional data approximation. For data with complex topology we define a {\it principal cubic complex} of low dimension and given complexity that gives the best approximation for…
For random graphs, the containment problem considers the probability that a binomial random graph $G(n,p)$ contains a given graph as a substructure. When asking for the graph as a topological minor, i.e., for a copy of a subdivision of the…
Let $X$ be a compact metric space and $T:X\longrightarrow X$ be continuous. Let $h^*(T)$ be the supremum of topological sequence entropies of $T$ over all subsequences of $\mathbb Z_+$ and $S(X)$ be the set of the values $h^*(T)$ for all…
\begin{abstrac} Let $(X,T) $ be a topological space, and $^{*}X$ a non--standard extension of $X$. There is a natural ``standard'' topology $^{S}T$ on $^{*}X$ generated by $^{*}G$, where $G\in T$. The topological space $(^{*}X,^{S}T) $ will…
Suppose $(M,g)$ is a Riemannian manifold having dimension $n$, nonnegative Ricci curvature, maximal volume growth and unique tangent cone at infinity. In this case, the tangent cone at infinity $C(X)$ is an Euclidean cone over the…
Let $(X,\Gamma)$ be a topological system, where $\Gamma$ is a nilpotent group generated by $T_1,\ldots, T_d$ such that for each $T\in \Gamma$, $T\neq e_\Gamma$, $(X,T)$ is weakly mixing and minimal. For $d,k\in \mathbb{N}$, let $p_{i,j}(n),…
We define the notion of {\em rational presentation of a complete metric space} in order to study metric spaces from the algorithmic complexity point of view. In this setting, we study some presentations of the space $\czu$ of uniformly…
We use Brown-Peterson cohomology to obtain lower bounds for the higher topological complexity, TC_k(RP^n), of real projective spaces, which are often much stronger than those implied by ordinary mod-2 cohomology.
Let $\omega$ be a relative differential on aithmetic surface $X$. We construct a family of rational functions $G_x$ on $X\otimes\Bbb{C}$, which can approximate local antiderivatives of $\omega$ over an open set on $X\otimes\Bbb{C}$. From…
Using a recursive approach, we show that the generating function for sets of Motzkin paths avoiding a single (not necessarily consecutive) pattern is rational over $x$ and the Catalan generating function $C(x) =…
Let $C\subset \mathbb{P}^n$ be a rational normal curve and let $\ell_O:\mathbb{P}^{n+1}\dashrightarrow \mathbb{P}^n$ be any tangential projection form a point $O\in T_AC$ where $A\in C$. Hence $X:= \ell_O(C)\subset \mathbb{P}^n$ is a…
We employ Massey products to find sharper lower bounds for the Schwarz genus of a fibration than those previously known. In particular we give examples of non-formal spaces $X$ for which the topological complexity $\TC(X)$ (defined to be…
We study the higher (sequential) topological complexity, a numerical homotopy invariant for the planar polygon spaces. For these spaces with a small genetic codes and dimension $m$, Davis showed that their topological complexity is either…
We consider a definably complete locally o-minimal expansion of an ordered field. We treat two topics in this paper. The first topic is a definable $\mathcal C^r$ approximation of a definable $\mathcal C^{r-1}$ map between definable…
Suppose $X$ and $Y$ are finite complexes, with $Y$ simply connected. Gromov conjectured that the number of mapping classes in $[X,Y]$ which can be realized by $L$-Lipschitz maps grows asymptotically as $L^\alpha$, where $\alpha$ is an…
Consider a definable complete d-minimal expansion $(F, <, +, \cdot, 0, 1, \dots,)$ of an oredered field $F$. Let $X$ be a definably compact definably normal definable $C^r$ manifold and $2 \le r <\infty$. We prove that the set of definable…
We prove the formula \begin{equation*} TC(X\vee Y)=\max\{TC(X),TC(Y),cat(X\times Y)\} \end{equation*} for the topological complexity of the wedge $X\vee Y$.
We establish some upper and lower bounds of the rational topological complexity for certain classes of elliptic spaces. Our techniques permit us in particular to show that the rational topological complexity coincides with the dimension of…
The level-$k$ $\ell_1$-Fourier weight of a Boolean function refers to the sum of absolute values of its level-$k$ Fourier coefficients. Fourier growth refers to the growth of these weights as $k$ grows. It has been extensively studied for…
We prove that $\mathcal{C}^r$ maps with $r>1$ on a compact surface have symbolic extensions, i.e. topological extensions which are subshifts over a finite alphabet. More precisely we give a sharp upper bound on the so-called symbolic…