Locally finite omega languages were introduced by Ressayre [Formal languages defined by the underlying structure of their words. J Symb Log 53(4):1009–1026, 1988]. These languages are defined by local sentences and extend ω-languages accepted by Büchi automata or defined by monadic second order sentences. We investigate their topological complexity. All locally finite ω-languages are analytic sets, the class LOC ω of locally finite ω-languages meets all finite levels of the Borel hierarchy and there exist some locally finite ω-languages (...) which are Borel sets of infinite rank or even analytic but non-Borel sets. This gives partial answers to questions of Simonnet (Automates et Théorie Descriptive, Ph.D. Thesis. Université Paris 7, March 1992) and of Duparc et al. [Computer science and the fine structure of Borel sets. Theor Comput Sci 257(1–2):85–105, 2001]. (shrink)

Let X be a non-reflexive Banach space such that X ∗ is separable. Let N be the set of all equivalent norms on X , equipped with the topology of uniform convergence on bounded subsets of X . We show that the subset Z of N consisting of Fréchet-differentiable norms whose dual norm is not strictly convex reduces any difference of analytic sets. It follows that Z is exactly a difference of analytic sets when N is equipped with the standard (...) Effros–Borel structure. Our main lemma elucidates the topological structure of the norm-attaining linear forms when the norm of X is locally uniformly rotund. (shrink)

The key philosophic concepts - wholeness and duality - are analyzed on the basis of general scientific and vision ideas of H. Poincaré. His cellular structure with full set of topological invariants (cycles) can be considered as a model of dual arrangement of the World. The World is seen as a multidimensional process, consisting not of parts, but of local processes, adjoining each other. It is demonstrated, that a set of cycles at each structural level not only resolve paradoxes (...) of wholeness and development, but represents a recommencing process, which reproduces its own environment. The wholeness – world is considered as a duality of flows and potentials, which arrange and produce absolutely different structures, being closely conjugated, as cycles and co-cycles within the whole. Thestreams are structured and coordinated towards decrease of structural level dimensions: from the general to the particular, from the concrete to the abstract, from the depth to the surface. This is the direction of differentiation of the whole. Potentials are coordinated in the opposite direction, with increase of dimension, through structural elements of higher dimensions. The world is gathered, integrated, joined, specified through stresses; differentiated parts tend to scatter, connections between them strain and turn them back to their whole. A penetration of the scientist into more complicated processes turns out to be a movement within a closed multidimensional surface (closed manifold), enriched with new dimensions with inclusion of new processes. Those concrete examples illustrate importance of Poincaré duality theorem for closed manifolds. (shrink)

The key philosophic concepts - wholeness and duality - are analyzed on the basis of general scientific and vision ideas of H. Poincaré. His cellular structure with full set of topological invariants (cycles) can be considered as a model of dual arrangement of the World. The World is seen as a multidimensional process, consisting not of parts, but of local processes, adjoining each other. It is demonstrated, that a set of cycles at each structural level not only resolve paradoxes (...) of wholeness and development, but represents a recommencing process, which reproduces its own environment. The wholeness – world is considered as a duality of flows and potentials, which arrange and produce absolutely different structures, being closely conjugated, as cycles and co-cycles within the whole. Thestreams are structured and coordinated towards decrease of structural level dimensions: from the general to the particular, from the concrete to the abstract, from the depth to the surface. This is the direction of differentiation of the whole. Potentials are coordinated in the opposite direction, with increase of dimension, through structural elements of higher dimensions. The world is gathered, integrated, joined, specified through stresses; differentiated parts tend to scatter, connections between them strain and turn them back to their whole. A penetration of the scientist into more complicated processes turns out to be a movement within a closed multidimensional surface (closed manifold), enriched with new dimensions with inclusion of new processes. Those concrete examples illustrate importance of Poincaré duality theorem for closed manifolds. (shrink)

Local sentences and the formal languages they define were introduced by Ressayre in. We prove that locally finite ω‐languages and effective analytic sets have the same topological complexity: the Borel and Wadge hierarchies of the class of locally finite ω‐languages are equal to the Borel and Wadge hierarchies of the class of effective analytic sets. In particular, for each non‐null recursive ordinal there exist some ‐complete and some ‐complete locally finite ω‐languages, and the supremum of the set of (...) Borel ranks of locally finite ω‐languages is the ordinal, which is strictly greater than the first non‐recursive ordinal. This gives an answer to the question of the topological complexity of locally finite ω‐languages, which was asked by Simonnet and also by Duparc, Finkel, and Ressayre in. Moreover we show that the topological complexity of a locally finite ω‐language defined by a local sentence φ may depend on the models of the Zermelo‐Fraenkel axiomatic system. Using similar constructions as in the proof of the above results we also show that the equivalence, the inclusion, and the universality problems for locally finite ω‐languages are ‐complete, hence highly undecidable. (shrink)

