A local-global principle for finiteness properties ofS-arithmetic groups over number fields

In the preceding paper [AT] compactness propertiesC _n andCP _n for locally compact groups were introduced. They generalize the finiteness propertiesF _n andFP _n for discrete groups. In this paper a local-global principle forS-arithmetic groups over number fields is proved. TheS-arithmetic group is of typeF _n , resp.FP _n , if and only if for allp inS thep-adic completionG _p of the corresponding algebraic groupG is of typeC _n resp.CP _n . As a corollary we obtain an easy proof of a theorem of Borel and Serre: AnS-arithmetic subgroup of a semisimple group has all the finiteness propertiesF _n .     

Greatest common subgraphs with specified properties

A graphG without isolated vertices is a greatest common subgraph of a setG of graphs, all having the same size, ifG is a graph of maximum size that is isomorphic to a subgraph of every graph inG. A number of results concerning greatest common subgraphs are presented. For several graphical propertiesP, we discuss the problem of determining, for a given graphG with propertyP, the existence of two non-isomorphic graphsG ₁ andG ₂ of equal size, also with propertyP, such thatG is the unique greatest common subgraph ofG ₁ andG ₂. In particular, this problem is solved whenP is the property of being 2-connected and whenP is the property of having chromatic numbern.     

Sur la propriétéP *

On the PropertyP _*. LetG be a locally compact group. We give a direct proof of the equivalence of the propertiesP ₁ andP _*, avoiding the use of invariant means onL (G).     

Prime ideals in the C*-algebra of a nilpotent group

We say that a locally compact groupG hasT ₁ primitive ideal space if the groupC ^*-algebra,C ^*(G), has the property that every primitive ideal (i.e. kernel of an irreducible representation) is closed in the hull-kernel topology on the space of primitive ideals ofC ^*(G), denoted by PrimG. This means of course that every primitive ideal inC ^*(G) is maximal. Long agoDixmier proved that every connected nilpotent Lie group hasT ₁ primitive ideal space. More recentlyPoguntke showed that discrete nilpotent groups haveT ₁ primitive ideal space and a few month agoCarey andMoran proved the same property for second countable locally compact groups having a compactly generated open normal subgroup. In this note we combine the methods used in [3] with some ideas in [9] and show that for nilpotent locally compact groupsG, having a compactly generated open normal subgroup, closed prime ideals inC ^*(G) are always maximal which implies of course that PrimG isT ₁.     

A rigidity theorem for the pair ${\cal q}{\Bbb C} P^n$ (complex hyperquadric, complex projective space)

Given a compact Kähler manifold M of real dimension 2n, let P be either a compact complex hypersurface of M or a compact totally real submanifold of dimension n. Let q\cal q (resp. \Bbb R Pⁿ{\Bbb R} P^n) be the complex hyperquadric (resp. the totally geodesic real projective space) in the complex projective space \Bbb C Pⁿ{\Bbb C} P^n of constant holomorphic sectional curvature 4l \lambda . We prove that if the Ricci and some (n-1)-Ricci curvatures of M (and, when P is complex, the mean absolute curvature of P) are bounded from below by some special constants and volume (P) / volume (M) ￡\leq volume (q\cal q)/ volume (\Bbb C Pⁿ)({\Bbb C} P^n) (resp. ￡\leq volume (\Bbb R Pⁿ)({\Bbb R} P^n) / volume (\Bbb C Pⁿ)({\Bbb C} P^n)), then there is a holomorphic isometry between M and \Bbb C Pⁿ{\Bbb C} P^n taking P isometrically onto q\cal q (resp. \Bbb R Pⁿ{\Bbb R} P^n). We also classify the Kähler manifolds with boundary which are tubes of radius r around totally real and totally geodesic submanifolds of half dimension, have the holomorphic sectional and some (n-1)-Ricci curvatures bounded from below by those of the tube \Bbb R Pⁿ_r{\Bbb R} P^n_r of radius r around \Bbb R Pⁿ{\Bbb R} P^n in \Bbb C Pⁿ{\Bbb C} P^n and have the first Dirichlet eigenvalue not lower than that of \Bbb R Pⁿ_r{\Bbb R} P^n_r.     

Dissipation of Convolution Powers in a Metric Group

In contrast to what is known about probability measures on locally compact groups, a metric group G can support a probability measure μ which is not carried on a compact subgroup but for which there exists a compact subset C⊆G such that the sequence μ ⁿ (C) fails to converge to zero as n tends to ∞. A noncompact metric group can also support a probability measure μ such that supp μ=G and the concentration functions of μ do not converge to zero. We derive a number of conditions which guarantee that the concentration functions in a metric group G converge to zero, and obtain a sufficient and necessary condition in order that a probability measure μ on G satisfy lim  _n→∞ μ ⁿ (C)=0 for every compact subset C⊆G. Supported by an NSERC Grant.     

Vertex Distinguishing Equitable Total Chromatic Number of Join Graph

