Nearly prime subsemigroups ofβℕ

We show that there exist relatively small subsemigroupsM ofβℕ with the property that ifp+q andq+p are inM then bothp andq are inM + ℤ. We also show that it is consistent with the usual axioms of set theory that there is some idempotent e inβℕ such that ifp+q=e, then bothp andq are ine + ℤ. The first author acknowledges support received from the National Science Foundation (USA) via grant DMS90-25025.     

On the number of queries necessary to identify a permutation

Let p and q be two permutations over {1, 2,…, n}. We denote by m(p, q) the number of integers i, 1 ≤ i ≤ n, such that p(i) = q(i). For each fixed permutation p, a query is a permutation q of the same size and the answer a(q) to this query is m(p, q). We investigate the problem of finding the minimum number of queries required to identify an unknown permutation p. A polynomial-time algorithm that identifies a permutation of size n by O(n · log₂n) queries is presented. The lower bound of this problem is also considered. It is proved that the problem of determining the size of the search space created by a given set of queries and answers is #P-complete. Since this counting problem is essential for the analysis of the lower bound, a complete analysis of the lower bound appears infeasible. We conjecture, based on some preliminary analysis, that the lower bound is Ω(n · log₂n).     

Cyclic Difference Packing and Covering Arrays

Let n and k be positive integers. Let C_q be a cyclic group of order q. A cyclic difference packing (covering) array, or a CDPA(k, n; q) (CDCA(k, n; q)), is a k × n array (a_ij) with entries a_ij (0 ≤ i ≤ k−1, 0 ≤ j ≤ n−1) from C_q such that, for any two rows t and h (0 ≤ t < h ≤ k−1), every element of C_q occurs in the difference list at most (at least) once. When q is even, then n ≤ q−1 if a CDPA(k, n; q) with k ≥ 3 exists, and n ≥ q+1 if a CDCA(k, n; q) with k ≥ 3 exists. It is proved that a CDCA(4, q+1; q) exists for any even positive integers, and so does a CDPA(4, q−1; q) or a CDPA(4, q−2; q). The result is established, for the most part, by means of a result on cyclic difference matrices with one hole, which is of interest in its own right.     

Bounds for Covering Codes over Large Alphabets

Let K_q(n,R) denote the minimum number of codewords in any q-ary code of length n and covering radius R. We collect lower and upper bounds for K_q(n,R) where 6 ≤ q ≤ 21 and R ≤ 3. For q ≤ 10, we consider lengths n ≤ 10, and for q ≥ 11, we consider n ≤ 8. This extends earlier results, which have been tabulated for 2 ≤ q ≤ 5. We survey known bounds and obtain some new results as well, also for s-surjective codes, which are closely related to covering codes and utilized in some of the constructions.AMS Classification: 94B75, 94B25, 94B65Gerzson Kéri - Supported in part by the Hungarian National Research Fund, Grant No. OTKA-T029572.Patric R. J. Östergård - Supported in part by the Academy of Finland, Grants No. 100500 and No. 202315.     

Non-simultaneous versus simultaneous quenching in a coupled nonlinear parabolic system

This paper deals with finite-time quenching for the nonlinear parabolic system with coupled singular absorptions: u_t=Δu−v^−p, v_t=Δv−u^−q in Ω×(0,T) subject to positive Dirichlet boundary conditions, where p,q>0, Ω is a bounded domain in with smooth boundary. We obtain the sufficient conditions for global existence and finite-time quenching of solutions, and then determine the blow-up of time-derivatives and the quenching set for the quenching solutions. As the main results of the paper, a very clear picture is obtained for radial solutions with Ω=B_R: the quenching is simultaneous if p,q≥1, and non-simultaneous if p<1≤q or q<1≤p; if p,q<1 with , then both simultaneous and non-simultaneous quenching may happen, depending on the initial data. In determining the non-simultaneous quenching criteria of the paper, some new ideas have been introduced to deal with the coupled singular inner absorptions and inhomogeneous Dirichlet boundary value conditions, in addition to techniques frequently used in the literature.     

On Finite Nonabelian Loop Capable Groups

