On two classes of finite supersoluble groups

Let ? be a complete set of Sylow subgroups of a finite group G, that is, a set composed of a Sylow p-subgroup of G for each p dividing the order of G. A subgroup H of G is called ?-S-semipermutable if H permutes with every Sylow p-subgroup of G in ? for all p?π(H); H is said to be ?-S-seminormal if it is normalized by every Sylow p-subgroup of G in ? for all p?π(H). The main aim of this paper is to characterize the ?-MS-groups, or groups G in which the maximal subgroups of every Sylow subgroup in ? are ?-S-semipermutable in G and the ?-MSN-groups, or groups in which the maximal subgroups of every Sylow subgroup in ? are ?-S-seminormal in G.     

On the rank of 3×3×3-tensors

Let U, V and W be finite dimensional vector spaces over the same field. The rank of a tensor τ in U???V???W is the minimum dimension of a subspace of U???V???W containing τ and spanned by fundamental tensors, i.e. tensors of the form u???v???w for some u in U, v in V and w in W. We prove that if U, V and W have dimension three, then the rank of a tensor in U???V???W is at most six, and such a bound cannot be improved, in general. Moreover, we discuss how the techniques employed in the proof might be extended to prove upper bounds for the rank of a tensor in U???V???W when the dimensions of U, V and W are higher.     

The Distribution of Reciprocal Pairs Modulo Polynomials over a Finite Field

Given a finite field F_q of order q, a fixed polynomial g in –F_q[X] of positive degree, and two elements u and v in the ring of polynomials in R = F_q [X]/gF_q[X], the question arises: How many pairs (a, 6) are there in R × R so that ab ? 1 mod g and so that a is close to u while b is close to v ? The answer is, about as many as one would expect. That is, there are no favored regions in R × R where inverse pairs cluster. The error term is quite sharp in most cases, being comparable to what would happen with random distribution of pairs. The proof uses Kloosterman sums and counting arguments. The exceptional cases involve fields of characteristic 2 and composite values of g. Even then the error term obtained is nontrivial. There is no computational evidence that inverses are in fact less evenly distributed in this case, however.     

Infinite families of 2- and 3-designs with parameters v = p + 1, k = (p − 1)/2i + 1, where p odd prime, 2e T (p − 1), e ≥ 2, 1 ≤ i ≤ e

Let p be an odd prime number such that p − 1 = 2^em for some odd m and e ≥ 2. In this article, by using the special linear fractional group PSL(2, p), for each i, 1 ≤ i ≤ e, except particular cases, we construct a 2-design with parameters v = p + 1, k = (p − 1)/2ⁱ + 1 and λ = ((p − 1)/2ⁱ+1)(p − 1)/2 = k(p − 1)/2, and in the case i = e we show that some of these 2-designs are 3-designs. Likewise, by using the linear fractional group PGL(2,p) we construct an infinite family of 3-designs with the same v k and λ = k(k − 2). These supplement a part of [4], in which we gave an infinite family of 3-designs with parameters v = q + 1, k = (q + 1)/2 = (q − 1)/2 + 1 and λ = (q + 1)(q − 3)/8 = k(k − 2)/2, where q is a prime power such that q − 1 = 2m for some odd m and q > 7. Some of the designs given in this article and in [4] fill in a few blanks in the table of Chee, Colbourn, and Kreher [2]. © 1997 John Wiley & Sons, Inc.     

Gaussian Property of the Rings R(X) and R〈X〉

The content of a polynomial f over a commutative ring R is the ideal c(f) of R generated by the coefficients of f. A commutative ring R is said to be Gaussian if c(fg) = c(f)c(g) for every polynomials f and g in R[X]. A number of authors have formulated necessary and sufficient conditions for R(X) (respectively, R?X?) to be semihereditary, have weak global dimension at most one, be arithmetical, or be Prüfer. An open question raised by Glaz is to formulate necessary and sufficient conditions that R(X) (respectively, R?X?) have the Gaussian property. We give a necessary and sufficient condition for the rings R(X) and R?X? in terms of the ring R in case the square of the nilradical of R is zero.     

On the number of regular vertices of the union of jordan regions

Let \C be a collection of n Jordan regions in the plane in general position, such that each pair of their boundaries intersect in at most s points, where s is a constant. If the boundaries of two sets in \C cross exactly twice, then their intersection points are called regular vertices of the arrangement \A(\C) . Let R(\C) denote the set of regular vertices on the boundary of the union of \C . We present several bounds on |R(\C)| , depending on the type of the sets of \C . (i) If each set of \C is convex, then |R(\C)|=O(n ^1.5+\eps ) for any \eps>0 . (ii) If no further assumptions are made on the sets of \C , then we show that there is a positive integer r that depends only on s such that |R(\C)|=O(n ^2-1/r ) . (iii) If \C consists of two collections \C ₁ and \C ₂ where \C ₁ is a collection of m convex pseudo-disks in the plane (closed Jordan regions with the property that the boundaries of any two of them intersect at most twice), and \C ₂ is a collection of polygons with a total of n sides, then |R(\C)|=O(m ^2/3 n ^2/3 +m +n) , and this bound is tight in the worst case. Received December 4, 1998, and in revised form June 3, 2000. Online publication Feburary 1, 2001.     

