The central limit theorem for Chébli-Trimèche hypergroups

Let (S _nn>-1) be a random walk on a hypergroup ( ₊ , *), i.e., a Markov chain with transition kernelN(x, A) = _x * (A), where is a fixed probability measure on ₊ such that the second moment exists. Then depending on the growth of the hypergroup two situations can occur: when ( ₊ , *) is of exponential growth then it is shown thatS _n is asymptotically normal. In the case of polynomial growth {more precisely, if the densityA of the Haar measure of ( ₊ , *) satisfies lim[A()/A()]=}, the normalized variablesS _n/[n Var()/(+1)]^1/2 converge to a Rayleigh distribution with parameter .     

A variational principle for eigenvalues of pencils of Hermitian matrices

LetH=(A, B) be a pair of HermitianN×N matrices. A complex number is an eigenvalue ofH ifdet(A–B)=0 (we include = ifdetB=0). For nonsingularH (i.e., for which some is not an eigenvalue), we show precisely which eigenvalues can be characterized as _k ⁺ =sup{inf{*A:*B=1,S},SS _k},S _k being the set of subspaces of C ^N of codimensionk–1.Dedicated to the memory of our friend and colleague Branko NajmanResearch supported by NSERC of Canada and the I.W.Killam FoundationProfessor Najman died suddenly while this work was at its final stage. His research was supported by the Ministry of Science of CroatiaResearch supported by NSERC of Canada     

Pseudo-mesures p- adiques associées aux fonctions L deQ

It is shown that some standard results concerning the p-adic L- functions, L_p(), ofQ(p-divisibilities of 1/2L_p(, s), and congruences for 1/2L_p(, t)–1/2L_p(, s), s, t_p) are direct consequences of a general structural theorem, based only on the functional properties of the p-adic pseudo-measures and distributions attached to these L_p-functions (essentially the eulerian ones). The method suggests that all such divisibilities and congruences are obtained systematically by this way, and are the best possible (in a standard point of view). In particular, these results improve significantly all the known ones.     

Coarse Cohomology and lp-Cohomology

We prove that, for any exact category M, any element of K₁(M)can be described in terms of a pair of admissible monomorphisms A X, B Y and an isomorphism :A X/A Y B Y/B X.     

The search for chromatically unique graphs

The number of vertex-colourings of a simple graphG in not more than colours is a polynomial in. This polynomial, denoted byP(G, ), is called the chromatic polynomial ofG. A graphG is said to be chromatically unique, in short-unique, ifH G for any graphH withP(H, ) = P(G, ). Since the appearance of the first paper on-unique graphs by Chao and Whitehead in 1978, various families of and several results on such graphs have been obtained successively, especially during the last five years. It is the aim of this expository paper to give a survey on most of the works done on-unique graphs. A number of related problems and conjectures are also included.1980 Mathematical Subject Classification. Primary 05C15This work was done while the author was visiting the Department of Mathematics, National University of Singapore.     

A relation between the zeros of an <Emphasis Type="Italic">L</Emphasis>-function belonging to the Selberg class and the zeros of an associated <Emphasis Type="Italic">L</Emphasis>-function twisted by a Dirichlet character

Let F (s) be a function belonging to the Selberg class. For a primitive Dirichlet character , we can define the -twist F(s) of F (s). If F(s) also belongs to the Selberg class and satisfies some other conditions then there is a relation between the zeros of F (s) and the zeros F(s). Further we give an operator theoretic interpretation of this relation according to A. Connes study.Received: 5 January 2004     

Edge Coloring of Embedded Graphs with Large Girth

Let G be a simple graph embedded in the surface of Euler characteristic ()0. Denote _e(G), and g the edge chromatic number, the maximum degree and the girth of the graph G, respectively. The paper shows that _e(G)= if 5 and g4, or 4 and g5, or 3 and g9. In addition, if ()>0, then _e(G)= if 3 and g8. Acknowledgments.The authors would like to thank Dr. C.Q. Zhang for carefully reading several versions of this paper during its preparation and for suggesting several stylistic changes that have improved the overall presentation.     

