12,131 research outputs found

    PPl 15: The First Brown Dwarf Spectroscopic Binary

    Get PDF
    PPl 15 is the first object to have been confirmed as a brown dwarf by the lithium test (in 1995), though its inferred mass was very close to the substellar limit. It is a member of the Pleiades open cluster. Its position in a cluster color-magnitude diagram suggested that it might be binary, and preliminary indications that it is a double-lined spectroscopic binary were reported by us in 1997. Here we report on the results of a consecutive week of Keck HIRES observations of this system, which yield its orbit. It has a period of about 5.8 days, and an eccentricity of 0.4+/-0.05. The rotation of the stars is slow for this class of objects. Because the system luminosity is divided between 2 objects with a mass ratio of 0.85, this renders each of them an incontrovertible brown dwarf, with masses between 60-70 jupiters. We show that component B is a little redder than A by studying their wavelength-dependent line ratios, and that this variation is compatible with the mass ratio. We confirm that the system has lithium, but cannot support the original conclusion that it is depleted (which would be surprising, given the new masses). This is a system of very close objects which, if they had combined, would have produced a low mass star. We discuss the implications of this discovery for the theories of binary formation and formation of very low mass objects.Comment: Latex, 18 pages, 4 figures, submitted to Astron.

    Photoionization and Photoelectric Loading of Barium Ion Traps

    Get PDF
    Simple and effective techniques for loading barium ions into linear Paul traps are demonstrated. Two-step photoionization of neutral barium is achieved using a weak intercombination line (6s2 1S0 6s6p 3P1, 791 nm) followed by excitation above the ionization threshold using a nitrogen gas laser (337 nm). Isotopic selectivity is achieved by using a near Doppler-free geometry for excitation of the triplet 6s6p 3P1 state. Additionally, we report a particularly simple and efficient trap loading technique that employs an in-expensive UV epoxy curing lamp to generate photoelectrons.Comment: 5 pages, Accepted to PRA 3/20/2007 -fixed typo -clarified figure 3 caption -added reference [15

    Extended Water Quality Monitoring of the Lincoln Lake Watershed

    Get PDF
    For seven years, the Lincoln Lake (Moores Creek and Beatty Branch) watershed was monitored for improvements in water quality resulting from agricultural best management practices (BMP) implemented to reduce nutrient transport. During the first three years of monitoring (1991 to 1994), nitrogen transport declined significantly (Edwards et al., 1994, 1996, and 1997) under both base and storm flow conditions. This decline in nitrogen transport was again observed in the three-year period following 1994 (Vendrell et al. 1998). This monitoring effort has demonstrated that water quality bas improved in the Lincoln Lake watershed. However, since the nitrogen transport continued to decline and there was some indication that phosphorus may begin to decline, monitoring was extended for another year (1998)

    A Priori Bounds on the Euclidean Traveling Salesman

    Get PDF
    It is proved that there are constants c1c_{1}, c2c_{2}, and c3c_{3} such that for any set S of n points in the unit square and for any minimum-length tour T of S the sum of squares of the edge lengths of T is bounded by c1lognc_{1} \log n. (2) the number of edges having length t or greater in T is at most c2/t2c_{2}/t^{2}, and (3) the sum of edge lengths of any subset E of T is bounded by c3E1/2c_{3}|E|^{1/2}. The second and third bounds are independent of the number of points in S, as well as their locations. Extensions to dimensions d3˘e2d \u3e 2 are also sketched. The presence of the logarithmic term in (1) is engaging because such a term is not needed in the case of the minimum spanning tree and several analogous problems, and, furthermore, we know that there always exists some tour of S (which perhaps does not have minimal length) for which the sum of squared edges is bounded independently of n

    Worst-Case Growth Rates of Some Classical Problems of Combinatorial Optimization

    Get PDF
    A method is presented for determining the asymptotic worst-case behavior of quantities like the length of the minimal spanning tree or the length of an optimal traveling salesman tour of nn points in the unit dd-cube. In each of these classical problems, the worst-case lengths are proved to have the exact asymptotic growth rate of βn(d1)/d\beta _n^{{{(d - 1)} / d}} , where β\beta is a positive constant depending on the problem and the dimension. These results complement known results on the growth rates for the analogous quantities under probabilistic assumptions on the points, but the results given here are free of any probabilistic hypotheses

    Equidistribution of Point Sets for the Traveling Salesman and Related Problems

    Get PDF
    Given a set S of n points in the unit square [0, 1)2, an optimal traveling salesman tour of S is a tour of S that is of minimum length. A worst-case point set for the Traveling Salesman Problem in the unit square is a point set S(n) whose optimal traveling salesman tour achieves the maximum possible length among all point sets S C [0, 1)2, where JSI = n. An open problem is to determine the structure of S(n). We show that for any rectangle R contained in [0, 1 F, the number of points in S(n) n R is asymptotic to n times the area of R. One corollary of this result is an 0( n log n) approximation algorithm for the worst-case Euclidean TSP. Analogous results are proved for the minimum spanning tree, minimum-weight matching, and rectilinear Steiner minimum tree. These equidistribution theorems are the first results concerning the structure of worst-case point sets like S(n)
    corecore