On the ideal structure of some Banach algebras related to convolution operators on L(G)

Let G be a locally compact group and let p∈(1,∞). Let be any of the Banach spaces C_δ,p(G), PF_p(G), M_p(G), AP_p(G), WAP_p(G), UC_p(G), PM_p(G), of convolution operators on L^p(G). It is shown that PF_p(G)′ can be isometrically embedded into UC_p(G)′. The structure of maximal regular ideals of (and of MA_p(G)″, B_p(G)″, W_p(G)″) is studied. Among other things it is shown that every maximal regular left (right, two sided) ideal in is either dense or is the annihilator of a unique element in the spectrum of A_p(G). Minimal ideals of is also studied. It is shown that a left ideal M in is minimal if and only if , where Ψ is either a right annihilator of or is a topologically x-invariant element (for some x∈G). Some results on minimal right ideals are also given.     

The critical number of finite abelian groups

Let G be an additive, finite abelian group. The critical number cr(G) of G is the smallest positive integer ? such that for every subset S⊂G?{0} with |S|?? the following holds: Every element of G can be written as a nonempty sum of distinct elements from S. The critical number was first studied by P. Erd?s and H. Heilbronn in 1964, and due to the contributions of many authors the value of cr(G) is known for all finite abelian groups G except for G≅Z/pqZ where p,q are primes such that . We determine that cr(G)=p+q−2 for such groups.     

The upper connected geodetic number and forcing connected geodetic number of a graph

For a connected graph G of order p≥2, a set S⊆V(G) is a geodetic set of G if each vertex v∈V(G) lies on an x-y geodesic for some elements x and y in S. The minimum cardinality of a geodetic set of G is defined as the geodetic number of G, denoted by g(G). A geodetic set of cardinality g(G) is called a g-set of G. A connected geodetic set of G is a geodetic set S such that the subgraph G[S] induced by S is connected. The minimum cardinality of a connected geodetic set of G is the connected geodetic number of G and is denoted by g_c(G). A connected geodetic set of cardinality g_c(G) is called a g_c-set of G. A connected geodetic set S in a connected graph G is called a minimal connected geodetic set if no proper subset of S is a connected geodetic set of G. The upper connected geodetic number is the maximum cardinality of a minimal connected geodetic set of G. We determine bounds for and determine the same for some special classes of graphs. For positive integers r,d and n≥d+1 with r≤d≤2r, there exists a connected graph G with , and . Also, for any positive integers 2≤a<b≤c, there exists a connected graph G such that g(G)=a, g_c(G)=b and . A subset T of a g_c-set S is called a forcing subset for S if S is the unique g_c-set containing T. A forcing subset for S of minimum cardinality is a minimum forcing subset of S. The forcing connected geodetic number of S, denoted by f_c(S), is the cardinality of a minimum forcing subset of S. The forcing connected geodetic number of G, denoted by f_c(G), is f_c(G)=min{f_c(S)}, where the minimum is taken over all g_c-sets S in G. It is shown that for every pair a,b of integers with 0≤a≤b−4, there exists a connected graph G such that f_c(G)=a and g_c(G)=b.     

Large sets in finite fields are sumsets

For a prime p, a subset S of Zp is a sumset if S=A+A for some A⊂Zp. Let f(p) denote the maximum integer so that every subset S⊂Zp of size at least p−f(p) is a sumset. The question of determining or estimating f(p) was raised by Green. He showed that for all sufficiently large p, and proved, with Gowers, that f(p)<cp2/3log1/3p for some absolute constant c. Here we improve these estimates, showing that there are two absolute positive constants c₁,c₂ so that for all sufficiently large p,

     

Moment conditions and support theorems for Radon transforms on affine Grassmann manifolds

Let G(p,n) and G(q,n) be the affine Grassmann manifolds of p- and q-planes in Rⁿ, respectively, and let be the Radon transform from smooth functions on G(p,n) to smooth functions on G(q,n) arising from the inclusion incidence relation. When p<q and dimG(p,n)=dimG(p,n), we present a range characterization theorem for via moment conditions. We then use this range result to prove a support theorem for . This complements a previous range characterization theorem for via differential equations when dimG(p,n)<dimG(p,n). We also present a support theorem in this latter case.     

