Sparse generalized Fourier transforms

Block-diagonalization of sparse equivariant discretization matrices is studied. Such matrices typically arise when partial differential equations that evolve in symmetric geometries are discretized via the finite element method or via finite differences. By considering sparse equivariant matrices as equivariant graphs, we identify a condition for when block-diagonalization via a sparse variant of a generalized Fourier transform (GFT) becomes particularly simple and fast. Characterizations for finite element triangulations of a symmetric domain are given, and formulas for assembling the block-diagonalized matrix directly are presented. It is emphasized that the GFT preserves symmetric (Hermitian) properties of an equivariant matrix. By simulating the heat equation at the surface of a sphere discretized by an icosahedral grid, it is demonstrated that the block-diagonalization is beneficial. The gain is significant for a direct method, and modest for an iterative method. A comparison with a block-diagonalization approach based upon the continuous formulation is made. It is found that the sparse GFT method is an appropriate way to discretize the resulting continuous subsystems, since the spectrum and the symmetry are preserved. AMS subject classification (2000)  43A30, 65T99, 20B25     

A Partial Differential Inequality in Geological Models

Sedimentation and erosion processes in sedimentary basins can be modeled by a parabolic equation with a limiter on the fluxes and a constraint on the time variation.This limiter happens to satisfy a stationary scalar hyperbolic inequality,within a constraint,for which the authors prove the existence and the uniqueness of the solution.Actually,this solution is shown to be the maximal element of a convenient convex set of functions.The existence proof is obtained thanks to the use of a numerical scheme.     

Representations, convolution square roots and spherical vectors

We extend results on square integrable representations of a locally compact group to subrepresentations of a representations induced from a character of a closed subgroup. We do so working in the framework of quotient representations of ∗-algebras.     

On almost-sure versions of classical limit theorems for dynamical systems

The purpose of this article is to support the idea that “whenever we can prove a limit theorem in the classical sense for a dynamical system, we can prove a suitable almost-sure version based on an empirical measure with log-average”. We follow three different approaches: martingale methods, spectral methods and induction arguments. Our results apply, among others, to Axiom A maps or flows, to systems inducing a Gibbs–Markov map, and to the stadium billiard.     

A six-step synthesis of (S)-5-ethenyl-3-(1-methyl-2-pyrrolidinyl)pyridine (SIB-1508Y) from (S)-nicotine

The anti-Parkinson’s agent SIB-1508Y was prepared in six steps from (S)-nicotine in 20% overall yield. The strategy involves a regioselective formylation at C-5 of a 1,4-dihydronicotine intermediate.     

Synthesis and crystal structures of extremely crowded oligophenylenes as model precursors to ‘cubic graphite’

By using drastic conditions for a Diels-Alder cycloaddition reaction, it was possible to synthesize an oligophenylene with an extremely dense packing of the benzene rings. Crystallographic data could be obtained and a projection of the structure on the plane of the central phenyl ring reveals that the molecule retained its theoretical threefold symmetry with only minor deviations. Due to its dense packing of interlocked benzene rings, this oligophenylene could be furthermore used as a suitable precursor for constructing a subunit of ‘cubic graphite’.