On Optimal Orientations of Cartesian Products of Trees

. Let d(D) (resp., d(G)) denote the diameter and r(D) (resp., r(G)) the radius of a digraph D (resp., graph G). Let G×H denote the cartesian product of two graphs G and H. An orientation D of G is said to be (r, d)-invariant if r(D)=r(G) and d(D)=d(G). Let {T _i }, i=1,…,n, where n≥2, be a family of trees. In this paper, we show that the graph ∏ _{i =1} ⁿ T _i admits an (r, d)-invariant orientation provided that d(T ₁)≥d(T ₂)≥4 for n=2, and d(T ₁)≥5 and d(T ₂)≥4 for n≥3. Received: July 30, 1997 Final version received: April 20, 1998     

Minimal presentations for certain group extensions

IfG is a finite group thend(G) denotes the minimal number of generators ofG. IfH andK are groups then the extension, 1 →H →G →K → 1, is called an outer extension ofK byH ifd(G)=d(H)+d(K). Let be the class of groups containing all finitep-groupsG which has a presentation withd(G) = dimH ¹(G,z _p ) generators andr(G)=dimH ² (G,Z _p ) relations: in this article it is shown that ifK is a non cyclic group belonging to andH is a finite abelian p-group then any outer extension ofK byH belongs to .     

Division algebras with a projective basis

Letk be any field andG a finite group. Given a cohomology class α∈H ²(G,k ^*), whereG acts trivially onk ^*, one constructs the twisted group algebrak ^αG. Unlike the group algebrakG, the twisted group algebra may be a division algebra (e.g. symbol algebras, whereG⋞Z _n×Z_n). This paper has two main results: First we prove that ifD=k ^α G is a division algebra central overk (equivalentyD has a projectivek-basis) thenG is nilpotent andG’ the commutator subgroup ofG, is cyclic. Next we show that unless char(k)=0 and , the division algebraD=k ^α G is a product of cyclic algebras. Furthermore, ifD _p is ap-primary factor ofD, thenD _p is a product of cyclic algebras where all but possibly one are symbol algebras. If char(k)=0 and , the same result holds forD _p, p odd. Ifp=2 we show thatD ₂ is a product of quaternion algebras with (possibly) a crossed product algebra (L/k,β), Gal(L/k)⋞Z ₂×Z₂n.     

l p n Superspaces of spans of independent random variables

We show that for 1 ≦p < ∞,p ≠ 2, ifɛ > 0 is small enough andX ≦L _p is the span ofn independent Rademacher functions orn independent Gaussian random variables, then any superspaceY ofX satisfyingd(Y,L _p ^m ) ≦ 1 +ɛ has dimension larger thanr ⁿ, wherer =r(ɛ, p) > 1. This forms part of the author’s doctoral dissertation prepared at Texas A&M University under the direction of Professor W. B. Johnson. Supported in part by NSF DMS-85 00764.     

The fitting length of solvableH pn-groups

For a (finite) groupG and some prime powerp ⁿ, theH _p ⁿ -subgroupH _pn (G) is defined byH _p ⁿ (G)=〈xεG|x ^pn≠1〉. A groupH≠1 is called aH _p ⁿ -group, if there is a finite groupG such thatH is isomorphic toH _p ⁿ (G) andH _p ⁿ (G)≠G. It is known that the Fitting length of a solvableH _p ⁿ -group cannot be arbitrarily large: Hartley and Rae proved in 1973 that it is bounded by some quadratic function ofn. In the following paper, we show that it is even bounded by some linear function ofn. In view of known examples of solvableH _p ⁿ -groups having Fitting lengthn, this result is “almost” best possible.     

Graphs whose every transitive orientation contains almost every relation

Given a graphG onn vertices and a total ordering ≺ ofV(G), the transitive orientation ofG associated with ≺, denotedP(G; ≺), is the partial order onV(G) defined by settingx<y inP(G; ≺) if there is a pathx=x ₁ x ₂…x _r=y inG such thatx ₁ ≺x _j for 1≦i<j≦r. We investigate graphsG such that every transitive orientation ofG contains ₂ ⁿ −o(n ²) relations. We prove that almost everyG _n,p satisfies this requirement if , but almost noG _n,p satisfies the condition if (pn log log logn)/(logn log logn) is bounded. We also show that every graphG withn vertices and at mostcn logn edges has some transitive orientation with fewer than ₂ ⁿ −δ(c)n ² relations. Partially supported by MCS Grant 8104854.     