As one of the most important routing problems in the complex network within a very-large-scale integration circuit, bus routing has become much more challenging when witnessing the advanced technology node enters the deep nanometer era because all bus bits need to be routed with the same routing topology in the context. In particular, the nonuniform routing track configuration and obstacles bring the largest difficulty for maintaining the same topology for all bus bits. In this paper, we first present a track (...) handling technique to unify the nonuniform routing track configuration with obstacles. Then, we formulate the topology-aware single bus routing as an unsplittable flow problem, which is integrated into a negotiation-based global routing to determine the desired routing regions for each bus. A topology-aware track assignment is also presented to allocate the tracks to each segment of buses under the guidance of the global routing result. Finally, a detailed routing scheme is proposed to connect the segments of each bus. We evaluate our routing result with the benchmark suite of the 2018 CAD Contest. Compared with the top-3 state-of-the-art methods, experimental results show that our proposed algorithm achieves the best overall score regarding specified time limitations. (shrink)

A novel conceptual framework is introduced for the Complexity Levels Theory in a Categorical Ontology of Space and Time. This conceptual and formal construction is intended for ontological studies of Emergent Biosystems, Super-complex Dynamics, Evolution and Human Consciousness. A claim is defended concerning the universal representation of an item’s essence in categorical terms. As an essential example, relational structures of living organisms are well represented by applying the important categorical concept of natural transformations to biomolecular reactions and relational structures (...) that emerge from the latter in living systems. Thus, several relational theories of living systems can be represented by natural transformations of organismic, relational structures. The ascent of man and other living organisms through adaptation, is viewed in novel categorical terms, such as variable biogroupoid representations of evolving species. Such precise but flexible evolutionary concepts will allow the further development of the unifying theme of local-to-global approaches to highly complex systems in order to represent novel patterns of relations that emerge in super- and ultra-complex systems in terms of compositions of local procedures. Solutions to such local-to-global problems in highly complex systems with ‘broken symmetry’ might be possible to be reached with the help of higher homotopy theorems in algebraic topology such as the generalized van Kampen theorems (HHvKT). Categories of many-valued, Łukasiewicz-Moisil (LM) logic algebras provide useful concepts for representing the intrinsic dynamic ‘asymmetry’ of genetic networks in organismic development and evolution, as well as to derive novel results for (non-commutative) Quantum Logics. Furthermore, as recently pointed out by Baianu and Poli (Theory and applications of ontology, vol 1. Springer, Berlin, in press), LM-logic algebras may also provide the appropriate framework for future developments of the ontological theory of levels with its complex/entangled/intertwined ramifications in psychology, sociology and ecology. As shown in the preceding two papers in this issue, a paradigm shift towards non-commutative, or non-Abelian, theories of highly complex dynamics—which is presently unfolding in physics, mathematics, life and cognitive sciences—may be implemented through realizations of higher dimensional algebras in neurosciences and psychology, as well as in human genomics, bioinformatics and interactomics. (shrink)

A novel conceptual framework is introduced for the Complexity Levels Theory in a Categorical Ontology of Space and Time. This conceptual and formal construction is intended for ontological studies of Emergent Biosystems, Super-complex Dynamics, Evolution and Human Consciousness. A claim is defended concerning the universal representation of an item’s essence in categorical terms. As an essential example, relational structures of living organisms are well represented by applying the important categorical concept of natural transformations to biomolecular reactions and relational structures (...) that emerge from the latter in living systems. Thus, several relational theories of living systems can be represented by natural transformations of organismic, relational structures. The ascent of man and other living organisms through adaptation, is viewed in novel categorical terms, such as variable biogroupoid representations of evolving species. Such precise but flexible evolutionary concepts will allow the further development of the unifying theme of local-to-global approaches to highly complex systems in order to represent novel patterns of relations that emerge in super- and ultra-complex systems in terms of compositions of local procedures. Solutions to such local-to-global problems in highly complex systems with ‘broken symmetry’ might be possible to be reached with the help of higher homotopy theorems in algebraic topology such as the generalized van Kampen theorems (HHvKT). Categories of many-valued, Łukasiewicz-Moisil (LM) logic algebras provide useful concepts for representing the intrinsic dynamic ‘asymmetry’ of genetic networks in organismic development and evolution, as well as to derive novel results for (non-commutative) Quantum Logics. Furthermore, as recently pointed out by Baianu and Poli (Theory and applications of ontology, vol 1. Springer, Berlin, in press), LM-logic algebras may also provide the appropriate framework for future developments of the ontological theory of levels with its complex/entangled/intertwined ramifications in psychology, sociology and ecology. As shown in the preceding two papers in this issue, a paradigm shift towards non-commutative, or non-Abelian, theories of highly complex dynamics—which is presently unfolding in physics, mathematics, life and cognitive sciences—may be implemented through realizations of higher dimensional algebras in neurosciences and psychology, as well as in human genomics, bioinformatics and interactomics. (shrink)

