Manganese-56 coincidence-counting facility precisely measures neutron-source strength

Precise measurement of neutron-source strength is provided by a manganese 56 coincidence-counting facility using the manganese-bath technique. This facility combines nuclear instrumentation with coincidence-counting techniques to handle a wide variety of radioisotope-counting requirements

Evidence of a structural anomaly at 14 K in polymerised CsC60

We report the results of a high-resolution synchrotron X-ray powder diffraction study of polymerised CsC$_{60}$ in the temperature range 4 to 40 K. Its crystal structure is monoclinic (space group I2/m), isostructural with RbC$_{60}$. Below 14 K, a spontaneous thermal contraction is observed along both the polymer chain axis, $a$ and the interchain separation along [111], $d_1$. This structural anomaly could trigger the occurrence of the spin-singlet ground state, observed by NMR at the same temperature.Comment: 8 pages, 5 figures, submitte

A Dichotomy for Regular Expression Membership Testing

We study regular expression membership testing: Given a regular expression of size $m$ and a string of size $n$, decide whether the string is in the language described by the regular expression. Its classic $O(nm)$ algorithm is one of the big success stories of the 70s, which allowed pattern matching to develop into the standard tool that it is today. Many special cases of pattern matching have been studied that can be solved faster than in quadratic time. However, a systematic study of tractable cases was made possible only recently, with the first conditional lower bounds reported by Backurs and Indyk [FOCS'16]. Restricted to any "type" of homogeneous regular expressions of depth 2 or 3, they either presented a near-linear time algorithm or a quadratic conditional lower bound, with one exception known as the Word Break problem. In this paper we complete their work as follows: 1) We present two almost-linear time algorithms that generalize all known almost-linear time algorithms for special cases of regular expression membership testing. 2) We classify all types, except for the Word Break problem, into almost-linear time or quadratic time assuming the Strong Exponential Time Hypothesis. This extends the classification from depth 2 and 3 to any constant depth. 3) For the Word Break problem we give an improved $\tilde{O}(n m^{1/3} + m)$ algorithm. Surprisingly, we also prove a matching conditional lower bound for combinatorial algorithms. This establishes Word Break as the only intermediate problem. In total, we prove matching upper and lower bounds for any type of bounded-depth homogeneous regular expressions, which yields a full dichotomy for regular expression membership testing

A Dichotomy for Regular Expression Membership Testing

We study regular expression membership testing: Given a regular expression of size $m$ and a string of size $n$, decide whether the string is in the language described by the regular expression. Its classic $O(nm)$ algorithm is one of the big success stories of the 70s, which allowed pattern matching to develop into the standard tool that it is today. Many special cases of pattern matching have been studied that can be solved faster than in quadratic time. However, a systematic study of tractable cases was made possible only recently, with the first conditional lower bounds reported by Backurs and Indyk [FOCS'16]. Restricted to any "type" of homogeneous regular expressions of depth 2 or 3, they either presented a near-linear time algorithm or a quadratic conditional lower bound, with one exception known as the Word Break problem. In this paper we complete their work as follows: 1) We present two almost-linear time algorithms that generalize all known almost-linear time algorithms for special cases of regular expression membership testing. 2) We classify all types, except for the Word Break problem, into almost-linear time or quadratic time assuming the Strong Exponential Time Hypothesis. This extends the classification from depth 2 and 3 to any constant depth. 3) For the Word Break problem we give an improved $\tilde{O}(n m^{1/3} + m)$ algorithm. Surprisingly, we also prove a matching conditional lower bound for combinatorial algorithms. This establishes Word Break as the only intermediate problem. In total, we prove matching upper and lower bounds for any type of bounded-depth homogeneous regular expressions, which yields a full dichotomy for regular expression membership testing

Stable and Unstable Circular Strings in Inflationary Universes

It was shown by Garriga and Vilenkin that the circular shape of nucleated cosmic strings, of zero loop-energy in de Sitter space, is stable in the sense that the ratio of the mean fluctuation amplitude to the loop radius is constant. This result can be generalized to all expanding strings (of non-zero loop-energy) in de Sitter space. In other curved spacetimes the situation, however, may be different. In this paper we develop a general formalism treating fluctuations around circular strings embedded in arbitrary spatially flat FRW spacetimes. As examples we consider Minkowski space, de Sitter space and power law expanding universes. In the special case of power law inflation we find that in certain cases the fluctuations grow much slower that the radius of the underlying unperturbed circular string. The inflation of the universe thus tends to wash out the fluctuations and to stabilize these strings.Comment: 15 pages Latex, NORDITA 94/14-

Monitoring of the prompt radio emission from the unusual supernova 2004dj in NGC2403

Supernova 2004dj in the nearby spiral galaxy NGC2403 was detected optically in July 2004. Peaking at a magnitude of 11.2, this is the brightest supernova detected for several years. Here we present Multi-Element Radio Linked Interferometer Network (MERLIN) observations of this source, made over a four month period, which give a position of R.A. = 07h37m17.044s, Dec =+65deg35'57.84" (J2000.0). We also present a well-sampled 5 GHz light curve covering the period from 5 August to 2 December 2004. With the exception of the unusual and very close SN 1987A, these observations represent the first detailed radio light curve for the prompt emission from a Type II-P supernova.Comment: (1) Jodrell Bank Observatory (2) University of Valencia (3) University of Sheffield 6 pages, 1 figure. To appear in ApJ letter

Circular String-Instabilities in Curved Spacetime

We investigate the connection between curved spacetime and the emergence of string-instabilities, following the approach developed by Loust\'{o} and S\'{a}nchez for de Sitter and black hole spacetimes. We analyse the linearised equations determining the comoving physical (transverse) perturbations on circular strings embedded in Schwarzschild, Reissner-Nordstr\"{o}m and de Sitter backgrounds. In all 3 cases we find that the "radial" perturbations grow infinitely for $r\rightarrow 0$ (ring-collapse), while the "angular" perturbations are bounded in this limit. For $r\rightarrow\infty$ we find that the perturbations in both physical directions (perpendicular to the string world-sheet in 4 dimensions) blow up in the case of de Sitter space. This confirms results recently obtained by Loust\'{o} and S\'{a}nchez who considered perturbations around the string center of mass.Comment: 24 pages Latex + 2 figures (not included). Observatoire de Paris, Meudon No. 9305

q-Deformed de Sitter/Conformal Field Theory Correspondence

Unitary principal series representations of the conformal group appear in the dS/CFT correspondence. These are infinite dimensional irreducible representations, without highest weights. In earlier work of Guijosa and the author it was shown for the case of two-dimensional de Sitter, there was a natural q-deformation of the conformal group, with q a root of unity, where the unitary principal series representations become finite-dimensional cyclic unitary representations. Formulating a version of the dS/CFT correspondence using these representations can lead to a description with a finite-dimensional Hilbert space and unitary evolution. In the present work, we generalize to the case of quantum-deformed three-dimensional de Sitter spacetime and compute the entanglement entropy of a quantum field across the cosmological horizon.Comment: 18 pages, 2 figures, revtex, (v2 reference added

Approximate Range Emptiness in Constant Time and Optimal Space

This paper studies the \emph{$\varepsilon$-approximate range emptiness} problem, where the task is to represent a set $S$ of $n$ points from $\{0,\ldots,U-1\}$ and answer emptiness queries of the form "$[a ; b]\cap S \neq \emptyset$ ?" with a probability of \emph{false positives} allowed. This generalizes the functionality of \emph{Bloom filters} from single point queries to any interval length $L$. Setting the false positive rate to $\varepsilon/L$ and performing $L$ queries, Bloom filters yield a solution to this problem with space $O(n \lg(L/\varepsilon))$ bits, false positive probability bounded by $\varepsilon$ for intervals of length up to $L$, using query time $O(L \lg(L/\varepsilon))$. Our first contribution is to show that the space/error trade-off cannot be improved asymptotically: Any data structure for answering approximate range emptiness queries on intervals of length up to $L$ with false positive probability $\varepsilon$, must use space $\Omega(n \lg(L/\varepsilon)) - O(n)$ bits. On the positive side we show that the query time can be improved greatly, to constant time, while matching our space lower bound up to a lower order additive term. This result is achieved through a succinct data structure for (non-approximate 1d) range emptiness/reporting queries, which may be of independent interest