An Anderson-Fano Resonance and Shake-Up Processes in the Magneto-Photoluminescence of a Two-Dimensional Electron System

We report an anomalous doublet structure and low-energy satellite in the magneto-photoluminescence spectra of a two-dimensional electron system. The doublet structure moves to higher energy with increasing magnetic field and is most prominent at odd filling factors 5 and 3. The lower-energy satellite peak tunes to lower energy for increasing magnetic field between filling factor 6 and 2. These features occur at energies below the fundamental band of recombination originating from the lowest Landau level and display striking magnetic field and temperature dependence that indicates a many-body origin. Drawing on a recent theoretical description of Hawrylak and Potemski, we show that distinct mechanisms are responsible for each feature.Comment: 14 pages including 5 figures. To appear in the April 15th edition of Phy. Rev. B. rapid com

The Galaxy Octopole Moment as a Probe of Weak Lensing Shear Fields

In this paper, we introduce the octopole moment of the light distribution in galaxies as a probe of the weak lensing shear field. While traditional ellipticity estimates of the local shear derived from the quadrupole moment are limited by the width of the intrinsic ellipticity distribution of background galaxies, the dispersion in the intrinsic octopole distribution is expected to be much smaller, implying that the signal from this higher order moment is ultimately limited by measurement noise, and not by intrinsic scatter. We present the computation of the octopole moment and show that current observations are at the regime where the octopole estimates will soon be able to contribute to the overall accuracy of the estimates of local shear fields. Therefore, the prospects for this estimator from future datasets like the Advanced Camera for Survey and the Next Generation Space Telescope are very promising.Comment: 9 pages, 2 PostScript figures; Submitted to Astrophysical Journa

Reconstruction of Cluster Masses using Particle Based Lensing I: Application to Weak Lensing

We present Particle-Based Lensing (PBL), a new technique for gravitational lensing mass reconstructions of galaxy clusters. Traditionally, most methods have employed either a finite inversion or gridding to turn observational lensed galaxy ellipticities into an estimate of the surface mass density of a galaxy cluster. We approach the problem from a different perspective, motivated by the success of multi-scale analysis in smoothed particle hydrodynamics. In PBL, we treat each of the lensed galaxies as a particle and then reconstruct the potential by smoothing over a local kernel with variable smoothing scale. In this way, we can tune a reconstruction to produce constant signal-noise throughout, and maximally exploit regions of high information density. PBL is designed to include all lensing observables, including multiple image positions and fluxes from strong lensing, as well as weak lensing signals including shear and flexion. In this paper, however, we describe a shear-only reconstruction, and apply the method to several test cases, including simulated lensing clusters, as well as the well-studied ``Bullet Cluster'' (1E0657-56). In the former cases, we show that PBL is better able to identify cusps and substructures than are grid-based reconstructions, and in the latter case, we show that PBL is able to identify substructure in the Bullet Cluster without even exploiting strong lensing measurements. We also make our codes publicly available.Comment: Accepted for publication in ApJ; Codes available at http://www.physics.drexel.edu/~deb/PBL.htm ; 12 pages,9 figures, section 3 shortene

Microstructural Matrix-Crystal Interactions in Calcium Oxalate Monohydrate Kidney Stones

The role of the proteinaceous matrix in the formation of calcium oxalate kidney stones is still not well understood. Simple scanning electron microscopy (SEM) has been of somewhat limited value in visualizing the organic and inorganic microstructure due to difficulties in obtaining detailed structural information for cut or fractured surfaces. To help clarify matrix-crystal microstructure, serial sections from 10-20 mm calcium oxalate calculi were partially demineralized with ethylenediamine tetraacetic acid (EDTA) and examined by SEM. Sections etched by EDTA showed a radial crystal structure composed of microcrystal subunits. Sections simultaneously EDTA etched and fixed with glutaraldehyde to insolubilize all matrix mucoprotein showed interesting forms of matrix structure: an amorphous sometimes membrane-like material, and a fibrous material that exhibited an apparent affinity for the inorganic crystalline phase. These observations give evidence for a more important etiological and structural role for the matrix than may be suggested by the relatively low matrix concentration in stones (2-6 wt. %)

Lagrangian and Hamiltonian for the Bondi-Sachs metrics

We calculate the Hilbert action for the Bondi-Sachs metrics. It yields the Einstein vacuum equations in a closed form. Following the Dirac approach to constrained systems we investigate the related Hamiltonian formulation.Comment: 8 page

Learning Convex Partitions and Computing Game-theoretic Equilibria from Best Response Queries

