Cycle and circle tests of balance in gain graphs: Forbidden minors and their groups

We examine two criteria for balance of a gain graph, one based on binary cycles and one on circles. The graphs for which each criterion is valid depend on the set of allowed gain groups. The binary cycle test is invalid, except for forests, if any possible gain group has an element of odd order. Assuming all groups are allowed, or all abelian groups, or merely the cyclic group of order 3, we characterize, both constructively and by forbidden minors, the graphs for which the circle test is valid. It turns out that these three classes of groups have the same set of forbidden minors. The exact reason for the importance of the ternary cyclic group is not clear. © 2005 Wiley Periodicals, Inc. J Graph Theory     

Space-Time Directional Lyapunov Exponents for Cellular Automata

Space-time directional Lyapunov exponents are introduced. They describe the maximal velocity of propagation to the right or to the left of fronts of perturbations in a frame moving with a given velocity. The continuity of these exponents as function of the velocity and an inequality relating them to the directional entropy is proved.     

An Analogue of Distributivity for Ungraded Lattices

In this paper, we study lattices that posess both the properties of being extremal (in the sense of Markowsky) and of being left modular (in the sense of Blass and Sagan). We call such lattices trim and show that they posess some additional appealing properties, analogous to those of a distributive lattice. For example, trimness is preserved under taking intervals and suitable sublattices. Trim lattices satisfy a weakened form of modularity. The order complex of a trim lattice is contractible or homotopic to a sphere; the latter holds exactly if the maximum element of the lattice is a join of atoms. Any distributive lattice is trim, but trim lattices need not be graded. The main example of ungraded trim lattices are the Tamari lattices and generalizations of them. We show that the Cambrian lattices in types A and B defined by Reading are trim; we conjecture that all Cambrian lattices are trim.     

Scaled-oscillation and regularity

We give sufficient conditions for Sobolev and Lipschitz functions in terms of their lower scaled-oscillation. The sharpness of these conditions is shown by examples. Our examples also show that a Stepanov-type differentiability theorem does not hold under the boundedness assumption of the lower scaled-oscillation.

     

CONCEPTUAL DESIGN STUDIES OF AN 84 GHz, 500 kW, CW GYROTRON

The feasibility of an 84 GHz, 500 kW, CW gyrotron for ECRH on an experimental tokamak will be presented in this paper. Mode competition and mode selection procedures are carefully investigated by considering various candidate modes and the TE_10,4 mode is chosen as the operating mode. A conventional cylindrical cavity resonator with weak input and output tapers and parabolic roundings is considered for interaction studies. Self-consistent, both single mode and time-dependent, calculations are carried out and power and efficiencies are computed for a typical set of beam parameters. The results show that an output power of well over 500 kW, CW and efficiency around 40% can be reached without a depressed collector.     

Odd-Excited Binomial States of the Radiation Field and Some of Their Statistical Properties

In this paper a new state called odd-excited binomial state (OEBS) is introduced. It interpolates between the odd number state and the odd-excited coherent state. We discuss some statistical properties, such as the Glauber second-order correlation function and squeezing phenomenon (normal and amplitude-squared squeezing) for this state. The quasiprobability distribution functions (Husimi Q-function and Wigner W-function) are also examined.     

A detailed study of the generation of optically detectable watermarks using the logistic map

A digital watermark is a visible, or preferably invisible, identification code that is permanently embedded in digital media, to prove owner authentication and provide protection for documents. Given the interest in watermark generation using chaotic functions a detailed study of one chaotic function for this purpose is performed. In this paper, we present an approach for the generation of watermarks using the logistic map. Using this function, in conjunction with seed management, it is possible to generate chaotic sequences that may be used to create highpass or lowpass digital watermarks. In this paper we provide a detailed study on the generation of optically detectable watermarks and we provide some guidelines on successful chaotic watermark generation using the logistic map, and show using a recently published scheme, how care must be taken in the selection of the function seed.