A chemical compound in the form of graph terminology is known as a chemical graph. Molecules are usually represented as vertices, while their bonding or interaction is shown by edges in a molecular graph. In this paper, we computed various connectivity indices based on degrees of vertices of a chemical graph of indium phosphide. Afterward, we found the physical measures like entropy and heat of formation of InP. Then, we fitted curves between different indices and the thermodynamical properties, namely, heat (...) of formation and entropy. Curve fitting was done in MATLAB through different methods based on linearity and nonlinearity. Furthermore, we depicted our results numerically and graphically. These numerical systems may give an approach to concentrate on the thermodynamical properties of the compound design of InP at an exceptional level that will help understand the connection between framework measurement and these actions. (shrink)

In order to establish patterns of materialization of the beliefs we are going to consider that these have defined mathematical structures. It will allow us to understand better processes of the textual, architectonic, normative, educative, etc., materialization of an ideology. The materialization is the conversion by means of certain mathematical correspondences, of an abstract set whose elements are beliefs or ideas, in an impure set whose elements are material or energetic. Text is a materialization of ideology and it is any (...) representation of the Reality represented by symbolic means. In all text T we can observe diverse topological structures: Metric Textual Space, Textual Topology and a Textual Lattice. (shrink)

In the last 20 years or so, since the publication of a seminal paper by Watts and Strogatz :440–442, 1998), an interest in topological explanations has spread like a wild fire over many areas of science, e.g. ecology, evolutionary biology, medicine, and cognitive neuroscience. The topological approach is still very young by all standards, and even within special sciences it still doesn’t have a single methodological programme that is applicable across all areas of science. That is why this (...) special issue is important as a first systematic philosophical study of topological explanations and their relation to a well understood and widespread explanatory strategy, such as mechanistic one. (shrink)

The idea that intelligence is embedded not only in a single brain network, but instead in a complex, well-optimized system of complementary networks, has led to the development of whole brain network analysis. Using graph theory to analyze resting-state functional MRI data, we investigated the brain graph networks (or brain networks) of high intelligence quotient (HIQ) children. To this end, we computed the “hub disruption index κ”, an index sensitive to graph network modifications. We found significant topological differences in (...) the integration and segregation properties of brain networks in HIQ compared to standard IQ children, not only for the whole brain graph, but also for each hemispheric graph, and for the homotopic connectivity. Moreover, two profiles of HIQ children, homogenous and heterogeneous, based on the differences between the two main IQ subscales (verbal comprehension index (VCI) and perceptual reasoning index (PRI)), were compared. Brain networks changes were more pronounced in the heterogeneous HIQ than in the homogeneous HIQ subgroups. Finally, we found significant correlations between the graph networks’ changes and the full-scale IQ (FSIQ), as well as the subscales VCI and PRI. Specifically, the higher the FSIQ the greater was the brain organization modification in the whole brain, the left hemisphere, and the homotopic connectivity. These results shed new light on the relation between functional connectivity topology and high intelligence, as well as on different intelligence profiles. (shrink)

The topology optimization of computer communication network is studied based on improved genetic algorithm, a network optimization design model based on the establishment of network reliability maximization under given cost constraints, and the corresponding improved GA is proposed. In this method, the corresponding computer communication network cost model and computer communication network reliability model are established through a specific project, and the genetic intelligence algorithm is used to solve the cost model and computer communication network reliability model, respectively. It has (...) been proved that GA can solve the complex problems of computer working environment better, which is 80% higher than the general algorithm, and can select the optimal scheme pertinently. (shrink)

