Gauss Algebras

A special class of associative algebras is introduced and studied. A criteria of semisimplicity for suitable category of modules is obtained.     

Some Problems of Harmonic Analysis on Reductive Groups

An algebraic approach to harmonic analysis on reductive Lie groups is proposed. The case of complex semisimple Lie groups is considered in details. Some problems for real reductive Lie groups are discussed.     

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.     

A new reaction of vicinal sulfonyliminocarboxylates with phosphites

The reaction of alkyl trifluoro(organylsulfonylimino)propionates with phosphites occurs with NC transfer of the RSO₂ group and leads to sulfonyl-substituted trifluoroalanine derivatives. The novel rearrangement is interpreted as cheletropic 1,4-cycloaddition of the phosphite and subsequent 1,2-shift of the sulfonyl group in the intermediate cyclic phosphorane.     

Synthesis and Structure of Mixed Phosphonium-iodonium Ylide

A mixed phosphonium-iodonium ylide, phenyliodoniumethoxycarbonylmethylenetriphenylphosphorane borofluoride, was synthesized. Its structure was established by means of X-ray diffraction analysis. Temperature dependence of ¹H, ¹³C, and ³¹P spectra of the ylide synthesized was investigated. A dynamic equilibrium between Z and E-isomers was observed.     

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.