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.     

Chapter 1 Introduction: Extensions and new developments in DEA

The extensions, new developments and new interpretations for DEA covered in this paper include: (1) new measures of efficiency, (2) new models and (3) new ways of implementing established models with new results and interpretations presented that include treatments of congestion, returns-to-scale and mix and technical inefficiencies and measures of efficiency that can be used to reflect all pertinent properties. Previously used models, such as those used to identify allocative inefficiencies, are extended by means of assurance region approaches which are less demanding in their information requirements and underlying assumptions. New opportunities for research are identified in each section of this chapter. Sources of further developments and possible sources for further help are also suggested with references supplied to other papers that appear in this volume and which are summarily described in this introductory chapter.     

A Nonlinear Problem Associated to the Motion of a Membrane

A nonlinear model associated to the motion of a membrane is considered as limit of a sequence of approximate models, for which a global existence and uniqueness theorem can be proved. The paper investigates the relationship between the solutions of the real and approximate models.     

Role of information in the stochastic zero-sum differential game

In this paper, a linear-quadratic Gaussian zero-sum differential game is studied. Maneuverability is defined to measure players' strength. It is shown that a more maneuverable player would prefer a more observable information system. An example is given to show that a more controllable player might not prefer more observable measurements in the stochastic environment.The research reported in this paper was made possible through support extended to the Division of Engineering and Applied Physics, Harvard University, by the US Office of Naval Research under the Joint Services Electronics Program by Contract No. N00014-75-c-0648 and by the National Science Foundation under Grant No. GK31511.     

Nonsymmetrical distance between probability distributions,entropy and the theorem of pythagoras

The Kullback-Leibler information I[Q¦p¦ for discrimination in favor of the probability distribution Q against P is considered as a nonsymmetrical analog of one half of the square of the distance between the points Q and P. For the n-dimensional planes we take the exponential families. We shall prove a nonsymmetrical analogue of the theorem of Pythagoras in the formulation: The squared length of an oblique line equals the sum of the squared lengths of the perpendicular and the projection of the oblique line, and also an analog of the cosine theorem and the like.Translated from Matematicheskie Zametki, Vol. 4, No. 3, pp. 323–332, September, 1968.     

On the continuity of midpoint hull convex set-valued functions

Summary The concept of hull convexity (midpoint hull convexity) for set-valued functions in vector spaces is examined. This concept, introduced by A. V. Fiacco and J. Kyparisis (Journal of Optimization Theory and Applications,43 (1986), 95–126), is weaker than one of convexity (midpoint convexity).The main result is a sufficient condition for a midpoint hull convex set-valued function to be continuous. This theorem improves a result obtained by K. Nikodem (Bulletin of the Polish Academy of Sciences, Mathematics,34 (1986), 393–399).     

Discrete Newton methods and iterated defect corrections

Summary In this paper we present a general theory for discrete Newton methods, iterated defect corrections via neighbouring problems and deferred corrections based on asymptotic expansions of the discretization error.Dedicated to Professor Dr. J. Weisinger on the occasion of his sixty-fifth birthday     

The geodesic “straightest” lines of a nonlinear nonholonomic manifold in E4

The following properties of the geodesic straightest lines of a system of two Monge equations inE ₄ are established:

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).     

A new class of cutting planes for the symmetric travelling salesman problem

A comprehensive class of cutting planes for the symmetric travelling salesman problem (TSP) is proposed which contains the known comb inequalities, the path inequalities and the 3-star constraints as special cases. Its relation to the clique tree inequalities is discussed. The cutting planes are shown to be valid for a relaxed version of the TSP, the travelling salesman problem on a road network, and—under certain conditions—to define facets of the polyhedron associated with this problem.     

Computing convolutions by reciprocal search

In this paper we show how certain geometric convolution operations can be computed efficiently. Here efficiently means that our algorithms have running time proportional to the input size plus the output size. Our convolution algorithms rely on new optimal solutions for certain reciprocal search problems, such as finding intersections between blue and green intervals, and overlaying convex planar subdivisions.This research was done while on leave from Cornell at DEC/SRC.     

