On weakly τ-quasinormal subgroups of finite groups

Let G be a finite group and H a subgroup of G. We say that: (1) H is τ-quasinormal in G if H permutes with all Sylow subgroups Q of G such that (|Q|, |H|) = 1 and (|H|, |Q ^G |) ≠ 1; (2) H is weakly τ-quasinormal in G if G has a subnormal subgroup T such that HT = G and T ∩ H ≦ H _τG , where H _τG is the subgroup generated by all those subgroups of H which are τ-quasinormal in G. Our main result here is the following. Let ℱ be a saturated formation containing all supersoluble groups and let X ≦ E be normal subgroups of a group G such that G/E ∈ ℱ. Suppose that every non-cyclic Sylow subgroup P of X has a subgroup D such that 1 < |D| < |P| and every subgroup H of P with order |H| = |D| and every cyclic subgroup of P with order 4 (if |D| = 2 and P is non-Abelian) not having a supersoluble supplement in G is weakly τ-quasinormal in G. If X is either E or F* (E), then G ∈ ℱ.     

Additive Maps Preserving Nilpotent Operators or Spectral Radius

Let X be a （real or complex） Banach space with dimension greater than 2 and let B0（X） be the subspace of B（X） spanned by all nilpotent operators on X. We get a complete classification of surjective additive maps Ф on B0（X） which preserve nilpotent operators in both directions. In particular, if X is infinite-dimensional, we prove that Ф has the form either Ф（T） = cATA^-1 or Ф（T） = cAT＇A^-1, where A is an invertible bounded linear or conjugate linear operator, c is a scalar, T＇ denotes the adjoint of T. As an application of these results, we show that every additive surjective map on B（X） preserving spectral radius has a similar form to the above with ｜c｜ = 1.     

A covering lemma for L(ℝ)

Jensen's celebrated Covering Lemma states that if 0^# does not exist, then for any uncountable set of ordinals X, there is a Y∈L such that X⊆Y and |X| = |Y|. Working in ZF + AD alone, we establish the following analog: If ℝ^# does not exist, then L(ℝ) and V have exactly the same sets of reals and for any set of ordinals X with |X| ≥Θ ^{L (ℝ)}, there is a Y∈L(ℝ) such that X⊆Y and |X| = |Y|. Here ℝ is the set of reals and Θ is the supremum of the ordinals which are the surjective image of ℝ. Received: 29 October 1999 / Published online: 12 December 2001     

On a combinatorial problem in group theory

We say that a groupG ∈DS if for some integerm, all subsetsX ofG of sizem satisfy |X ²|<|X|², whereX ²={xy|x,y ∈X}. It is shown, using a previous result of Peter Neumann, thatG ∈DS if and only if either the subgroup ofG generated by the squares of elements ofG is finite, orG contains a normal abelian subgroup of finite index, on which each element ofG acts by conjugation either as the identity automorphism or as the inverting automorphism. Dedicated to John G. Thompson, the Wolf Prize Laureate in Mathematics for 1992 The first author wishes to thank the Department of Mathematics in the University of Napoli for their hospitality during the preparation of this paper.     

Exact Distribution of the Product of Two or More Logistic Random Variables

Without a doubt, the logistic distribution is the most popular statistical model in the social sciences and related areas. Motivated by the importance of products of random variables in these areas, we derive the exact distributions of | X ₁ X ₂ | and | X ₁ X ₂ ⋯ X _p  | when X _m are independent logistic random variables. Tabulations of the associated percentage points are provided and possible extensions discussed.     

Bounds on global secure sets in cactus trees

Let G = (V, E) be a graph. A global secure set SD ⊆ V is a dominating set which satisfies the condition: for all X ⊆ SD, |N[X] ∩ SD| ≥ | N[X] − SD|. A global defensive alliance is a set of vertices A that is dominating and satisfies a weakened condition: for all x ∈ A, |N[x] ∩ A| ≥ |N[x] − A|. We give an upper bound on the cardinality of minimum global secure sets in cactus trees. We also present some results for trees, and we relate them to the known bounds on the minimum cardinality of global defensive alliances.     

Representations of deformed preprojective algebras and quantum groups

Let (Γ,I) be the bound quiver of a cyclic quiver whose vertices correspond to the Abelian group Zd. In this paper, we list all indecomposable representations of (Γ,I) and give the conditions that those representations of them can be extended to representations of deformed preprojective algebra Πλ(Γ,I). It is shown that those representations given by extending indecomposable representations of (Γ,I) are all simple representations of Πλ(Γ,I). Therefore, it is concluded that all simple representa-tions of rest...     

Counting points in hypercubes and convolution measure algebras