This book examines and explores Jacques Lacan's controversial topologisation of psychoanalysis, and seeks to persuade the reader that this enterprise was necessary and important. In providing both an introduction to a fundamental component of Lacan's theories, as well as readings of texts that have been largely ignored, it provides a thorough critical interpretation of his work. Will Greenshields argues that Lacan achieved his most pedagogically clear and successful presentations of his most essential and notoriously complex concepts - such as structure, (...) the subject and the real - through the deployment of topology. The book will help readers to better understand Lacan, and also those concepts that have become prevalent in various intellectual discourses such as contemporary continental philosophy, politics and the study of ideology, and literary or cultural criticism. (shrink)

It is universally accepted that genetic control over basic aspects of cell and molecular biology is the primary organizing principle in development and homeostasis of living systems. However, instances do exist where important aspects of biological order arise without explicit genetic instruction, emerging instead from simple physical principles, stochastic processes, or the complex self‐organizing interaction between random and seemingly unrelated parts. Being mostly resistant to direct genetic dissection, the analysis of such emergent processes falls into a grey area between mathematics, (...) physics and molecular cell biology and therefore remains very poorly understood. We recently proposed a mathematical model predicting the emergence of a specific non‐Gaussian distribution of polygonal cell shapes from the stochastic cell division process in epithelial cell sheets; this cell shape distribution appears to be conserved across a diverse set of animals and plants.1 The use of such topological models to study the process of cellular morphogenesis has a long history, starting almost a century ago, and many insights from those original works influence current experimental studies. Here we review current and past literature on this topic while exploring some new ideas on the origins and implications of topological order in proliferating epithelia. BioEssays 30:260–266, 2008. © 2008 Wiley Periodicals, Inc. (shrink)

We continue work of our earlier paper :219–241, 2009) where abstract logics and particularly intuitionistic abstract logics are studied.logics can be topologized in a direct and natural way. This facilitates a topological study of classes of concrete logics whenever they are given in abstract form. Moreover, such a direct topological approach avoids the often complex algebraic and lattice-theoretic machinery usually applied to represent logics. Motivated by that point of view, we define in this paper the category of intuitionistic (...) abstract logics with stable logic maps as morphisms, and the category of implicative spectral spaces with spectral maps as morphisms. We show the equivalence of these categories and conclude that the larger categories of distributive abstract logics and distributive sober spaces are equivalent, too. (shrink)

This paper is an investigation of definability hierarchies on effective topological spaces. An open subset U of an effective space X is definable iff there is a parameter free definition φ of U so that the atomic predicate symbols of φ are recursively open relations on X . The complexity of a definable open set may be identified with the quantifier complexity of its definition. For example, a set U is an ∃∃∀∃-set if it has an ∃∃∀∃ (...) parameter free definition using only recursively open predicate symbols. Since X is not equipped with a natural pairing apparatus such a U need not be an ∃∀∃-set. Let Σ denote the class of all ∃-sets, ∃∃-sets, ∃∃∃-sets etc. We show that an open set is in Σ iff it is equivalent modulo a nowhere dense set to a recursively enumerable open set . Thus Σ = e.r.e. Indeed we show the existence of a universal Σ -set as well as the existence of universal sets for higher levels of the definability hierarchy. (shrink)

In this paper we introduce the notion of a first order topological structure, and consider various possible conditions on the complexity of the definable sets in such a structure, drawing several consequences thereof.Our aim is to develop, for a restricted class of unstable theories, results analogous to those for stable theories. The “material basis” for such an endeavor is the analogy between the field of real numbers and the field of complex numbers, the former being a “nicely behaved” (...) unstable structure and the latter the archetypal stable structure. In this sense we try here to situate our work ono-minimal structures [PS] in a general topological context. Note, however, that thep-adic numbers, and structures definable therein, will also fit into our analysis.In the remainder of this section we discuss several ways of studying topological structures model-theoretically. Eventually we fix on the notion of a structure in which the topology is “explicitly definable” in the sense of Flum and Ziegler [FZ]. In §2 we introduce the hypothesis that every definable set is a Boolean combination of definable open sets. In §3 we introduce a “dimension rank” on definable sets. In §4 we consider structures on which this rank is defined, and for which also every definable set has a finite number of definably connected definable components. We show that prime models over sets exist under such conditions. (shrink)

