A generalization of the weighted Strichartz estimates for wave equations and an application to self‐similar solutions

Weighted Strichartz estimates with homogeneous weights with critical exponents are proved for the wave equation without a support restriction on the forcing term. The method of proof is based on expansion by spherical harmonics and on the Sobolev space over the unit sphere, by which the required estimates are reduced to the radial case. As an application of the weighted Strichartz estimates, the existence and uniqueness of self‐similar solutions to nonlinear wave equations are proved on up to five space dimensions. © 2006 Wiley Periodicals, Inc.     

Spectral Gap and Exponential Decay of Correlations

We study the relation between the spectral gap above the ground state and the decay of the correlations in the ground state in quantum spin and fermion systems with short-range interactions on a wide class of lattices. We prove that, if two observables anticommute with each other at large distance, then the nonvanishing spectral gap implies exponential decay of the corresponding correlation. When two observables commute with each other at large distance, the connected correlation function decays exponentially under the gap assumption. If the observables behave as a vector under the U(1) rotation of a global symmetry of the system, we use previous results on the large distance decay of the correlation function to show the stronger statement that the correlation function itself, rather than just the connected correlation function, decays exponentially under the gap assumption on a lattice with a certain self-similarity in (fractal) dimensions D < 2. In particular, if the system is translationally invariant in one of the spatial directions, then this self-similarity condition is automatically satisfied. We also treat systems with long-range, power-law decaying interactions.     

Electron spin resonance of the two-dimensional metallic state and the quantum Hall state in a Si/SiGe quantum well

We report electrically detected electron spin resonance (ESR) measurements of a high mobility two-dimensional (2D) electron system formed in a Si/SiGe quantum well, with millimeter wave in a high magnetic field . The negative ESR signal observed under an in-plane magnetic field gives direct evidence that the spin polarization leads to a resistance increase in the 2D metallic state. Suppression of spin decoherence was observed in the quantum Hall state at the Landau level filling factor ν=2. Strength of the nuclear magnetic field in the resonance is evaluated to be less than , much smaller than that reported for GaAs/AlGaAs heterostructures.     

Improved lattice action for Wilson fermions

An improved lattice action for gauge theories with Wilson fermions is presented.     

Convergence of the arithmetic-geometric mean procedure for the complex variables and the calculation of the complete elliptic integrals with complex modulus

The convergence of the arithmetic-geometric mean procedure is checked for complex variables. The procedure is shown to be useful for the evaluation of the complete elliptic integrals of the first and second kinds with complex modulus. It is suggested that the procedure will be useful also for the numerical calculation of the elliptic integrals and the Jacobian elliptic functions with complex modulus in general.     

A linear algorithm for the domination number of a series-parallel graph

A vertex u in an undirected graph G = (V, E) is said to dominate all its adjacent vertices and itself. A subset D of V is a dominating set in G if every vertex in G is dominated by a vertex in D, and is a minimum dominating set in G if no other dominating set in G has fewer vertices than D. The domination number of G is the cardinality of a minimum dominating set in G.The problem of determining, for a given positive integer k and an undirected graph G, whether G has a dominating set D in G satisfying ¦D¦ ≤ k, is a well-known NP-complete problem. Cockayne have presented a linear time algorithm for finding a minimum dominating set in a tree. In this paper, we will present a linear time algorithm for finding a minimum dominating set in a series-parallel graph.