Related papers: Certain topological methods for computing digital …
Most complex systems can be captured by graphs or networks. Networks connect nodes (e.g.\ neurons) through edges (synapses), thus summarizing the system's structure. A popular way of interrogating graphs is community detection, which…
Through careful analysis of an argument of Brooke-Taylor and Rosicky, we show that the powerful image of any accessible functor is closed under colimits of $\kappa$-chains, $\kappa$ a sufficiently large almost measurable cardinal. This…
The paper refers to several concepts which are essential to studying digital objects from the viewpoint of digital topology: digital $k$-connectivity or digital $k$-adjacency, $C$-compatible and normal $k$-adjacency for a digital product.…
Topological order in strongly correlated systems, including quantum spin liquids, quantum Hall states in lattices and topological superconductivity is treated. Various metallic non-Fermi-liquid states are discussed, including fractionalized…
In our thesis, we try to shed more light onto the complexity of quantum complexity classes by refining the related part of the hierarchy. First, we review the basic concepts of quantum computing in general. Then, inspired by BQP, we define…
We survey the application of a relatively new branch of statistical physics--"community detection"-- to data mining. In particular, we focus on the diagnosis of materials and automated image segmentation. Community detection describes the…
I briefly discuss a method of obtaining distinct classes of topologically equivalent knots by developing appropriate computer programs.
Several approaches and corresponding definitions of complexity have been developed in different fields. Urban systems are the archetype of complex socio-technical systems concerned with these different viewpoints. We suggest in this chapter…
In 2010, M. Sakai and the first author showed that the topological complexity of a space $X$ coincides with the fibrewise unpointed L-S category of a pointed fibrewise space $\operatorname{pr}_{1} : X \times X \to X$ with the diagonal map…
A central issue of the science of complex systems is the quantitative characterization of complexity. In the present work we address this issue by resorting to information geometry. Actually we propose a constructive way to associate to a -…
A duality of $\kappa$-normed topological vector spaces is defined and investigated. For such spaces the analog of the Mackey-Arens theorem is proved. There are investigated cases, when $\kappa$-normability of a topological vector space…
This paper provides an overview of modern digital geometry and topology through mathematical principles, algorithms, and measurements. It also covers recent developments in the applications of digital geometry and topology including image…
Methods from statistical physics, such as those involving complex networks, have been increasingly used in quantitative analysis of linguistic phenomena. In this paper, we represented pieces of text with different levels of simplification…
The concept of relative sectional category expands upon classical sectional category theory by incorporating the pullback of a fibration along a map. Our paper aims not only to explore this extension but also to thoroughly investigate its…
In this paper, we study the Lusternik-Schnirelmann category of a simplicial map between simplicial complexes, generalizing the simplicial category of a complex to that of a map. Several properties of this new invariant are shown, including…
Topological data analysis (TDA) is a rising branch in modern applied mathematics. It extracts topological structures as features of a given space and uses these features to analyze digital data. Persistent homology, one of the central tools…
Real data is often given as a point cloud, i.e. a finite set of points with pairwise distances between them. An important problem is to detect the topological shape of data --- for example, to approximate a point cloud by a low-dimensional…
We investigate topological realizations of higher-rank graphs. We show that the fundamental group of a higher-rank graph coincides with the fundamental group of its topological realization. We also show that topological realization of…
The topological complexity TC(X) is a numerical homotopy invariant of a topological space X which is motivated by robotics and is similar in spirit to the classical Lusternik-Schnirelmann category of X. Given a mechanical system with…
We note that, for any natural $k$ and every natural $l$ between $k$ and $2k$, there exists a group $\pi$ with $\cat K(\pi,1)=k$ and $\TC(K(\pi,1))=l$. Because of this, we can set up a problem of searching of purely group-theoretical…