Search

We provide a characterisation of the Kerr spacetime close to future null infinity using the asymptotic characteristic initial value problem in a conformally compactified spacetime. Stewart's gauge is used to set up the past-oriented characteristic initial value problem. By a theorem of M. Mars characterising the Kerr spacetime, we provide conditions for the existence of an asymptotically timelike Killing vector on the development of the initial data by demanding that the spacetime is endowed with a Killing spinor. The conditions on the characteristic initial data ensuring the existence of a Killing spinor are, in turn, analysed. Finally, we write the conditions on the initial data in terms of the free data in the characteristic initial value problem. As a result, we characterise the Kerr spacetime using only a section of future null infinity and its intersection with an outgoing null hypersurface., Comment: 46 pages. All comments welcome

Creating new air combat tactics and discovering novel maneuvers can require numerous hours of expert pilots' time. Additionally, for each different combat scenario, the same strategies may not work since small changes in equipment performance may drastically change the air combat outcome. For this reason, we created a reinforcement learning environment to help investigate potential air combat tactics in the field of beyond-visual-range (BVR) air combat: the BVR Gym. This type of air combat is important since long-range missiles are often the first weapon to be used in aerial combat. Some existing environments provide high-fidelity simulations but are either not open source or are not adapted to the BVR air combat domain. Other environments are open source but use less accurate simulation models. Our work provides a high-fidelity environment based on the open-source flight dynamics simulator JSBSim and is adapted to the BVR air combat domain. This article describes the building blocks of the environment and some use cases., Comment: 8 pages, 8 figures

We explicitly construct the analogue of the \v{d}Alembert solution to the 1+1 wave equation in an hyperboloidal setting. This hyperboloidal \v{d}Alembert solution is used, in turn, to gain intuition into the behaviour of solutions to the wave equation in a hyperboloidal foliation and to explain some apparently anomalous behaviour observed in numerically constructed solutions discussed in the literature., Comment: 21 pages, 10 figures; Amended to accommodate for referees requests and published version: important typo in Eqs.(12,13) corrected, and Appendix added with further examples in different hyperboloidal coordinate charts; Part of the topical collection "Hyperboloidal foliations in the era of gravitational-wave astronomy: from mathematical relativity to astrophysics"

The hardware for data archiving has expanded capacities for digital storage enormously in the past decade or more. This article charts the efforts of IUCr to facilitate discussions and plans relating to raw data archiving and reuse within the various communities of crystallography, diffraction, and scattering., Comment: 34 pages, 2 figures, 2 tables

As the effective range of air-to-air missiles increases, it becomes harder for human operators to maintain the situational awareness needed to keep a UAV safe. In this work, we propose a decision support tool to help UAV operators in Beyond Visual Range (BVR) air combat scenarios assess the risks of different options and make decisions based on those. Earlier work focused on the threat posed by a single missile, and in this work, we extend the ideas to several missile threats. The proposed method uses Deep Neural Networks (DNN) to learn from high-fidelity simulations to provide the operator with an outcome estimate for a set of different strategies. Our results demonstrate that the proposed system can manage multiple incoming missiles, evaluate a family of options, and recommend the least risky course of action.

Future brain-machine interfaces, prosthetics, and intelligent soft robotics will require integrating artificial neuromorphic devices with biological systems. Due to their poor biocompatibility, circuit complexity, low energy efficiency, and operating principles fundamentally different from the ion signal modulation of biology, traditional Silicon-based neuromorphic implementations have limited bio-integration potential. Here, we report the first organic electrochemical neurons (OECNs) with ion-modulated spiking, based on allprinted complementary organic electrochemical transistors. We demonstrate facile biointegration of OECNs with Venus Flytrap (Dionaea muscipula) to induce lobe closure upon input stimuli. The OECNs can also be integrated with all-printed organic electrochemical synapses (OECSs), exhibiting short-term plasticity with paired-pulse facilitation and longterm plasticity with retention >1000 s, facilitating Hebbian learning. These soft and flexible OECNs operate below 0.6 V and respond to multiple stimuli, defining a new vista for localized artificial neuronal systems possible to integrate with bio-signaling systems of plants, invertebrates, and vertebrates.

For asymptotically flat spacetimes, a conjecture by Strominger states that asymptotic BMS-supertranslations and their associated charges at past null infinity $\mathscr{I}^{-}$ can be related to those at future null infinity $\mathscr{I}^{+}$ via an antipodal map at spatial infinity $i^{0}$. We analyse the validity of this conjecture using Friedrich's formulation of spatial infinity, which gives rise to a regular initial value problem for the conformal field equations at spatial infinity. A central structure in this analysis is the cylinder at spatial infinity representing a blow-up of the standard spatial infinity point $i^{0}$ to a 2-sphere. The cylinder touches past and future null infinities $\mathscr{I}^{\pm}$ at the critical sets. We show that for a generic class of asymptotically Euclidean and regular initial data, BMS-supertranslation charges are not well-defined at the critical sets unless the initial data satisfies an extra regularity condition. We also show that given initial data that satisfy the regularity condition, BMS-supertranslation charges at the critical sets are fully determined by the initial data and that the relation between the charges at past null infinity and those at future null infinity directly follows from our regularity condition., Comment: 59 pages, no figures (Change made to agree with the peer-reviewed article. Approved for publication in the Journal of Mathematical Physics)

