Topological Properties of Braid-Paths Connected 2-Simplices in Covering Spaces under Cyclic Orientations

In general, the braid structures in a topological space can be classified into algebraic forms and geometric forms. This paper investigates the properties of a braid structure involving 2-simplices and a set of directed braid-paths in view of algebraic as well as geometric topology. The 2-simplices are of the cyclically oriented variety embedded within the disjoint topological covering subspaces where the finite braid-paths are twisted as well as directed. It is shown that the generated homotopic simplicial braids form Abelian groups and the twisted braid-paths successfully admit several varieties of twisted discrete path-homotopy equivalence classes, establishing a set of simplicial fibers. Furthermore, a set of discrete-loop fundamental groups are generated in the covering spaces where the appropriate weight assignments generate multiplicative group structures under a variety of homological formal sums. Interestingly, the resulting smallest non-trivial group is not necessarily unique. The proposed variety of homological formal sum exhibits a loop absorption property if the homotopy path-products are non-commutative. It is considered that the topological covering subspaces are simply connected under embeddings with local homeomorphism maintaining generality.

Solving binary programming problems using homotopy theory ideas

PurposeThe aim of the study is to show that merging two areas of mathematics – topology and discrete optimization – could result in a viable option to solve classical or specialized integer problems.Design/methodology/approachIn the paper, discrete topology concepts are applied to propose a metaheuristic algorithm that is capable to solve binary programming problems. Particularly, some of the homotopy for paths principles are used to explore the solution space associated with four well-known NP-hard problems herein considered as follows: knapsack, set covering, bi-level single plant location with order and one-max.FindingsComputational experimentation confirms that the proposed algorithm performs in an effective manner, and it is able to efficiently solve the sets of instances used for the benchmark. Moreover, the performance of the proposed algorithm is compared with a standard genetic algorithm (GA), a scatter search (SS) method and a memetic algorithm (MA). Acceptable results are obtained for all four implemented metaheuristics, but the path homotopy algorithm stands out.Originality/valueA novel metaheuristic is proposed for the first time. It uses topology concepts to design an algorithmic framework to solve binary programming problems in an effective and efficient manner.

Interactions between Homotopy and Topological Groups in Covering (C, R) Space Embeddings

The interactions between topological covering spaces, homotopy and group structures in a fibered space exhibit an array of interesting properties. This paper proposes the formulation of finite covering space components of compact Lindelof variety in topological (C, R) spaces. The covering spaces form a Noetherian structure under topological injective embeddings. The locally path-connected components of covering spaces establish a set of finite topological groups, maintaining group homomorphism. The homeomorphic topological embedding of covering spaces and base space into a fibered non-compact topological (C, R) space generates two classes of fibers based on the location of identity elements of homomorphic groups. A compact general fiber gives rise to the discrete variety of fundamental groups in the embedded covering subspace. The path-homotopy equivalence is admitted by multiple identity fibers if, and only if, the group homomorphism is preserved in homeomorphic topological embeddings. A single identity fiber maintains the path-homotopy equivalence in the discrete fundamental group. If the fiber is an identity-rigid variety, then the fiber-restricted finite and symmetric translations within the embedded covering space successfully admits path-homotopy equivalence involving kernel. The topological projections on a component and formation of 2-simplex in fibered compact covering space embeddings generate a prime order cyclic group. Interestingly, the finite translations of the 2-simplexes in a dense covering subspace assist in determining the simple connectedness of the covering space components, and preserves cyclic group structure.

Fuzzy Fibrewise Homotopy

In this disquisition, the notion structures is introduced. The intend of this article is to study the notions of homotopy, path homotopy and fundamental group via structure which is a triplet consisting of two fuzzy topological spaces and a continuous surjection between them. Many properties concerning these concepts are provided.

On the Optimal Resolution of Inverse Kinematics for Redundant Manipulators Using a Topological Analysis

The redundancy resolution schemes based on the optimization of an integral performance index are investigated from the topological point of view. The topological notions of self-motion manifold, C-path-homotopy and extended aspect are clarified in relation to the limitations of the necessary conditions of optimality provided by calculus of variations. On one hand, they do not guarantee the achievement of the optimal solution, and on the other hand, they translate into a two-point boundary value problem (TPBVP), whose resolution, under certain circumstances, may not lead to a feasible solution at all. In response to the limitations of calculus of variations, a dynamic-programming-inspired formalism is developed, which is based on the discretization of the state space and on its representation in the form of multiple grids. Building upon the topological analysis, effective algorithms are designed that are able to find the optimal solution in any condition, across all C-path homotopy classes and self-motion manifolds, with no limitation due to the passage through singularities. Moreover, if the grids are representative of the manipulator’s extended aspects, the topological notion of the transitional point can be used to reduce the computational complexity of the optimal redundancy resolution algorithm. The results are demonstrated on a canonical 4R planar robot in two different scenarios.