Mediation of Supersymmetry Breaking via Anti-Generation Fields

In the context of the weakly coupled heterotic string, we propose a new model of mediating supersymmetry breaking. The breakdown of supersymmetry in the hidden sector is transmitted to anti-generation fields via gravitational interactions. Subsequent transmission of the breaking to the MSSM sector occurs via gauge interactions. It is shown that the mass spectra of superparticles are phenomenologically viable.Comment: 8pages, LaTeX, 1 figure, final version to appear in Prog. Theor. Phys. Vol.103, No.6 (2000

Fixed-Parameter Tractability of Token Jumping on Planar Graphs

Suppose that we are given two independent sets $I_0$ and $I_r$ of a graph such that $|I_0| = |I_r|$, and imagine that a token is placed on each vertex in $I_0$. The token jumping problem is to determine whether there exists a sequence of independent sets which transforms $I_0$ into $I_r$ so that each independent set in the sequence results from the previous one by moving exactly one token to another vertex. This problem is known to be PSPACE-complete even for planar graphs of maximum degree three, and W[1]-hard for general graphs when parameterized by the number of tokens. In this paper, we present a fixed-parameter algorithm for the token jumping problem on planar graphs, where the parameter is only the number of tokens. Furthermore, the algorithm can be modified so that it finds a shortest sequence for a yes-instance. The same scheme of the algorithms can be applied to a wider class of graphs, $K_{3,t}$-free graphs for any fixed integer $t \ge 3$, and it yields fixed-parameter algorithms

Reconfiguration of Dominating Sets

We explore a reconfiguration version of the dominating set problem, where a dominating set in a graph $G$ is a set $S$ of vertices such that each vertex is either in $S$ or has a neighbour in $S$. In a reconfiguration problem, the goal is to determine whether there exists a sequence of feasible solutions connecting given feasible solutions $s$ and $t$ such that each pair of consecutive solutions is adjacent according to a specified adjacency relation. Two dominating sets are adjacent if one can be formed from the other by the addition or deletion of a single vertex. For various values of $k$, we consider properties of $D_k(G)$, the graph consisting of a vertex for each dominating set of size at most $k$ and edges specified by the adjacency relation. Addressing an open question posed by Haas and Seyffarth, we demonstrate that $D_{\Gamma(G)+1}(G)$ is not necessarily connected, for $\Gamma(G)$ the maximum cardinality of a minimal dominating set in $G$. The result holds even when graphs are constrained to be planar, of bounded tree-width, or $b$-partite for $b \ge 3$. Moreover, we construct an infinite family of graphs such that $D_{\gamma(G)+1}(G)$ has exponential diameter, for $\gamma(G)$ the minimum size of a dominating set. On the positive side, we show that $D_{n-m}(G)$ is connected and of linear diameter for any graph $G$ on $n$ vertices having at least $m+1$ independent edges.Comment: 12 pages, 4 figure

A reconfigurations analogue of Brooks’ theorem.

Let G be a simple undirected graph on n vertices with maximum degree Δ. Brooks’ Theorem states that G has a Δ-colouring unless G is a complete graph, or a cycle with an odd number of vertices. To recolour G is to obtain a new proper colouring by changing the colour of one vertex. We show that from a k-colouring, k > Δ, a Δ-colouring of G can be obtained by a sequence of O(n 2) recolourings using only the original k colours unless G is a complete graph or a cycle with an odd number of vertices, or k = Δ + 1, G is Δ-regular and, for each vertex v in G, no two neighbours of v are coloured alike. We use this result to study the reconfiguration graph R k (G) of the k-colourings of G. The vertex set of R k (G) is the set of all possible k-colourings of G and two colourings are adjacent if they differ on exactly one vertex. It is known that if k ≤ Δ(G), then R k (G) might not be connected and it is possible that its connected components have superpolynomial diameter, if k ≥ Δ(G) + 2, then R k (G) is connected and has diameter O(n 2). We complete this structural classification by settling the missing case: if k = Δ(G) + 1, then R k (G) consists of isolated vertices and at most one further component which has diameter O(n 2). We also describe completely the computational complexity classification of the problem of deciding whether two k-colourings of a graph G of maximum degree Δ belong to the same component of R k (G) by settling the case k = Δ(G) + 1. The problem is O(n 2) time solvable for k = 3, PSPACE-complete for 4 ≤ k ≤ Δ(G), O(n) time solvable for k = Δ(G) + 1, O(1) time solvable for k ≥ Δ(G) + 2 (the answer is always yes)

Formation of Hot Planets by a combination of planet scattering, tidal circularization, and Kozai mechanism

We have investigated the formation of close-in extrasolar giant planets through a coupling effect of mutual scattering, Kozai mechanism, and tidal circularization, by orbital integrations. We have carried out orbital integrations of three planets with Jupiter-mass, directly including the effect of tidal circularization. We have found that in about 30% runs close-in planets are formed, which is much higher than suggested by previous studies. We have found that Kozai mechanism by outer planets is responsible for the formation of close-in planets. During the three-planet orbital crossing, the Kozai excitation is repeated and the eccentricity is often increased secularly to values close enough to unity for tidal circularization to transform the inner planet to a close-in planet. Since a moderate eccentricity can remain for the close-in planet, this mechanism may account for the observed close-in planets with moderate eccentricities and without nearby secondary planets. Since these planets also remain a broad range of orbital inclinations (even retrograde ones), the contribution of this process would be clarified by more observations of Rossiter-McLaughlin effects for transiting planets.Comment: 15 pages, 16 figures, Accepted for publication in Ap

Asynchronous vibration problem of centrifugal compressor

An unstable asynchronous vibration problem in a high pressure centrifugal compressor and the remedial actions against it are described. Asynchronous vibration of the compressor took place when the discharge pressure (Pd) was increased, after the rotor was already at full speed. The typical spectral data of the shaft vibration indicate that as the pressure Pd increases, pre-unstable vibration appears and becomes larger, and large unstable asynchronous vibration occurs suddenly (Pd = 5.49MPa). A computer program was used which calculated the logarithmic decrement and the damped natural frequency of the rotor bearing systems. The analysis of the log-decrement is concluded to be effective in preventing unstable vibration in both the design stage and remedial actions

Reconfiguring Independent Sets in Claw-Free Graphs

We present a polynomial-time algorithm that, given two independent sets in a claw-free graph $G$, decides whether one can be transformed into the other by a sequence of elementary steps. Each elementary step is to remove a vertex $v$ from the current independent set $S$ and to add a new vertex $w$ (not in $S$) such that the result is again an independent set. We also consider the more restricted model where $v$ and $w$ have to be adjacent

Reconfiguration on sparse graphs

A vertex-subset graph problem Q defines which subsets of the vertices of an input graph are feasible solutions. A reconfiguration variant of a vertex-subset problem asks, given two feasible solutions S and T of size k, whether it is possible to transform S into T by a sequence of vertex additions and deletions such that each intermediate set is also a feasible solution of size bounded by k. We study reconfiguration variants of two classical vertex-subset problems, namely Independent Set and Dominating Set. We denote the former by ISR and the latter by DSR. Both ISR and DSR are PSPACE-complete on graphs of bounded bandwidth and W[1]-hard parameterized by k on general graphs. We show that ISR is fixed-parameter tractable parameterized by k when the input graph is of bounded degeneracy or nowhere-dense. As a corollary, we answer positively an open question concerning the parameterized complexity of the problem on graphs of bounded treewidth. Moreover, our techniques generalize recent results showing that ISR is fixed-parameter tractable on planar graphs and graphs of bounded degree. For DSR, we show the problem fixed-parameter tractable parameterized by k when the input graph does not contain large bicliques, a class of graphs which includes graphs of bounded degeneracy and nowhere-dense graphs

Developing Cloud Chambers with High School Students

The result and outcome of the \textit{cloud chamber project}, which aims to develop a cloud chamber useful for science education is reported in detail. A project includes both three high school students and a teacher as a part of Super Science High School (SSH) program in our school. We develop a dry-ice-free cloud chamber using salt and ice (or snow). Technical details of the chamber are described. We also argue how the project have affected student's cognition, motivation, academic skills and behavior. The research project has taken steps of professional researchers, i.e., in planning research, applying fund, writing a paper and giving a talk in conferences. From interviews with students, we have learnt that such style of scientific activity is very effective in promoting student's motivation for learning science.Comment: 9 pages, accepted to the proceedings of APPC12 - the 12th Asia Pacific Physics Conferenc