Uniqueness of the electrostatic solution in Schwarzschild space

In this Brief Report we give the proof that the solution of any static test charge distribution in Schwarzschild space is unique. In order to give the proof we derive the first Green's identity written with p-forms on (pseudo) Riemannian manifolds. Moreover, the proof of uniqueness can be shown for either any purely electric or purely magnetic field configuration. The spacetime geometry is not crucial for the proof.Comment: 3 pages, no figures, uses revtex4 style file

Charged Particle Dynamics in the Field of a Slowly Rotating Compact Star

We study the dynamics of a charged particle in the field of a slowly rotating compact star in the gravitoelectromagnetic approximation to the geodesic equation . The star is assumed to be surrounded by an ideal, highly conducting plasma (taken as a magnetohydrodynamic fluid) with a stationary, axially symmetric electromagnetic field. The general relativistic Maxwell equations are solved to obtain the effects of the background spacetime on the electromagnetic field in the linearized Kerr spacetime. The equations of motion are then set up and solved numerically to incorporate the gravitational as well as the electromagnetic effects. The analysis shows that in the slow rotation approximation the frame dragging effects on the electromagnetic field are absent. However the particle is directly effected by the rotating gravitational source such that close to the star the gravitational and electromagnetic field produce contrary effects on the particle's trajectory.Comment: 10 pages, 6 figures in B & W PostScript Forma

The prismatic Sigma 3 (10-10) twin bounday in alpha-Al2O3 investigated by density functional theory and transmission electron microscopy

The microscopic structure of a prismatic $\Sigma 3$ $(10\bar{1}0)$ twin boundary in \aal2o3 is characterized theoretically by ab-initio local-density-functional theory, and experimentally by spatial-resolution electron energy-loss spectroscopy in a scanning transmission electron microscope (STEM), measuring energy-loss near-edge structures (ELNES) of the oxygen $K$-ionization edge. Theoretically, two distinct microscopic variants for this twin interface with low interface energies are derived and analysed. Experimentally, it is demonstrated that the spatial and energetical resolutions of present high-performance STEM instruments are insufficient to discriminate the subtle differences of the two proposed interface variants. It is predicted that for the currently developed next generation of analytical electron microscopes the prismatic twin interface will provide a promising benchmark case to demonstrate the achievement of ELNES with spatial resolution of individual atom columns

The EVN view of the highly variable TeV active galaxy IC 310

Very-high-energy $\gamma$-ray observations of the active galaxy IC 310 with the MAGIC telescopes have revealed fast variability with doubling time scales of less than 4.8min. This implies that the emission region in IC 310 is smaller than 20% of the gravitational radius of the central supermassive black hole with a mass of $3\times 10^8 M_\odot$, which poses serious questions on the emission mechanism and classification of this enigmatic object. We report on the first quasi-simultaneous multi-frequency VLBI observations of IC 310 conducted with the EVN. We find a blazar-like one-sided core-jet structure on parsec scales, constraining the inclination angle to be less than $\sim 20^\circ$ but very small angles are excluded to limit the de-projected length of the large-scale radio jet.Comment: 4 pages, proceedings of the 12th European VLBI Network Symposium and Users Meeting - EVN 2014, 7-10 October 2014, Cagliari, Italy. Published online in PoS, ID.10

Parallel Search with no Coordination

We consider a parallel version of a classical Bayesian search problem. $k$ agents are looking for a treasure that is placed in one of the boxes indexed by $\mathbb{N}^+$ according to a known distribution $p$. The aim is to minimize the expected time until the first agent finds it. Searchers run in parallel where at each time step each searcher can "peek" into a box. A basic family of algorithms which are inherently robust is \emph{non-coordinating} algorithms. Such algorithms act independently at each searcher, differing only by their probabilistic choices. We are interested in the price incurred by employing such algorithms when compared with the case of full coordination. We first show that there exists a non-coordination algorithm, that knowing only the relative likelihood of boxes according to $p$, has expected running time of at most $10+4(1+\frac{1}{k})^2 T$, where $T$ is the expected running time of the best fully coordinated algorithm. This result is obtained by applying a refined version of the main algorithm suggested by Fraigniaud, Korman and Rodeh in STOC'16, which was designed for the context of linear parallel search.We then describe an optimal non-coordinating algorithm for the case where the distribution $p$ is known. The running time of this algorithm is difficult to analyse in general, but we calculate it for several examples. In the case where $p$ is uniform over a finite set of boxes, then the algorithm just checks boxes uniformly at random among all non-checked boxes and is essentially $2$ times worse than the coordinating algorithm.We also show simple algorithms for Pareto distributions over $M$ boxes. That is, in the case where $p(x) \sim 1/x^b$ for $0< b < 1$, we suggest the following algorithm: at step $t$ choose uniformly from the boxes unchecked in ${1, . . . ,min(M, \lfloor t/\sigma\rfloor)}$, where $\sigma = b/(b + k - 1)$. It turns out this algorithm is asymptotically optimal, and runs about $2+b$ times worse than the case of full coordination