Colouring finite incidence structures

One of our results: Let denote a finite projective plane of ordern. Colour its vertices by colours. If no colour appears more than twice on any of the lines, then n + 1. Explicit constructions show that this bound is sharp when is desarguesian.     

Structures of topological type

In this paper we continue the study of structures of various types initiated by the author in the earlier paper Structures of extensions (Ref. Zh. Mat., 1974, 4A361). The present paper is devoted to the so-called structure of topological type. By a structure of topological type on the set X is meant a topological structure, defined on some set obtained from X, and possibly additional sets, by a totally ordered sequence of operations of unions of sets, products of sets, and passage to the set of subsets. We study certain structures of topological type: bitopological (Sec. 2) and settopological (Sec. 3). A bitopological structure on the set X is any topological structure on the set X×X, and a bitopological space is a pair (X,). This concept is a natural extension of the concept of a bitopological space as a set X on which there are given two topological structures ₁ and ₂-these structures define a structure =₁×₂ on the set X×X. A settopological structure on the set X is any topological structure on the set={A¦A. There are given representations of piecewise-linear structures (Sec. 4) and smooth structures (Sec. 5) as settopological structures.Translated from Zapiski Nauchnykh Seminarov Leningradskogo Otdeleniya Matematicheskogo Instituta im. V. A. Steklova AN SSSR, Vol. 83, pp. 5–62, 1979.     

Infinite dimensional multipoint methods and the solution of two point boundary value problems

Consider the problem of determining the roots of an equation of the formF() =0 whereF maps the Banach spaceX into itself. Convergence theorems for the iterative solution ofF() =0 are proved for multipoint algorithms of the form _n+1= _n - ( _n ), 1, where and ₀()=0. The theorems are applied to the solution of two point boundary value problems of the form =f (y, t), g(y(0))+h(y(1))=c. A set {A(t),B,C} of matrices is called boundary compatible if the linear two point boundary value problem =A(t)) y+k (t),B y (0) + C y (1) = d has a unique solution for allk (t) andd. Then, under certain conditions, there are boundary compatible sets such that the problem =f (y, t),g (y (0) ) +h (y (1)) =c has the equivalent integral representation where and are Green's matrices for the linear problem =A(t)y +k(t),B y (0) +C y (1) =d. Eq. (i) is viewed as an operator equation of the formF (x) =(I-T) (x) = 0 and convergence conditions for the iterative solution of (i) are deduced from the general theorems. Explicit interpretations of the convergence results are given in terms off, g, h and some illustrative numerical examples are presented.This research has been supported by the National Aeronautics and Space Administration under Grant No. NGR-40-002-015.This research has been supported by the National Science Foundation under Grant No. GK-2788.     

The crossing number of posets

The purpose of this paper is to investigate some properties of the crossing number (P) of a posetP. We first study the crossing numbers of the product and the lexicographical sum of posets. The results are similar to the dimensions of these posets. Then we consider the problem of what happens to the crossing number when a point is taken away from a poset. We show that ifP is a poset such that P and (P–)1, then 1/2 (P)(P–)(P). We don't know yet how to improve the lower bound. We also determine the crossing numbers of some subposets of the Boolean latticeB _n which consist of some specified ranks. Finally we show that _n is crossing critical where _n is the subposet ofB _n which is restricted to rank 1, rankn–1 and middle rank(s). Some open problems are raised at the end of this paper.     

A remark on a theorem of Losert

Subject to the continuum hypothesis, the Haar measure on a compact group of topological weight ₂ admits a Baire strong lifting.     

On the dispersion spectrum

A measure for the denseness of sequences (an) mod 1, irrational, is the dispersion constantD() introduced byH. Niederreiter. In this paper the smallest accumulation point ₁ of the set of theD() is determined and all those are explicitely given for whichD () < ₁ holds.     

On the discrete mean square of Dirichlet <Emphasis Type="Italic">L</Emphasis>-functions at 1