We prove that, for each countable ordinal ξ≥1, there exist some -complete ω-powers, and some -complete ω-powers, extending previous works on the topological complexity of ω-powers [O. Finkel, Topological properties of omega context free languages, Theoretical Computer Science 262 669–697; O. Finkel, Borel hierarchy and omega context free languages, Theoretical Computer Science 290 1385–1405; O. Finkel, An omega-power of a finitary language which is a borel set of infinite rank, Fundamenta informaticae 62 333–342; D. Lecomte, Sur les (...) ensembles de phrases infinies constructibles a partir d’un dictionnaire sur un alphabet fini, Séminaire d’Initiation a l’Analyse, 1, année 2001–2002; D. Lecomte, Omega-powers and descriptive set theory, Journal of Symbolic Logic 70 1210–1232; J. Duparc, O. Finkel, An ω-Power of a Context-Free Language Which Is Borel Above , in: S. Bold, B. Löwe, T. Räsch, J. van Benthem , in the Proceedings of the international conference foundations of the formal sciences V : Infinite Games, November 26th to 29th, 2004, Bonn, Germany, in: Studies in Logic, vol. 11, College Publications at King’s College, 2007, pp. 109–122]. We prove effective versions of these results; in particular, for each recursive ordinal there exist some recursive sets A2<ω such that , where and denote classes of the hyperarithmetical hierarchy. To do this, we prove effective versions of a result by Kuratowski, describing a set as the range of a closed subset of the Baire space ωω by a continuous bijection. This leads us to prove closure properties for the pointclasses in arbitrary recursively presented Polish spaces. We apply our existence results to get better computations of the topological complexity of some sets of dictionaries considered in [D. Lecomte, Omega-powers and descriptive set theory, Journal of Symbolic Logic 70 1210–1232]. (shrink)

The basic concept of Type-2 Theory of Effectivity to define computability on topological spaces or limit spaces are representations, i. e. surjection functions from the Baire space onto X. Representations having the topological property of admissibility are known to provide a reasonable computability theory. In this article, we investigate several additional properties of representations which guarantee that such representations induce a reasonable Type-2 Complexity Theory on the represented spaces. For each of these properties, we give a nice (...) characterization of the class of spaces that are equipped with a representation having the respective property. (shrink)

The basic methodology of rough set theory depends on an equivalence relation induced from the generated partition by the classification of objects. However, the requirements of the equivalence relation restrict the field of applications of this philosophy. To begin, we describe two kinds of closure operators that are based on right and left adhesion neighbourhoods by any binary relation. Furthermore, we illustrate that the suggested techniques are an extension of previous methods that are already available in the literature. As a (...) result of these topological techniques, we propose extended rough sets as an extension of Pawlak’s models. We offer a novel topological strategy for making a topological reduction of an information system for COVID-19 based on these techniques. We provide this medical application to highlight the importance of the offered methodologies in the decision-making process to discover the important component for coronavirus infection. Furthermore, the findings obtained are congruent with those of the World Health Organization. Finally, we create an algorithm to implement the recommended ways in decision-making. (shrink)

In this paper, we purposed further study on rough functions and introduced some concepts based on it. We introduced and investigated the concepts of topological lower and upper approximations of near-open sets and studied their basic properties. We defined and studied new topological neighborhood approach of rough functions. We generalized rough functions to topological rough continuous functions by different topological structures. In addition, topological approximations of a function as a relation were defined and studied. Finally, (...) we applied our approach of rough functions in finding the images of patient classification data using rough continuous functions. (shrink)

In this paper, an in-depth study of interactive visual communication of network topology through non-line-of-sight congestion control algorithms is conducted to address the real-time routing problem of adapting to dynamic topologies, and a delay-constrained stochastic routing algorithm is proposed to enable packets to reach GB within the delay threshold in the absence of end-to-end delay information while improving network throughput and reducing network resource consumption. The algorithm requires each sending node to select an available relay set based on the location (...) of its neighbor nodes and channel state and computes transfer probabilities for each node in the relay set combining the remaining delay of the packet with the distance from the relay node to GB. Based on the obtained transfer probability and local channel state, the sending node passes the packet to the relay node. The convergence of the algorithm is proved and its performance is verified by simulation. The first part of the algorithm is based on the greedy algorithm to deploy and locate the network flying platform nodes with the goal of efficient coverage of the network flying platform nodes, considering the ground base station services. As the delay on each link varies due to the change of channel state, the source and relay nodes asynchronously update the data generation rate and the pairwise parameters based on the received local information and use the obtained optimal values to pass the packets to GB. (shrink)