It is shown that ifA andB are non-empty subsets of {0, 1} ⁿ (for somenεN) then |A+B|≧(|A||B|)^α where α=(1/2) log₂ 3 here and in what follows. In particular if |A|=2 ^n-1 then |A+A|≧3 ^n-1 which anwers a question of Brown and Moran. It is also shown that if |A| = 2 ^n-1 then |A+A|=3 ^n-1 if and only if the points ofA lie on a hyperplane inn-dimensions. Necessary and sufficient conditions are also given for |A +B|=(|A||B|)^α. The above results imply the following improvement of a result of Talagrand [7]: ifX andY are compact subsets ofK (the Cantor set) withm(X),m(Y)>0 then λ(X+Y)≧2(m(X)m(Y))^α wherem is the usual measure onK and λ is Lebesgue measure. This also answers a question of Moran (in more precise terms) showing thatm is not concentrated on any proper Raikov system.     

Involutions whose top dimensional component of the fixed point set is indecomposable

Let (M ^m , T) be a smooth involution on a closed smooth m-dimensional manifold and F = è_j=0ⁿ F^j{F = \bigcup_{j=0}^{n} F^j} (n ≤ m) its fixed point set, where F ^j denotes the union of those components of F having dimension j. In this paper we show that, if the top dimensional component F ⁿ is indecomposable, then m ≤ 2n + 1. We also give examples to show that this bound is best possible. This gives an improvement for the famous Five Halves Theorem of J. Boardman when the top dimensional component of the fixed point set is indecomposable.     

An extension of the Erdős–Ginzburg–Ziv Theorem to hypergraphs

An n-set partition of a sequence S is a collection of n nonempty subsequences of S, pairwise disjoint as sequences, such that every term of S belongs to exactly one of the subsequences, and the terms in each subsequence are all distinct with the result that they can be considered as sets. For a sequence S, subsequence S^′, and set T, |T∩S| denotes the number of terms x of S with xT, and |S| denotes the length of S, and SS^′ denotes the subsequence of S obtained by deleting all terms in S^′. We first prove the following two additive number theory results.(1) Let S be a finite sequence of elements from an abelian group G. If S has an n-set partition, A=A₁,…,A_n, such that

then there exists a subsequence S^′ of S, with length |S^′|≤max{|S|−n+1,2n}, and with an n-set partition, , such that . Furthermore, if ||A_i|−|A_j||≤1 for all i and j, or if |A_i|≥3 for all i, then .(2) Let S be a sequence of elements from a finite abelian group G of order m, and suppose there exist a,bG such that . If |S|≥2m−1, then there exists an m-term zero-sum subsequence S^′ of S with or .Let be a connected, finite m-uniform hypergraph, and be the least integer n such that for every 2-coloring (coloring with the elements of the cyclic group ) of the vertices of the complete m-uniform hypergraph , there exists a subhypergraph isomorphic to such that every edge in is monochromatic (such that for every edge e in the sum of the colors on e is zero). As a corollary to the above theorems, we show that if every subhypergraph of contains an edge with at least half of its vertices monovalent in , or if consists of two intersecting edges, then . This extends the Erdős–Ginzburg–Ziv Theorem, which is the case when is a single edge.     

A note on minimal topological spaces

Let (X,τ) be a completely Hausdorff space. LetP be any topological property which is implied by complete regularity. Let (X,τ), be minimal-P. Then it has been shown that (X,τ), is completely regular and hence compact.     

Friabilité des valeurs d’un polynôme

Let F(X) be an absolutely irreducible polynomial in \mathbbZ [X₁,..., X_n]{\mathbb{Z} [X_{1},\dots, X_{n}]}, with degree d. We prove that, for any δ < 4/3, for any sufficiently large x, there exists a positive density of integral n-tuples m = (m ₁, . . . , m _n ) in the hypercube max |m _i | ≤ x such that every prime divisor of F(m) is smaller than x ^d–δ . This result is improved when F satisfies some geometrical hypotheses.     

On samples of independent random vectors in spaces of infinitely increasing dimension

We study the asymptotic behavior of a set of random vectors ξ_i, i = 1,..., m, whose coordinates are independent and identically distributed in a space of infinitely increasing dimension. We investigate the asymptotics of the distribution of the random vectors, the consistency of the sets M _m⁽ⁿ⁾ = ξ₁,..., ξ_m and X _n^λ = x ∈ X _n: ρ(x) ≤ λn, and the mutual location of pairs of vectors. Translated from Ukrainskii Matematicheskii Zhurnal, Vol. 50, No. 12, pp. 1706–1711, December, 1998.     

On the number of popular differences

We prove that there exists an absolute constant c > 0 such that for any finite set A ⊆ ℤ with |A| ≥ 2 and any positive integer m < c|A|/ ln |A| there are at most m integers b > 0 satisfying |(A + b) \ A| ≤ m; equivalently, there are at most m positive integers possessing |A| −m (or more) representations as a difference of two elements of A.     

