Continuous vacua in bilinear soliton equations

We discuss the freedom in the background field (vacuum) on top of which the solitons are built. If the Hirota bilinear form of a soliton equation is given by A(D_{\vec x})\bd GF=0,\, B(D_{\vec x})(\bd FF - \bd GG)=0 where both $A$ and $B$ are even polynomials in their variables, then there can be a continuum of vacua, parametrized by a vacuum angle $\phi$. The ramifications of this freedom on the construction of one- and two-soliton solutions are discussed. We find, e.g., that once the angle $\phi$ is fixed and we choose $u=\arctan G/F$ as the physical quantity, then there are four different solitons (or kinks) connecting the vacuum angles $\pm\phi$, $\pm\phi\pm\Pi2$ (defined modulo $\pi$). The most interesting result is the existence of a ``ghost'' soliton; it goes over to the vacuum in isolation, but interacts with ``normal'' solitons by giving them a finite phase shift.Comment: 9 pages in Latex + 3 figures (not included

On the Magnetic Excitation Spectra of High Tc Cu Oxides up to the Energies far above the Resonance Energy

Magnetic excitation spectra c"(q,w) of YBa2Cu3Oy and La214 systems have been studied. For La1.88Sr0.12CuO4, c"(q,w) have been measured up to ~30 meV and existing data have been analyzed up to the energy w~150 meV by using the phenomenological expression of the generalized magnetic susceptibility c(q,w)=c0(q,w)/{1+J(q)c0(q,w)}, where c0(q,w) is the susceptibility of the electrons without the exchange coupling J(q) among them. In the relatively low energy region up to slightly above the resonance energy Er, it has been reported by the authors' group that the expression can explain characteristics of the q- and w-dependence of the spectra of YBa2Cu3Oy (YBCO or YBCOy). Here, it is also pointed out that the expression can reproduce the rotation of four incommensurate peaks of c"(q,w) within the a*-b* plane about (p/a, p/a) {or so-called (p, p)} point by 45 degree, which occurs as w goes to the energy region far above Er from E below Er. For La2-xSrxCuO4 and La2-xBaxCuO4, agreements between the observed results and the calculations are less satisfactory than for YBCO, indicating that we have to take account of the existence of the "stripes" to consistently explain the observed c"(q,w) of La214 system especially near x=1/8.Comment: 14 pages, 5 figure

Token Jumping in minor-closed classes

Given two $k$-independent sets $I$ and $J$ of a graph $G$, one can ask if it is possible to transform the one into the other in such a way that, at any step, we replace one vertex of the current independent set by another while keeping the property of being independent. Deciding this problem, known as the Token Jumping (TJ) reconfiguration problem, is PSPACE-complete even on planar graphs. Ito et al. proved in 2014 that the problem is FPT parameterized by $k$ if the input graph is $K_{3,\ell}$-free. We prove that the result of Ito et al. can be extended to any $K_{\ell,\ell}$-free graphs. In other words, if $G$ is a $K_{\ell,\ell}$-free graph, then it is possible to decide in FPT-time if $I$ can be transformed into $J$. As a by product, the TJ-reconfiguration problem is FPT in many well-known classes of graphs such as any minor-free class

Bell inequalities stronger than the CHSH inequality for 3-level isotropic states

We show that some two-party Bell inequalities with two-valued observables are stronger than the CHSH inequality for 3 \otimes 3 isotropic states in the sense that they are violated by some isotropic states in the 3 \otimes 3 system that do not violate the CHSH inequality. These Bell inequalities are obtained by applying triangular elimination to the list of known facet inequalities of the cut polytope on nine points. This gives a partial solution to an open problem posed by Collins and Gisin. The results of numerical optimization suggest that they are candidates for being stronger than the I_3322 Bell inequality for 3 \otimes 3 isotropic states. On the other hand, we found no Bell inequalities stronger than the CHSH inequality for 2 \otimes 2 isotropic states. In addition, we illustrate an inclusion relation among some Bell inequalities derived by triangular elimination.Comment: 9 pages, 1 figure. v2: organization improved; less references to the cut polytope to make the main results clear; references added; typos corrected; typesetting style change

Nucleon Spin in QCD: Old Crisis and New Resolution

We discuss the shortfalls of existing resolutions of the long-standing gauge invariance problem of the canonical decomposition of the nucleon spin to the spin and angular momentum of quarks and gluons. We provide two logically flawless expressions of nucleon spin which have different physical meanings, using the gauge independent Abelian decomposition. The first one is based on the assumption that all gluons (binding and valence gluons) contribute to the nucleon spin, but the second one is based on the assumption that only the binding gluons (and the quarks) contribute to it. We propose the second expression to be the physically correct one

An efficient instruction cache scheme for object-oriented languages

We present an efficient cache scheme, which can considerably reduce instruction cache misses caused by procedure call/returns. This scheme employs N-way banks and XOR mapping functions. The main function of this scheme is to place a group of instructions separated by a call instruction into a bank according to the initial and final bank selection mechanisms. After the initial bank selection mechanism selects a bank on an instruction cache miss, the final bank selection mechanism will determine the final bank for updating a cache line as a correction mechanism. These two mechanisms can guarantee that recent groups of instructions exist in each bank safely. We have developed a simulation program by using Shade and Spixtools, provided by SUN Microsystems, on an ultra SPARC/10 processor. Our experimental results show that these schemes reduce conflict misses more effectively than skewed-associative caches in both C (up to 9.29% improvement) and C++ (up to 30.71% improvement) programs on L1 caches. In addition, they also allow for a significant miss reduction on Branch Target Buffers (BTB)