Search

The observation of neutron stars enables the otherwise impossible study of fundamental physical processes. The timing of binary radio pulsars is particularly powerful, as it enables precise characterization of their (three-dimensional) positions and orbits. PSR~J0437$-$4715 is an important millisecond pulsar for timing array experiments and is also a primary target for the Neutron Star Interior Composition Explorer (NICER). The main aim of the NICER mission is to constrain the neutron star equation of state by inferring the compactness ($M_p/R$) of the star. Direct measurements of the mass $M_p$ from pulsar timing therefore substantially improve constraints on the radius $R$ and the equation of state. Here we use observations spanning 26 years from Murriyang, the 64-m Parkes radio telescope, to improve the timing model for this pulsar. Among the new precise measurements are the pulsar mass $M_p=1.418\pm 0.044$ $M_{\odot}$, distance $D=156.96 \pm 0.11$ pc, and orbital inclination angle $i=137.506 \pm 0.016^\circ$, which can be used to inform the X-ray pulse profile models inferred from NICER observations. We demonstrate that these results are consistent between multiple data sets from the Parkes Pulsar Timing Array (PPTA), each modeled with different noise assumptions. Using the longest available PPTA data set, we measure an apparent second derivative of the pulsar spin frequency and discuss how this can be explained either by kinematic effects due to the proper motion and radial velocity of the pulsar or excess low-frequency noise such as a gravitational-wave background., Comment: 13 pages, 3 figures, accepted for publication in Astrophysical Journal Letters

The $k$-CombDMR problem is that of determining whether an $n \times n$ distance matrix can be realised by $n$ vertices in some undirected graph with $n + k$ vertices. This problem has a simple solution in the case $k=0$. In this paper we show that this problem is polynomial time solvable for $k=1$ and $k=2$. Moreover, we provide algorithms to construct such graph realisations by solving appropriate 2-SAT instances. In the case where $k \geq 3$, this problem is NP-complete. We show this by a reduction of the $k$-colourability problem to the $k$-CombDMR problem. Finally, we discuss the simpler polynomial time solvable problem of tree realisability for a given distance matrix., Comment: 27 pages, 5 figures

We present a catalog of hard X-ray serendipitous sources detected in the first 80 months of observations by the Nuclear Spectroscopic Telescope Array (NuSTAR). The NuSTAR serendipitous survey 80-month (NSS80) catalog has an unprecedented $\sim$ 62 Ms of effective exposure time over 894 unique fields (a factor of three increase over the 40-month catalog), with an areal coverage of $\sim $36 deg$^2$, larger than all NuSTAR extragalactic surveys. NSS80 provides 1274 hard X-ray sources in the $3-24$ keV band (822 new detections compared to the previous 40-month catalog). Approximately 76% of the NuSTAR sources have lower-energy ($<10$ keV) X-ray counterparts from Chandra, XMM-Newton, and Swift-XRT. We have undertaken an extensive campaign of ground-based spectroscopic follow-up to obtain new source redshifts and classifications for 427 sources. Combining these with existing archival spectroscopy provides redshifts for 550 NSS80 sources, of which 547 are classified. The sample is primarily composed of active galactic nuclei (AGN), detected over a large range in redshift ($z$ = 0.012-3.43), but also includes 58 spectroscopically confirmed Galactic sources. In addition, five AGN/galaxy pairs, one dual AGN system, one BL Lac candidate, and a hotspot of 4C 74.26 (radio quasar) have been identified. The median rest-frame $10-40$ keV luminosity and redshift of the NSS80 are $\langle{L_\mathrm{10-40 keV}}\rangle$ = 1.2 $\times$ 10$^{44}$ erg s$^{-1}$ and $\langle z \rangle = 0.56$. We investigate the optical properties and construct composite optical spectra to search for subtle signatures not present in the individual spectra, finding an excess of redder BL AGN compared to optical quasar surveys predominantly due to the presence of the host-galaxy and, at least in part, due to dust obscuration., Comment: Accepted for publication in ApJ:S. 57 pages, 32 figures

