Non-Abelian Tensor Multiplet Equations from Twistor Space

We establish a Penrose-Ward transform yielding a bijection between holomorphic principal 2-bundles over a twistor space and non-Abelian self-dual tensor fields on six-dimensional flat space-time. Extending the twistor space to supertwistor space, we derive sets of manifestly N=(1,0) and N=(2,0) supersymmetric non-Abelian constraint equations containing the tensor multiplet. We also demonstrate how this construction leads to constraint equations for non-Abelian supersymmetric self-dual strings.Comment: v3: 23 pages, revised version published in Commun. Math. Phy

Prolongations of Geometric Overdetermined Systems

We show that a wide class of geometrically defined overdetermined semilinear partial differential equations may be explicitly prolonged to obtain closed systems. As a consequence, in the case of linear equations we extract sharp bounds on the dimension of the solution space.Comment: 22 pages. In the second version, a comparison with the classical theory of prolongations was added. In this third version more details were added concerning our construction and especially the use of Kostant's computation of Lie algebra cohomolog

Rendezvous of Distance-aware Mobile Agents in Unknown Graphs

We study the problem of rendezvous of two mobile agents starting at distinct locations in an unknown graph. The agents have distinct labels and walk in synchronous steps. However the graph is unlabelled and the agents have no means of marking the nodes of the graph and cannot communicate with or see each other until they meet at a node. When the graph is very large we want the time to rendezvous to be independent of the graph size and to depend only on the initial distance between the agents and some local parameters such as the degree of the vertices, and the size of the agent's label. It is well known that even for simple graphs of degree $\Delta$, the rendezvous time can be exponential in $\Delta$ in the worst case. In this paper, we introduce a new version of the rendezvous problem where the agents are equipped with a device that measures its distance to the other agent after every step. We show that these \emph{distance-aware} agents are able to rendezvous in any unknown graph, in time polynomial in all the local parameters such the degree of the nodes, the initial distance $D$ and the size of the smaller of the two agent labels $l = \min(l_1, l_2)$. Our algorithm has a time complexity of $O(\Delta(D+\log{l}))$ and we show an almost matching lower bound of $\Omega(\Delta(D+\log{l}/\log{\Delta}))$ on the time complexity of any rendezvous algorithm in our scenario. Further, this lower bound extends existing lower bounds for the general rendezvous problem without distance awareness

Conformal Einstein equations and Cartan conformal connection

Necessary and sufficient conditions for a space-time to be conformal to an Einstein space-time are interpreted in terms of curvature restrictions for the corresponding Cartan conformal connection

Harmonic Superspaces in Low Dimensions

Harmonic superspaces for spacetimes of dimension $d\leq 3$ are constructed. Some applications are given.Comment: 16, kcl-th-94-15. Two further references have been added (12 and 13) and a few typographical errors have been correcte

Differential Calculi on Some Quantum Prehomogeneous Vector Spaces

This paper is devoted to study of differential calculi over quadratic algebras, which arise in the theory of quantum bounded symmetric domains. We prove that in the quantum case dimensions of the homogeneous components of the graded vector spaces of k-forms are the same as in the classical case. This result is well-known for quantum matrices. The quadratic algebras, which we consider in the present paper, are q-analogues of the polynomial algebras on prehomogeneous vector spaces of commutative parabolic type. This enables us to prove that the de Rham complex is isomorphic to the dual of a quantum analogue of the generalized Bernstein-Gelfand-Gelfand resolution.Comment: LaTeX2e, 51 pages; changed conten

Two dimensional Sen connections and quasi-local energy-momentum

The recently constructed two dimensional Sen connection is applied in the problem of quasi-local energy-momentum in general relativity. First it is shown that, because of one of the two 2 dimensional Sen--Witten identities, Penrose's quasi-local charge integral can be expressed as a Nester--Witten integral.Then, to find the appropriate spinor propagation laws to the Nester--Witten integral, all the possible first order linear differential operators that can be constructed only from the irreducible chiral parts of the Sen operator alone are determined and examined. It is only the holomorphy or anti-holomorphy operator that can define acceptable propagation laws. The 2 dimensional Sen connection thus naturally defines a quasi-local energy-momentum, which is precisely that of Dougan and Mason. Then provided the dominant energy condition holds and the 2-sphere S is convex we show that the next statements are equivalent: i. the quasi-local mass (energy-momentum) associated with S is zero; ii.the Cauchy development $D(\Sigma)$ is a pp-wave geometry with pure radiation ($D(\Sigma)$ is flat), where $\Sigma$ is a spacelike hypersurface whose boundary is S; iii. there exist a Sen--constant spinor field (two spinor fields) on S. Thus the pp-wave Cauchy developments can be characterized by the geometry of a two rather than a three dimensional submanifold.Comment: 20 pages, Plain Tex, I

The kernel of the edth operators on higher-genus spacelike two-surfaces

The dimension of the kernels of the edth and edth-prime operators on closed, orientable spacelike 2-surfaces with arbitrary genus is calculated, and some of its mathematical and physical consequences are discussed.Comment: 12 page

L∞L_\infty-Algebras, the BV Formalism, and Classical Fields

We summarise some of our recent works on $L_\infty$-algebras and quasi-groups with regard to higher principal bundles and their applications in twistor theory and gauge theory. In particular, after a lightning review of $L_\infty$-algebras, we discuss their Maurer-Cartan theory and explain that any classical field theory admitting an action can be reformulated in this context with the help of the Batalin-Vilkovisky formalism. As examples, we explore higher Chern-Simons theory and Yang-Mills theory. We also explain how these ideas can be combined with those of twistor theory to formulate maximally superconformal gauge theories in four and six dimensions by means of $L_\infty$-quasi-isomorphisms, and we propose a twistor space action.Comment: 19 pages, Contribution to Proceedings of LMS/EPSRC Durham Symposium Higher Structures in M-Theory, August 201

Gathering in Dynamic Rings

The gathering problem requires a set of mobile agents, arbitrarily positioned at different nodes of a network to group within finite time at the same location, not fixed in advanced. The extensive existing literature on this problem shares the same fundamental assumption: the topological structure does not change during the rendezvous or the gathering; this is true also for those investigations that consider faulty nodes. In other words, they only consider static graphs. In this paper we start the investigation of gathering in dynamic graphs, that is networks where the topology changes continuously and at unpredictable locations. We study the feasibility of gathering mobile agents, identical and without explicit communication capabilities, in a dynamic ring of anonymous nodes; the class of dynamics we consider is the classic 1-interval-connectivity. We focus on the impact that factors such as chirality (i.e., a common sense of orientation) and cross detection (i.e., the ability to detect, when traversing an edge, whether some agent is traversing it in the other direction), have on the solvability of the problem. We provide a complete characterization of the classes of initial configurations from which the gathering problem is solvable in presence and in absence of cross detection and of chirality. The feasibility results of the characterization are all constructive: we provide distributed algorithms that allow the agents to gather. In particular, the protocols for gathering with cross detection are time optimal. We also show that cross detection is a powerful computational element. We prove that, without chirality, knowledge of the ring size is strictly more powerful than knowledge of the number of agents; on the other hand, with chirality, knowledge of n can be substituted by knowledge of k, yielding the same classes of feasible initial configurations