On the Existence of Dynamics of Wheeler-Feynman Electromagnetism

We study the equations of Wheeler-Feynman electrodynamics which is an action-at-a-distance theory about world-lines of charges that interact through their corresponding advanced and retarded Li\'enard-Wiechert field terms. The equations are non-linear, neutral, and involve time-like advanced as well as retarded arguments of unbounded delay. Using a reformulation in terms of Maxwell-Lorentz electrodynamics without self-interaction, which we have introduced in a preceding work, we are able to establish the existence of conditional solutions. These are solutions that solve the Wheeler-Feynman equations on any finite time interval with prescribed continuations outside of this interval. As a byproduct we also prove existence and uniqueness of solutions to the Synge equations on the time half-line for a given history of charge trajectories.Comment: 45 pages, introduction revised, typos corrected, explanations adde

A microscopic derivation of the quantum mechanical formal scattering cross section

We prove that the empirical distribution of crossings of a "detector'' surface by scattered particles converges in appropriate limits to the scattering cross section computed by stationary scattering theory. Our result, which is based on Bohmian mechanics and the flux-across-surfaces theorem, is the first derivation of the cross section starting from first microscopic principles.Comment: 28 pages, v2: Typos corrected, layout improved, v3: Typos corrected. Accepted for publication in Comm. Math. Phy

Maxwell-Lorentz Dynamics of Rigid Charges

We establish global existence and uniqueness of the dynamics of classical electromagnetism with extended, rigid charges and fields which need not to be square integrable. We consider also a modified theory of electromagnetism where no self-fields occur. That theory and our results are crucial for approaching the as yet unsolved problem of the general existence of dynamics of Wheeler Feynman electromagnetism, which we shall address in the follow up paper.Comment: 32 pages, revised Introduction, typos correcte

Reciprocity in Social Networks with Capacity Constraints

Directed links -- representing asymmetric social ties or interactions (e.g., "follower-followee") -- arise naturally in many social networks and other complex networks, giving rise to directed graphs (or digraphs) as basic topological models for these networks. Reciprocity, defined for a digraph as the percentage of edges with a reciprocal edge, is a key metric that has been used in the literature to compare different directed networks and provide "hints" about their structural properties: for example, are reciprocal edges generated randomly by chance or are there other processes driving their generation? In this paper we study the problem of maximizing achievable reciprocity for an ensemble of digraphs with the same prescribed in- and out-degree sequences. We show that the maximum reciprocity hinges crucially on the in- and out-degree sequences, which may be intuitively interpreted as constraints on some "social capacities" of nodes and impose fundamental limits on achievable reciprocity. We show that it is NP-complete to decide the achievability of a simple upper bound on maximum reciprocity, and provide conditions for achieving it. We demonstrate that many real networks exhibit reciprocities surprisingly close to the upper bound, which implies that users in these social networks are in a sense more "social" than suggested by the empirical reciprocity alone in that they are more willing to reciprocate, subject to their "social capacity" constraints. We find some surprising linear relationships between empirical reciprocity and the bound. We also show that a particular type of small network motifs that we call 3-paths are the major source of loss in reciprocity for real networks

Span programs and quantum algorithms for st-connectivity and claw detection

We introduce a span program that decides st-connectivity, and generalize the span program to develop quantum algorithms for several graph problems. First, we give an algorithm for st-connectivity that uses O(n d^{1/2}) quantum queries to the n x n adjacency matrix to decide if vertices s and t are connected, under the promise that they either are connected by a path of length at most d, or are disconnected. We also show that if T is a path, a star with two subdivided legs, or a subdivision of a claw, its presence as a subgraph in the input graph G can be detected with O(n) quantum queries to the adjacency matrix. Under the promise that G either contains T as a subgraph or does not contain T as a minor, we give O(n)-query quantum algorithms for detecting T either a triangle or a subdivision of a star. All these algorithms can be implemented time efficiently and, except for the triangle-detection algorithm, in logarithmic space. One of the main techniques is to modify the st-connectivity span program to drop along the way "breadcrumbs," which must be retrieved before the path from s is allowed to enter t.Comment: 18 pages, 4 figure

Training Induced Positive Exchange Bias in NiFe/IrMn Bilayers

Positive exchange bias has been observed in the Ni$_{81}$Fe$_{19}$/Ir$_{20}$Mn$_{80}$ bilayer system via soft x-ray resonant magnetic scattering. After field cooling of the system through the blocking temperature of the antiferromagnet, an initial conventional negative exchange bias is removed after training i. e. successive magnetization reversals, resulting in a positive exchange bias for a temperature range down to 30 K below the blocking temperature (450 K). This new manifestation of magnetic training is discussed in terms of metastable magnetic disorder at the magnetically frustrated interface during magnetization reversal.Comment: 4 pages, 3 figure

Bohmian Mechanics and Quantum Information

Many recent results suggest that quantum theory is about information, and that quantum theory is best understood as arising from principles concerning information and information processing. At the same time, by far the simplest version of quantum mechanics, Bohmian mechanics, is concerned, not with information but with the behavior of an objective microscopic reality given by particles and their positions. What I would like to do here is to examine whether, and to what extent, the importance of information, observation, and the like in quantum theory can be understood from a Bohmian perspective. I would like to explore the hypothesis that the idea that information plays a special role in physics naturally emerges in a Bohmian universe.Comment: 25 pages, 2 figure