Polynomial Quantization on Rank One Para-Hermitian Symmetric Spaces

We construct the polynomial quantization on the space G/H where G=SL(n,R),H=GL(n–1,R). It is a variant of quantization in the spirit of Berezin. In our case covariant and contravariant symbols are polynomials on G/H. We introduce a multiplication of covariant symbols, establish the correspondence principle, study transformations of symbols (the Berezin transform) and of operators. We write a full asymptotic decomposition of the Berezin transform.     

Explicit 2-Factorisations of the Odd Graph

In this note we show how 1-factors in the middle two layers of the discrete cube can be used to construct 2-factors in the Odd graph (the Kneser graph of (k − 1)-sets from a (2k − 1)-set). In particular, we use the lexical matchings of Kierstead and Trotter, and the modular matchings of Duffus, Kierstead and Snevily, to give explicit constructions of two different 2-factorisations of the Odd graph. This revised version was published online in September 2006 with corrections to the Cover Date.     

Microwave-accelerated conjugate addition of aldehydes to α,β-unsaturated ketones

Aldehydes undergo smooth conjugate addition to α,β-unsaturated ketones in the presence of 5-(2-hydroxyethyl)-1,3-thiazolium halides and DBU adsorbed onto the surface of basic alumina under microwave irradiation and solvent-free conditions to afford 1,4-diketones in enhanced yields and reduced reaction times compared to conventional methods.     

Uniformity in Computable Structure Theory

We investigate the effects of adding uniformity requirements to concepts in computable structure theory such as computable categoricity (of a structure) and intrinsic computability (of a relation on a computable structure). We consider and compare two different notions of uniformity, previously studied by Kudinov and by Ventsov. We discuss some of their results and establish new ones, while also exploring the connections with the relative computable structure theory of Ash, Knight, Manasse, and Slaman and Chisholm and with previous work of Ash, Knight, and Slaman on uniformity in a general computable structure-theoretical setting.     

Two-row nilpotent orbits of cyclic quivers

We prove that the local intersection cohomology of nilpotent orbit closures of cyclic quivers is trivial when the two orbits involved correspond to partitions with at most two rows. This gives a geometric proof of a result of Graham and Lehrer, which states that standard modules of the affine Hecke algebra of GL_d corresponding to nilpotents with at most two Jordan blocks are multiplicity-free. Received: 7 February 2002 / Published online: 8 November 2002