A combinatorial characterization of the Klein quadric

We give a combinatorial characterization of the Klein quadric in terms of its incidence structure of points and lines. As an application, we obtain a combinatorial proof of a result of Havlicek.In memoriam Giuseppe TalliniWork supported by National Research Project Strutture Geometriche, Combinatoria e loro applicazioni of the Italian Ministere dell'Università e della Ricerca Scientifica and by G.N.S.A.G.A. of C.N.R.      

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.     

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.     

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.     

Applying a fuzzy relation to describe influence of flux behaviour in a printed coil

Summary Being a subject of expectedly fuzzy character, an attempt is made to apply fuzzy functions, more precisely fuzzy relations to investigate the problem of flux distortion in a printed coil.

---

Zusammenfassung Da die Vorgänge in einer gedruckten Spule sich aus einer Vielzahl schwerer erfaßbarer Einzeleinflüsse zusammensetzen, die insbesondere den Magnetfluß verzerren, lag es nahe, den Versuch zu machen, die Fuzzy Functions (die logische Algebra, gemäß [1]) darauf anzuwenden. Die Fuzzy Functions sind gedacht für das Beschreiben von Vorgängen, oder Ereignissen, die im Ansatz ein breit gefächertes (fuzzy) Verhalten, ohne scharfe Grenzen aufweisen; siehe Fig. 4.Dieser gefächerten logischen Funktion entspricht eine reguläre mathematische Kurvenschar, die meßtechnisch nachgewiesen werden muß.Im vorliegenden Falle ergab sich eine Korrekturfunktion (5), die es gestattet, die Induktivität gedruckter Spulen, in einem weiten Bereich von Abmessungen und Windungen, mit einer Genauigkeit von –2% bis +5% zu bestimmen.

     

Weyl's theorem for operator matrices

Weyl's theorem holds for an operator when the complement in the spectrum of the Weyl spectrum coincides with the isolated points of the spectrum which are eigenvalues of finite multiplicity. By comparison Browder's theorem holds for an operator when the complement in the spectrum of the Weyl spectrum coincides with Riesz points. Weyl's theorem and Browder's theorem are liable to fail for 2×2 operator matrices. In this paper we explore how Weyl's theorem and Browder's theorem survive for 2×2 operator matrices on the Hilbert space.Supported in part by BSRI-97-1420 and KOSEF 94-0701-02-01-3.     

Characterization of coalitionally ordered games

Summary In the sequel we will derive sufficient and necessary conditions for the existence of certain numeric representations of simple games. In § 2 the above mentioned representation is given by a so called, coalitionally ordered function, i.e. a numeric function representing the desirability of each coalition in the class of all coalitions. Simple games which possess a c.o.f are called coalitionally ordered games. Sufficient and necessary criteria are given for a simple game to be a c.o.g. Analogously weighted majority games are characterized in § 3. The criteria to be presented are linked by properties of the desirability relation of a simple game. The concept of a desirability relation was introduced by Peleg 1978.

---

Zusammenfassung Im folgenden werden wir hinreichende und notwendige Bedingungen zur Existenz von gewissen numerischen Darstellungen einfacher Spiele (simple games) herleiten. Diese oben genannte Darstellung wird in § 2 durch eine sogenannte coalitionally ordered function, gegeben, wobei wir darunter eine numerische Funktion verstehen, die die Desirability, jeder Koalition innerhalb der Klasse aller Koalitionen beschreibt. Einfache Spiele, die eine c.o.f besitzen, werden coalitionally ordered games genannt. Es werden hinreichende und notwendige Bedingungen dafür genannt, daß ein einfaches Spiel ein c.o.g ist. Analog werden gewichtete Abstimmungsspiele (weighted majority games) in § 3 charakterisiert. Die angegebenen Kriterien werden mit Eigenschaften der sogenannten desirability relation eines einfachen Spieles in Verbindung gebracht. Das Konzept einer desirability relation wurde von Peleg 1978 verwendet.

     

A Framework for Evaluating Knowledge-Based Interestingness of Association Rules

In Knowledge Discovery in Databases (KDD)/Data Mining literature, interestingness measures are used to rank rules according to the interest a particular rule is expected to evoke. In this paper, we introduce an aspect of subjective interestingness called item-relatedness. Relatedness is a consequence of relationships that exist between items in a domain. Association rules containing unrelated or weakly related items are interesting since the co-occurrence of such items is unexpected. Item-Relatedness helps in ranking association rules on the basis of one kind of subjective unexpectedness. We identify three types of item-relatedness – captured in the structure of a fuzzy taxonomy (an extension of the classical concept hierarchy tree). An item-relatedness measure for describing relatedness between two items is developed by combining these three types. Efficacy of this measure is illustrated with the help of a sample taxonomy. We discuss three mechanisms for extending this measure from a two-item set to an association rule consisting of a set of more than two items. These mechanisms utilize the relatedness of item-pairs and other aspects of an association rule, namely its structure, distribution of items and item-pairs. We compare our approach with another method from recent literature.     

Inequalities for Random Utility Models,with Applications to Ranking and Subset Choice Data