Theory of networks serves as a mathematical foundation for the construction and modeling of chemical structures and complicated networks. In particular, chemical networking theory has a wide range of utilizations in the study of chemical structures, where examination and manipulation of chemical structural information are made feasible by utilizing the numerical graph invariants. A network invariant or a topological index is a numerical measure of a chemical compound which is capable to describe the chemical structural properties such as melting (...) point, freezing point, density, pressure, tension, and temperature of chemical compounds. Wiener initiated the first distance-based TI which is considered to be the most important TI to preserve the chemical and physical properties of chemical structures. Later on, degree-based TI was introduced to find the π -electron energy of molecules. Recently, connection number-based TIs are studied which are more efficient than degree and distance-based TIs. In this paper, we compute the connection number-based TIs of the structure of crystal cubic carbons which are one of the most significant and interesting composites in modern resources of science due to the involvement of carbon atoms. (shrink)

This thesis is devoted to the exploration of the complexity of some mathematical problems using the framework of computable analysis and descriptive set theory. We will especially focus on Weihrauch reducibility as a means to compare the uniform computational strength of problems. After a short introduction of the relevant background notions, we investigate the uniform computational content of problems arising from theorems that lie at the higher levels of the reverse mathematics hierarchy.We first analyze the strength of the open (...) and clopen Ramsey theorems. Since there is not a canonical way to phrase these theorems as multi-valued functions, we identify eight different multi-valued functions and study their degree from the point of view of Weihrauch, strong Weihrauch, and arithmetic Weihrauch reducibility.We then discuss some new operators on multi-valued functions and study their algebraic properties and the relations with other previously studied operators on problems. In particular, we study the first-order part and the deterministic part of a problem f, capturing the Weihrauch degree of the strongest multi-valued problem that is reducible to f and that, respectively, has codomain $\mathbb {N}$ or is single-valued.These notions proved to be extremely useful when exploring the Weihrauch degree of the problem $\mathsf {DS}$ of computing descending sequences in ill-founded linear orders. They allow us to show that $\mathsf {DS}$, and the Weihrauch equivalent problem $\mathsf {BS}$ of finding bad sequences through non-well quasi-orders, while being very “hard” to solve, are rather weak in terms of uniform computational strength. We then generalize $\mathsf {DS}$ and $\mathsf {BS}$ by considering $\boldsymbol {\Gamma }$ -presented orders, where $\boldsymbol {\Gamma }$ is a Borel pointclass or $\boldsymbol {\Delta }^1_1$, $\boldsymbol {\Sigma }^1_1$, $\boldsymbol {\Pi }^1_1$. We study the obtained $\mathsf {DS}$ -hierarchy and $\mathsf {BS}$ -hierarchy of problems in comparison with the Baire hierarchy and show that they do not collapse at any finite level.Finally, we work in the context of geometric measure theory and we focus on the characterization, from the point of view of descriptive set theory, of some conditions involving the notions of Hausdorff/Fourier dimension and Salem sets. We first work in the hyperspace $\mathbf {K}$ of compact subsets of $[0,1]$ and show that the closed Salem sets form a $\boldsymbol {\Pi }^0_3$ -complete family. This is done by characterizing the complexity of the family of sets having sufficiently large Hausdorff or Fourier dimension. We also show that the complexity does not change if we increase the dimension of the ambient space and work in $\mathbf {K}$. We also generalize the results by relaxing the compactness of the ambient space and show that the closed Salem sets are still $\boldsymbol {\Pi }^0_3$ -complete when we endow $\mathbf {F}$ with the Fell topology. A similar result holds also for the Vietoris topology.We conclude by analyzing the same notions from the point of view of effective descriptive set theory and Type-2 Theory of Effectivity, and show that the complexities remain the same also in the lightface case. In particular, we show that the family of all the closed Salem sets is $\Pi ^0_3$ -complete. We furthermore characterize the Weihrauch degree of the functions computing Hausdorff and Fourier dimension of closed sets.prepared by Manlio Valenti.E-mail:[email protected]. (shrink)

The epistemological foundation of unity of knowledge is used to formulate a system-model of participatory socioeconomic development. The micro-properties of such a participatory development approach are deeply ethical in nature. In order to bring out the endogenous role of ethics derived from the moral law in reference to the epistemic foundation, and thereby explain their impact on the socioeconomic development experience, the methods of topological space and topological mappings are found to be appropriate for formalizing the complex nature (...) of participatory dynamics. They emerge in the midst of institutional and organic interaction, integration, and evolution. The application of topological methods to participatory socioeconomic development thus opens up a field that is rarely used by mathematical economists. In this sense this article is an original contribution to the area of ethical development theory and its topological explanation and application. (shrink)

