Space-Efficient Parallel Algorithms for Combinatorial Search Problems

We present space-efficient parallel strategies for two fundamental combinatorial search problems, namely, backtrack search and branch-and-bound, both involving the visit of an $n$-node tree of height $h$ under the assumption that a node can be accessed only through its father or its children. For both problems we propose efficient algorithms that run on a $p$-processor distributed-memory machine. For backtrack search, we give a deterministic algorithm running in $O(n/p+h\log p)$ time, and a Las Vegas algorithm requiring optimal $O(n/p+h)$ time, with high probability. Building on the backtrack search algorithm, we also derive a Las Vegas algorithm for branch-and-bound which runs in $O((n/p+h\log p \log n)h\log^2 n)$ time, with high probability. A remarkable feature of our algorithms is the use of only constant space per processor, which constitutes a significant improvement upon previous algorithms whose space requirements per processor depend on the (possibly huge) tree to be explored.Comment: Extended version of the paper in the Proc. of 38th International Symposium on Mathematical Foundations of Computer Science (MFCS

Node-balancing by edge-increments

Suppose you are given a graph $G=(V,E)$ with a weight assignment $w:V\rightarrow\mathbb{Z}$ and that your objective is to modify $w$ using legal steps such that all vertices will have the same weight, where in each legal step you are allowed to choose an edge and increment the weights of its end points by $1$. In this paper we study several variants of this problem for graphs and hypergraphs. On the combinatorial side we show connections with fundamental results from matching theory such as Hall's Theorem and Tutte's Theorem. On the algorithmic side we study the computational complexity of associated decision problems. Our main results are a characterization of the graphs for which any initial assignment can be balanced by edge-increments and a strongly polynomial-time algorithm that computes a balancing sequence of increments if one exists.Comment: 10 page

Popular matchings in the marriage and roommates problems

Popular matchings have recently been a subject of study in the context of the so-called House Allocation Problem, where the objective is to match applicants to houses over which the applicants have preferences. A matching M is called popular if there is no other matching M′ with the property that more applicants prefer their allocation in M′ to their allocation in M. In this paper we study popular matchings in the context of the Roommates Problem, including its special (bipartite) case, the Marriage Problem. We investigate the relationship between popularity and stability, and describe efficient algorithms to test a matching for popularity in these settings. We also show that, when ties are permitted in the preferences, it is NP-hard to determine whether a popular matching exists in both the Roommates and Marriage cases

Reconstruction of Black Hole Metric Perturbations from Weyl Curvature

Perturbation theory of rotating black holes is usually described in terms of Weyl scalars $\psi_4$ and $\psi_0$, which each satisfy Teukolsky's complex master wave equation and respectively represent outgoing and ingoing radiation. On the other hand metric perturbations of a Kerr hole can be described in terms of (Hertz-like) potentials $\Psi$ in outgoing or ingoing {\it radiation gauges}. In this paper we relate these potentials to what one actually computes in perturbation theory, i.e $\psi_4$ and $\psi_0$. We explicitly construct these relations in the nonrotating limit, preparatory to devising a corresponding approach for building up the perturbed spacetime of a rotating black hole. We discuss the application of our procedure to second order perturbation theory and to the study of radiation reaction effects for a particle orbiting a massive black hole.Comment: 6 Pages, Revtex

The imposition of Cauchy data to the Teukolsky equation I: The nonrotating case

Gravitational perturbations about a Kerr black hole in the Newman-Penrose formalism are concisely described by the Teukolsky equation. New numerical methods for studying the evolution of such perturbations require not only the construction of appropriate initial data to describe the collision of two orbiting black holes, but also to know how such new data must be imposed into the Teukolsky equation. In this paper we show how Cauchy data can be incorporated explicitly into the Teukolsky equation for non-rotating black holes. The Teukolsky function $$ and its first time derivative $\partial_t \Psi$ can be written in terms of only the 3-geometry and the extrinsic curvature in a gauge invariant way. Taking a Laplace transform of the Teukolsky equation incorporates initial data as a source term. We show that for astrophysical data the straightforward Green function method leads to divergent integrals that can be regularized like for the case of a source generated by a particle coming from infinity.Comment: 9 pages, REVTEX. Misprints corrected in formulas (2.4)-(2.7). Final version to appear in PR

Distribution of Energy-Momentum in a Schwarzschild-Quintessence Space-time Geometry

An analysis of the energy-momentum localization for a four-dimensional\break Schwarzschild black hole surrounded by quintessence is presented in order to provide expressions for the distributions of energy and momentum. The calculations are performed by using the Landau-Lifshitz and Weinberg energy-momentum complexes. It is shown that all the momenta vanish, while the expression for the energy depends on the mass $M$ of the black hole, the state parameter $w_{q}$ and the normalization factor $c$. The special case of $w_{q}=-2/3$ is also studied, and two limiting cases are examined.Comment: 9 page

Nuclear Shadowing in DIS: Numerical Solution of the Evolution Equation for the Green Function

Within a light-cone QCD formalism based on the Green function technique incorporating color transparency and coherence length effects we study nuclear shadowing in deep-inelastic scattering at moderately small Bjorken x_{Bj}. Calculations performed so far were based only on approximations leading to an analytical harmonic oscillatory form of the Green function. We present for the first time an exact numerical solution of the evolution equation for the Green function using realistic form of the dipole cross section and nuclear density function. We compare numerical results for nuclear shadowing with previous predictions and discuss differences.Comment: 21 pages including 3 figures; a small revision of the tex

Black Holes from Cosmic Rays: Probes of Extra Dimensions and New Limits on TeV-Scale Gravity

If extra spacetime dimensions and low-scale gravity exist, black holes will be produced in observable collisions of elementary particles. For the next several years, ultra-high energy cosmic rays provide the most promising window on this phenomenon. In particular, cosmic neutrinos can produce black holes deep in the Earth's atmosphere, leading to quasi-horizontal giant air showers. We determine the sensitivity of cosmic ray detectors to black hole production and compare the results to other probes of extra dimensions. With n \ge 4 extra dimensions, current bounds on deeply penetrating showers from AGASA already provide the most stringent bound on low-scale gravity, requiring a fundamental Planck scale M_D > 1.3 - 1.8 TeV. The Auger Observatory will probe M_D as large as 4 TeV and may observe on the order of a hundred black holes in 5 years. We also consider the implications of angular momentum and possible exponentially suppressed parton cross sections; including these effects, large black hole rates are still possible. Finally, we demonstrate that even if only a few black hole events are observed, a standard model interpretation may be excluded by comparison with Earth-skimming neutrino rates.Comment: 30 pages, 18 figures; v2: discussion of gravitational infall, AGASA and Fly's Eye comparison added; v3: Earth-skimming results modified and strengthened, published versio

Probing mSUGRA via the Extreme Universe Space Observatory

An analysis is carried out within mSUGRA of the estimated number of events originating from upward moving ultra-high energy neutralinos that could be detected by the Extreme Universe Space Observatory (EUSO). The analysis exploits a recently proposed technique that differentiates ultra-high energy neutralinos from ultra-high energy neutrinos using their different absorption lengths in the Earth's crust. It is shown that for a significant part of the parameter space, where the neutralino is mostly a Bino and with squark mass $\sim 1$ TeV, EUSO could see ultra-high energy neutralino events with essentially no background. In the energy range 10^9 GeV < E < 10^11 GeV, the unprecedented aperture of EUSO makes the telescope sensitive to neutralino fluxes as low as 1.1 \times 10^{-6} (E/GeV)^{-1.3} GeV^{-1} cm^{-2} yr^{-1} sr^{-1}, at the 95% CL. Such a hard spectrum is characteristic of supermassive particles' $N$-body hadronic decay. The case in which the flux of ultra-high energy neutralinos is produced via decay of metastable heavy particles with uniform distribution throughout the universe is analyzed in detail. The normalization of the ratio of the relics' density to their lifetime has been fixed so that the baryon flux produced in the supermassive particle decays contributes to about 1/3 of the events reported by the AGASA Collaboration below 10^{11} GeV, and hence the associated GeV gamma-ray flux is in complete agreement with EGRET data. For this particular case, EUSO will collect between 4 and 5 neutralino events (with 0.3 of background) in ~ 3 yr of running. NASA's planned mission, the Orbiting Wide-angle Light-collectors (OWL), is also briefly discussed in this context.Comment: Some discussion added, final version to be published in Physical Review

How spiking neurons give rise to a temporal-feature map

A temporal-feature map is a topographic neuronal representation of temporal attributes of phenomena or objects that occur in the outside world. We explain the evolution of such maps by means of a spike-based Hebbian learning rule in conjunction with a presynaptically unspecific contribution in that, if a synapse changes, then all other synapses connected to the same axon change by a small fraction as well. The learning equation is solved for the case of an array of Poisson neurons. We discuss the evolution of a temporal-feature map and the synchronization of the single cells’ synaptic structures, in dependence upon the strength of presynaptic unspecific learning. We also give an upper bound for the magnitude of the presynaptic interaction by estimating its impact on the noise level of synaptic growth. Finally, we compare the results with those obtained from a learning equation for nonlinear neurons and show that synaptic structure formation may profit from the nonlinearity