Fermionic entanglement ambiguity in non-inertial frames

We analyse an ambiguity in previous works on entanglement of fermionic fields in non-inertial frames. This ambiguity, related to the anticommutation properties of field operators, leads to non-unique results when computing entanglement measures for the same state. We show that the ambiguity disappears when we introduce detectors, which are in any case necessary as a means to probe the field entanglement.Comment: 9 pages, 4 figures. Revtex 4.1, added Journal referenc

Unified life detection system: A concept

Systematic investigation of techniques and hardware which could be utilized in life detection system has resulted in identification of group of candidate concepts and selection of "unified system". Theme of concept permits greatest flexibility in procedural details for experiments which can be performed in individual ampules

Complete Reducibility and Commuting Subgroups

Let G be a reductive linear algebraic group over an algebraically closed field of characteristic p. We study J.-P. Serre's notion of G-complete reducibility for subgroups of G. In particular, for a subgroup H and a normal subgroup N of H, we look at the relationship between G-complete reducibility of N and of H, and show that these properties are equivalent if H/N is linearly reductive, generalizing a result of Serre. We also study the case when H = MN with M a G-completely reducible subgroup of G which normalizes N. We show that if G is connected, N and M are connected commuting G-completely reducible subgroups of G, and p is good for G, then H = MN is also G-completely reducible.Comment: 21 pages; to appear in J. Reine Angew. Math. final for

Voyager Mars planetary quarantine Basic math model report

Basic math model study of planetary quarantine effects on Voyager Mars missio

Exact and Fast Numerical Algorithms for the Stochastic Wave Equation

On the basis of integral representations we propose fast numerical methods to solve the Cauchy problem for the stochastic wave equation without boundaries and with the Dirichlet boundary conditions. The algorithms are exact in a probabilistic sense