Fixed points and graph images for minimal maps on the once punctured torus

A fixed point detection theorem for a family of maps defined on the once punctured torus is proved. As a consequence, we produce an example of a homotopy class [f] of self-maps on the once punctured torus that illustrates the following: (i) there is a map in the homotopy class that has no fixed points, and (ii) if the image of f lies in a 1-complex that embeds as a homotopy equivalence, then f must have a fixed point.     

On homotopy groups of quandle spaces and the quandle homotopy invariant of links

For a quandle X, the quandle space BX is defined, modifying the rack space of Fenn, Rourke and Sanderson (1995) [13], and the quandle homotopy invariant of links is defined in Z[π₂(BX)], modifying the rack homotopy invariant of Fenn, Rourke and Sanderson (1995) [13]. It is known that the cocycle invariants introduced in Carter et al. (2005) [3], Carter et al. (2003) [5], Carter et al. (2001) [6] can be derived from the quandle homotopy invariant.In this paper, we show that, for a finite quandle X, π₂(BX) is finitely generated, and that, for a connected finite quandle X, π₂(BX) is finite. It follows that the space spanned by cocycle invariants for a finite quandle is finitely generated. Further, we calculate π₂(BX) for some concrete quandles. From the calculation, all cocycle invariants for those quandles are concretely presented. Moreover, we show formulas of the quandle homotopy invariant for connected sum of knots and for the mirror image of links.     

Global and bifurcation analysis of a structure with cyclic symmetry

This article combines the application of a global analysis approach and the more classical continuation, bifurcation and stability analysis approach of a cyclic symmetric system. A solid disc with four blades, linearly coupled, but with an intrinsic non-linear cubic stiffness is at stake. Dynamic equations are turned into a set of non-linear algebraic equations using the harmonic balance method. Then periodic solutions are sought using a recursive application of a global analysis method for various pulsation values. This exhibits disconnected branches in both the free undamped case (non-linear normal modes, NNMs) and in a forced case which shows the link between NNMs and forced response. For each case, a full bifurcation diagram is provided and commented using tools devoted to continuation, bifurcation and stability analysis.     

Solitary Solution of Discrete mKdV Equation by Homotopy Analysis Method

In this paper, we apply homotopy analysis method to solve discrete mKdV equation and successfully obtain the bell-shaped solitary solution to mKdV equation. Comparison between our solution and the exact solution shows that homotopy analysis method is effective and validity in solving hybrid nonlinear problems, including solitary solution of difference-differential equation.     

On Producing Multiple Solutions Using Repeated Trials

The number of trials that is required by an algorithm to produce a given fraction of the problem solutions with a specified level of confidence is analyzed. The analysis indicates that the number of trials required to find a large fraction of the solutions rapidly decreases as the number of solutions obtained on each trial by an algorithm increases. In applications where multiple solutions are sought, this decrease in the number of trials could potentially offset the additional computational cost of algorithms that produce multiple solutions on a single trial. The analysis framework presented is used to compare the efficiency of a homotopy algorithm to that of a Newton method by measuring both the number of trials and the number of calculations required to obtain a specified fraction of the solutions.     

Schematization of networks

We study the problem of computing schematized versions of network maps, like railroad or highway maps. Every path of the schematized map has two or three links with restricted orientations, and the schematized map must be topologically equivalent to the input map. Our approach can handle several types of schematizations, and certain additional constraints can be added, such as a minimum vertical distance between two paths. Our algorithm runs in O(nlogn) time, and experimental results showing the quality of the output are given.     

Magnetohydrodynamic flow past a porous rotating disk in a circular magnetic field

This paper studies the effects of a circular magnetic field on the flow of a conducting fluid about a porous rotating disk. Using modern quasi-Newton and globally convergent homotopy methods, numerical solutions are obtained for a wide range of magnetic field strengths, suction and injection velocities and Alfven and disk speeds. Results are presented graphically in terms of three non-dimensional parameters. There is excellent agreement with previous work and asymptotic formulae.     

On the computational complexity of piecewise-linear homotopy algorithms

We show that piecewise-linear homotopy algorithms may take a number of steps that grows exponentially with the dimension when solving a system of linear equations whose solution lies close to the starting point. Our examples are based on an example of Murty exhibiting exponential growth for Lemke's algorithm for the linear complementarity problem.This research was supported in part by NSF grant ECS-7921279 and by a Guggenheim Fellowship.     

Symmetric homotopy construction

Homotopy continuation methods can be applied to compute all finite solutions to a given polynomial system. Computations will be performed more efficiently if the symmetric structure of the system can be exploited. This paper presents the construction of a symmetric homotopy. Using this homotopy, only the paths according to the generating solutions have to be traced during continuation.     

A NOTE ON THE NULLITY OF HOMOTOPY GROUP FOR COMPLETE THREE DIMENSIONAL MANIFOLDS WITH RICCI ≧ 0

§１．ＩｎｔｒｏｄｕｃｔｉｏｎＬｅｔＭ３ｂｅａｃｏｍｐｌｅｔｅ，ｎｏｎｃｏｍｐａｃｔＲｉｅｍａｎｎｉａｎｍａｎｉｆｏｌｄ，ａｎｄＲｉｃｃｉＭｂｅｉｔｓＲｉｃｉｃｕｒｖａｔｕｒｅ．ＳｃｈｏｅｎＹａｕ［１］ｐｒｏｖｅｄｔｈｅｆｏｌｏｗｉｎｇＴｈｅｏｒ...