Electric-dipole active two-magnon excitation in {\textit{ab}} spiral spin phase of a ferroelectric magnet Gd0.7_{\textbf{0.7}}Tb0.3_{\textbf{0.3}}MnO3_{\textbf 3}

A broad continuum-like spin excitation (1--10 meV) with a peak structure around 2.4 meV has been observed in the ferroelectric $ab$ spiral spin phase of Gd$_{0.7}$Tb$_{0.3}$MnO$_3$ by using terahertz (THz) time-domain spectroscopy. Based on a complete set of light-polarization measurements, we identify the spin excitation active for the light $E$ vector only along the a-axis, which grows in intensity with lowering temperature even from above the magnetic ordering temperature but disappears upon the transition to the $A$-type antiferromagnetic phase. Such an electric-dipole active spin excitation as observed at THz frequencies can be ascribed to the two-magnon excitation in terms of the unique polarization selection rule in a variety of the magnetically ordered phases.Comment: 11 pages including 3 figure

Unary Pushdown Automata and Straight-Line Programs

We consider decision problems for deterministic pushdown automata over a unary alphabet (udpda, for short). Udpda are a simple computation model that accept exactly the unary regular languages, but can be exponentially more succinct than finite-state automata. We complete the complexity landscape for udpda by showing that emptiness (and thus universality) is P-hard, equivalence and compressed membership problems are P-complete, and inclusion is coNP-complete. Our upper bounds are based on a translation theorem between udpda and straight-line programs over the binary alphabet (SLPs). We show that the characteristic sequence of any udpda can be represented as a pair of SLPs---one for the prefix, one for the lasso---that have size linear in the size of the udpda and can be computed in polynomial time. Hence, decision problems on udpda are reduced to decision problems on SLPs. Conversely, any SLP can be converted in logarithmic space into a udpda, and this forms the basis for our lower bound proofs. We show coNP-hardness of the ordered matching problem for SLPs, from which we derive coNP-hardness for inclusion. In addition, we complete the complexity landscape for unary nondeterministic pushdown automata by showing that the universality problem is $\Pi_2 \mathrm P$-hard, using a new class of integer expressions. Our techniques have applications beyond udpda. We show that our results imply $\Pi_2 \mathrm P$-completeness for a natural fragment of Presburger arithmetic and coNP lower bounds for compressed matching problems with one-character wildcards

Universal Constraints on Low-Energy Flavour Models

It is pointed out that in a general class of flavour models one can identify certain universally present FCNC operators, induced by the exchange of heavy flavour messengers. Their coefficients depend on the rotation angles that connect flavour and fermion mass basis. The lower bounds on the messenger scale are derived using updated experimental constraints on the FCNC operators. The obtained bounds are different for different operators and in addition they depend on the chosen set of rotations. Given the sensitivity expected in the forthcoming experiments, the present analysis suggests interesting room for discovering new physics. As the highlights emerge the leptonic processes, $\mu\rightarrow e\gamma$, $\mu\rightarrow eee$ and $\mu\rightarrow e$ conversion in nuclei.Comment: 18 pages, 3 figures; v2 matches published versio

Solving satisfiability problems by fluctuations: The dynamics of stochastic local search algorithms

Stochastic local search algorithms are frequently used to numerically solve hard combinatorial optimization or decision problems. We give numerical and approximate analytical descriptions of the dynamics of such algorithms applied to random satisfiability problems. We find two different dynamical regimes, depending on the number of constraints per variable: For low constraintness, the problems are solved efficiently, i.e. in linear time. For higher constraintness, the solution times become exponential. We observe that the dynamical behavior is characterized by a fast equilibration and fluctuations around this equilibrium. If the algorithm runs long enough, an exponentially rare fluctuation towards a solution appears.Comment: 21 pages, 18 figures, revised version, to app. in PRE (2003

The dose makes the poison: have “field realistic” rates of exposure of bees to neonicotinoid insecticides been overestimated in laboratory studies?

Recent laboratory based studies have demonstrated adverse sub-lethal effects of neonicotinoid insecticides on honey bees and bumble bees, and these studies have been influential in leading to a European Union moratorium on the use of three neonicotinoids, clothianidin, imidacloprid, and thiamethoxam on “bee attractive” crops. Yet so far, these same effects have not been observed in field studies. Here we review the three key dosage factors (concentration, duration and choice) relevant to field conditions, and conclude that these have probably been over estimated in many laboratory based studies

Research Proposal for an Experiment to Search for the Decay {\mu} -> eee

We propose an experiment (Mu3e) to search for the lepton flavour violating decay mu+ -> e+e-e+. We aim for an ultimate sensitivity of one in 10^16 mu-decays, four orders of magnitude better than previous searches. This sensitivity is made possible by exploiting modern silicon pixel detectors providing high spatial resolution and hodoscopes using scintillating fibres and tiles providing precise timing information at high particle rates.Comment: Research proposal submitted to the Paul Scherrer Institute Research Committee for Particle Physics at the Ring Cyclotron, 104 page

Relaxation and Metastability in the RandomWalkSAT search procedure

An analysis of the average properties of a local search resolution procedure for the satisfaction of random Boolean constraints is presented. Depending on the ratio alpha of constraints per variable, resolution takes a time T_res growing linearly (T_res \sim tau(alpha) N, alpha < alpha_d) or exponentially (T_res \sim exp(N zeta(alpha)), alpha > alpha_d) with the size N of the instance. The relaxation time tau(alpha) in the linear phase is calculated through a systematic expansion scheme based on a quantum formulation of the evolution operator. For alpha > alpha_d, the system is trapped in some metastable state, and resolution occurs from escape from this state through crossing of a large barrier. An annealed calculation of the height zeta(alpha) of this barrier is proposed. The polynomial/exponentiel cross-over alpha_d is not related to the onset of clustering among solutions.Comment: 23 pages, 11 figures. A mistake in sec. IV.B has been correcte

Computational Indistinguishability between Quantum States and Its Cryptographic Application

We introduce a computational problem of distinguishing between two specific quantum states as a new cryptographic problem to design a quantum cryptographic scheme that is "secure" against any polynomial-time quantum adversary. Our problem, QSCDff, is to distinguish between two types of random coset states with a hidden permutation over the symmetric group of finite degree. This naturally generalizes the commonly-used distinction problem between two probability distributions in computational cryptography. As our major contribution, we show that QSCDff has three properties of cryptographic interest: (i) QSCDff has a trapdoor; (ii) the average-case hardness of QSCDff coincides with its worst-case hardness; and (iii) QSCDff is computationally at least as hard as the graph automorphism problem in the worst case. These cryptographic properties enable us to construct a quantum public-key cryptosystem, which is likely to withstand any chosen plaintext attack of a polynomial-time quantum adversary. We further discuss a generalization of QSCDff, called QSCDcyc, and introduce a multi-bit encryption scheme that relies on similar cryptographic properties of QSCDcyc.Comment: 24 pages, 2 figures. We improved presentation, and added more detail proofs and follow-up of recent wor