There have been many results obtained so far for the mean square of the (absolute) value of the Dirichlet L-function L(s,) in the critical strip 0<<1, especially on the critical line , but relatively few results were known for discrete mean value of |L(1,)|² till W. Zhang had published papers improving the error term step by step, which have recently been superseded by M. Katsurada and K.Matsumoto in which they succeeded in deriving an asymptotic formula for ₀|L(1,)|². The object of our paper is to point out a structural property contained in the formation of the mean square, to find out the niryana–the true body of the above sum.Dedicated to Professor Jean Louis Nicolás on his sixtieth birthdayin final form: 7 October 2003     

Continuous Singularity of the Weak Limit of Convolution Powers of a Discrete Probability Measure on 2 × 2 Stochastic Matrices

Let be a probability measure on n 2 × 2 stochastic matrices, n an arbitrary positive integer, and = (w) lim _n ⁿ , such that the support of consists of 2 × 2 stochastic matrices of rank one, and as such, can be regarded as a probability measure on [0, 1]. We present simple sufficient conditions for to be continuous singular w.r.t. the Lebesgue measure on [0, 1]. We also determine , given .     

On the factorization of the relative class number in terms of Frobenius divisions

The relative class number of an imaginary abelian number fieldK is—up to trivial factors—the product of the first Bernoulli numbersB _x belonging to the odd characters ofK. This product splits into rational factorsF _Z = {B ; Z}, whereZ runs through the Frobenius divisions of odd characters. It is shown that each numberF _z is—up to a certain prime power—the index of two explicitly given subgroups of (K, +). These subgroups are cyclic Galois modules, whose generators arise from roots of unity and cotangent numbers, resp. Our result is an analogue of a result concerningh ⁺ which was given by Leopoldt many years ago.To the memory of my friend Kurt Dietrich     

Some Non-trivial Symmetry Classes of Tensors Associated with Certain Characters

Let G be a finite group and a set of n elements. Assume that G acts faithfully on and let V be a vector space over the complex field , with dim V = m 2. It is shown that for each irreducible constituent of permutation character of G, the symmetry class of tensors associated with G and is non-trivial. This extends a result of Merris and Rashid (see [6, Theorem 2]).1995 AMS subject classification primary 20C30 secondary 15A69This research was in part supported by a grant from IPM.     

Circular Chromatic Number and Mycielski Graphs

As a natural generalization of graph coloring, Vince introduced the star chromatic number of a graph G and denoted it by ^*(G). Later, Zhu called it circular chromatic number and denoted it by _c(G). Let (G) be the chromatic number of G. In this paper, it is shown that if the complement of G is non-hamiltonian, then _c(G)=(G). Denote by M(G) the Mycielski graph of G. Recursively define M^m(G)=M(M^m–1(G)). It was conjectured that if mn–2, then _c(M^m(K_n))=(M^m(K_n)). Suppose that G is a graph on n vertices. We prove that if , then _c(M(G))=(M(G)). Let S be the set of vertices of degree n–1 in G. It is proved that if |S| 3, then _c(M(G))=(M(G)), and if |S| 5, then _c(M²(G))=(M²(G)), which implies the known results of Chang, Huang, and Zhu that if n3, _c(M(K_n))=(M(K_n)), and if n5, then _c(M²(K_n))=(M²(K_n)).* Research supported by Grants from National Science Foundation of China and Chinese Academy of Sciences.     

Prolongement Méromorphe des séries de Dirichlet à Support dans un sous-Ensemble semi-algébrique de Rn

We consider the Dirichlet series Z(P,A;s) = P^–s(m) (s C) where P R[X₁ ,..., X_n] and A is an open semi-algebraic subset of Rⁿ. We will say that Z(P,A;s) exists if this multiple series is absolutely convergent. In this paper we study the existence and several properties of meromorphic continuations of such series, under certain assumption on P and A. As an application, we show the existence of a finite asymptotic expansion of the counting function with support in A: N_p(A,t):= m A Zⁿ | P(m) t} when t +.