We say that groups, which are isomorphic to inner mapping groups of finite loops, are loop capable. Let p and q be distinct prime numbers, S a nonabelian group of order pq, and C a finite nontrivial cyclic group such that gcd (|S|, |C|) = 1. We show that the group S × C is not loop capable.     

Nilpotent Injectors in General Linear Groups

In a recent paper, A. Bialostocki (Israel J. Math.41 (1982), 261-273) has defined a nilpotent injector in an arbitrary finite group G to be a maximal nilpotent subgroup of G, containing a subgroup H of G of maximal order satisfying class (H) ≤2. In the present paper, the author determines the nilpotent injectors of GL(n, q) and shows that they form a unique conjugacy class of subgroups of GL(n, q). It is also proved that if n ≠ 2 or n = 2 and q ≠ 9 is not a Fermat prime >3, then the nilpotent injectors of GL(n, q) are the nilpotent subgroups of maximal order.     

On the generators of subgroups of unit groups of group rings

In this paper we find the generators of a subgroup of finite index in the unit group of the integral group ring of the metacyclic group of orderpq given byG=(a,x:a ^p=1=x ^q ,xax ⁻¹=a ^f ), wherep is an odd prime,q>2 a divisor ofp-1, andf belongs to the exponentq modulop.     

G-Loops and Permutation Groups

A G-loop is a loop which is isomorphic to all its loop isotopes. We apply some theorems about permutation groups to get information about G-loops. In particular, we study G-loops of order pq, where p < q are primes and p  (q − 1). In the case p = 3, the only G-loop of order 3q is the group of order 3q. The notion “G-loop” splits naturally into “left G-loop” plus “right G-loop.” There exist non-group right G-loops and left G-loops of order n iff n is composite and n > 5.     

Matroids with No (q+2)-Point-Line Minors

It is known that a geometry with rankrand no minor isomorphic to the (q+2)-point line has at most (q^r−1)/(q−1) points, with strictly fewer points ifr>3 andqis not a prime power. Forqnot a prime power andr>3, we show thatq^r−1−1 is an upper bound. Forqa prime power andr>3, we show that any rank-rgeometry with at leastq^r−1points and no (q+2)-point-line minor is representable overGF(q). We strengthen these bounds toq^r−1−(q^r−2−1)/(q−1)−1 andq^r−1−(q^r−2−1)/(q−1) respectively whenqis odd. We give an application to unique representability and a new proof of Tutte's theorem: A matroid is binary if and only if the 4-point line is not a minor.     

Solvable line-transitive automorphism groups of finite linear spaces

Let S be a finite linear space, and letG be a group of automorphisms of S. IfG is soluble and line-transitive, then for a givenk but a finite number of pairs of (S, G),S hasv= p ⁿ points andG ⩽AΓL(1,p ⁿ ).     

On the algebra structure of some bismash products

We study several families of semisimple Hopf algebras, arising as bismash products, which are constructed from finite groups with a certain specified factorization. First we associate a bismash product H_q of dimension q(q−1)(q+1) to each of the finite groups PGL₂(q) and show that these H_q do not have the structure (as algebras) of group algebras (except when q=2,3). As a corollary, all Hopf algebras constructed from them by a comultiplication twist also have this property and are thus non-trivial. We also show that bismash products constructed from Frobenius groups do have the structure (as algebras) of group algebras.     

A new characterization ofA p wherep andp − 2 are primes

Based on the prime graph of a finite simple group, its order is the product of its order components (see [4]). It is known that Suzuki-Ree groups [6],PSL ₂(q) [8] andE ₈(q) [7] are uniquely determined by their order components. In this paper we prove that the simple groupsA _p are also uniquely determined by their order components, wherep andp − 2 are primes.     

Stabilizers of collineation groups of smooth stable planes