Suppose that an $m$-simplex is partitioned into $n$ convex regions having disjoint interiors and distinct labels, and we may learn the label of any point by querying it. The learning objective is to know, for any point in the simplex, a label that occurs within some distance $\epsilon$ from that point. We present two algorithms for this task: Constant-Dimension Generalised Binary Search (CD-GBS), which for constant $m$ uses $poly(n, \log \left( \frac{1}{\epsilon} \right))$ queries, and Constant-Region Generalised Binary Search (CR-GBS), which uses CD-GBS as a subroutine and for constant $n$ uses $poly(m, \log \left( \frac{1}{\epsilon} \right))$ queries. We show via Kakutani's fixed-point theorem that these algorithms provide bounds on the best-response query complexity of computing approximate well-supported equilibria of bimatrix games in which one of the players has a constant number of pure strategies. We also partially extend our results to games with multiple players, establishing further query complexity bounds for computing approximate well-supported equilibria in this setting.Comment: 38 pages, 7 figures, second version strengthens lower bound in Theorem 6, adds footnotes with additional comments and fixes typo

Completeness of Wilson loop functionals on the moduli space of SL(2,C)SL(2,C) and SU(1,1)SU(1,1)-connections

The structure of the moduli spaces \M := \A/\G of (all, not just flat) $SL(2,C)$ and $SU(1,1)$ connections on a n-manifold is analysed. For any topology on the corresponding spaces \A of all connections which satisfies the weak requirement of compatibility with the affine structure of \A, the moduli space \M is shown to be non-Hausdorff. It is then shown that the Wilson loop functionals --i.e., the traces of holonomies of connections around closed loops-- are complete in the sense that they suffice to separate all separable points of \M. The methods are general enough to allow the underlying n-manifold to be topologically non-trivial and for connections to be defined on non-trivial bundles. The results have implications for canonical quantum general relativity in 4 and 3 dimensions.Comment: Plain TeX, 7 pages, SU-GP-93/4-

Weak Gravitational Flexion

Flexion is the significant third-order weak gravitational lensing effect responsible for the weakly skewed and arc-like appearance of lensed galaxies. Here we demonstrate how flexion measurements can be used to measure galaxy halo density profiles and large-scale structure on non-linear scales, via galaxy-galaxy lensing, dark matter mapping and cosmic flexion correlation functions. We describe the origin of gravitational flexion, and discuss its four components, two of which are first described here. We also introduce an efficient complex formalism for all orders of lensing distortion. We proceed to examine the flexion predictions for galaxy-galaxy lensing, examining isothermal sphere and Navarro, Frenk & White (NFW) profiles and both circularly symmetric and elliptical cases. We show that in combination with shear we can precisely measure galaxy masses and NFW halo concentrations. We also show how flexion measurements can be used to reconstruct mass maps in 2-D projection on the sky, and in 3-D in combination with redshift data. Finally, we examine the predictions for cosmic flexion, including convergence-flexion cross-correlations, and find that the signal is an effective probe of structure on non-linear scales.Comment: 17 pages, including 12 figures, submitted to MNRA

The Inverse Shapley Value Problem

For $f$ a weighted voting scheme used by $n$ voters to choose between two candidates, the $n$ \emph{Shapley-Shubik Indices} (or {\em Shapley values}) of $f$ provide a measure of how much control each voter can exert over the overall outcome of the vote. Shapley-Shubik indices were introduced by Lloyd Shapley and Martin Shubik in 1954 \cite{SS54} and are widely studied in social choice theory as a measure of the "influence" of voters. The \emph{Inverse Shapley Value Problem} is the problem of designing a weighted voting scheme which (approximately) achieves a desired input vector of values for the Shapley-Shubik indices. Despite much interest in this problem no provably correct and efficient algorithm was known prior to our work. We give the first efficient algorithm with provable performance guarantees for the Inverse Shapley Value Problem. For any constant \eps > 0 our algorithm runs in fixed poly$(n)$ time (the degree of the polynomial is independent of \eps) and has the following performance guarantee: given as input a vector of desired Shapley values, if any "reasonable" weighted voting scheme (roughly, one in which the threshold is not too skewed) approximately matches the desired vector of values to within some small error, then our algorithm explicitly outputs a weighted voting scheme that achieves this vector of Shapley values to within error \eps. If there is a "reasonable" voting scheme in which all voting weights are integers at most \poly(n) that approximately achieves the desired Shapley values, then our algorithm runs in time \poly(n) and outputs a weighted voting scheme that achieves the target vector of Shapley values to within error $\eps=n^{-1/8}.

The Goldberg-Sachs theorem in linearized gravity

The Goldberg-Sachs theorem has been very useful in constructing algebraically special exact solutions of Einstein vacuum equation. Most of the physical meaningful vacuum exact solutions are algebraically special. We show that the Goldberg-Sachs theorem is not true in linearized gravity. This is a remarkable result, which gives light on the understanding of the physical meaning of the linearized solutions.Comment: 6 pages, no figures, LaTeX 2