Some results on the achromatic number

Let G be a simple graph. The achromatic number ψ(G) is the largest number of colors possible in a proper vertex coloring of G in which each pair of colors is adjacent somewhere in G. For any positive integer m, let q(m) be the largest integer k such that ≤ m. We show that the problem of determining the achromatic number of a tree is NP-hard. We further prove that almost all trees T satisfy ψ (T) = q(m), where m is the number of edges in T. Lastly, for fixed d and ϵ > 0, we show that there is an integer N₀ = N₀(d, ϵ) such that if G is a graph with maximum degree at most d, and m ≥ N₀ edges, then (1 - ϵ)q(m) ≤ ψ (G) ≤ q(m). © 1997 John Wiley & Sons, Inc. J Graph Theory 26: 129–136, 1997     

Small cliques in random graphs

For d ≥ 1, a d-clique in a graph G is a complete d-vertex subgraph not contained in any larger complete subgraph of G. We investigate the limit distribution of the number of d-cliques in the binomial random graph G(n, p), p = p(n), n→∞.     

Spanning trees with leaf distance at least four

For a graph G, we denote by i(G) the number of isolated vertices of G. We prove that for a connected graph G of order at least five, if i(G–S) < |S| for all ?? ≠ S ? V(G), then G has a spanning tree T such that the distance in T between any two leaves of T is at least four. This result was conjectured by Kaneko in “Spanning trees with constrains on the leaf degree”, Discrete Applied Math, 115 (2001), 73–76. Moreover, the condition in the result is sharp in a sense that the condition i(G–S) < |S| cannot be replaced by i(G–S) ≤ |S|. © 2006 Wiley Periodicals, Inc. J Graph Theory 55: 83–90, 2007     

Domination versus disjunctive domination in graphs

A dominating set in a graph G is a set S of vertices of G such that every vertex not in S is adjacent to a vertex of S. The domination number of G is the minimum cardinality of a dominating set of G. For a positive integer b, a set S of vertices in a graph G is a b-disjunctive dominating set in G if every vertex v not in S is adjacent to a vertex of S or has at least b vertices in S at distance 2 from it in G. The b-disjunctive domination number of G is the minimum cardinality of a b-disjunctive dominating set. In this paper, we continue the study of disjunctive domination in graphs. We present properties of b-disjunctive dominating sets in a graph. A characterization of minimal b-disjunctive dominating sets is given. We obtain bounds on the ratio of the domination number and the b-disjunctive domination number for various families of graphs, including regular graphs and trees.     

Unipotent Conjugacy in General Linear Groups

Let U(n,q) be the group of upper uni-triangular matrices in GL(n,q), the n-dimensional general linear group over the field of q elements. The number of U(n,q)-conjugacy classes in GL(n,q) is, as a function of q, for fixed n, a polynomial in q with integral coefficients.     

Algebraic group actions on noncommutative spectra

Let G be an affine algebraic group and let R be an associative algebra with a rational action of G by algebra automorphisms. We study the induced G-action on the set Spec R of all prime ideals of R, viewed as a topological space with the Jacobson–Zariski topology, and on the subspace Rat R ⊆ Spec R consisting of all rational ideals of R. Here, a prime ideal P of R is said to be rational if the extended centroid is equal to the base field. Our results generalize the work of Mœglin and Rentschler and of Vonessen to arbitrary associative algebras while also simplifying some of the earlier proofs. The map P ↦ ⋂ _{g ∈ G} g.P gives a surjection from Spec R onto the set G-Spec R of all G-prime ideals of R. The fibers of this map yield the so-called G-stratification of Spec R which has played a central role in the recent investigation of algebraic quantum groups, in particular, in the work of Goodearl and Letzter. We describe the G-strata of Spec R in terms of certain commutative spectra. Furthermore, we show that if a rational ideal P is locally closed in Spec R then the orbit G.P is locally closed in Rat R. This generalizes a standard result on G-varieties. Finally, we discuss the situation where G-Spec R is a finite set. Research supported in part by NSA Grant H98230-07-1-0008.     

Algorithms for ham-sandwich cuts