Inequalities on orderings of independent random variables are derived in the context of random utility models for ranking and subset choice data. The inequalities can be used to assess whether ranking or subset choice data are consistent with an independent random utility model. The main technique used for the inequalities is association, with conditions for the sharpness for the inequalities coming from identifying when the association inequality is an equality. Applications to real data sets are given.     

Averaging of Systems with Slow Variables

We justify the averaging method for systems with delay described by both slow and fast variables. The results obtained are applied to the analysis of one problem in control theory.     

0-1-sequences of Toeplitz type

Summary 0-1-sequences are constructed by successive insertion of a periodic sequence of symbols 0, 1 and hole into the holes of the sequence already constructed. Assuming that finally all holes are filled with symbols 0, 1, an almost periodic point in shift space results. Under certain conditions, it is even strictly ergodic. It is proved that the attached invariant measure has pure point spectrum, and a rather explicit expression for eigenvectors is obtained.     

On the representation of zero in floating-point arithmetic

Two representations of zero in floating-point arithmetic are considered in relation to a summation with correction for rounding errors. The common representation with exponent zero is shown in this case to be better than the academic representation where the exponent depends on the history of the zero.     

A generalization of hadwiger's transversal theorem to intersecting sets

Given an ordered family of compact convex sets in the plane, if every three sets can be intersected by some directed line consistent with the ordering, then there exists a common transversal of the family. This generalizes Hadwiger's Transversal Theorem to families of compact convex sets which are not necessarily pairwise disjoint. If every six sets can be intersected by some directed line consistent with the ordering, then there exists a common transversal which is consistent with the ordering. If the family is pairwise disjoint and every four sets can be intersected by some directed line consistent with the ordering, then there exists a common transversal which is consistent with the ordering.     

Characterization of regular singular linear systems of difference equations

This paper deals with linear systems of difference equations whose coefficients admit generalized factorial series representations atz=. We are concerned with the behavior of solutions near the pointz= (the only fixed singularity for difference equations). It is important to know whether a system of linear difference equations has a regular singularity or an irregular singularity. To a given system () we can assign a number , called the Moser's invariant of (), so that the system is regular singular if and only if 1. We shall develop an algorithm, implementable in a computer algebra system, which reduces in a finite number of steps the system of difference equations to an irreducible form. The computation ot the number can be done explicitly from this irreducible form.     

A monte carlo model for simulation of tank battles

A Monte Carlo model for simulation of company-level tank battles is described. The simulation is started with an observation phase. The probability of discovery is dependent upon properties of the terrain etc. Target selection is simulated deterministically with priority rules. Every unit belongs to one of the following states of fight: undamaged, able to shoot only, able to move only, shocked and out of action.It is possible to simulate surprise attacks and battles after a sudden contact if the units are assumed to fight from the same position during the whole battle. In a later version of the model, the units are permitted to show as much of themselves as they wish during the battle. Thus it is possible to simulate (small) changes of position, initiated by the current events.     

Geometric properties of 2-dimensional Brownian paths

Summary Let A be the set of all points of the plane , visited by 2-dimensional Brownian motion before time 1. With probability 1, all points of A are twist points except a set of harmonic measure zero. Twist points may be continuously approached in \A only along a special spiral. Although negligible in the sense of harmonic measure, various classes of cone points are dense in A, with probability 1. Cone points may be approached in \A within suitable wedges.Research supported in part by NSF Grant DMS 8419377     

Nonexistence of new order-9 projective plane with order-13 collineation

The order-9 Desarguesian projective plane and the known self-dual non-Desarguesian plane (Carmichael or Hughes plane) each have a 13-collineation displacing all points and all lines. We show that no previously undiscovered 9-plane has this property.     

Representations of *-algebras with two generators and polynomial relations

It is shown that all * -algebras with two generators with quadratic relations are tame and a classification of their representations is given. A number of examples of general polynomial relations are analyzed (the algebras here can be either tame or wild).Translated from Zapiski Nauchnykh Seminarov Leningradskogo Otdeleniya Matematicheskogo Instituta im. V. A. Steklova, Akad. Nauk SSSR, Vol. 172, pp. 121–129, 1989.     

Absolut stetige Maße auf lokalkompakten Halbgruppen

LetS be a locally compact semigroup. It is shown that if a measure is absolutely continuous and ifS is cancellative, then the measure concentrated on a Borel subsetB ofS (i. e. =(B.)) is also absolutely continuous. Other properties of absolutely continuous measures will be obtained. Moreover we will answer the question when absolutely continuous probability measures exist. This is the case ifS admits an invariant integral on the space of all continuous functions onS with compact support. Another result is the following: If the compact semigroupS has a connected kernel then there exist absolutely continuous probability measures if and only ifS is amenable.     

On the spectral density and asymptotic normality of weakly dependent random fields

For weakly stationary random fields, conditions on coefficients of linear dependence are given which are, respectively, sufficient for the existence of a continuous spectral density, and necessary and sufficient for the existence of a continuous positive spectral density. For strictly stationary random fields, central limit theorems are proved under the corresponding unrestricted -mixing condition and just finite or barely infinite second moments. No mixing rate is assumed.