Related papers: Higher Analogues of Discrete Topological Complexit…
We introduce the notion of topological entropy of a formal languages as the topological entropy of the minimal topological automaton accepting it. Using a characterization of this notion in terms of approximations of the Myhill-Nerode…
We investigate the category of discrete topological spaces, with emphasis on inverse systems of height $\omega_1$. Their inverse limits belong to the class of $P$-spaces, which allows us to explore dimensional types of these spaces.
We introduce a hierarchy of fast-growing complexity classes and show its suitability for completeness statements of many non elementary problems. This hierarchy allows the classification of many decision problems with a non-elementary…
In this paper we consider the computational complexity of uniformizing a domain with a given computable boundary. We give nontrivial upper and lower bounds in two settings: when the approximation of boundary is given either as a list of…
We give a topological characterization of the n-dimensional pseudo-boundary of the (2n+1)-dimensional Euclidean space.
We survey techniques for constructing spaces with non-trivial self covers. These processes include methods for building low and high dimension continua which non-trivially self. We also discuss several related group theoretic and…
In this paper, we propose new lower and upper bounds on the linear extension complexity of regular $n$-gons. Our bounds are based on the equivalence between the computation of (i) an extended formulation of size $r$ of a polytope $P$, and…
This note surveys basic topological properties of nonarchimedean analytic spaces, in the sense of Berkovich, including the recent tameness results of Hrushovski and Loeser. We also discuss interactions between the topology of nonarchimedean…
J. Milnor introduced a specific class of codimension-$1$ submanifolds in the product of projective spaces, known as Milnor manifolds. This paper establishes precise bounds on the higher topological complexity of these manifolds and provides…
We prove an upper bound on the degree complexity of Putinar's Positivstellensatz. This bound is much worse than the one obtained previously for Schm\"udgen's Positivstellensatz but it depends on the same parameters. As a consequence, we get…
Extending the investigations about the theory of duals, we analyze duals built up with the aid of discrete symmetry operators. We scrutinize algebraic and physical constraints (encompassing them in a theoretical scope) in order to verify…
Let $p$ be a branched covering of a Riemann surface to the Riemann sphere $\mathbb{P}^1$, with branching set $B \subset \mathbb{P}^1$. We define the complexity of $p$ as infinity, if $\mathbb{P}^1 \setminus B$ does not admit a hyperbolic…
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,...}$.
We give topological lower bounds on the number of periodic and closed trajectories in strictly convex smooth billiards. We use variational reduction admitting a finite group of symmetries and apply topological approach based on equivariant…
In this article, we investigate the higher topological complexity of oriented Seifert fibered manifolds that are Eilenberg--MacLane spaces $K(G,1)$ with infinite fundamental group $G$. We first refine the cohomological lower bounds for…
We study the degree of an $L$-Lipschitz map between Riemannian manifolds, proving new upper bounds and constructing new examples. For instance, if $X_k$ is the connected sum of $k$ copies of $\mathbb CP^2$ for $k \ge 4$, then we prove that…
We improve lower bounds on the $k$th-order nonlinear complexity of pseudorandom sequences over finite fields and we establish a probabilistic result on the behavior of the $k$th-order nonlinear complexity of random sequences over finite…
We derive Moore-type upper bounds for regular simplicial complexes and present logarithmic lower bounds on their diameter based on minimum degree.
Our original results refer to multivariate recurrences: discrete multitime diagonal recurrence, bivariate recurrence, trivariate recurrence, solutions tailored to particular situations, second order multivariate recurrences, characteristic…
The diameter of a strongly connected $d$-dimensional simplicial complex is the diameter of its dual graph. We provide a probabilistic proof of the existence of $d$-dimensional simplicial complexes with diameter $ (\frac{1}{d \cdot d!} -…