Neutrino astronomy: Present and future

I briefly review the present and future status of the burgeoning field of neutrino astronomy. I outline the astrophysics and particle physics goals, design, and performance of the various current and proposed neutrino telescopes. Also described are present results and future expectations.     

Time interval distributions of atoms in atomic beams

We report an experimental investigation of two-particle correlations between neutral atoms in a Hanbury Brown and Twiss experiment. Both an atom laser beam and a pseudo-thermal atomic beam are extracted from a Bose–Einstein condensate and the atom flux is measured with a single atom counter. We determine the conditional and the unconditional detection probabilities for the atoms in the beam and find good agreement with the theoretical predictions. PACS 03.75.Pp; 05.30.Jp; 07.77.Gx; 42.50.Pq     

Growth of Lévy trees

We construct random locally compact real trees called Lévy trees that are the genealogical trees associated with continuous-state branching processes. More precisely, we define a growing family of discrete Galton–Watson trees with i.i.d. exponential branch lengths that is consistent under Bernoulli percolation on leaves; we define the Lévy tree as the limit of this growing family with respect to the Gromov–Hausdorff topology on metric spaces. This elementary approach notably includes supercritical trees and does not make use of the height process introduced by Le Gall and Le Jan to code the genealogy of (sub)critical continuous-state branching processes. We construct the mass measure of Lévy trees and we give a decomposition along the ancestral subtree of a Poisson sampling directed by the mass measure. T. Duquesne is supported by NSF Grants DMS-0203066 and DMS-0405779. M. Winkel is supported by Aon and the Institute of Actuaries, EPSRC Grant GR/T26368/01, le département de mathématique de l’Université d’Orsay and NSF Grant DMS-0405779.     

Asymmetry in the Multiprotein Systems of Molecular Biology

Signaling in living systems needs to achieve high specificity, to be reversible, and to achieve high signal to noise. Signaling mediated by multiprotein systems has evolved that avoids the requirement for high-affinity binary complexes that would be difficult to reverse and which, in the overcrowded cell, would lead to excessive noise in the system. Symmetrical structures are only occasionally formed. When they are, it is principally to colocate components, for example, the tyrosyl kinases of growth factors, where dimers form. Symmetry is, however, often broken, presumably to create more sensitivity and specificity in the signaling system by assembling other components, into higher-order multiprotein systems. The binding of a single heparin to two 1:1 FGF:FGFR complexes is an example, as is the binding of a single ligase to the Xrcc4 dimer, perhaps so creating a further DNA-binding site.     

New Combinatorial Descriptions of the Triangulations of Cyclic Polytopes and the Second Higher Stasheff–Tamari Posets

This paper is concerned with the d-dimensional cyclic polytope with n vertices, C(n,d), and the set of its triangulations, S(n,d). We show that there is a bijection between S(n,d) and certain partitions of the set of increasing d-tuples on the integers 1 to n–1. We give a combinatorial characterization of the second higher Stasheff–Tamari poset, which is a partial ordering of S(n,d), and we determine its 2-dimension. There is a well-known representation of triangulations of an n-gon by right bracket vectors. We generalize this to cyclic polytopes of higher dimensions.     

A note on canonical functions

We construct a generic extension in which the ℵ₂nd canonical function on ℵ₁ exists. Supported by NSF and by a Fulbright grant. Publ. 378. Partially supported by the B.S.F.     

A finite cutting plane method for facial disjunctive programs

This paper shows that any linear disjunctive program with a finite number of constraints can be transformed into an equivalent facial program. Based upon linear programming technique, a new, finite cutting plane method is presented for the facial programs.

---

Zusammenfassung Die Arbeit zeigt, daß jedes lineare disjunktive Optimierungsproblem mit endlich vielen Restriktionen in ein äquivalentes Fazetten-Problem transformiert werden kann. Auf der Grundlage von linearer Optimierungstechnik wird für das Fazetten-Problem ein neues, endliches Schnittebenenverfahren vorgestellt.

     

Fejér means of functions on noncommutative Vilenkin groups with respect to the character system

Summary It is known that the Fejér means - with respect to the character system of the Walsh, and bounded Vilenkin groups - of an integrable function converge to the function a.e. In this work we discuss analogous problems on the complete product of finite, not necessarily Abelian groups with respect to the character system for functions that are constant on the conjugacy classes. We find that the nonabelian case differs from the commutative case. We prove the a.e. convergence of the (C,1) means of the Fourier series of square integrable functions. We also prove the existence of a function f∊L^q for some q >1 such that sup |σ_n f | = + ∞ a.e. This is a sharp contrast between the Abelian and the nonabelian cases.     

Buchbesprechungen

Ohne Zusammenfassung