On lower bounds for the widths of classes of functions defined by integral moduli of continuity

We establish lower bounds for the Kolmogorov widths d _2n-1(W ^r H ₁^ω.L _p ) and Gel’fand widths d ^2n-1(W ^r H ₁^ω.L _p ) of the classes of functions W ^r H ₁^ω with a convex integral modulus of continuity ω(t).     

Classification of finite groups according to the number of conjugacy classes II

In the following,G denotes a finite group,r(G) the number of conjugacy classes ofG, β(G) the number of minimal normal subgroups ofG andα(G) the number of conjugate classes ofG not contained in the socleS(G). Let Φ _j = {G|β(G) =r(G) −j}. In this paper, the family Φ₁₁ is classified. In addition, from a simple inspection of the groups withr(G) =b conjugate classes that appear in ϒ _j ^=1/11 Φ _j , we obtain all finite groups satisfying one of the following conditions: (1)r(G) = 12; (2)r(G) = 13 andβ(G) > 1; …; (9)r(G) = 20 andβ(G) > 8; (10)r(G) =n andβ(G) =n −a with 1 ≦a ≦ 11, for each integern ≧ 21. Also, we obtain all finite groupsG with 13 ≦r(G) ≦ 20,β(G) ≦r(G) − 12, and satisfying one of the following conditions: (i) 0 ≦α(G) ≦ 4; (ii) 5 ≦α(G) ≦ 10 andS(G) solvable.     

On the Q-rational cuspidal subgroup and the component group ofJ 0(p r )

Forp≥3 a prime, we compute theQ-rational cuspidal subgroupC(p ^r ) of the JacobianJ ₀(p ^r ) of the modular curveX ₀(p ^r ). This result is then applied to determine the component group Φ _p ^r of the Néron model ofJ ₀(p ^r ) overZ _p . This extends results of Lorenzini [7]. We also study the action of the Atkin-Lehner involution on thep-primary part ofC(p ^r ), as well as the effect of degeneracy maps on the component groups.     

Two-point concentration in random geometric graphs

A random geometric graph G _n is constructed by taking vertices X ₁,…,X _n ∈ℝ ^d at random (i.i.d. according to some probability distribution ν with a bounded density function) and including an edge between X _i and X _j if ‖X _i -X _j ‖ < r where r = r(n) > 0. We prove a conjecture of Penrose ([14]) stating that when r=r(n) is chosen such that nr ^d = o(lnn) then the probability distribution of the clique number ω(G _n ) becomes concentrated on two consecutive integers and we show that the same holds for a number of other graph parameters including the chromatic number χ(G _n ). The author was partially supported by EPSRC, the Department of Statistics, Bekkerla-Bastide fonds, Dr. Hendrik Muller’s Vaderlandsch fonds, and Prins Bernhard Cultuurfonds.     

On the Matlis duals of local cohomology modules and modules of generalized fractions

Let (R, m) be a commutative Noetherian local ring with non-zero identity, a a proper ideal of R and M a finitely generated R-module with aM ≠ M. Let D(−) ≔ Hom _R (−, E) be the Matlis dual functor, where E ≔ E(R/m) is the injective hull of the residue field R/m. In this paper, by using a complex which involves modules of generalized fractions, we show that, if x ₁, …, x _n is a regular sequence on M contained in α, then H _{(x1, …,xnR} ⁿ D(H _a ⁿ (M))) is a homomorphic image of D(M), where H _b ⁱ (−) is the i-th local cohomology functor with respect to an ideal b of R. By applying this result, we study some conditions on a certain module of generalized fractions under which D(H _{(x1, …,xn)R} ⁿ (D(H _a ⁿ (M)))) ⋟ D(D(M)).     

Primitives and central detection numbers in group cohomology

