CLP-compactness for topological spaces and groups

We study CLP-compact spaces (every cover consisting of clopen sets has a finite subcover) and CLP-compact topological groups. In particular, we extend a theorem on CLP-compactness of products from [J. Steprāns, A. Šostak, Restricted compactness properties and their preservation under products, Topology Appl. 101 (3) (2000) 213-229] and we offer various criteria for CLP-compactness for spaces and topological groups, that work particularly well for precompact groups. This allows us to show that arbitrary products of CLP-compact pseudocompact groups are CLP-compact. For every natural n we construct:

(i)

a totally disconnected, n-dimensional, pseudocompact CLP-compact group; and

(ii)

a hereditarily disconnected, n-dimensional, totally minimal, CLP-compact group that can be chosen to be either separable metrizable or pseudocompact (a Hausdorff group G is totally minimal when all continuous surjective homomorphisms G→H, with a Hausdorff group H, are open).

     

Artin's L-functions and one-dimensional characters

Let K/Q be a finite Galois extension with the Galois group G, let χ₁,…,χr be the irreducible non-trivial characters of G, and let A be the C-algebra generated by the Artin L-functions L(s,χ₁),…,L(s,χr). Let B be the subalgebra of A generated by the L-functions corresponding to induced characters of non-trivial one-dimensional characters of subgroups of G. We prove: (1) B is of Krull dimension r and has the same quotient field as A; (2) B=A iff G is M-group; (3) the integral closure of B in A equals A iff G is quasi-M-group.     

Limit theorems and Markov approximations for chaotic dynamical systems

Summary We prove the central limit theorem and weak invariance principle for abstract dynamical systems based on bounds on their mixing coefficients. We also develop techniques of Markov approximations for dynamical systems. We apply our results to expanding interval maps, Axiom A diffeomorphisms, chaotic billiards and hyperbolic attractors.     

Compositions with distinct parts

The number of compositionsC(n) of a positive integern into distinct parts can be considered as a natural analogue of the numberq(n) of distinct partitions ofn. We obtain an asymptotic estimate forC(n) and in addition show that the sequence {C(n, k)} of distinct compositions ofn withk distinct parts is unimodal. Our analysis is more complicated than is usual for composition problems. The results imply however that the behaviour of these functions is of comparable complexity to partition problems.     

Frobenius-Perron operators and approximation of invariant measures for set-valued dynamical systems

A set-valued dynamical systemF on a Borel spaceX induces a set-valued operatorF onM(X) — the set of probability measures onX. We define arepresentation ofF, each of which induces an explicitly defined selection ofF; and use this to extend the notions of invariant measure and Frobenius-Perron operators to set-valued maps. We also extend a method ofS. Ulam to Markov finite approximations of invariant measures to the set-valued case and show how this leads to the approximation ofT-invariant measures for transformations , whereT corresponds to the closure of the graph of .     

String Jacobi Matrices with Very Fast Decreasing Weights

In this work we investigate a class of string, compact Jacobi matrices with very rapidly decreasing weights. In particular, we have found Hellinger-Weyls function representation as ratio of two entire functions with known Taylor series representation. The asymptotical estimations of zeroes of this entire functions and of eigenvalues of a corresponding operator are found. The application of this theory to Rogers-Ramanujans functions is considered.Submitted: November 18, 2002 Revised: October 30, 2003     

Notes sur la fonction ζ de Riemann, 4

Opération fondamentale de l'arithmétique, familière depuis des millénaires, la division euclidienne n'a pas livré tous ses secrets. Ainsi, notons pour k et a entiers positifs, le reste de la division euclidienne de k par a, et imaginons un instant que, par un choix convenable d'un entier n et de réels c₂,…,c_n, nous sachions rendre arbitrairement petite la quantité

     

Increasing Self-Described Sequences

We proceed with our study of increasing self-described sequences F, beginning with 1 and defined by a functional equation In [1] we exhibited the simple solution f (t)=Ct, for some (0,1), of the associated functional-differential equation and we proved that provided <2/(2+d()), where we have the asymtotic equivalence F(m)~ Cm.In the present paper we show that this last result is optimal, in the sense that the self-described sequence defined by |F^–1(m)|=F(m)², that is