Given disjoint setsP ₁,P ₂, ...,P _d inR ^d withn points in total, ahamsandwich cut is a hyperplane that simultaneously bisects theP _i . We present algorithms for finding ham-sandwich cuts in every dimensiond>1. Whend=2, the algorithm is optimal, having complexityO(n). For dimensiond>2, the bound on the running time is proportional to the worst-case time needed for constructing a level in an arrangement ofn hyperplanes in dimensiond−1. This, in turn, is related to the number ofk-sets inR ^d−1 . With the current estimates, we get complexity close toO(n ^3/2 ) ford=3, roughlyO(n ^8/3 ) ford=4, andO(n ^d−1−a(d) ) for somea(d)>0 (going to zero asd increases) for largerd. We also give a linear-time algorithm for ham-sandwich cuts inR ³ when the three sets are suitably separated. A preliminary version of the results of this paper appeared in [16] and [17]. Part of this research by J. Matoušek was done while he was visiting the School of Mathematics, Georgia Institute of Technology, Atlanta, and part of his work on this paper was supported by a Humboldt Research Fellowship. W. Steiger expresses gratitude to the NSF DIMACS Center at Rutgers, and his research was supported in part by NSF Grants CCR-8902522 and CCR-9111491.     

Edge sets contained in circuits

A graphG withn vertices has propertyp(r, s) ifG contains a path of lengthr and if every such path is contained in a circuit of lengths. G. A. Dirac and C. Thomassen [Math. Ann.203 (1973), 65–75] determined graphs with propertyp(r,r+1). We determine the least number of edges in a graphG in order to insure thatG has propertyp(r,s), we determine the least number of edges possible in a connected graph with propertyp(r,s) forr=1 and alls, forr=k ands=k+2 whenk=2, 3, 4, and we give bounds in other cases. Some resulting extremal graphs are determined. We also consider a generalization of propertyp(2,s) in which it is required that each pair of edges is contained in a circuit of lengths. Some cases of this last property have been treated previously by U. S. R. Murty [inProof Techniques in Graph Theory, ed. F. Harary, Academic Press, New York, 1969, pp. 111–118].     

Inner and outerj-radii of convex bodies in finite-dimensional normed spaces

This paper is concerned with the various inner and outer radii of a convex bodyC in ad-dimensional normed space. The innerj-radiusr _j (C) is the radius of a largestj-ball contained inC, and the outerj-radiusR _j (C) measures how wellC can be approximated, in a minimax sense, by a (d —j)-flat. In particular,r _d (C) andR _d (C) are the usual inradius and circumradius ofC, while 2r ₁(C) and 2R ₁(C) areC's diameter and width.Motivation for the computation of polytope radii has arisen from problems in computer science and mathematical programming. The radii of polytopes are studied in [GK1] and [GK2] from the viewpoint of the theory of computational complexity. This present paper establishes the basic geometric and algebraic properties of radii that are needed in that study.Much of this paper was written when both authors were visiting the Institute for Mathematics and Its Applications, 206 Church Street S.E., Minneapolis, MN 55455, USA. The research of P. Gritzmann was supported in part by the Alexander-von-Humboldt Stiftung and the Deutsche Forschungsgemeinschaft. V. Klee's research was supported in part by the National Science Foundation.     

Associativity of the <Emphasis Type="Italic">∇</Emphasis>-operation on bands in rings

Given a multiplicative band of idempotents S in a ring R, for all e,f∈S the ∇-product e ∇ f=e+f+fe−efe−fef is an idempotent that lies roughly above e and f in R just as ef and fe lie roughly below e and f. In this paper we study ∇-bands in rings, that is, bands in rings that are closed under ∇, giving various criteria for ∇ to be associative, thus making the band a skew lattice. We also consider when a given band S in R generates a ∇-band.     

On the Cyclic Homology of an Algebra Associated with a Cyclic Quiver and a Monic Polynomial

In this article, we compute the Hochschild homology group of A = KΓ/(f(X ^s )), where KΓ is the path algebra of the cyclic quiver Γ with s vertices and s arrows over a commutative ring K, f(x) is a monic polynomial over K, and X is the sum of all arrows in KΓ. Moreover, we compute the cyclic homology group of A in the case f(x) = (x ? a) ^m , where a ∈ K, so that we can determine the cyclic homology of A in general when K is an algebraically closed field.     

Study of families of monotone continuous functions on Tychonoff spaces

The main object of study is the space of all monotone continuous functions CM(X) on a connected Tychonoff space X endowed with the topology of pointwise (CM _p (X)) or uniform (CM(X)) convergence. Technical questions concerning restriction and extension of monotone functions are considered in Sec. 2. Conditions for CM(X) to separate the points of X and for CM(X) to contain only constant functions are found in Sec. 3. In Sec. 4, the linear structure of CM(X) is studied and all linear subspaces of CM(X) for a certain class of spaces X are described. In Sec. 5, conditions under which CM(X) is closed and nowhere dense in C _p (X) and C(X) are determined. The metrizability of CM _p (X) is considered in Sec. 6; necessary and sufficient metrizability conditions for various classes of spaces X are obtained. In Sec. 7, criteria for σ-compactness and the Hurewicz property in the class of spaces CM _p (X) are given. __________ Translated from Sovremennaya Matematika i Ee Prilozheniya (Contemporary Mathematics and Its Applications), Vol. 34, General Topology, 2005.