Distribution results for lattices in SL(2,ℚ p )

In this paper we study the ergodic properties of the linear action of lattices Γ of SL(2,ℚ_p) on ℚ_p × ℚ_p and distribution results for orbits of Γ. Following Serre, one can define a “geodesic flow” for an associated tree (actually associated to GL(2,ℚ_p)). The approach we use is based on an extension of this approach to “frame flows” which are a natural compact group extension of the geodesic flow.     

The Livsic Cocycle Equation for Compact Lie Group Extensions of Hyperbolic Systems

In this article we extend well-known results of Livsic on theregularity of measurable solutions to the cocycle equation.Livsic proved a regularity result for real valued cocycles,but for compact Lie group valued cocycles his result was restrictedto coboundaries (that is, trivial or constant cocycles). Inthis article we prove the complete result. We present several useful applications of these results.     

Outflow refreshment angiography: A bright blood, bright static tissue technique

A new “bright blood” strategy, outflow refreshment imaging, is introduced in which a number of overlapping slices are excited in rapid succession. Flowing spins that refresh each overlapped slice portion contribute a bright signal. Additionally, static tissue in each non-overlapped slice portion also yields a bright signal. However, the flow/static contrast is comparable to that produced in inflow refreshment images, and angiograms can be generated by conventional maximum intensity projection processing. The dual ability to visualize angiograms and static tissue images is a major benefit of the strategy. Computer simulations of flow sensitivities and in vivo results are presented which compare the outflow and inflow refreshment imaging strategies.     

RANDOM EDGE can be exponential on abstract cubes

We prove that RANDOM EDGE, the simplex algorithm that always chooses a random improving edge to proceed on, can take a mildly exponential number of steps in the model of abstract objective functions (introduced by Williamson Hoke [Completely unimodal numberings of a simple polytope, Discrete Appl. Math. 20 (1988) 69-81.] and by Kalai [A simple way to tell a simple polytope from its graph, J. Combin. Theory Ser. A 49(2) (1988) 381-383.] under different names). We define an abstract objective function on the n-dimensional cube for which the algorithm, started at a random vertex, needs at least exp(const·n^1/3) steps with high probability. The best previous lower bound was quadratic. So in order for RANDOM EDGE to succeed in polynomial time, geometry must help.     

Adaptive local grid refinement algorithms for finite-element collocation

An adaptive grid refinement procedure allows accurate solutions to advection-dominated, time-dependent flows using finite-element collocation. The technique relies on a data structure that is readily amenable to parallel computing. The paper discusses computational aspects of the method.     

The Matsumoto-Yor property and the structure of the Wishart distribution

This paper establishes a link between a generalized matrix Matsumoto-Yor (MY) property and the Wishart distribution. This link highlights certain conditional independence properties within blocks of the Wishart and leads to a new characterization of the Wishart distribution similar to the one recently obtained by Geiger and Heckerman but involving independences for only three pairs of block partitionings of the random matrix.In the process, we obtain two other main results. The first one is an extension of the MY independence property to random matrices of different dimensions. The second result is its converse. It extends previous characterizations of the matrix generalized inverse Gaussian and Wishart seen as a couple of distributions.We present two proofs for the generalized MY property. The first proof relies on a new version of Herz's identity for Bessel functions of matrix arguments. The second proof uses a representation of the MY property through the structure of the Wishart.