An L(2, 1)-labeling of a graph G is equitable if the number of elements in any two color classes differ by at most one. The equitable L(2, 1)-labeling number λe(G) of G is the smallest integer k such that G has an equitable L(2, 1)-labeling. Sierpiński graphs S(n, k) generalize the Tower of Hanoi graphs—the graph S(n, 3) is isomorphic to the graph of the Tower of Hanoi with n disks. In this pap...

In this we paper we consider the version of the classical Towers of Hanoi games where the game-board contains more than three pegs. For k pegs we give a 2k 1/(k−2) lower bound on the number of steps necessary for transferring n disks from one peg to another. Apart from the value of the constants Ck this bound is tight.

Amines, organic derivatives of NH3, are important common trace atmospheric species that can enhance new particle formation in the Earth’s atmosphere under favorable conditions. While methylamine (MA), dimethylamine (DMA) and trimethylamine (TMA) all efficiently enhance binary nucleation, MA may represent the lower limit of the enhancing effect of amines on atmospheric nucleation. In the present...

Lateral tower vibrations of offshore wind turbines are normally lightly damped, and large amplitude vibrations induced by wind and wave loads in this direction may significantly shorten the fatigue life of the tower. This paper proposes the modeling and control of lateral tower vibrations in offshore wind turbines using active generator torque. To implement the active control algorithm, both th...

is called the 2-class field tower of k. If n is the minimal integer such that kn = kn+1, then n is called the length of the tower. If no such n exists, then the tower is said to be of infinite length. At present there is no known decision procedure to determine whether or not the (2-)class field tower of a given field k is infinite. However, it is known by group theoretic results (see [2]) that...

We draw an analogy between biology and computer hardware systems and argue for the need of a tower of abstractions to tame complexity of living systems. Much like in hardware design, where engineers use a tower of abstractions to produce the most complex man-made systems, we stress that in reverse engineering of biological systems; only by using a tower of abstractions we would be able to under...

We construct a tower of function fields F0 ⊂ F1 ⊂ . . . over a finite field such that every place of every Fi ramifies in the tower and lim genus(Fi)/[Fi : F0] <∞. We also construct a tower in which every place ramifies and limNFi/[Fi : F0] > 0, where NFi is the number of degree-1 places of Fi. These towers answer questions posed by Stichtenoth at Fq7.

The notion of stratified (L, M)-semiuniform convergence tower spaces is introduced, which extends the notions ofprobabilistic semiuniform convergence spaces and lattice-valued semiuniform convergence spaces. The resulting categoryis shown to be a strong topological universe. Besides, the relations between our category and that of stratified (L, M)-filter tower spaces are studied.

It is proved that seven different approaches to the multi-peg Tower of Hanoi problem are all equivalent. Among them the classical approaches of Stewart and Frame from 1941 can be found.

Come with us to read a new book that is coming recently. Yeah, this is a new coming book that many people really want to read will you be one of them? Of course, you should be. It will not make you feel so hard to enjoy your life. Even some people think that reading is a hard to do, you must be sure that you can do it. Hard will be felt when you have no ideas about what kind of book to read. Or...