Invarianz gewisser Operatorenklassen unter nichtkommutativen ergodischen Mitteln

Let be a group of *-automorphisms on the algebra of bounded linear operators on a complex Hilbert space H. Then the strongly closed convex hull of the orbit of any compact operator under consists of compact operators. The same is true if one replaces compact by nuclear, Hilbert-Schmidt or positive Fredholm. We further discuss these results in the framework of the noncommutative mean ergodic theorem of KOVACS and SZ#x00FC;CS and formulate an analogous theorem for the algebra of compact operators on a complex Hilbert space.

---

---

Gefördert von der Deutschen Forschungsgemeinschaft im Rahmen des Forschungsvorhabens Ko 506/1.     

Computations in choice groupoids

Defining achoice as a mapping of the subsets of a setX into their respective subsets, a one-to-one (and naturally) corresponding binary operation,sequential choice, is identified under which the power set ofX is closed as achoice groupoid. A complete logical diagram is given, exhibiting all the implications between conjunctions of the seven conditions: (1) idempotence, (2) consistency, (3) absorbence, and (4) homomorphism of a choice, and (5) commutativity, (6) associativity, and (7) path-independence of the corresponding sequential choice.     

Hugoniót–Maslov Chains for Singular Vortical Solutions to Quasilinear Hyperbolic Systems and Typhoon Trajectory

According to Maslov, many 2D quasilinear systems of PDE possess only three algebras of singular solutions with properties of structural self-similarity and stability. They are the algebras of shock waves, narrow solitons, and square-root point singularities (solitary vortices). Their propagation is described by infinite chains of ODE (the Hugoniót–Maslov chains). We consider the Hugoniót-Maslov chain for the square-root point singularities of the shallow water equations. We discuss different related mathematical questions (in particular, unexpected integrability effects) as well as their possible application to the problem of typhoon dynamics.     

Model reduction techniques for sampled-data systems

An approximately balanced realization of linear finite-dimensional sampled-data systems is proposed. The theoretical support of the approximately balancing algorithm is represented by a result on the asymptotic expansions with respect to the sampling step of the sampled controllability and observability graminas. Reduced order models obtained as singular perturbational approximations of approximately balanced realizations of sampled-data systems are shown to be acceptable solutions to the sampled-data system model reduction problem in the sense that, enjoying some asymptotic properties, they come close to the exact solutions as the sampling step decreases. An example illustrates the results.     

A Niche Width Model of Optimal Specialization

Niche width theory, a part of organizational ecology, predicts whether specialist or generalist forms of organizations have higher fitness, in a continually changing environment. To this end, niche width theory uses a mathematical model borrowed from biology. In this paper, we first loosen the specialist-generalist dichotomy, so that we can predict the optimal degree of specialization. Second, we generalize the model to a larger class of environmental conditions, on the basis of the model's underlying assumptions. Third, we criticize the way the biological model is treated in sociological theory. Two of the model's dimensions seem to be confused, i.e., that of trait and environment; the predicted optimal specialization is a property of individual organizations, not of populations; and, the distinction between fine and coarse grained environments is superfluous.     

Construction of Pseudorandom Binary Sequences Using Additive Characters

In earlier papers the authors studied finite pseudorandom binary sequences, and they constructed sequences with strong pseudorandom properties. In these earlier constructions multiplicative characters were used. In this paper a new construction is presented which utilizes properties of additive characters. These new sequences can be computed fast, they are well-distributed relative to arithmetic progressions and their correlations of small order are small, but the price paid for the fast computation is that the correlations of large order can be large.     

Stellare Abänderungen und Schälbarkeit von Komplexen und Polytopen

Brugesser and Mani proved that the boundary-complex of a convex polytope can be shelled. This result lead to McMullen's proof of the Upper-bound-conjecture. We show that the shellability of complexes has a close connection to the theory of stellar operations. Several results on special shelling procedures and on non-shellable complexes are obtained.     

On the Mechanism for Nonlinear Representations of the Lorentz Group Arising in Quantum Field Theory

A mechanism is identified that leads to the correct law for the relativistic Wigner function transformation with respect to the Lorentz group as long as the corresponding relativistic wave functions have special transformation properties.