Overlap Cycles for Steiner Quadruple Systems

Steiner quadruple systems are set systems in which every triple is contained in a unique quadruple. It is well known that Steiner quadruple systems of order v, or SQS(v), exist if and only if . Universal cycles, introduced by Chung, Diaconis, and Graham in 1992, are a type of cyclic Gray code. Overlap cycles are generalizations of universal cycles that were introduced in 2010 by Godbole, et al. Using Hanani's SQS constructions, we show that for every with there exists an SQS(v) that admits a 1‐overlap cycle.     

Toward multipurpose NMR experiments

Standard phase cycled NMR pulse sequences were generalized such that for each individual step of the pulse phase cycle the free induction decay is stored separately without phase correction. This is in contrast to the usual practice, where pulse responses are phase shifted immediately (by applying a ‘receiver phase’) and co‐added as they are stored. The approach used here allows one to extract different types of NMR information, which are usually referred to as different ‘experiments’, from the same raw data set a posteriori by using complex linear combinations. Storing the free induction decays of individual phase cycle steps separately and using specific linear combinations of these data to obtain a particular type of information increase the overall efficiency of a given set of NMR experiments substantially, because all information can be derived from a single multiplexed data set. This ‘super‐experiment’ requires only as much time as the most complex of the derived specific experiments alone. The principle of this multipurpose approach was demonstrated by performing different multiple‐quantum filtered COSY experiments. It also becomes possible to generate linear combinations, which differ from the conventionally acquired spectra a posteriori. For example, we implemented diagonal peak reduction by using zero‐ and single‐quantum filtered COSY contributions without requiring additional experiment time. Copyright © 2009 John Wiley & Sons, Ltd.     

Monochromatic sinks in nearly transitive arc-colored tournaments

Let T be the set of all arc-colored tournaments, with any number of colors, that contain no rainbow 3-cycles, i.e., no 3-cycles whose three arcs are colored with three distinct colors. We prove that if T∈T and if each strong component of T is a single vertex or isomorphic to an upset tournament, then T contains a monochromatic sink. We also prove that if T∈T and T contains a vertex x such that T−x is transitive, then T contains a monochromatic sink. The latter result is best possible in the sense that, for each n≥5, there exists an n-tournament T such that (T−x)−y is transitive for some two distinct vertices x and y in T, and T can be arc-colored with five colors such that T∈T, but T contains no monochromatic sink.     

Persistent oscillations in a threshold adjustment model

In this paper we present a simple time-continuous behavioural model of habit formation. Addictive behaviour is damped by a threshold which adapts itself to the habit. This adaptive behaviour of the threshold may lead to periodic fluctuations of the consumption rate, the habit and the threshold. It turns out that both a low adjustment rate of the threshold as well as a steep consumption function favour oscillatory patterns.     

Endogenous Opening Policy and Nonlinear Economic Development—Physical Capital,Human Capital and Economic Structure

This paper is concerned with nonlinear issues in economic development. We suggest a model of dynamic interdependence of economic development, openness and human capital accumulation. The model provides some insights into complex of modernization of mainland China. We show conditions under which the dynamic system exhibits multiple equilibria, limit cycles or catastrophes.     

Cyclical strategies in two-dimensional optimal control models: Necessary conditions and existence

This paper derives necessary conditions such that cyclical policies may be optimal in concave, two state variable (economic) control problems. These conditions identify four different routes. One major implication is that two of these four conditions may be met by separable models. This possibility has been overlooked so far. Therefore, even separable and structurally very simple models may be characterized by optimal cyclical policies. Indeed, it will be shown that stable limit cycles exist for concave and separable control problems.     

Sparse hamiltonian 2-decompositions together with exact count of numerous Hamilton cycles

We construct multigraphs of any large order with as few as only four 2-decompositions into Hamilton cycles or only two 2-decompositions into Hamilton paths. Nevertheless, some of those multigraphs are proved to have exponentially many Hamilton cycles (Hamilton paths). Two families of large simple graphs are constructed. Members in one class have exactly 16 hamiltonian pairs and in another class exactly four traceable pairs. These graphs also have exponentially many Hamilton cycles and Hamilton paths, respectively. The exact numbers of (Hamilton) cycles and paths are expressed in terms of Lucas- or Fibonacci-like numbers which count 2-independent vertex (or edge) subsets on the n-path or n-cycle. A closed formula which counts Hamilton cycles in the square of the n-cycle is found for n≥5. The presented results complement, improve on, or extend the corresponding well-known Thomason’s results.     

Stability properties of cycles and tori of a simplest nonresonant wave-type equation

For a number of meaningful examples, nonresonant wave-type equations are shown to be characterized by periodic dynamics. Translated fromMatematicheskie Zametki, Vol. 62, No. 5, pp. 744–750, November, 1997. Translated by O. V. Sipacheva     

泛圈图方面的著名Bondy定理的简单证明

本文用极好的新方法给出泛图图方面的Bondy定理的简捷证明。