Let be a smooth stable plane of dimension n (see Definition 1.2) and let Δ be a closed subgroup of the collineation group of which fixes some point p. We derive some results on the group-theoretical structure of Δ, e.g. that Δ is a linear Lie group (Theorem 3.7). As a by-product this shows that no (affine or projective) Moulton plane can be turned into a smooth plane. If Δ fixes some flag, then any Levi subgroup Ψ of Δ is a compact group and Δ is contained in the flag stabilizer of the classical Moufang plane of dimension n (Corollary 3.1 and Theorem 3.7). Let Δ fix three concurrent lines through the point p. If is one of the classical projective planes over the reals, the complex numbers, the quaternions, or the Cayley numbers, then the dimension of Δ is d_class = 3, 6, 15, or 38, respectively. We show that for a smooth stable (projective) plane S of dimension 2l either S is an almost projective translation plane (classical projective plane) or that dim Δ ≤ d_class − l holds (Theorems 4.1 and 4.2).     

Some permutation groups of degreep=6q+1

Transitive permutation groups of degrees 43, 67, 79, 103 and 139 are classified.In this note we consider insoluble transitive permutation groups of degreeq = 6q+1 wherep andq are primes and summarise the computations whereby these groups have been classified for some small values ofq. The result which allows progress on this problem is due to McDonough [1]; he showed that if such a group has a Sylowp-normaliser of order 3p then it is isomorphic either toPSL(3, 3) orPAL(3, 5) (of degrees 13, 31 respectively). Using this theorem machine computations along the lines of those done by Parker, Nikolai and Appel [3, 2] for degreesp=2q+1 andp=4q+1 give the following     

The Fine Structure of the n-Widths of H-Spaces in Lq(−1, 1)

The n-widths of the unit ball A_p of the Hardy space H^p in L_q( −1, 1) are determined asymptotically. It is shown that for 1 ≤ q < p ≤∞ there exist constants k₁ and k₂ such that [formula]≤ d_n(A_p, L_q(−1, 1)),dⁿ(A_p, L_q(−1, 1)), δ_n(A_p, L_q(−1, 1))[formula]where d_n, dⁿ, and δ_n denote the Kolmogorov, Gel′fand and linear n-widths, respectively. This result is an improvement of estimates previously obtained by Burchard and Höllig and by the author.     

On a group with three supersolvable subgroups of pairwise relatively prime indices

In this paper, we show that if G is a finite group with three supersolvable subgroups of pairwise relatively prime indices in G and G′ is nilpotent, then G is supersolvable. Let π(G) denote the set of prime divisors of |G| and max(π(G)) denote the largest prime divisor of |G|. We also establish that if G is a finite group such that G has three supersolvable subgroups H, K, and L whose indices in G are pairwise relatively prime, q \nmid p-1{q \nmid p-1} where p =  max(π(G)) and q = max(π(L)) with L a Hall p′-subgroup of G, then G is supersolvable.     

On an extension of a theorem on conjugacy class sizes

Let G be a finite group. We extend Alan Camina’s theorem on conjugacy classes sizes which asserts that if the conjugacy classes sizes of G are {1, p ^a , q ^b , p ^a q ^b }, where p and q are two distinct primes and a and b are integers, then G is nilpotent. We show that let G be a group and assume that the conjugacy classes sizes of elements of primary and biprimary orders of G are exactly {1, p ^a , n,p ^a n} with (p, n) = 1, where p is a prime and a and n are positive integers. If there is a p-element in G whose index is precisely p ^a , then G is nilpotent and n = q ^b for some prime q ≠ p.     

Complexity of Weighted Approximation over

We study approximation of univariate functions defined over the reals. We assume that the rth derivative of a function is bounded in a weighted L_p norm with a weight ψ. Approximation algorithms use the values of a function and its derivatives up to order r−1. The worst case error of an algorithm is defined in a weighted L_q norm with a weight ρ. We study the worst case (information) complexity of the weighted approximation problem, which is equal to the minimal number of function and derivative evaluations needed to obtain error . We provide necessary and sufficient conditions in terms of the weights ψ and ρ, as well as the parameters r, p, and q for the weighted approximation problem to have finite complexity. We also provide conditions which guarantee that the complexity of weighted approximation is of the same order as the complexity of the classical approximation problem over a finite interval. Such necessary and sufficient conditions are also provided for a weighted integration problem since its complexity is equivalent to the complexity of the weighted approximation problem for q=1.