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.     

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.     

Approximations from Subspaces of C0(X)

We show among other things that if B is a linear space of continuous real-valued functions vanishing at infinity on a locally compact Hausdorff space X, for which there is a continuous function h defined in a neighbourhood of 0 in the real line which is non-affine in every neighbourhood of 0 and satisfies |h(t)|k |t| for all t, such that hb is in B whenever b is in B and the composite function is defined, then every function in C₀(X) which can be approximated on every pair of points in X by functions in B can be approximated uniformly by functions in B.     

p-Hypercyclically embedding and Π-property of subgroups of finite groups

Let G be a finite group, E a normal subgroup of G and p a fixed prime. We say that E is p-hypercyclically embedded in G if every p-G-chief factor of E is cyclic. A subgroup H of G is said to satisfy Π-property in G if |G∕K:N_G∕K((H∩L)K∕K)| is a π((H∩L)K∕K)-number for any chief factor L∕K in G; we say that H has Π*-property in G if H∩O^π(H)(G) has Π-property in G. In this paper, we prove that E is p-hypercyclically embedded in G if and only if some classes of p-subgroups of E have Π*-property in G. Some recent results are extended.     

Generalized KKM Type Theorems in FC-Spaces with Applications (I)

The class KKM(X,Y) (resp., s-KKM(X,Y,Z)) of set-valued mappings with KKM (resp., s-KKM) property is introduced in FC-spaces without any convexity structure. Some generalized KKM (resp., s-KKM) type theorems are proved in FC-spaces under much weak assumptions. As applications, some new section theorems and coincidence theorems are established in FC-spaces. These theorems generalize many known results in literature. The further applications of these results will be given in a follow-up paper.     

On Weakly ℋ-embedded Subgroups of Finite Groups

Let G be a finite group and H a subgroup of G. We say that H is an ?-subgroup in G if N_G(H) ∩ H^g ≤ H for all g ∈ G; H is called weakly ?-subgroup in G if G has a normal subgroup K such that G = HK and H ∩ K is an ?-subgroup in G. We say that H is weakly ? -embedded in G if G has a normal subgroup K such that H^G = HK and H ∩ K is an ?-subgroup in G. In this paper, we investigate the structure of the finite group G under the assumption that some subgroups of prime power order are weakly ?-embedded in G. Our results improve and generalize several recent results in the literature.     

Alliance free and alliance cover sets

A defensive (offensive) k-alliance in Γ = (V,E) is a set S ⊆ V such that every υ in S (in the boundary of S) has at least k more neighbors in S than it has in V / S. A set X ⊆ V is defensive (offensive) k-alliance free, if for all defensive (offensive) k-alliance S, S/X ≠ ∅, i.e., X does not contain any defensive (offensive) k-alliance as a subset. A set Y ⊆ V is a defensive (offensive) k-alliance cover, if for all defensive (offensive) k-alliance S, S ∩ Y ≠ ∅, i.e., Y contains at least one vertex from each defensive (offensive) k-alliance of Γ. In this paper we show several mathematical properties of defensive (offensive) k-alliance free sets and defensive (offensive) k-alliance cover sets, including tight bounds on their cardinality.     

Complete precones on noncommutative integral domains

A subgroup H is called Q-supplemented in a finite group G, if there exists a subgroup K of G such that G = HK and H ∩ K is contained in H _QG , where H _QG is the maximal quasinormal subgroup of G contained in H. In this article, we investigate the influence of Q-supplementation of some primary subgroups in finite groups. Some recent results are generalized.     

Illuminating high-dimensional convex sets

A setL of points in thed-spaceE ^d is said toilluminate a familyF={S ₁, ...,S _n } ofn disjoint compact sets inE ^d if for every setS _i inF and every pointx in the boundary ofS _i there is a pointv inL such thatv illuminatesx, i.e. the line segment joiningv tox intersects the union of the elements ofF in exactly {x}.The problem we treat is the size of a setS needed to illuminate a familyF={S ₁, ...,S _n } ofn disjoint compact sets inE ^d . We also treat the problem of putting these convex sets in mutually disjoint convex polytopes, each one having at most a certain number of facets.     

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.     

Normal Quadratics in Ore Extensions,Quantum Planes,and Quantized Weyl Algebras

Let R be a Noetherian domain and let (σ,δ) be a quasi-derivation of R such that σ is an automorphism. There is an induced quasi-derivation on the classical quotient ring Q of R. Suppose F=t ²−v is normal in the Ore extension R[t;σ,δ] where v∈R. We show F is prime in R[t;σ,δ] if and only if F is irreducible in Q[t;σ,δ] if and only if there does not exist w∈Q such that v=σ(w)w−δ(w). We apply this result to classify prime quadratic forms in quantum planes and quantized Weyl algebras.     