definitions and explanations frequently come together and permeate almost all fields of knowledge. This does not exclude mathematics, even when these definitions hold clear links and close connections with our physical world. Here we propose a rather different perspective. Making operational physical assumptions, we show how it is possible to rigorously reconstruct some features of both geometry and topology. Broadly speaking, assuming this operational and more concrete philosophy we not only are capable of defining primitive concepts like points, straight lines, (...) planes, angles and spaces, but we also go all the way up to more complex constructions. We show that within our method it is also possible to come up with what we call a compass-based topology as well as a normed and a metric space. We hope this operationalist point-of-view can assist other researchers and students to have a clearer understanding of these quite abstract concepts. (shrink)

The primary objective of this study was to propose a functional discrete mathematical model for analyzing folklore fairy tales. Within this model, characters are denoted as vertices, and explicit instances of communication – both verbal and non-verbal – within the text are depicted as edges. Upon examining a corpus of Eastern Slavic fairy tales in comparison to Chukchi fairy tales, unforeseen outcomes emerged. Notably, the constructed models seem to evade establishing certain connections between characters. Consequently, instances where the interactions among (...) fairy tale characters would result in a non-planar graph structure are notably absent. To put it differently, the models refrain from incorporating sub-graphs delineated by the Kuratowski theorem governing planar graphs, specifically the minimal non-planar graphs Κ5 and Κ3,3. Remarkably, even in more extensive texts featuring a larger cast of characters, connections that would yield a non-planar graph pattern are consistently avoided. This leads to the formulation of a hypothesis positing that traditional folk tales adhere to a “planar narrative” design – an identifiable narrative variant characterized by inherent limitations in complexity. This design, in turn, appears deeply entrenched within the societal framework of the cultures that produced these folk narratives. (shrink)

Topological indices are quantitative measurements that describe a molecule’s topology and are quantified from the molecule’s graphical representation. The significance of topological indices is linked to their use in QSPR/QSAR modelling as descriptors. Mathematical associations between a particular molecular or biological activity and one or several biochemical and/or molecular structural features are QSPRs and QSARs. In this paper, we give explicit expressions of two recently defined novel ev-degree- and ve-degree-based topological indices of two classes of benzenoid, namely, (...) linear hexagonal chain and hammer-like benzenoid. (shrink)

This study has two aims. First, it lays out the synchronic patterning of four constructions that express static location in Secoya (Tukanoan). Each construction licenses different semantic verb types: topological verbs, postural verbs, an existential verb, and a copula. Second, this study explores the different construals encoded by these constructions and highlights the ways speakers use them creatively to elaborate on stage-level properties adjacent to location in locative utterances. Data collected from six speakers using visual stimuli reveal that each (...) of the constructions elaborates on specific aspects of locative scenes. Responses for typical/atypical scenes, negative polarity statements, and frequency patterns show that speakers can choose conceptualizations that favor Ground geometry, Figure posture, more complex Figure dispositions, or marked perspectivizations. Similar phenomena are observed in other Amazonian languages. These results raise difficulties in identifying a basic locative construction, suggesting that Secoya may not fit squarely into any type in existing typologies of spatial expression (e.g., Ameka and Levinson 2007). Additionally, the Secoya system raises questions about the relationship between conceptual alternativity and the notion of “basicness” with respect to construal types. (shrink)

By creating an unbounded topological reduction theory for complex Hilbert spaces over Stonean spaces, we can give a category-theoretic duality between Boolean valued analysis and topological reduction theory for complex Hilbert spaces. MSC: 03C90, 03E40, 06E15, 46M99.

This article addresses complexity by selecting some of its key aspects that share a common feature: the power to change. They seem to change not only the way the world is approached by scientists, but also the way this approach, the resulting perspectives and their multiple relationships, are interpreted. These main aspects are: the challenge of measurability, with an unexpected result that escapes the gravitational field of the measurability problem; the meaning of reproducibility and the redrawn boundaries of scientific (...) inquiry, with implications for the social sciences; the altered expectations concerning prediction, which seem to break with a glorious tradition of unquestioned technological success; and the discovery of all-embracing patterns of events that unavoidably include large events, possibly perceived as ‘crises’, which one may hope to understand and confront, rather than rule out. The resulting geography, with its new landmarks, new relationships among its elements and new means of orientation, is expected to reach the public sooner or later, even if the effect – according to complexity theory itself – cannot be foreseen in detail. All these fibres of change are considered in the context of a fresh meaning of time and of a topology dominated by network concepts. (shrink)