Circular game chromatic number of graphs

In a circular r-colouring game on G, Alice and Bob take turns colouring the vertices of G with colours from the circle S(r) of perimeter r. Colours assigned to adjacent vertices need to have distance at least 1 in S(r). Alice wins the game if all vertices are coloured, and Bob wins the game if some uncoloured vertices have no legal colour. The circular game chromatic number χ_cg(G) of G is the infimum of those real numbers r for which Alice has a winning strategy in the circular r-colouring game on G. This paper proves that for any graph G, , where is the game colouring number of G. This upper bound is shown to be sharp for forests. It is also shown that for any graph G, χ_cg(G)≤2χ_a(G)(χ_a(G)+1), where χ_a(G) is the acyclic chromatic number of G. We also determine the exact value of the circular game chromatic number of some special graphs, including complete graphs, paths, and cycles.     

Operator space structure on Feichtinger's Segal algebra

We extend the definition, from the class of abelian groups to a general locally compact group G, of Feichtinger's remarkable Segal algebra S₀(G). In order to obtain functorial properties for non-abelian groups, in particular a tensor product formula, we endow S₀(G) with an operator space structure. With this structure S₀(G) is simultaneously an operator Segal algebra of the Fourier algebra A(G), and of the group algebra L¹(G). We show that this operator space structure is consistent with the major functorial properties: (i) completely isomorphically (operator projective tensor product), if H is another locally compact group; (ii) the restriction map is completely surjective, if H is a closed subgroup; and (iii) is completely surjective, where N is a normal subgroup and . We also show that S₀(G) is an invariant for G when it is treated simultaneously as a pointwise algebra and a convolutive algebra.     

On the dual rigidity matrix

A novel characterization of bar-and-joint framework rigidity was introduced in [A.Y. Alfakih. Graph rigidity via Euclidean distance matrices. Linear Algebra Appl., 310 (2000) 149-165; A.Y. Alfakih. On rigidity and realizability of weighted graphs. Linear Algebra Appl., 325 (2001) 57-70]. This characterization uses the notion of normal cones of convex sets to define a matrix whose rank determines whether or not a given generic framework is rigid. Furthermore, this characterization was derived under the assumption that the framework of interest G(p) has an equivalent framework G(q) in R^n-1, where n is the number of vertices of G(p). In this paper we show that the matrix corresponding to a framework G(p) contains the same information as the well-known rigidity matrix R. Whereas the entries of R are a function of the positions of the vertices of G(p), the entries of are a function of the Gale matrix corresponding to G(p). Furthermore, while the number of rows of R is equal to the number of edges of G(p), the number of columns of is equal to the number of missing edges of G(p). We also show that the assumption of the existence of an equivalent framework G(q) in R^n-1 can be dropped and we give the precise relation between the left-nullspaces, and consequently the nullspaces, of R and .     

The multiple originator broadcasting problem in graphs

Given a graph G and a vertex subset S of V(G), the broadcasting time with respect toS, denoted by b(G,S), is the minimum broadcasting time when using S as the broadcasting set. And the k-broadcasting number, denoted by b_k(G), is defined by b_k(G)=min{b(G,S)|S⊆V(G),|S|=k}.Given a graph G and two vertex subsets S, S^′ of V(G), define , d(S,S^′)=min{d(u,v)|u∈S, v∈S^′}, and for all v∈V(G). For all k, 1?k?|V(G)|, the k-radius of G, denoted by r_k(G), is defined as r_k(G)=min{d(G,S)|S⊆V(G), |S|=k}.In this paper, we study the relation between the k-radius and the k-broadcasting numbers of graphs. We also give the 2-radius and the 2-broadcasting numbers of the grid graphs, and the k-broadcasting numbers of the complete n-partite graphs and the hypercubes.     

