Related papers: An Axisymmetric Object-Based Search for a Flat Com…
The first year data from the Wilkinson Microwave Anisotropy Probe are used to place stringent constraints on the topology of the Universe. We search for pairs of circles on the sky with similar temperature patterns along each circle. We…
We study black hole solutions in the Einstein-Gauss-Bonnet gravity with the dilaton and a negative ``cosmological constant''. We derive the field equations for the static spherically symmetric ($k=1$) and hyperbolically symmetric ($k=-1$)…
It is pointed out that if we allow for the possibility of a multilayered universe, it is possible to maintain exact supersymmetry and arrange, in principle, for the vanishing of the cosmological constant. Superpartner(s) of a known particle…
A recently proposed Asymptotically Safe cosmology provides an elegant mechanism towards understanding the nature of dark energy and its associated cosmic coincidence problem. The underlying idea is that the accelerated expansion of the…
Some years ago (Jackson and Dodgson 1997) analysis of the angular-size/redshift relationship for ultra-compact radio sources indicted that for spatially flat universes the best choice of cosmological parameters was Omega_m=0.2 and…
We present a fitting formula for the luminosity and angular diameter distances in cosmological models with pressureless matter, a cosmological constant and zero spatial curvature. The formula has a relative error of less than 0.4% for…
Gravitational lensing can provide pure geometric tests of the structure of space-time, for instance by determining empirically the angular diameter distance-redshift relation. This geometric test has been demonstrated several times using…
The usual ambient space approach to conformal fields is based on identifying the d-dimensional conformal space as the Dirac projective hypercone in a flat d+2-dimensional ambient space. In this work, we explicitly concentrate on singletons…
A geometrical pattern is a set of points with all pairwise distances (or, more generally, relative distances) specified. Finding matches to such patterns has applications to spatial data in seismic, astronomical, and transportation…
We propose an adaptive tracking algorithm where the object is modelled as a continuously updated bag of affine subspaces, with each subspace constructed from the object's appearance over several consecutive frames. In contrast to linear…
The search for dark matter has been performed mainly for weakly interacting massive particles and massive compact halo objects, and the intermediate mass region has not been investigated experimentally. A method to search dark matter with…
We present a fast algorithm for global rigid symmetry detection with approximation guarantees. The algorithm is guaranteed to find the best approximate symmetry of a given shape, to within a user-specified threshold, with very high…
A wide range of techniques have been developed to search for particle dark matter, including direct detection, indirect detection, and collider searches. The prospects for the detection of neutralino dark matter is quite promising for each…
Traditional problems in computational geometry involve aspects that are both discrete and continuous. One such example is nearest-neighbor searching, where the input is discrete, but the result depends on distances, which vary continuously.…
This work introduces a novel dissimilarity measure between two convex cones, based on the max-min angle between them. We demonstrate that this measure is closely related to the Pompeiu-Hausdorff distance, a well-established metric for…
We present results from a search for gravitational microlensing of stars in the Large Magellanic Cloud by low mass objects in the Galactic Halo. The search uses the CCD light curves of about 82,000 stars with up to 46 measurements per night…
The prospects for detecting a candidate supersymmetric dark matter particle at the LHC are reviewed, and compared with the prospects for direct and indirect searches for astrophysical dark matter. The discussion is based on a frequentist…
We consider polyhedral approximations of strictly convex compacta in finite dimensional Euclidean spaces (such compacta are also uniformly convex). We obtain the best possible estimates for errors of considered approximations in the…
We solve the problem of best approximation by partial isometries of given rank to an arbitrary rectangular matrix, when the distance is measured in any unitarily invariant norm. In the case where the norm is strictly convex, we parametrize…
Axions solve the Strong CP Problem and are a cold dark matter candidate. The combined constraints from accelerator searches, stellar evolution limits and cosmology suggest that the axion mass is in the range $3 \cdot 10^{-3} > m_a >…