Nearly m-embedded subgroups and solvability of finite groups

A subgroup A of a finite group G is called {1≤G}-embedded in G if for each two subgroups K≤H of G, where K is a maximal subgroup of H, A either covers the pair (K,H) or avoids it. Moreover, a subgroup H of G is called nearly m-embedded in G if G has a subgroup T and a {1≤G}-embedded subgroup C such that G?=?HT and H∩T≤C≤H. In this paper, we mainly prove that G is solvable if and only if its Sylow 3-subgroups, Sylow 5-subgroups and Sylow 7-subgroups are nearly m-embedded in G.     

Strong Reality Properties of Normalizers of Parabolic Subgroups in Finite Coxeter Groups

Let W be a finite Coxeter group, P a parabolic subgroup of W, and N _W (P) the normalizer of P in W. We prove that every element in N _W (P) is strongly real in N _W (P), and that every irreducible complex character of N _W (P) has Frobenius-Schur indicator 1.     

Pan-connectedness of graphs with large neighborhood unions

Let G be a simple graph with n vertices. For any v ? V(G){v \in V(G)} , let N(v)={u ? V(G): uv ? E(G)}{N(v)=\{u \in V(G): uv \in E(G)\}} , NC(G) = min{|N(u) èN(v)|: u, v ? V(G){NC(G)= \min \{|N(u) \cup N(v)|: u, v \in V(G)} and uv \not ? E(G)}{uv \not \in E(G)\}} , and NC₂(G) = min{|N(u) èN(v)|: u, v ? V(G){NC_2(G)= \min\{|N(u) \cup N(v)|: u, v \in V(G)} and u and v has distance 2 in E(G)}. Let l ≥ 1 be an integer. A graph G on n ≥ l vertices is [l, n]-pan-connected if for any u, v ? V(G){u, v \in V(G)} , and any integer m with l ≤ m ≤ n, G has a (u, v)-path of length m. In 1998, Wei and Zhu (Graphs Combinatorics 14:263–274, 1998) proved that for a three-connected graph on n ≥ 7 vertices, if NC(G) ≥ n − δ(G) + 1, then G is [6, n]-pan-connected. They conjectured that such graphs should be [5, n]-pan-connected. In this paper, we prove that for a three-connected graph on n ≥ 7 vertices, if NC ₂(G) ≥ n − δ(G) + 1, then G is [5, n]-pan-connected. Consequently, the conjecture of Wei and Zhu is proved as NC ₂(G) ≥ NC(G). Furthermore, we show that the lower bound is best possible and characterize all 2-connected graphs with NC ₂(G) ≥ n − δ(G) + 1 which are not [4, n]-pan-connected.     

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.     

On Π-Supplemented Subgroups of a Finite Group

A subgroup H of a finite group G is said to satisfy Π-property in G if for every chief factor L/K of G, |G/K: N_G/K(HK/K ∩ L/K)| is a π(HK/K ∩ L/K)-number. A subgroup H of G is called Π-supplemented in G if there exists a subgroup T of G such that G = HT and H ∩ T ≤ I ≤ H, where I satisfies Π-property in G. In this article, we investigate the structure of a finite group G under the assumption that some primary subgroups of G are Π-supplemented in G. The main result we proved improves a large number of earlier results.     

π-quasinormally embedded and c-supplemented subgroup of finite group

Suppose that H is a subgroup of a finite group G. H is called π-quasinormal in G if it permutes with every Sylow subgroup of G; H is called π-quasinormally embedded in G provided every Sylow subgroup of H is a Sylow subgroup of some π-quasinormal subgroup of G; H is called c-supplemented in G if there exists a subgroup N of G such that G = HN and H ∩ N ⩽ H _G = Core _G (H). In this paper, finite groups G satisfying the condition that some kinds of subgroups of G are either π-quasinormally embedded or c-supplemented in G, are investigated, and theorems which unify some recent results are given.      

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.     

Additive Set of Idempotents in Rings

Let R be a ring with identity 1, I(R) be the set of all nonunit idempotents in R, and M(R) be the set of all primitive idempotents and 0 of R. We say that I(R) is additive if for all e, f ∈ I(R) (e ≠ f), e + f ∈ I(R), and M(R) is additive in I(R) if for all e, f ∈ M(R)(e ≠ f), e + f ∈ I(R). In this article, the following points are shown: (1) I(R) is additive if and only if I(R) is multiplicative and the characteristic of R is 2; M(R) is additive in I(R) if and only if M(R) is orthogonal. If 0 ≠ ef ∈ I(R) for some e ∈ M(R) and f ∈ I(R), then ef ∈ M(R), (2) If R has a complete set of primitive idempotents, then R is a finite product of connected rings if and only if I(R) is multiplicative if and only if M(R) is additive in I(R).