Snowmass 2001: Jet Energy Flow Project

Conventional cone jet algorithms arose from heuristic considerations of LO hard scattering coupled to independent showering. These algorithms implicitly assume that the final states of individual events can be mapped onto a unique set of jets that are in turn associated with a unique set of underlying hard scattering partons. Thus each final state hadron is assigned to a unique underlying parton. The Jet Energy Flow (JEF) analysis described here does not make such assumptions. The final states of individual events are instead described in terms of flow distributions of hadronic energy. Quantities of physical interest are constructed from the energy flow distribution summed over all events. The resulting analysis is less sensitive to higher order perturbative corrections and the impact of showering and hadronization than the standard cone algorithms.Comment: REVTeX4, 13 pages, 6 figures; Contribution to the P5 Working Group on QCD and Strong Interactions at Snowmass 200

Structural collapse and superconductivity in rare earth-doped CaFe2As2

Aliovalent rare earth substitution into the alkaline earth site of CaFe2As2 single-crystals is used to fine-tune structural, magnetic and electronic properties of this iron-based superconducting system. Neutron and single crystal x-ray scattering experiments indicate that an isostructural collapse of the tetragonal unit cell can be controllably induced at ambient pressures by choice of substituent ion size. This instability is driven by the interlayer As-As anion separation, resulting in an unprecedented thermal expansion coefficient of $180\times 10^{-6}$ K$^{-1}$. Electrical transport and magnetic susceptibility measurements reveal abrupt changes in the physical properties through the collapse as a function of temperature, including a reconstruction of the electronic structure. Superconductivity with onset transition temperatures as high as 47 K is stabilized by the suppression of antiferromagnetic order via chemical pressure, electron doping or a combination of both. Extensive investigations are performed to understand the observations of partial volume-fraction diamagnetic screening, ruling out extrinsic sources such as strain mechanisms, surface states or foreign phases as the cause of this superconducting phase that appears to be stable in both collapsed and uncollapsed structures.Comment: 15 pages, 18 figure

SOME ABSTRACT PROPERTIES OF SEMIGROUPS APPEARING IN SUPERCONFORMAL THEORIES

A new type of semigroups which appears while dealing with $N=1$ superconformal symmetry in superstring theories is considered. The ideal series having unusual abstract properties is constructed. Various idealisers are introduced and studied. The ideal quasicharacter is defined. Green's relations are found and their connection with the ideal quasicharacter is established.Comment: 11 page

Predicate Abstraction for Linked Data Structures

We present Alias Refinement Types (ART), a new approach to the verification of correctness properties of linked data structures. While there are many techniques for checking that a heap-manipulating program adheres to its specification, they often require that the programmer annotate the behavior of each procedure, for example, in the form of loop invariants and pre- and post-conditions. Predicate abstraction would be an attractive abstract domain for performing invariant inference, existing techniques are not able to reason about the heap with enough precision to verify functional properties of data structure manipulating programs. In this paper, we propose a technique that lifts predicate abstraction to the heap by factoring the analysis of data structures into two orthogonal components: (1) Alias Types, which reason about the physical shape of heap structures, and (2) Refinement Types, which use simple predicates from an SMT decidable theory to capture the logical or semantic properties of the structures. We prove ART sound by translating types into separation logic assertions, thus translating typing derivations in ART into separation logic proofs. We evaluate ART by implementing a tool that performs type inference for an imperative language, and empirically show, using a suite of data-structure benchmarks, that ART requires only 21% of the annotations needed by other state-of-the-art verification techniques