We consider random simple temporal graphs in which every edge of the complete graph $K_n$ appears once within the time interval [0,1] independently and uniformly at random. Our main result is a sharp threshold on the size of any maximum $\delta$-clique (namely a clique with edges appearing at most $\delta$ apart within [0,1]) in random instances of this model, for any constant~$\delta$. In particular, using the probabilistic method, we prove that the size of a maximum $\delta$-clique is approximately $\frac{2\log{n}}{\log{\frac{1}{\delta}}}$ with high probability (whp). What seems surprising is that, even though the random simple temporal graph contains $\Theta(n^2)$ overlapping $\delta$-windows, which (when viewed separately) correspond to different random instances of the Erdos-Renyi random graphs model, the size of the maximum $\delta$-clique in the former model and the maximum clique size of the latter are approximately the same. Furthermore, we show that the minimum interval containing a $\delta$-clique is $\delta-o(\delta)$ whp. We use this result to show that any polynomial time algorithm for $\delta$-TEMPORAL CLIQUE is unlikely to have very large probability of success.

In this paper, we study the complexity of the \textit{periodic temporal graph realization} problem with respect to upper bounds on the fastest path durations among its vertices. This constraint with respect to upper bounds appears naturally in transportation network design applications where, for example, a road network is given, and the goal is to appropriately schedule periodic travel routes, while not exceeding some desired upper bounds on the travel times. This approach is in contrast to verification applications of the graph realization problems, where exact values for the distances (respectively, fastest travel times) are given, following some kind of precise measurement. In our work, we focus only on underlying tree topologies, which are fundamental in many transportation network applications. As it turns out, the periodic upper-bounded temporal tree realization problem (TTR) has a very different computational complexity behavior than both (i) the classic graph realization problem with respect to shortest path distances in static graphs and (ii) the periodic temporal graph realization problem with exact given fastest travel times (which was recently introduced). First, we prove that, surprisingly, TTR is NP-hard, even for a constant period $\Delta$ and when the input tree $G$ satisfies at least one of the following conditions: (a) $G$ has a constant diameter, or (b) $G$ has constant maximum degree. In contrast, when we are given exact values of the fastest travel delays, the problem is known to be solvable in polynomial time. Second, we prove that TTR is fixed-parameter tractable (FPT) with respect to the number of leaves in the input tree $G$, via a novel combination of techniques for totally unimodular matrices and mixed integer linear programming.

Multiband superconductors have featured one of the main challenges to achieve a comprehensive understanding of unconventional superconductivity. Here, the multiband character is studied separately as orbital and sublattice degrees of freedom, as they have different effects for the superconducting and magnetic or charge orders. We build on the framework of the matrix random-phase approximation (RPA), which accounts for the RPA Feynman diagrams and also vertex corrections, to treat the electron-electron interactions in an off-site degenerate Hubbard model. As a result, systems without a sublattice degree of freedom tend to be dominated by spin fluctuations, while systems with multiple sublattice sites and orbitals have the charge fluctuations favored. Finally, we explicitly demonstrate that the known suppression of the superconducting pairing strength $\lambda$ by spin fluctuations from repulsive interactions at zero momentum transfer $\boldsymbol{q}$ is countered by the finite-$\boldsymbol{q}$ pairing, which always improves $\lambda$., Comment: 10 + 6 pages, 2 figures

The network-based study of financial systems has received considerable attention in recent years but has seldom explicitly incorporated the dynamic aspects of such systems. We consider this problem setting from the temporal point of view and introduce the Interval Debt Model (IDM) and some scheduling problems based on it, namely: Bankruptcy Minimization/Maximization, in which the aim is to produce a payment schedule with at most/at least a given number of bankruptcies; Perfect Scheduling, the special case of the minimization variant where the aim is to produce a schedule with no bankruptcies (that is, a perfect schedule); and Bailout Minimization, in which a financial authority must allocate a smallest possible bailout package to enable a perfect schedule. We show that each of these problems is NP-complete, in many cases even on very restricted input instances. On the positive side, we provide for Perfect Scheduling a polynomial-time algorithm on (rooted) out-trees although in contrast we prove NP-completeness on directed acyclic graphs, as well as on instances with a constant number of nodes (and hence also constant treewidth). When we allow non-integer payments, we show by a linear programming argument that the problem Bailout Minimization can be solved in polynomial time., Comment: 30 pages, 17 figures

The paper is an attempt to apply the theory of dessins d'enfants to the theory of fullerenes. The classical results concerning the calculation of the dodecahedron Belyi function are presented and then applied to the calculation of the Belyi function of the barrel, and the euclidean geometry of the latter is investigated. The non-existence of the fullerene with the only hexagonal face is established by the methods of dessins d'enfants.

