On Connes’ trace formula for the Hankel transformation of order-1/2

A local Hankel transformation of order 1/2 is defined for every finite place of the field of rational numbers.Its inversion formula and the Plancherel type theorem are obtained.A Connes type trace formula is given for each local Hankel transformation of order 1/2.An S-local Connes type trace formula is derived for the S-local Hankel transformation of order 1/2.These formulas are generalizations of Connes’ corresponding trace formulas in 1999.     

K3 surfaces,Picard numbers and Siegel disks

If a K3 surface admits an automorphism with a Siegel disk, then its Picard number is an even integer between 0 and 18. Conversely, using the method of hypergeometric groups, we are able to construct K3 surface automorphisms with Siegel disks that realize all possible Picard numbers. The constructions involve extensive computer searches for appropriate Salem numbers and computations of algebraic numbers arising from holomorphic Lefschetz-type fixed point formulas and related Grothendieck residues.     

Some variant of Newton’s method with third-order convergence

We present a new modification of the Newton’s method which produces iterative methods with order of convergence three. A general error analysis providing the higher order of convergence is given, and the best efficiency, in term of function evaluations, of two of this new methods is provided.     

Bulk viscosity of hot dense Quark matter in the PNJL model

Starting from the Kubo formula and the QCD low energy theorem, we study the the bulk viscosity of hot dense quark matter in the PNJL model from the equation of state. We show that the bulk viscosity has a sharp peak near the chiral phase transition, and that the ratio of bulk viscosity over entropy rises dramatically in the vicinity of the phase transition. These results agree with those from the lattice and other model calculations. In addition, we show that the increase of chemical potential raises the bulk viscosity.     

Poincaré series of semi-invariants of 2×2 matrices

The Poincaré series of the algebra of -invariants of m-tuples of 2×2 matrices is presented both as a rational function and as a series of Schur functions. We show that this algebra of invariants is generated by the determinants, the mixed discriminants and the discriminants of 2×2 matrices. Consequences on invariants of three-dimensional matrices of the shape 2×2×m are discussed. For arbitrary n2, we prove an explicit functional equation for the Poincaré series of the -invariants of m-tuples of n×n matrices.     

On the convergence of multipoint Padé-type approximants and quadrature formulas associated with the unit circle

We study the convergence of rational interpolants with prescribed poles on the unit circle to the Herglotz-Riesz transform of a complex measure supported on [–, ]. As a consequence, quadrature formulas arise which integrate exactly certain rational functions. Estimates of the rate of convergence of these quadrature formulas are also included.This research was performed as part of the European project ROLLS under contract CHRX-CT93-0416.     

Symmetric Powers of Galois Modules on Dedekind Schemes

We prove a certain Riemann–Roch-type formula for symmetric powers of Galois modules on Dedekind schemes which, in the number field or function field case, specializes to a formula of Burns and Chinburg for Cassou–Noguès–Taylor operations.     

MOMENT GENERATING FUNCTIONS OF RANDOM VARIABLES AND ASYMPTOTIC BEHAVIOUR FOR GENERALIZED FELLER OPERATORS

1. Introduction and NotationsThe generalized Feller operators which include many famous operators, such ajsBernstein, Szasz-Mirakjan, BaskakoV, Meyer--K5nig and Zeller operators, can be constructed by making use of the probabilistic method. In the paper [1][2], Xu JihuaPr(--lvjdetl a general scheme f(,r its construction, and Zhao Jillghui showed that theFeller type operators are of good approximations f'or unbounded functions.Our purpose is to present representation of moment generating …     

An iterative method for solving the stable subspace of a matrix pencil and its application

This work is to propose an iterative method of choice to compute a stable subspace of a regular matrix pencil. This approach is to define a sequence of matrix pencils via particular left null spaces. We show that this iteration preserves a semigroup property depending only on the initial matrix pencil. Via this recursion relationship, we propose an accelerated iterative method to compute the stable subspace and use it to provide a theoretical result to solve the principal square root of a given matrix, both nonsingular and singular. We show that this method can not only find out the matrix square root, but also construct an iterative approach which converges to the square root with any desired order.