Fix a prime p. Given a finite group G, let H^∗(G) denote its mod p cohomology. In the early 1990s, Henn, Lannes, and Schwartz introduced two invariants d₀(G) and d₁(G) of H^∗(G) viewed as a module over the mod p Steenrod algebra. They showed that, in a precise sense, H^∗(G) is respectively detected and determined by Hd(CG(V)) for d?d₀(G) and d?d₁(G), with V running through the elementary abelian p-subgroups of G.The main goal of this paper is to study how to calculate these invariants. We find that a critical role is played by the image of the restriction of H^∗(G) to H^∗(C), where C is the maximal central elementary abelian p-subgroup of G. A measure of this is the top degree e(G) of the finite dimensional Hopf algebra H^∗(C)_⊗H^∗(G)Fp, a number that tends to be quite easy to calculate.Our results are complete when G has a p-Sylow subgroup P in which every element of order p is central. Using the Benson-Carlson duality, we show that in this case, d₀(G)=d₀(P)=e(P), and a similar exact formula holds for d₁. As a bonus, we learn that He(G)(P) contains nontrivial essential cohomology, reproving and sharpening a theorem of Adem and Karagueuzian.In general, we are able to show that d₀(G)?max{e(CG(V))|V<G} if certain cases of Benson's Regularity Conjecture hold. In particular, this inequality holds for all groups such that the difference between the p-rank of G and the depth of H^∗(G) is at most 2. When we look at examples with p=2, we learn that d₀(G)?14 for all groups with 2-Sylow subgroup of order up to 64, with equality realized when G=SU(3,4).En route we study two objects of independent interest. If C is any central elementary abelian p-subgroup of G, then H^∗(G) is an H^∗(C)-comodule, and we prove that the subalgebra of H^∗(C)-primitives is always Noetherian of Krull dimension equal to the p-rank of G minus the p-rank of C. If the depth of H^∗(G) equals the rank of Z(G), we show that the depth essential cohomology of G is nonzero (reproving and extending a theorem of Green), and Cohen-Macauley in a certain sense, and prove related structural results.     

The structure of injective covers of special modules

In this paper, we prove that the injective cover of theR-moduleE(R/B)/R/B for a prime ideal B ofR is the direct sum of copies ofE(R/B) for prime ideals D ⊃ B, and if B is maximal, the injective cover is a finite sum of copies ofE(R/B). For a finitely generatedR-moduleM withn generators andG an injectiveR-module, we argue that the natural mapG ⁿ →G ⁿ/Hom _R (M, G) is an injective precover if Ext _R ¹ (M, R) = 0, and that the converse holds ifG is an injective cogenerator ofR. Consequently, for a maximal ideal R ofR, depth_R R ≧ 2 if and only if the natural mapE(R/R) →E(R/R)/R/R is an injective cover and depth_R R > 0.     

The algebra ofG-relations

In this paper, we study a tower {A _n ^G: n} ≥ 1 of finite-dimensional algebras; here, G represents an arbitrary finite group,d denotes a complex parameter, and the algebraA _n ^G(d) has a basis indexed by ‘G-stable equivalence relations’ on a set whereG acts freely and has 2n orbits. We show that the algebraA _n ^G(d) is semi-simple for all but a finite set of values ofd, and determine the representation theory (or, equivalently, the decomposition into simple summands) of this algebra in the ‘generic case’. Finally we determine the Bratteli diagram of the tower {A _n ^G(d): n} ≥ 1 (in the generic case).     

Profinite groups with nonabelian crowns of bounded rank and their probabilistic zeta function

It has been conjectured by Mann that the infinite sum Σ _H μ(H,G)/|G:H| ^s , where H ranges over all open subgroups of a finitely generated profinite group G, converges absolutely in some half right plane if G is positively finitely generated. We prove that the conjecture is true if the nonabelian crowns of G have bounded rank. In particular Mann’s conjecture holds if G has polynomial subgroup growth or is an adelic profinite group.     

The size-Ramsey number of trees