We prove a new geometric inequality that relates the Arnowitt-Deser-Misner mass of initial data to a quasilocal angular momentum of a marginally future trapped surface inner boundary. The inequality is expressed in terms of a 1-spinor, which satisfies an intrinsic first-order Dirac-type equation. Furthermore, we show that if the initial data is axisymmetric, then the divergence-free vector used to define the quasilocal angular momentum cannot be a Killing field of the generic boundary., Comment: 13 pages

The celebrated notion of important separators bounds the number of small $(S,T)$-separators in a graph which are 'farthest from $S$' in a technical sense. In this paper, we introduce a generalization of this powerful algorithmic primitive that is phrased in terms of $k$-secluded vertex sets: sets with an open neighborhood of size at most $k$. In this terminology, the bound on important separators says that there are at most $4^k$ maximal $k$-secluded connected vertex sets $C$ containing $S$ but disjoint from $T$. We generalize this statement significantly: even when we demand that $G[C]$ avoids a finite set $\mathcal{F}$ of forbidden induced subgraphs, the number of such maximal subgraphs is $2^{O(k)}$ and they can be enumerated efficiently. This allows us to make significant improvements for two problems from the literature. Our first application concerns the 'Connected $k$-Secluded $\mathcal{F}$-free subgraph' problem, where $\mathcal{F}$ is a finite set of forbidden induced subgraphs. Given a graph in which each vertex has a positive integer weight, the problem asks to find a maximum-weight connected $k$-secluded vertex set $C \subseteq V(G)$ such that $G[C]$ does not contain an induced subgraph isomorphic to any $F \in \mathcal{F}$. The parameterization by $k$ is known to be solvable in triple-exponential time via the technique of recursive understanding, which we improve to single-exponential. Our second application concerns the deletion problem to scattered graph classes. Here, the task is to find a vertex set of size at most $k$ whose removal yields a graph whose each connected component belongs to one of the prescribed graph classes $\Pi_1, \ldots, \Pi_d$. We obtain a single-exponential algorithm whenever each class $\Pi_i$ is characterized by a finite number of forbidden induced subgraphs. This generalizes and improves upon earlier results in the literature., Comment: To appear at ISAAC'23

The notion of $\mathcal{H}$-treewidth, where $\mathcal{H}$ is a hereditary graph class, was recently introduced as a generalization of the treewidth of an undirected graph. Roughly speaking, a graph of $\mathcal{H}$-treewidth at most $k$ can be decomposed into (arbitrarily large) $\mathcal{H}$-subgraphs which interact only through vertex sets of size $O(k)$ which can be organized in a tree-like fashion. $\mathcal{H}$-treewidth can be used as a hybrid parameterization to develop fixed-parameter tractable algorithms for $\mathcal{H}$-deletion problems, which ask to find a minimum vertex set whose removal from a given graph $G$ turns it into a member of $\mathcal{H}$. The bottleneck in the current parameterized algorithms lies in the computation of suitable tree $\mathcal{H}$-decompositions. We present FPT approximation algorithms to compute tree $\mathcal{H}$-decompositions for hereditary and union-closed graph classes $\mathcal{H}$. Given a graph of $\mathcal{H}$-treewidth $k$, we can compute a 5-approximate tree $\mathcal{H}$-decomposition in time $f(O(k)) \cdot n^{O(1)}$ whenever $\mathcal{H}$-deletion parameterized by solution size can be solved in time $f(k) \cdot n^{O(1)}$ for some function $f(k) \geq 2^k$. The current-best algorithms either achieve an approximation factor of $k^{O(1)}$ or construct optimal decompositions while suffering from non-uniformity with unknown parameter dependence. Using these decompositions, we obtain algorithms solving Odd Cycle Transversal in time $2^{O(k)} \cdot n^{O(1)}$ parameterized by $\mathsf{bipartite}$-treewidth and Vertex Planarization in time $2^{O(k \log k)} \cdot n^{O(1)}$ parameterized by $\mathsf{planar}$-treewidth, showing that these can be as fast as the solution-size parameterizations and giving the first ETH-tight algorithms for parameterizations by hybrid width measures., Comment: Conference version to appear at the European Symposium on Algorithms (ESA 2023)

Within the next decade the Laser Interferometer Space Antenna (LISA) is due to be launched, providing the opportunity to extract physics from stellar objects and systems, such as \textit{Extreme Mass Ratio Inspirals}, (EMRIs) otherwise undetectable to ground based interferometers and Pulsar Timing Arrays (PTA). Unlike previous sources detected by the currently available observational methods, these sources can \textit{only} be simulated using an accurate computation of the gravitational self-force. Whereas the field has seen outstanding progress in the frequency domain, metric reconstruction and self-force calculations are still an open challenge in the time domain. Such computations would not only further corroborate frequency domain calculations and models, but also allow for full self-consistent evolution of the orbit under the effect of the self-force. Given we have \textit{a priori} information about the local structure of the discontinuity at the particle, we will show how to construct discontinuous spatial and temporal discretisations by operating on discontinuous Lagrange and Hermite interpolation formulae and hence recover higher order accuracy. In this work we demonstrate how this technique in conjunction with well-suited gauge choice (hyperboloidal slicing) and numerical (discontinuous collocation with time symmetric) methods can provide a relatively simple method of lines numerical algorithm to the problem. This is the first of a series of papers studying the behaviour of a point-particle prescribing circular geodesic motion in Schwarzschild in the \textit{time domain}. In this work we describe the numerical machinery necessary for these computations and show not only our work is capable of highly accurate flux radiation measurements but it also shows suitability for evaluation of the necessary field and it's derivatives at the particle limit., Comment: 37 pages; Corrected to accommodate for valuable feedback from the referee; Minor typos corrected in Appendix B