Polyhedral <Emphasis Type="Italic">K</Emphasis><Subscript><Emphasis Type="Italic">2</Emphasis></Subscript>

 Using elementary graded automorphisms of polytopal algebras (essentially the coordinate rings of projective toric varieties) polyhedral versions of the group of elementary matrices and the Steinberg and Milnor groups are defined. They coincide with the usual K-theoretic groups in the special case when the polytope is a unit simplex and can be thought of as compact/polytopal substitutes for the tame automorphism groups of polynomial algebras. Relative to the classical case, many new aspects have to be taken into account. We describe these groups explicitly when the underlying polytope is 2-dimensional. Already this low-dimensional case provides interesting classes of groups. Received: 13 December 2001 / Revised version: 24 June 2002 The second author was supported by the Deutsche Forschungsgemeinschaft, INTAS grant 99-00817 and TMR grant ERB FMRX CT-97-0107 Mathematics Subject Classification (2000): 14L27, 14M25, 19C09, 52B20     

Singularity conjecture and constructions of Jacobi forms

This paper verifies the singularity conjecture for Jacobi forms with higher degree in some typical cases, and gives constructions for the Jacobi cusp forms whose Fourier coefficients can be expressed by some kind of Rankin-typeL-series.     

Instability of quark matter core in a compact newborn neutron star with moderately strong magnetic field

It is explicitly shown that if phase transition occurs at the core of a newborn neutron star with moderately strong magnetic field strength, which populates only the electron’s Landau levels, then in the β -equilibrium condition, the quark core is energetically much more unstable than the neutron matter of identical physical condition.     

Quantum diffusion

Basic ideas and results which characterize quantum diffusion of defects in quantum crystals like solid helium as a new phenomenon are presented. Quantum effects in such media lead to a delocalization of point defects (vacancies, impurities etc.) and they turn into quasiparticles of a new type—defectons, which are characterized not by their position in the crystal lattice but by their quasimomentum and dispersion law. Defecton-defecton and defecton-phonon scattering are considered and an interpolation formula for the diffusion coefficient valid in all interesting temperature and concentration regions is presented. A comparison with the experimental data is made. Some alternative points of view are discussed in detail and the inconsistency of the Kisvarsanyi-Sullivan theory is shown.     

Representations of Positive Projections II

In this paper we obtain a number of Maharam-type slice integral representations, with respect to scalar measures, for positive projections in Dedekind complete vector lattices and f-algebras. AMS Classification: 47B65, 46A40, 06F25     

Fonctions analytiques Cliffordiennes

We define analytic functions within Clifford Algebras CL, and study their trigonometric properties. We write the addition formulas when their arguments, A and B in CL, commute, this generalizes ordinary trigonometry. We examine in particular the case A² = 1.      

Isometric Isomorphisms Between Banach Algebras Related to a Certain Class of Clifford Topological Semigroups

In the present paper it is shown that if S₁ and S₂ are two Clifford topological semigroups satisfying certain conditions and T is an isometric isomorphism of LUC(S₁*) onto LUC(S₂*), then T maps S₁ topologically isomorphically onto S₂. Furthermore, T maps M ^l _n(S₁) (M(S₁), respectively) isometrically isomorphically onto M ^l _n(S₂) (M(S₂), respectively). Indeed, we have obtained a generalization of a well-known result of Ghahramani, Lau and Losert for locally compact groups to a more general setting of Clifford topological semigroups.     

Experiences in Expert Systems

This paper describes some work carried out in the Scientific Research and Development Branch (SRDB) of the Home Office, intended to contribute to an overall aim of building up internal expertise in the field of expert systems. This was done by carrying out a number of pilot and demonstrator projects, two of which are described in some detail. The plan, which proved successful, was to build as far as possible on the relevant skills already possessed by an OR group in the branch. The lessons learned from these are summarized in the hope that they will be of use to other groups who wish to become involved in this important area.     

Construction algorithms for polynomial lattice rules for multivariate integration

We introduce a new construction algorithm for digital nets for integration in certain weighted tensor product Hilbert spaces. The first weighted Hilbert space we consider is based on Walsh functions. Dick and Pillichshammer calculated the worst-case error for integration using digital nets for this space. Here we extend this result to a special construction method for digital nets based on polynomials over finite fields. This result allows us to find polynomials which yield a small worst-case error by computer search. We prove an upper bound on the worst-case error for digital nets obtained by such a search algorithm which shows that the convergence rate is best possible and that strong tractability holds under some condition on the weights.

We extend the results for the weighted Hilbert space based on Walsh functions to weighted Sobolev spaces. In this case we use randomly digitally shifted digital nets. The construction principle is the same as before, only the worst-case error is slightly different. Again digital nets obtained from our search algorithm yield a worst-case error achieving the optimal rate of convergence and as before strong tractability holds under some condition on the weights. These results show that such a construction of digital nets yields the until now best known results of this kind and that our construction methods are comparable to the construction methods known for lattice rules.

We conclude the article with numerical results comparing the expected worst-case error for randomly digitally shifted digital nets with those for randomly shifted lattice rules.