Geodesic systems of tunnels in hyperbolic 3-manifolds

It is unknown whether an unknotting tunnel is always isotopic to a geodesic in a finite volume hyperbolic 3-manifold. In this paper, we address the generalization of this problem to hyperbolic 3-manifolds admitting tunnel systems. We show that there exist finite volume hyperbolic 3-manifolds with a single cusp, with a system of at least two tunnels, such that all but one of the tunnels come arbitrarily close to self-intersecting. This gives evidence that systems of unknotting tunnels may not be isotopic to geodesics in tunnel number n manifolds. In order to show this result, we prove there is a geometrically finite hyperbolic structure on a (1;n)-compression body with a system of core tunnels such that all but one of the core tunnels self-intersect.Comment: 19 pages, 4 figures. V2 contains minor updates to references and exposition. To appear in Algebr. Geom. Topo

Phase Lags in the Optical-Infrared Light Curves of AGB Stars

To search for phase lags in the optical-infrared light curves of asymptotic giant branch stars, we have compared infrared data from the COBE DIRBE satellite with optical light curves from the AAVSO and other sources. We found 17 examples of phase lags in the time of maximum in the infrared vs. that in the optical, and 4 stars with no observed lags. There is a clear difference between the Mira variables and the semi-regulars in the sample, with the maximum in the optical preceding that in the near-infrared in the Miras, while in most of the semi-regulars no lags are observed. Comparison to published theoretical models indicates that the phase lags in the Miras are due to strong titanium oxide absorption in the visual at stellar maximum, and suggests that Miras pulsate in the fundamental mode, while at least some semi-regulars are first overtone pulsators. There is a clear optical-near-infrared phase lag in the carbon-rich Mira V CrB; this is likely due to C2 and CN absorption variations in the optical.Comment: AJ, in pres

Stellar Intensity Interferometry: Astrophysical targets for sub-milliarcsecond imaging

Intensity interferometry permits very long optical baselines and the observation of sub-milliarcsecond structures. Using planned kilometric arrays of air Cherenkov telescopes at short wavelengths, intensity interferometry may increase the spatial resolution achieved in optical astronomy by an order of magnitude, inviting detailed studies of the shapes of rapidly rotating hot stars with structures in their circumstellar disks and winds, or mapping out patterns of nonradial pulsations across stellar surfaces. Signal-to-noise in intensity interferometry favors high-temperature sources and emission-line structures, and is independent of the optical passband, be it a single spectral line or the broad spectral continuum. Prime candidate sources have been identified among classes of bright and hot stars. Observations are simulated for telescope configurations envisioned for large Cherenkov facilities, synthesizing numerous optical baselines in software, confirming that resolutions of tens of microarcseconds are feasible for numerous astrophysical targets.Comment: 12 pages, 4 figures; presented at the SPIE conference "Optical and Infrared Interferometry II", San Diego, CA, USA (June 2010

Correlations in Quantum Spin Ladders with Site and Bond Dilution

We investigate the effects of quenched disorder, in the form of site and bond dilution, on the physics of the $S=1/2$ antiferromagnetic Heisenberg model on even-leg ladders. Site dilution is found to prune rung singlets and thus create localized moments which interact via a random, unfrustrated network of effective couplings, realizing a random-exchange Heisenberg model (REHM) in one spatial dimension. This system exhibits a power-law diverging correlation length as the temperature decreases. Contrary to previous claims, we observe that the scaling exponent is non-universal, i.e., doping dependent. This finding can be explained by the discrete nature of the values taken by the effective exchange couplings in the doped ladder. Bond dilution on even-leg ladders leads to a more complex evolution with doping of correlations, which are weakly enhanced in 2-leg ladders, and are even suppressed for low dilution in the case of 4-leg and 6-leg ladders. We clarify the different aspects of correlation enhancement and suppression due to bond dilution by isolating the contributions of rung-bond dilution and leg-bond dilution.Comment: 13 pages, 15 figure

Distributed Exact Shortest Paths in Sublinear Time

The distributed single-source shortest paths problem is one of the most fundamental and central problems in the message-passing distributed computing. Classical Bellman-Ford algorithm solves it in $O(n)$ time, where $n$ is the number of vertices in the input graph $G$. Peleg and Rubinovich (FOCS'99) showed a lower bound of $\tilde{\Omega}(D + \sqrt{n})$ for this problem, where $D$ is the hop-diameter of $G$. Whether or not this problem can be solved in $o(n)$ time when $D$ is relatively small is a major notorious open question. Despite intensive research \cite{LP13,N14,HKN15,EN16,BKKL16} that yielded near-optimal algorithms for the approximate variant of this problem, no progress was reported for the original problem. In this paper we answer this question in the affirmative. We devise an algorithm that requires $O((n \log n)^{5/6})$ time, for $D = O(\sqrt{n \log n})$, and $O(D^{1/3} \cdot (n \log n)^{2/3})$ time, for larger $D$. This running time is sublinear in $n$ in almost the entire range of parameters, specifically, for $D = o(n/\log^2 n)$. For the all-pairs shortest paths problem, our algorithm requires $O(n^{5/3} \log^{2/3} n)$ time, regardless of the value of $D$. We also devise the first algorithm with non-trivial complexity guarantees for computing exact shortest paths in the multipass semi-streaming model of computation. From the technical viewpoint, our algorithm computes a hopset $G"$ of a skeleton graph $G'$ of $G$ without first computing $G'$ itself. We then conduct a Bellman-Ford exploration in $G' \cup G"$, while computing the required edges of $G'$ on the fly. As a result, our algorithm computes exactly those edges of $G'$ that it really needs, rather than computing approximately the entire $G'$