IfG andH are graphs, let us writeG→(H)₂ ifG contains a monochromatic copy ofH in any 2-colouring of the edges ofG. Thesize-Ramsey number r _e(H) of a graphH is the smallest possible number of edges a graphG may have ifG→(H)₂. SupposeT is a tree of order |T|≥2, and lett ₀,t ₁ be the cardinalities of the vertex classes ofT as a bipartite graph, and let Δ(T) be the maximal degree ofT. Moreover, let Δ₀, Δ₁ be the maxima of the degrees of the vertices in the respective vertex classes, and letβ(T)=T ₀Δ₀+t ₁Δ₁. Beck [7] proved thatβ(T)/4≤r _e(T)=O{β(T)(log|T|)¹²}, improving on a previous result of his [6] stating thatr _e(T)≤Δ(T)|T|(log|T|)¹². In [6], Beck conjectures thatr _e(T)=O{Δ(T)|T|}, and in [7] he puts forward the stronger conjecture thatr _e(T)=O{β(T)}. Here, we prove the first of these conjectures, and come quite close to proving the second by showing thatr _e(T)=O{β(T)logΔ(T)}.     

Cutting hyperplane arrangements

We consider a collectionH ofn hyperplanes in E ^d (where the dimensiond is fixed). An ε-cutting forH is a collection of (possibly unbounded)d-dimensional simplices with disjoint interors, which cover all E ^d and such that the interior of any simplex is intersected by at mostεn hyperplanes ofH. We give a deterministic algorithm for finding a (1/r)-cutting withO(r ^d ) simplices (which is asymptotically optimal). Forr≤n ^1−σ, where δ>0 is arbitrary but fixed, the running time of this algorithm isO(n(logn) ^O(1) r ^d−1). In the plane we achieve a time boundO(nr) forr≤n ^1−δ, which is optimal if we also want to compute the collection of lines intersecting each simplex of the cutting. This improves a result of Agarwal, and gives a conceptually simpler algorithm. For ann point setX⊆E ^d and a parameterr, we can deterministically compute a (1/r)-net of sizeO(rlogr) for the range space (X, {X ϒ R; R is a simplex}), In timeO(n(logn) ^O(1) r ^d−1 +r ^O(1)). The size of the (1/r)-net matches the best known existence result. By a simple transformation, this allows us to find ε-nets for other range spaces usually encountered in computational geometry. These results have numerous applications for derandomizing algorithms in computational geometry without affecting their running time significantly. A preliminary version of this paper appeared inProceedings of the Sixth ACM Symposium on Computational Geometry, Berkeley, 1990, pp. 1–9. Work on this paper was supported by DIMACS Center.     

Embedding graphs with bounded degree in sparse pseudorandom graphs

In this paper, we show the equivalence of somequasi-random properties for sparse graphs, that is, graphsG with edge densityp=|E(G)|/( ₂ ⁿ )=o(1), whereo(1)→0 asn=|V(G)|→∞. Our main result (Theorem 16) is the following embedding result. For a graphJ, writeN _J(x) for the neighborhood of the vertexx inJ, and letδ(J) andΔ(J) be the minimum and the maximum degree inJ. LetH be atriangle-free graph and setd _H=max{δ(J):J⊆H}. Moreover, putD _H=min{2d _H,Δ(H)}. LetC>1 be a fixed constant and supposep=p(n)≫n ⁻¹ D _H. We show that ifG is such that

The K-theory of fields in characteristic p

We show that for a field k of characteristic p, H ⁱ (k,ℤ(n)) is uniquely p-divisible for i≠n (we use higher Chow groups as our definition of motivic cohomology). This implies that the natural map K _n ^M (k)?K _n (k) from Milnor K-theory to Quillen K-theory is an isomorphism up to uniquely p-divisible groups, and that K _n ^M (k) and K _n (k) are p-torsion free. As a consequence, one can calculate the K-theory mod p of smooth varieties over perfect fields of characteristic p in terms of cohomology of logarithmic de Rham Witt sheaves, for example K _n (X,ℤ/p ^r )=0 for n>dimX. Another consequence is Gersten’s conjecture with finite coefficients for smooth varieties over discrete valuation rings with residue characteristic p. As the last consequence, Bloch’s cycle complexes localized at p satisfy all Beilinson-Lichtenbaum-Milne axioms for motivic complexes, except possibly the vanishing conjecture. Oblatum 21-I-1998 & 26-VII-1999 / Published online: 18 October 1999