A vertex distinguishing equitable total coloring of graph G is a proper total coloring of graph G such that any two distinct vertices＇ coloring sets are not identical and the difference of the elements colored by any two colors is not more than 1. In this paper we shall give vertex distinguishing equitable total chromatic number of join graphs Pn VPn, Cn VCn and prove that they satisfy conjecture 3, namely, the chromatic numbers of vertex distinguishing total and vertex distinguishing equitable total are the same for join graphs Pn V Pn and Cn ∨ Cn.     

Hereditarily extended properties, quasi-random graphs and not necessarily induced subgraphs

Recently much attention has been focused on the theory of quasi-random graph and hypergraph properties. The class of quasi-random graphs is defined by certain equivalent graph properties possessed by random graphs. We shall investigate propertiesP which do not imply quasi-randomnes for sequences (G _n ) of graphs on their own, but do imply if they hold not only for the whole graphG _n but also for every sufficiently large subgraph ofG _n . Here the properties are strongly connected to countingnot necessarily induced subgraphs of a given type, while in a subsequent paper we shall investigate the properties connected with counting induced subgraphs.Dedicated to the memory of Paul ErdsResearch supported by OTKA N1909.     

Counterexamples to a conjecture of mader about cycles through specified vertices inn-edge-connected graphs

For each oddn≥3, we constructn-edge-connected graphsG with the following property: There are two verticesu andv inG such that for every cycleC inG passign throughu andv the graphG-E(C) is not (n-2)-edge-connected. HereE(C) denotes the set of edges ofC, and a cycle is allowed to pass through a vertex more than once.     

Courants invariants par une action propre

The purpose of this paper is to characterise the invariant sections-distributions by a proper action. More precisely, we show that if G is a connected Lie group acting on a differentiable vector bundle E→V such that the induced action on V is proper, then the topological vector space of the G-invariant linear functionals (on the space of C ^∞ sections with compact support) equipped with the induced weak-topology (resp. the strong-topology), is isomorphic to the weak (resp. strong) topological dual of the space (of all G-invariant sections σ with compact quotient supp(σ)/G) equipped with a suitable topology; this coincides with the usual C ^∞-topology if the orbit space is compact, and with the Schwartz-topology if the group G is compact. Received: 8 June 1998 / Revised version: 22 September 1998     

Distal actions and shifted convolution property

A locally compact group G is said to have shifted convolution property (abbr. as SCP) if for every regular Borel probability measure μ on G, either sup _x∈G μ ⁿ (Cx) → 0 for all compact subsets C of G, or there exist x ∈ G and a compact subgroup K normalised by x such that μ ⁿ x ⁻ⁿ → ωK, the normalised Haar measure on K. We first consider distality of factor actions of distal actions. It is shown that this holds in particular for factors by compact groups invariant under the action and for factors by the connected component of the identity. We then characterize groups having SCP in terms of a readily verifiable condition on the conjugation action (pointwise distality). This gives some interesting corollaries to distality of certain actions and Choquet-Deny measures which actually motivated SCP and pointwise distal groups. We also relate distality of actions on groups to that of the extensions on the space of probability measures.     

Maximum chromatic polynomials of 2-connected graphs

In this paper we obtain chromatic polynomials P(G; λ) of 2-connected graphs of order n that are maximum for positive integer-valued arguments λ ≧ 3. The extremal graphs are cycles C_n and these graphs are unique for every λ ≧ 3 and n ≠ 5. We also determine max{P(G; λ): G is 2-connected of order n and G ≠ C_n} and all extremal graphs relative to this property, with some consequences on the maximum number of 3-colorings in the class of 2-connected graphs of order n having _X(G) = 2 and _X(G) = 3, respectively. For every n ≧ 5 and λ ≧ 4, the first three maximum chromatic polynomials of 2-connected graphs are determined.     

Tearing a strip off the plane

In this article we examine some homomorphic properties of certain subgraphs of the unit-distance graph. We define G_r to be the subgraph of the unit-distance graph induced by the subset (−∞, ∞) × [0, r] of the plane. The bulk of the article is devoted to examining the graphs G_r, when r is the minimum width such that G_r contains an odd cycle of given length. We determine for each odd n the minimum width r_n such that contains an n-cycle C_n, and characterize the embeddings of C_n in $G_{r_{n}}$. We then show that is homomorphically equivalent to C_n when n ≡ 3 (mod 4), but is a core when n ≡ 1 (mod 4). We begin by showing that G_r is homomorphically compact for each r ≥ 0, as defined in [1]. We conclude with some other interesting results and open problems related to the graphs G_r. © 1998 John Wiley & Sons, Inc. J. Graph Theory 29: 17–33, 1998     

On Countable Products of Finite Hausdorff Spaces

