Compact elements in the lattice of radicals

Summary A radical R, in the sense of Kurosh--Amitsur, is said to be compact if, given any collection of radicals X such that R ≤;VX, we have R ≤;VX' for some finite subcollection X' of X. A ring A is said to be radical compact if the lower radical on the singleton {A} is compact. This paper explores the relationship between radical compact rings and rings satisfying certain finiteness conditions. Closure properties of the class of all radical compact rings are also investigated.     

Types in a mixed language system

As a support for writing software, a comprehensive set of problem oriented languages appears preferable to any so-called universal language, as soon as static checking is sufficient to ensure type correctness of the mixed language program. We lay the basis for a mixed language system where this requirement is fulfilled. The general outline of the system is first sketched. Detailed consideration is then given to our basic constructs for establishing communication between languages, namely standard types and foreign types. Abstract types, such as defined in CLU, are finally shown to be a particular class of foreign types.     

Design of Stacked Self-Healing Rings Using a Genetic Algorithm

Ring structures in telecommunications are taking on increasing importance because of their self-healing properties. We consider a ring design problem in which several stacked self-healing rings (SHRs) follow the same route, and, thus, pass through the same set of nodes. Traffic can be exchanged among these stacked rings at a designated hub node. Each non-hub node may be connected to multiple rings. It is necessary to determine to which rings each node should be connected, and how traffic should be routed on the rings. The objective is to optimize the tradeoff between the costs for connecting nodes to rings and the costs for routing demand on multiple rings. We describe a genetic algorithm that finds heuristic solutions for this problem. The initial generation of solutions includes randomly-generated solutions, complemented by seed solutions obtained by applying a greedy randomized adaptive search procedure (GRASP) to two related problems. Subsequent generations are created by recombining pairs of parent solutions. Computational experiments compare the genetic algorithm with a commercial integer programming package.     

Multivariate Refinable Functions of High Approximation Order Via Quotient Ideals of Laurent Polynomials

We give an algebraic interpretation of the well-known zero-condition or sum rule for multivariate refinable functions with respect to an arbitrary scaling matrix. The main result is a characterization of these properties in terms of containment in a quotient ideal, however not in the ring of polynomials but in the ring of Laurent polynomials.     

Chapter 13 Satisficing DEA models under chance constraints

DEA (Data Envelopment Analysis) models and concepts are formulated here in terms of the P-Models of Chance Constrained Programming, which are then modified to contact the satisficing concepts of H.A. Simon. Satisficing is thereby added as a third category to the efficiency/inefficiency dichotomies that have heretofore prevailed in DEA. Formulations include cases in which inputs and outputs are stochastic, as well as cases in which only the outputs are stochastic. Attention is also devoted to situations in which variations in inputs and outputs are related through a common random variable. Extensions include new developments in goal programming with deterministic equivalents for the corresponding satisficing models under chance constraints.     

Hypercyclic and chaotic convolution operators associated with the Dunkl operator on <Emphasis Type=”Bold”>C</Emphasis>

Summary We show that there exist infinitely many positive integers m not of the form n-&ohgr;(n) for any positive integer n. Here, &ohgr;(n) stands for the number of distinct prime factors of n. A similar result holds with &ohgr;(n) replaced by the total number of prime factors of n (counting multiplicities), or by the number of divisors of n.     

Some remarks on bounded and unbounded weak solutions of elliptic systems

The result of Ladyzenskaya on global bounds for weak solutions of elliptic equations is carried over to certain quasilinear elliptic systems in diagonal form. A generalization of De Giorgi's example shows that there are unbounded weak solutions for systems with only small deviation from the diagonal form.     

Compact Laws of the Iterated Logarithm for B-Valued Random Variables with Two-Dimensional Indices

Let be a real separable Banach space and {X, X _{n, m}; (n, m) N ²} B-valued i.i.d. random variables. Set . In this paper, the compact law of the iterated logarithm, CLIL(D), for B-valued random variables with two-dimensional indices ranging over a subset D of N ² is studied. There is a gap between the moment conditions for CLIL(N ¹) and those for CLIL(N ²). The main result of this paper fills this gap by presenting necessary and sufficient conditions for the sequence to be almost surely conditionally compact in B, where, for 0, 1 r 2, N ^r (, ) = {(n, m) N ²; n m n exp{(log n) ^r–1 (n)}} and (·) is any positive, continuous, nondecreasing function such that (t)/(log log t) is eventually decreasing as t , for some > 0.     

Zwei Bemerkungen über die Ricci-Krümmung

Ohne ZusammenfassungUnterstützt von Sonderforschungsbereich Theoretische Mathematik an der Universität Bonn.     

Large transversals to small families of unit disks

