Critical star multigraphs

A star-multigraphG is a multigraph in which there is a vertexv ⁺ which is incident with each non-simple edge. It is critical if it is connected, Class 2 and(G\e) < (G) for eache E(G). We show that, ifG is any star multigraph, then(G) (G) + 1. We investigate the edge-chromatic class of star multigraphs with at most two vertices of maximum degree. We also obtain a number of results on critical star multigraphs. We shall make use of these results in later papers.     

The Topology of the Coloring Complex

In a recent paper, E. Steingrímsson associated to each simple graph G a simplicial complex _G, referred to as the coloring complex of G. Certain nonfaces of _G correspond in a natural manner to proper colorings of G. Indeed, the h-vector is an affine transformation of the chromatic polynomial _G of G, and the reduced Euler characteristic is, up to sign, equal to |_G(–1)|–1. We show that _G is constructible and hence Cohen-Macaulay. Moreover, we introduce two subcomplexes of the coloring complex, referred to as polar coloring complexes. The h-vectors of these complexes are again affine transformations of _G, and their Euler characteristics coincide with _G(0) and –_G(1), respectively. We show for a large class of graphs—including all connected graphs—that polar coloring complexes are constructible. Finally, the coloring complex and its polar subcomplexes being Cohen-Macaulay allows for topological interpretations of certain positivity results about the chromatic polynomial due to N. Linial and I. M. Gessel.Research financed by ECs IHRP Programme, within the Research Training Network Algebraic Combinatorics in Europe, grant HPRN-CT-2001-00272.     

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.     

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.     

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.     

The non-cancellation group of a direct power of a (finite cyclic)-by-cyclic group

If M is a finitely generated group having a finite commutator subgroup, then the set (M) of all isomorphism classes of groups G such that G×M× is a finite set and coincides with the Mislin genus (M) of M if M is nilpotent. For such groups M, there is a group structure on (M) defined in terms of the indices of embeddings of G into M, for groups G representing elements of (M). Such embeddings do exist and their indices are necessarily finite. If M is nilpotent, then this group structure on (M) coincides with the Hilton-Mislin group structure on the genus of M. In this paper we calculate the group (H^k) where H^k is the direct product of k copies of a group the form H= a,b | aⁿ=1, bab^-1=a^u, for any relatively prime pair of natural numbers n,u. In particular we find that for each such group H we have an isomorphism (H²)(H^k) whenever k>2.The author wishes to acknowledge financial support from the National Research Foundation of South Africa.Mathematics Subject Classification (2000): 20E34, 20F28Revised version: 10 December 2003     

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.     

Trace formulas for pair operators

In this paper we shall study the Fredholm determinant and related trace formulas for a class of operators which correspond to the restriction of integral operators with kernels of the form k(x,y) = (x)g^v(x–y)+[1–(x)]f^v(x–y) to the square |x|,|y| T and shall evaluate the limit as T . Here denotes the indicator function of the right half-line [0,) . The results obtained generalize the well known formulas of M. Kac for the classical convolution operator in which g = f .     

On the Coates–Sinnott Conjecture

Let E signify a totally real Abelian number field with a prime power conductor and ring of pintegers R _E for a prime p. Let G denote the Galois group of E over the rationals, and let be a padic character of G of order prime to p. Theorem A calculates, under a minor restriction on , the Fitting ideals of H ² _ét(R _E;Z _p (n/2+1))() over Z _p [G](). Here we require that n2 mod 4. These Fitting ideals are principal and generated by a Stickelberger element. This gives a partial verification and also a strong indication of the Coates–Sinnott conjecture.     

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.     

Parameter-dependent renewal theorems with applications

Let ₁, ₂, ... be a sequence of i.i.d. random variables with positive mean and finite variance and letr(b), b0, be real numbers tending to 0 asb . Definings _n=₁+...+_n andS _n=S_n(b)=s_n+r(b)n, the stopping time =(b)=inf {n>/1:S_n >b} whereb=b(b) , will be considered with special regard to the excess over the boundaryR _b=s+r(b)–b. It turns out that the limiting distribution ofR _b is the same as in the caser(b)0 for allb. Proving this, Blackwell's renewal theorem and its integral version have to be established first in the above stated situation. Finally, an expansion ofE to vanishing terms asb will be provided and applied to some examples arising in economics.

---

Zusammenfassung Seien ₁, ₂, ... unabhängige identisch verteilte Zufallsgrößen mit positivem Erwartungswert und endlicher Varianz sowier(b), b0, reelle Zahlen mitr(b)0 für b. Sei ferners ₁, s₂, ... der zugehörige Summenprozeß,S _n= S_n(b)=s_n+r(b)n fürn1 und =(b)=inf {n1: S_n>b, wobeib=b(b) fürb . Es wird gezeigt, daß die asymptotische Verteilung des ExzessesR _b=s +r(b) –b mit der im Fallr(·)0 übereinstimmt. Dazu werden sowohl das Blackwellsche Erneuerungstheorem als auch seine Integralversion in der vorher beschriebenen parameterabhängigen Situation geeignet formuliert und bewiesen. Als Folgerung ergibt sich dann eine asymptotische Entwicklung vonE(b) fürb bis zu Termen o(1). Anh- and einiger Beispiele aus dem ökonomischen Bereich wird schließlich noch aufgezeigt, wo Approximationen fürE(b) von Interesse sein können.

     

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     

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.     

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.     

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     

Opérateurs différentiels associés à certaines représentations unitaires d'un groupe de Lie résoluble exponentiel

Soient G = exp g un groupe de Lie résoluble exponentiel et H = exp h un sous-groupe connexe de G. Soient un caractère unitaire de H et = Ind_H ^G. Soit D(G/H) l'algèbre des opérateurs différentiels G-invariants sur G/H. Une question posée par Duflo et Corwin-Greenleaf consiste à voir si la finitude des multiplicités de est équivalente à la commutativité de D (G/H). Nous répondons positivement à cette question quand H est normal dans G. Lorsque H n'est pas normal, nous préparons le terrain pour d'espaces homogènes nilpotents et nous répondons à la question dans différents cas. Nous étudions finalement l'algèbre D (G) ^H , des opérateurs différentiels qui laissent l'espace des vecteurs C de invariant et qui commuttent avec l'action de H sur cet espace.     

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     

An upper bound for the total chromatic number

The total chromatic number,(G), of a graphG, is defined to be the minimum number of colours needed to colour the vertices and edges of a graph in such a way that no adjacent vertices, no adjacent edges and no incident vertex and edge are given the same colour. This paper shows that , where(G) is the vertex chromatic number and(G) is the edge chromatic number of the graph.Partially supported by ORS grant ORS/84120     

The cohomology of homotopy categories and the general linear group

A homotopy categoryC (of co-H-groups resp.H-groups) represents an element C in the third cohomology ofC. This element determines all Toda brackets and secondary homotopy operations inC. Moreover, in caseC =VS ⁿ consists of all one-point unions ofn-spheres, the bracket is actually a /2-generator which restricts to Igusa's class(1) in casen3; an explicit new cocycle for(1) is obtained by automorphisms of free nil(2)-groups.     

On the Approximation of Functions on Locally Compact Abelian Groups

Questions of approximative nature are considered for a space of functions L ^p(G, ), 1 p , defined on a locally compact abelian Hausdorff group G with Haar measure . The approximating subspaces which are analogs of the space of exponential type entire functions are introduced.