Effective inseparability of pairs of sets is an important notion in logic and computer science. We study the effective inseparability of sets which appear as index sets of subsets of an effectively given topological T0-space and discuss its consequences. It is shown that for two disjoint subsets X and Y of the space one can effectively find a witness that the index set of X cannot be separated from the index set of Y by a recursively enumerable set, if (...) X intersects the topological closure of an effectively enumerable subset of Y. As a consequence of a more general parametric inseparability result a theorem of Rice-Shapiro type is obtained. Moreover, under some additional requirements it follows that nonopen subsets have productive index sets. This implies a generalized Rice theorem: Connected spaces have only trivial completely recursive subsets. As application some decision problems in computable analysis and domain theory are studied. It follows that the complement of the halting problem can be reduced to the problem to decide of a number whether it is a computable irrational. The same is true for the problems to decide whether two numbers are equal, whether one is not greater than the other, and whether a number is equal to a given number. In the case of an effectively given continuous complete partial order the complexity of the last problem depends on whether the given element is the smallest element, in which case the complement of the halting problem is reducible to it, whether it is a base element and maximal, then the decision problem is recursively isomorphic to the halting problem, or whether it is none of these. In this case, both the halting problem and its complement are reducible to the problem. The same is true in nontrivial cases for the problems whether an element belongs to the basis, whether two elements of the partial order are equal, or whether one approximates the other. In general, for any nonempty proper subset of the partial order either the halting problem or its complement can be reduced to the membership problem of the subset. (shrink)

All the typical global quantum mechanical observables are complex relative phases obtained by interference phenomena. They are described by means of some global geometric phase factor, which is thought of as the “memory” of a quantum system undergoing a “cyclic evolution” after coming back to its original physical state. The origin of a geometric phase factor can be traced to the local phase invariance of the transition probability assignment in quantum mechanics. Beyond this invariance, transition probabilities also remain invariant under (...) the operation of complex conjugation. Most important, geometric phase factors distinguish between unitary and antiunitary transformations in terms of complex conjugation. These two types of invariance functions as an anchor point to investigate the role of loops and based loops in the state space of a quantum system as well as their links and interrelations. We show that arbitrary transition probabilities can be calculated using projective invariants of loops in the space of rays. The case of the double slit experiment serves as a model for this purpose. We also represent the action of one-parameter unitary groups in terms of oppositely oriented-based loops at a fixed ray. In this context, we explain the relation among observables, local Boolean frames of projectors, and one-parameter unitary groups. Next, we exploit the non-commutative group structure of oriented-based loops in 3-d space and demonstrate that it carries the topological semantics of a Borromean link. Finally, we prove that there exists a representation of this group structure in terms of one-parameter unitary groups that realizes the topological linking properties of the Borromean link. (shrink)

Coevolution between two antagonistic species has been widely studied theoretically for both ecologically- and genetically-driven Red Queen dynamics. A typical outcome of these systems is an oscillatory behavior causing an endless series of one species adaptation and others counter-adaptation. More recently, a mathematical model combining a three-species food chain system with an adaptive dynamics approach revealed genetically driven chaotic Red Queen coevolution. In the present article, we analyze this mathematical model mainly focusing on the impact of species rates of evolution (...) (mutation rates) in the dynamics. Firstly, we analytically proof the boundedness of the trajectories of the chaotic attractor. The complexity of the coupling between the dynamical variables is quantified using observability indices. By using symbolic dynamics theory, we quantify the complexity of genetically driven Red Queen chaos computing the topological entropy of existing one-dimensional iterated maps using Markov partitions. Co-dimensional two bifurcation diagrams are also built from the period ordering of the orbits of the maps. Then, we study the predictability of the Red Queen chaos, found in narrow regions of mutation rates. To extend the previous analyses, we also computed the likeliness of finding chaos in a given region of the parameter space varying other model parameters simultaneously. Such analyses allowed us to compute a mean predictability measure for the system in the explored region of the parameter space. We found that genetically driven Red Queen chaos, although being restricted to small regions of the analyzed parameter space, might be highly unpredictable. (shrink)