The number of reachable pairs in a digraph

For a digraph G, let R(G) (respectively, R^(k)(G)) be the number of ordered pairs (u,v) of vertices of G such that u≠v and v is reachable from u (respectively, reachable from u by a path of length ?k). In this paper, we study the range S_n of R(G) and the range of R^(k)(G) as G varies over all possible digraphs on n vertices. We give a sufficient condition and a necessary condition for an integer to belong to S_n. These determine the set S_n for all n?208. We also determine for k?4 and show that whenever n?k+(k+1)^0.57+2, for arbitrary k.     

The Erd?s-Ko-Rado properties of various graphs containing singletons

Let G=(V,E) be a graph. For r≥1, let be the family of independent vertex r-sets of G. For v∈V(G), let denote the star. G is said to be r-EKR if there exists v∈V(G) such that for any non-star family A of pair-wise intersecting sets in . If the inequality is strict, then G is strictlyr-EKR.Let Γ be the family of graphs that are disjoint unions of complete graphs, paths, cycles, including at least one singleton. Holroyd, Spencer and Talbot proved that, if G∈Γ and 2r is no larger than the number of connected components of G, then G is r-EKR. However, Holroyd and Talbot conjectured that, if G is any graph and 2r is no larger than μ(G), the size of a smallest maximal independent vertex set of G, then G is r-EKR, and strictly so if 2r<μ(G). We show that in fact, if G∈Γ and 2r is no larger than the independence number of G, then G is r-EKR; we do this by proving the result for all graphs that are in a suitable larger set Γ^′?Γ. We also confirm the conjecture for graphs in an even larger set Γ^″?Γ^′.     

Classifying spaces with virtually cyclic stabilisers for certain infinite cyclic extensions

Let G?B?Z be an infinite cyclic extension of a group B where the action of Z on the set of conjugacy classes of non-trivial elements of B is free. This class of groups includes certain strictly descending HNN-extensions with abelian or free base groups, certain wreath products by Z and the soluble Baumslag-Solitar groups BS(1,m) with |m|≥2. We construct a model for , the classifying space of G for the family of virtually cyclic subgroups of G, and give bounds for the minimal dimension of . Finally we determine the geometric dimension when G is a soluble Baumslag-Solitar group.     

On p-approximation properties for p-operator spaces

This paper has a two-fold purpose. Let 1<p<∞. We first introduce the p-operator space injective tensor product and study various properties related to this tensor product, including the p-operator space approximation property, for p-operator spaces on Lp-spaces. We then apply these properties to the study of the pseudofunction algebra PFp(G), the pseudomeasure algebra PMp(G), and the Figà-Talamanca-Herz algebra Ap(G) of a locally compact group G. We show that if G is a discrete group, then most of approximation properties for the reduced group C^∗-algebra , the group von Neumann algebra VN(G), and the Fourier algebra A(G) (related to amenability, weak amenability, and approximation property of G) have the natural p-analogues for PFp(G), PMp(G), and Ap(G), respectively. The p-completely bounded multiplier algebra McbAp(G) plays an important role in this work.     

On global domination critical graphs

A dominating set of a graph G=(V,E) is a subset S⊆V such that every vertex not in S is adjacent to at least one vertex of S. The domination number of G is the cardinality of a smallest dominating set. The global domination number, γ_g(G), is the cardinality of a smallest set S that is simultaneously a dominating set of both G and its complement . Graphs for which γ_g(G−e)>γ_g(G) for all edges e∈E are characterized, as are graphs for which γ_g(G−e)<γ_g(G) for all edges e∈E whenever is disconnected. Progress is reported in the latter case when is connected.     

Determining cusp forms by central values of Rankin-Selberg L-functions

Let g be a fixed normalized Hecke-Maass cusp form for SL(2,Z) associated to the Laplace eigenvalue . We show that g is uniquely determined by the central values of the family for k sufficiently large, where Hk(1) denotes a Hecke basis of the space of holomorphic cusp forms for SL(2,Z).