Related papers: Topological Complexity of omega-Powers : Extended …
The aim of this text is to provide a linguistically accessible, but comprehensive introduction into a variety of topics in dynamical systems and its applications. Whilst preliminary knowledge of dynamical systems is useful, it is not…
In this paper, we find a power series expansion of the invariant differential $\omega_E$ of an elliptic curve $E$ defined over $\mathbb{Q}$, where $E$ is described by certain families of Weierstrass equations. In addition, we introduce…
These informal notes, initially prepared a few years ago, look at various questions related to infinite processes in several parts of mathematics, with emphasis on examples.
This is a survey of known algorithms in algebraic topology with a focus on finite simplicial complexes and, in particular, simplicial manifolds. Wherever possible an elementary approach is chosen. This way the text may also serve as a…
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 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,...}$.
: Algebraic properties of orbifold models on arbitrary Riemann surfaces are investigated. The action of mapping class group transformations and of standard geometric operations is given explicitly. An infinite dimensional extension of the…
The utilization of statistical methods an their applications within the new field of study known as Topological Data Analysis has has tremendous potential for broadening our exploration and understanding of complex, high-dimensional data…
Maslov's class $\overline{\text{K}}$ is an expressive fragment of First-Order Logic known to have decidable satisfiability problem, whose exact complexity, however, has not been established so far. We show that $\overline{\text{K}}$ has the…
A didactical survey of the foundations of Algorithmic Information Theory. These notes are short on motivation, history and background but introduce some of the main techniques and concepts of the field. The "manuscript" has been evolving…
We perform a refined complexity-theoretic analysis of three classical problems in the context of Hierarchical Task Network Planning: the verification of a provided plan, whether an executable plan exists, and whether a given state can be…
A classical result in descriptive complexity theory states that Datalog expresses exactly the class of polynomially computable queries on ordered databases. In this paper we extend this result to the case of higher-order Datalog. In…
Let omega be the first infinite ordinal (or the set of all natural numbers) with the usual order <. In section 1 we show that, assuming the consistency of a supercompact cardinal, there may exist an ultrapower of omega, whose cardinality is…
Let \Omega be a bounded, weakly convex domain in C^n, n>1, having real-analytic boundary. A(\Omega) is the algebra of all functions holomorphic in \Omega and continuous upto the boundary. A submanifold M\subset \partial\Omega is said to be…
We introduce and study several notions of computability-theoretic reducibility between subsets of $\omega$ that are "robust" in the sense that if only partial information is available about the oracle, then partial information can be…
Information entropy is applied to the analysis of time series generated by dynamical systems. Complexity of a temporal or spatio-temporal signal is defined as the difference between the sum of entropies of the local linear regions of the…
In these expository notes we draw together and develop the ideas behind some recent progress in two directions: the treatment of finite type partial differential operators by prolongation, and a class of differential complexes known as…
In this work, we Extend Pawlak approximation spaces by topological spaces. Also, Rough Membership, equality and inclusion relations are extended using topological near open sets. In addition, new extended measures of accuracy and quality of…
In this paper we extend recent results of Fiorini et al. on the extension complexity of the cut polytope and related polyhedra. We first describe a lifting argument to show exponential extension complexity for a number of NP-complete…
We discuss ways in which tools from topology can be used to derive lower bounds for the circuit complexity of Boolean functions.