The ideal magnetohydrodynamic (MHD) stability limits for the edge transport barrier (ETB) region in tokamaks are explored, concentrating in particular on the intermediate to high toroidal mode number, n, modes. These calculations take full account of the effect of the edge bootstrap current on the stability of both ballooning and peeling modes. Because the current plays an important role in MHD...

Abstract. Islands are combinatorial objects that can be intuitively defined on a board consisting of a finite number of cells. Based on the neighbor relation of the cells, it is a fundamental property that two islands are either containing or disjoint. Recently, numerous extremal questions have been answered using different methods. We show elementary techniques unifying these approaches. Our b...

We establish a new group-theoretic realization of the basic representations of the twisted affine and twisted toroidal algebras of ADE types in the same spirit of our new approach to the McKay correspondence. Our vertex operator construction provides a unified description to the character tables for the spin cover of the wreath product of the twisted hyperoctahedral groups and an arbitrary fini...

Magnetic monopole solutions to heterotic string theory are discussed in toroidal compactifications to four spacetime dimensions. Particular emphasis is placed on the relation to previously studied fivebrane solutions in ten dimensions and on the possibility of constructing exact monopole solutions related to symmetric fivebranes.

A theoretical study of toroidal Inelnbranes with various degrees of intrinsic orientational order is presented at mean-field level. The study uses a simple Ginzburg-Landau

According to a conjecture due to Wdlmore [5], the toroidal surface corresponding to the absolute minimum of the curvature ener©, is either an axisymmetric torus of aspect ratio

We show the universality of the VEDIC network in simulating other well known interconnection networks b y generating the parameters of the VEDtC network automatically. Algorithms are given to represent chordal rings, toroidal meshes, binary hypercubes, kary n-cubes, and Cayley graphs star graph and pancake graph, as VEDIC networks. Using these parameters the VEDIC network can be used as a tool ...

Let G be a toroidal graph without cycles of a fixed length k, and l (G) the list chromatic number of G. We establish tight upper bounds Contract grant sponsor: RGC; Contract grant number: CUHK4165/01E (to L. C.); Contract grant sponsor: NSFC; Contract grant number: 10771197 (to W. W.); Contract grant sponsor: ZJNSFC; Contract grant number: Z6090150 (to W. W.); Contract grant sponsor: NSC97-2115...

Let G be a 2-connected graph with a toroidal rotation system given. An algorithm for constructing a straight line drawing with no crossings on a rectangular representation of the torus is presented. It is based on Read’s algorithm for constructing a planar layout of a 2-connected graph with a planar rotation system. It is proved that the method always works. The complexity of the algorithm is l...

A bent Hamilton cycle in a grid graph is one in which each edge in a successive pair of edges lies in a different dimension. We show that the d-dimensional grid graph has a bent Hamilton cycle if some dimension is even and d ≥ 3, and does not have a bent Hamilton cycle if all dimensions are odd. In the latter case, we determine the conditions for when a bent Hamilton path exists. For the d-dime...