Spanning k-Trees of n-Connected Graphs

A tree is called a k-tree if the maximum degree is at most k. We prove the following theorem, by which a closure concept for spanning k-trees of n-connected graphs can be defined. Let k ≥ 2 and n ≥ 1 be integers, and let u and v be a pair of nonadjacent vertices of an n-connected graph G such that deg _G (u) + deg _G (v) ≥ |G| − 1 − (k − 2)n, where |G| denotes the order of G. Then G has a spanning k-tree if and only if G + uv has a spanning k-tree.     

On cardinality bounds involving the weak Lindelöf degree

We give a general closing-off argument in Theorem 2.3 from which several corollaries follow, including (1) if X is a locally compact Hausdorff space then |X| ≤ 2^wL(X)ψ(X), and (2) if X is a locally compact power homogeneous Hausdorff space then |X| ≤ 2^wL(X)t(X). The first extends the well-known cardinality bound 2^ψ(X) for a compactum X in a new direction. As |X| ≤ 2^wL(X)χ(X) for a normal spaceX[4], this enlarges the class of known Tychonoff spaces for which this bound holds. In 2.12 we give a short, direct proof of (1) that does not use 2.3. Yet 2.3 is broad enough to establish results much more general than (1), such as if X is a regular space with a π-base ? such that |B| ≤ 2^wL(X)χ(X) for all B ∈ ?, then |X| ≤ 2^wL(X)χ(X).

Separately, it is shown that if X is a regular space with a π-base whose elements have compact closure, then |X| ≤ 2^{wL(X)ψ(X)t(X)}. This partially answers a question from [4] and gives a third, separate proof of (1). We also show that if X is a weakly Lindelöf, normal, sequential space with χ(X) ≤ 2^?0, then |X| ≤ 2^?0.

Result (2) above is a new generalization of the cardinality bound 2^t(X) for a power homogeneous compactum X (Arhangel'skii, van Mill, and Ridderbos [3], De la Vega in the homogeneous case [10]). To this end we show that if U ? clD ? X, where X is power homogeneous and U is open, then |U| ≤ |D|^πχ(X). This is a strengthening of a result of Ridderbos [19].     

On the Convexity of the Heinz Means

Let A, B, and X be operators on a complex separable Hilbert space such that A and B are positive, and let 0 ≤ v ≤ 1. The Heinz inequalities assert that for every unitarily invariant norm | | | ·| | | ,{\left\vert \left\vert \left\vert \cdot \right\vert \right\vert \right\vert ,}

Random weighting,asymptotic counting,and inverse isoperimetry

For a family X of k-subsets of the set {1, …, n}, let |X| be the cardinality of X and let Γ(X, μ) be the expected maximum weight of a subset from X when the weights of 1, …, n are chosen independently at random from a symmetric probability distribution μ on ℝ. We consider the inverse isoperimetric problem of finding μ for which Γ(X, μ) gives the best estimate of ln |X|. We prove that the optimal choice of μ is the logistic distribution, in which case Γ(X, μ) provides an asymptotically tight estimate of ln |X| as k ⁻¹ ln |X} grows. Since in many important cases Γ(X, μ) can be easily computed, we obtain computationally efficient approximation algorithms for a variety of counting problems. Given μ, we describe families X of a given cardinality with the minimum value of Γ(X, μ), thus extending and sharpening various isoperimetric inequalities in the Boolean cube. The research of the first author was partially supported by NSF Grants DMS 9734138 and DMS 0400617. The research of the second author was partially supported by ISF Grant 039-7165 and by GIF grant I-2052.     

The security number of lexicographic products

A subset S of vertices of a graph G is a secure set if |N [X] ∩ S| ≥ |N [X] ? S| holds for any subset X of S, where N [X] denotes the closed neighborhood of X. The minimum cardinality s(G) of a secure set in G is called the security number of G. We investigate the security number of lexicographic product graphs by defining a new concept of tightly-securable graphs. In particular we derive several exact results for different families of graphs which yield some general results.     

Global existence and L ∞ estimates of solutions for a quasilinear parabolic system

In this paper, we study the global existence, L^∞ estimates and decay estimates of solutions for the quasilinear parabolic system u_t = div (|∇ u|^m ∇ u) + f(u, v), v_t = div (|∇ v|^m ∇ v) + g(u,v) with zero Dirichlet boundary condition in a bounded domain Ω ⊂ R^N. In particular, we find a critical value for the existence and nonexistence of global solutions to the equation u_t = div (|∇ u|^m ∇ u) + λ |u|^{α - 1} u.