Direct Numerical Simulations of the Kraichnan Model: Scaling Exponents and Fusion Rules

We present results from direct numerical simulations of the Kraichnan model for passive scalar advection by a rapidly-varying random scaling velocity field for intermediate values of the velocity scaling exponent. These results are compared with the scaling exponents predicted for this model by Kraichnan. Further, we test the recently proposed fusion rules which govern the scaling properties of multi-point correlations, and present results on the linearity of the conditional statistics of the Laplacian operator on the scalar field.Comment: PRL, submitted, 4 pages, 5 figures (not included). Online (HTML) version and PS source of the paper with figures available at http://lvov.weizmann.ac.il/onlinelist.htm

Spectral Polarization and Spectral Phase Control of Time and Energy Entangled Photons

We demonstrate a scheme to spectrally manipulate a collinear, continuous stream of time and energy entangled photons to generate beamlike, bandwidth-limited fuxes of polarization-entangled photons with nearly-degenerate wavelengths. Utilizing an ultrashort-pulse shaper to control the spectral phase and polarization of the photon pairs, we tailor the shape of the Hong-Ou-Mandel interference pattern, demonstrating the rules that govern the dependence of this interference pattern on the spectral phases of the photons. We then use the pulse shaper to generate all four polarization Bell states. The singlet state generated by this scheme forms a very robust decoherence-free subspace, extremely suitable for long distance fiber-optics based quantum communication.Comment: 5 pages, 3 figure

New Dependencies of Hierarchies in Polynomial Optimization

We compare four key hierarchies for solving Constrained Polynomial Optimization Problems (CPOP): Sum of Squares (SOS), Sum of Diagonally Dominant Polynomials (SDSOS), Sum of Nonnegative Circuits (SONC), and the Sherali Adams (SA) hierarchies. We prove a collection of dependencies among these hierarchies both for general CPOPs and for optimization problems on the Boolean hypercube. Key results include for the general case that the SONC and SOS hierarchy are polynomially incomparable, while SDSOS is contained in SONC. A direct consequence is the non-existence of a Putinar-like Positivstellensatz for SDSOS. On the Boolean hypercube, we show as a main result that Schm\"udgen-like versions of the hierarchies SDSOS*, SONC*, and SA* are polynomially equivalent. Moreover, we show that SA* is contained in any Schm\"udgen-like hierarchy that provides a O(n) degree bound.Comment: 26 pages, 4 figure

Post-ISCO Ringdown Amplitudes in Extreme Mass Ratio Inspiral

An extreme mass ratio inspiral consists of two parts: adiabatic inspiral and plunge. The plunge trajectory from the innermost stable circular orbit (ISCO) is special (somewhat independent of initial conditions). We write an expression for its solution in closed-form and for the emitted waveform. In particular we extract an expression for the associated black-hole ringdown amplitudes, and evaluate them numerically.Comment: 21 pages, 5 figures. v4: added section with numerical evaluation of the ringdown amplitude

Relaxation and edge reconstruction in integer quantum Hall systems

The interplay between the confinement potential and electron-electron interactions causes reconstructions of Quantum Hall edges. We study the consequences of this edge reconstruction for the relaxation of hot electrons injected into integer quantum Hall edge states. In translationally invariant edges, the relaxation of hot electrons is governed by three-body collisions which are sensitive to the electron dispersion and thus to reconstruction effects. We show that the relaxation rates are significantly altered in different reconstruction scenarios.Comment: 8 pages, 3 figure

Templates for stellar mass black holes falling into supermassive black holes

The spin modulated gravitational wave signals, which we shall call smirches, emitted by stellar mass black holes tumbling and inspiralling into massive black holes have extremely complicated shapes. Tracking these signals with the aid of pattern matching techniques, such as Wiener filtering, is likely to be computationally an impossible exercise. In this article we propose using a mixture of optimal and non-optimal methods to create a search hierarchy to ease the computational burden. Furthermore, by employing the method of principal components (also known as singular value decomposition) we explicitly demonstrate that the effective dimensionality of the search parameter space of smirches is likely to be just three or four, much smaller than what has hitherto been thought to be about nine or ten. This result, based on a limited study of the parameter space, should be confirmed by a more exhaustive study over the parameter space as well as Monte-Carlo simulations to test the predictions made in this paper.Comment: 12 pages, 4 Tables, 4th LISA symposium, submitted to CQ

Point mutations of the P53 gene, human hepatocellular carcinoma and aflatoxins

The tumor suppressor p53 exerts important protective functions towards DNA-damaging agents. Its inactivation by allelic deletions or point mutations within the P53 gene as well as complex formation of wildtype p53 with cellular or viral proteins is a common and crucial event in carcinogenesis. Mutations increase the half-life of the p53 protein allowing the immunohistochemical detection and anti-p53 antibody formation. Distinct G to T point mutations in codon 249 leading to a substitution of the basic amino acid arginine by the neutral amino acid serin are responsible for the altered functionality of the mutant gene product and were originally identified in 8 of 16 Chinese and 5 of 10 African HCC patients. Both groups are frequently exposed to mycotoxin contaminations of their food. Today an average P53 gene mutation rate of 25% is assumed for high-aflatoxin B1-exposure regions. This is double the rate observed in low-aflatoxin B1-exposure countries. Although many HCC patients displaying P53 mutations also suffer from HBV infection, which itself can lead to rearrangements of P53 coding regions or induce the synthesis of viral proteins possibly interacting with p53, the specific G to T transversion within codon 249 of the P53 gene seems to directly reflect the extent of aflatoxin B1 exposure

Modulus Computational Entropy

The so-called {\em leakage-chain rule} is a very important tool used in many security proofs. It gives an upper bound on the entropy loss of a random variable $X$ in case the adversary who having already learned some random variables $Z_{1},\ldots,Z_{\ell}$ correlated with $X$, obtains some further information $Z_{\ell+1}$ about $X$. Analogously to the information-theoretic case, one might expect that also for the \emph{computational} variants of entropy the loss depends only on the actual leakage, i.e. on $Z_{\ell+1}$. Surprisingly, Krenn et al.\ have shown recently that for the most commonly used definitions of computational entropy this holds only if the computational quality of the entropy deteriorates exponentially in $|(Z_{1},\ldots,Z_{\ell})|$. This means that the current standard definitions of computational entropy do not allow to fully capture leakage that occurred "in the past", which severely limits the applicability of this notion. As a remedy for this problem we propose a slightly stronger definition of the computational entropy, which we call the \emph{modulus computational entropy}, and use it as a technical tool that allows us to prove a desired chain rule that depends only on the actual leakage and not on its history. Moreover, we show that the modulus computational entropy unifies other,sometimes seemingly unrelated, notions already studied in the literature in the context of information leakage and chain rules. Our results indicate that the modulus entropy is, up to now, the weakest restriction that guarantees that the chain rule for the computational entropy works. As an example of application we demonstrate a few interesting cases where our restricted definition is fulfilled and the chain rule holds.Comment: Accepted at ICTS 201