Summary It is proved that if the nonempty intersection of bounded closed convex sets AnB is contained in (A + F)U(B+F) and one of the following holds true: (i) the space X is less-than-three dimensional, (ii) AUB is convex, (iii) F is a one-point set, then AnBCA+F or AnBCB+F (Theorems 2 and 3). Moreover, under some hypotheses the characterization of A and B such that AnB is a summand of AUB is given (Theorem 3).     

Near-rings (MDS)- and Laguerre codes

(MDS)- and Laguerre codes are closely related to geometry and can be used in order to construct certain finite incidence structures. Here we present some structure theorems on near rings, introduce the notion of a coding set of a near ring, which enables us to construct (MDS)-codes, and discuss the same problem for Laguerre codes. To find non trivial Laguerre sets in a near ring is much more difficult.Dedicated to Giuseppe Tallini on the occasion of his 60 th birthday     

A new characterization of <Emphasis Type="Italic">PSU</Emphasis>(<Emphasis Type="Italic">p,q</Emphasis>)

Summary Let G be a finite group. Order components of G were introduced in Chen [5]. Let OC(G) be the set of order components of G. Some finite groups are characterizable by their order components. This assertion was proved for the simple groups PSU(p,q), where p=3, 5, 7 and 11. In this paper, we prove that the simple groups PSU(p,q) can be uniquely determined by their order components, where p&ge;13 is a prime number. Main consequences of our results are the validity of a conjecture of J. G. Thompson and another conjecture of W. Shi and J. Bi for the groups under consideration.     

A result from diophantine approximation which has applications in economics

We say that a real number allows poor approximations if we can find 0<=()<1 and a sequence of integers n₁2<... such that for all rationals p/q with qn. we have |–.p/q| > Kn _j ^–l– where K is a constant depending only on .In this note we prove that the set of numbers which allow poor approximations are precisely the very well-approximable numbers.The existence of numbers with poor approximations has been used by Cheng [1] to show the existence of a dense set of economies whose cone converges to the Walras equilibrium as slowly as 0(n^–1/2–) after n replications.     

A note on sequence-covering mappings

Summary Let f: X &rarr; Y be a mapping. f is called a sequence-covering mapping if in case S is a convergent sequence containing its limit point in Y then there is a compact subset K of X such that f(K) = S. It is shown that each quotient and compact mapping of a metric space is sequence-covering.     

Combinatorics of orientation reversing polygons

We give two combinatorial characterizations of orientation reversing polygons in graphs embedded on surfaces (r-polygons) and use the notion of skew embedding introduced in [7] to characterize parity embeddings: an embedding has its odd polygons coinciding with itsr-polygons if and only if the skew embedding is in an orientable surface. The concept of imbalance, central for the proof, does not seem to appear explicitly before in the literature. Possible algorithmic implications of the parity embedding theorem are briefly discussed.     

L ∞ stability of finite element approximations to elliptic gradient equations

Summary We examine theL stability of piecewise linear finite element approximationsU to the solutionu to elliptic gradient equations of the form –·[a(x)u]+f(x, u)=g(x) wheref is monotonically increasing inu. We identify a prioriL bounds for the finite element solutionU, which we call reduced bounds, and which are marginally weaker than those for the original differential equations. For the general,N-dimensionai, case we identify new conditions on the mesh, such that under the assumption thatf is Lipschitz continuous on a finite interval,U satisfies the reducedL bounds mentioned above. The new,N-dimensional regularity conditions preclude quasi-rectangular meshes.Moreover, we show thatU is stable inL in two dimensions for a discretization mesh on which –·[a(x)u] gives rise to anM-matrix, whileU is stable for any mesh in one dimension. The condition that the discretization of –·[a(x)u] has to be anM-matrix, still allows the inclusion of the important case of triangulating in a quasi-rectangular fashion.The results are valid for either the pure Neumann problem or the general mixed Dirichlet-Neumann boundary value problem, while interfaces may be present. The boundary conditions forU are obtained by use of (nonexpansive) pointwise projection operators.The first author is supported by the National Science Foundation under grant EET-8719100Research of the second author supported by National Science Foundation grant DMS.8420192     

On a partition analog of the Cauchy-Davenport theorem

Summary Let G be a finite abelian group, and let n be a positive integer. From the Cauchy-Davenport Theorem it follows that if G is a cyclic group of prime order, then any collection of n subsets A_1,A_2,\ldots,A_n of G satisfies \bigg|\sum_{i=1}^n A_i\bigg| \ge \min \bigg\{|G|,\,\sum_{i=1}^n |A_i|-n+1\bigg\}. M.~Kneser generalized the Cauchy--Davenport Theorem for any abelian group. In this paper, we prove a sequence-partition analog of the Cauchy--Davenport Theorem along the lines of Kneser&apos;s Theorem. A particular case of our theorem was proved by J.~E. Olson in the context of the Erd&odblac;s--Ginzburg--Ziv Theorem.