We investigate in ZF (i.e., Zermelo‐Fraenke set theory without the axiom of choice) conditions that are necessary and sufficient for countable products ∏_m∈ℕX_m of (a) finite Hausdorff spaces X_m resp. (b) Hausdorff spaces X_m with at most n points to be compact resp. Baire. Typica results: (i) Countable products of finite Hausdorff spaces are compact (resp. Baire) if and only if countable products of non‐empty finite sets are non‐empty. (ii) Countable products of discrete spaces with at most n + 1 points are compact (resp. Baire) if and only if countable products of non‐empty sets with at most n points are non‐empty.     

Invariants for group algebras of Abelian groups

LetF be a field of characteristicp>0 and letG be an arbitrary abelian group written multiplicatively withp-basis subgroup denoted byB. The first main result of the present paper is thatB is an isomorphism invariant of theF-group algebraFG. In particular, thep-local algebraically compact groupG can be retrieved fromFG. Moreover, for the lower basis subgroupB ₁ of thep-componentG _p it is shown thatG _p/B_l is determined byFG. Besides, ifH is (p-)high inG, thenG _p/H_p andH ^{p n}[p] for ℕ₀ are structure invariants forFG, andH[p] as a valued vector space is a structural invariant forN ₀ G, whereN _p is the simple field ofp-elements. Next, presume thatG isp-mixed with maximal divisible subgroupD. ThenD andF(G/D) are functional invariants forFG. The final major result is that the relative Ulm-Kaplansky-Mackeyp-invariants ofG with respect to the subgroupC are isomorphic invariants of the pair (FG, FC) ofF-algebras. These facts generalize and extend analogous in this aspect results due to May (1969), Berman-Mollov (1969) and Beers-Richman-Walker (1983). As a finish, some other invariants for commutative group algebras are obtained.     

An operator approach to zero-sum repeated games

We consider two person zero-sum stochastic games. The recursive formula for the valuesvλ (resp.v _n) of the discounted (resp. finitely repeated) version can be written in terms of a single basic operator Φ(α,f) where α is the weight on the present payoff andf the future payoff. We give sufficient conditions in terms of Φ(α,f) and its derivative at 0 for limv _n and limvλ to exist and to be equal. We apply these results to obtain such convergence properties for absorbing games with compact action spaces and incomplete information games.     

Generalized Ramsey theory for multiple colors

In this paper, we study the generalized Ramsey number r(G₁,…, G_k) where the graphs G₁,…, G_k consist of complete graphs, complete bipartite graphs, paths, and cycles. Our main theorem gives the Ramsey number for the case where G₂,…, G_k are fixed and G₁ C_n or P_n with n sufficiently large. If among G₂,…, G_k there are both complete graphs and odd cycles, the main theorem requires an additional hypothesis concerning the size of the odd cycles relative to their number. If among G₂,…, G_k there are odd cycles but no complete graphs, then no additional hypothesis is necessary and complete results can be expressed in terms of a new type of Ramsey number which is introduced in this paper. For k = 3 and k = 4 we determine all necessary values of the new Ramsey number and so obtain, in particular, explicit and complete results for the cycle Ramsey numbers r(C_n, C_l, C_k) and r(C_n, C_l, C_k, C_m) when n is large.     

The crossing number of <Emphasis Type="Italic">G</Emphasis> ▭ <Emphasis Type="Italic">C</Emphasis><Subscript><Emphasis Type="Italic">n</Emphasis></Subscript> for the graph <Emphasis Type="Italic">G</Emphasis> on six vertices

The crossing numbers of Cartesian products of paths, cycles or stars with all graphs of order at most four are known. The crossing numbers of G□C _n for some graphs G on five and six vertices and the cycle C _n are also given. In this paper, we extend these results by determining the crossing number of the Cartesian product G □ C _n , where G is a specific graph on six vertices.     

Orientations of circle graphs

Let C(v₁, …,v_n) be a system consisting of a circle C with chords v₁, …,v_n on it having different endpoints. Define a graph G having vertex set V(G) = {v₁, …,v_n} and for which vertices v_i and v_j are adjacent in G if the chords v_i and v_j intersect. Such a graph will be called a circle graph. The chords divide the interior of C into a number of regions. We give a method which associates to each such region an orientation of the edges of G. For a given C(v₁, …,v_n) the number m of different orientations corresponding to it satisfies q + 1 ≤ m ≤ n + q + 1, where q is the number of edges in G. An oriented graph obtained from a diagram C(v₁, …,v_n) as above is called an oriented circle graph (OCG). We show that transitive orientations of permutation graphs are OCGs, and give a characterization of tournaments which are OCGs. When the region is a peripheral one, the orientation of G is acyclic. In this case we define a special orientation of the complement of G, and use this to develop an improved algorithm for finding a maximum independent set in G.     

Convergence of the efficient sets

LetA _n,n=1, 2, ... be nonempty subsets of a linear metric spaceE andC _n, n=1, 2, ... convex cones ofE. We consider the efficient sets Min(A _n, C_n) and the aim of this paper is to show that under suitable conditions, the convergence ofA _n andC _n toA andC respectively, implies the convergence of Min(A _n,C _n) to Min(A, C). Several illustrative examples are given which clarify the results.