Magic-angle twisted bilayer graphene (MATBG) has been extensively explored both theoretically and experimentally as a suitable platform for a rich and tunable phase diagram that includes ferromagnetism, charge order, broken symmetries, and unconventional superconductivity. In this work, we investigate the intricate interplay between long-range electron-electron interactions, spin fluctuations, and superconductivity in MATBG. By employing a low-energy model for MATBG that captures the correct shape of the flat bands, we explore the effects of short- and long-range interactions on spin fluctuations and their impact on the superconducting (SC) pairing vertex in the Random Phase Approximation (RPA). We find that the SC state is notably influenced by the strength of long-range Coulomb interactions. Interestingly, our RPA calculations indicate that there is a regime where the system can traverse from a magnetic phase to the SC phase by \emph{increasing} the relative strength of long-range interactions compared to the on-site ones. These findings underscore the relevance of electron-electron interactions in shaping the intriguing properties of MATBG and offer a pathway for designing and controlling its SC phase., Comment: Revised and expanded version. 11 pages, 7 figures

We argue that if axions are the dark matter, their coupling to electromagnetism results in exponential growth of a helical magnetic field when the axion field first rolls down its potential. After an inverse cascade, the relevant length scales to day are of order 10-100 kpc, of astrophysical interest. Our mechanism for allowing the field to grow relies on a nuance of MHD. Faraday's Law says that an electric field is needed to create a magnetic field. Previous authors relied on conventional Ohm's law to calculate E, but the resistivity is negligible and therefore they assume E is as well. We use a modified Ohm's Law that includes the effects of self-induction in limiting the current driven by a given E, which allows a magnetic field to grow.

April 2024 The US Department of Agriculture's (USDA) Environmental Quality Incentives Program (EQIP) provides subsidies and technical assistance to encourage farmers to adopt new technologies and practices for soil and [...]

The noise in millisecond pulsar (MSP) timing data can include contributions from observing instruments, the interstellar medium, the solar wind, solar system ephemeris errors, and the pulsars themselves. The noise environment must be accurately characterized in order to form the null hypothesis from which signal models can be compared, including the signature induced by nanohertz-frequency gravitational waves (GWs). Here we describe the noise models developed for each of the MSPs in the Parkes Pulsar Timing Array (PPTA) third data release, which have been used as the basis of a search for the isotropic stochastic GW background. We model pulsar spin noise, dispersion measure variations, scattering variations, events in the pulsar magnetospheres, solar wind variability, and instrumental effects. We also search for new timing model parameters and detected Shapiro delays in PSR~J0614$-$3329 and PSR~J1902$-$5105. The noise and timing models are validated by testing the normalized and whitened timing residuals for Gaussianity and residual correlations with time. We demonstrate that the choice of noise models significantly affects the inferred properties of a common-spectrum process. Using our detailed models, the recovered common-spectrum noise in the PPTA is consistent with a power law with a spectral index of $\gamma=13/3$, the value predicted for a stochastic GW background from a population of supermassive black hole binaries driven solely by GW emission., Comment: 18 pages, 10 figures. Accepted for publication in ApJL

Pulsar timing arrays aim to detect nanohertz-frequency gravitational waves (GWs). A background of GWs modulates pulsar arrival times and manifests as a stochastic process, common to all pulsars, with a signature spatial correlation. Here we describe a search for an isotropic stochastic gravitational-wave background (GWB) using observations of 30 millisecond pulsars from the third data release of the Parkes Pulsar Timing Array (PPTA), which spans 18 years. Using current Bayesian inference techniques we recover and characterize a common-spectrum noise process. Represented as a strain spectrum $h_c = A(f/1 {\rm yr}^{-1})^{\alpha}$, we measure $A=3.1^{+1.3}_{-0.9} \times 10^{-15}$ and $\alpha=-0.45 \pm 0.20$ respectively (median and 68% credible interval). For a spectral index of $\alpha=-2/3$, corresponding to an isotropic background of GWs radiated by inspiraling supermassive black hole binaries, we recover an amplitude of $A=2.04^{+0.25}_{-0.22} \times 10^{-15}$. However, we demonstrate that the apparent signal strength is time-dependent, as the first half of our data set can be used to place an upper limit on $A$ that is in tension with the inferred common-spectrum amplitude using the complete data set. We search for spatial correlations in the observations by hierarchically analyzing individual pulsar pairs, which also allows for significance validation through randomizing pulsar positions on the sky. For a process with $\alpha=-2/3$, we measure spatial correlations consistent with a GWB, with an estimated false-alarm probability of $p \lesssim 0.02$ (approx. $2\sigma$). The long timing baselines of the PPTA and the access to southern pulsars will continue to play an important role in the International Pulsar Timing Array., Comment: 19 pages, 10 figures, Accepted for publication in ApJL