Search

Search Results

1. Random sets. A survey of results and applications

   A survey of current directions in the theory of random closed sets is presented; these include: the central limit theorem, the law of large numbers...

   I. S. Molchanov in Ukrainian Mathematical Journal

   Article 01 December 1991

2. The late-twentieth century resolution of a mid-nineteenth century dilemma generated by the eighteenth-century experiments of Ernst Chladni on the dynamics of rods

   James F. Bell in Archive for History of Exact Sciences

   Article 01 September 1991

3. Group Actions on Non-Archimedean Trees

   Let Λ be a (totally) ordered abelian group. Let X be a Λ-tree, as defined in [MS1] (see also [AB] for various equivalent definitions). Let Γ be a...

   Hyman Bass in Arboreal Group Theory

   Conference paper 1991
   

4. On Pisier Type Problems and Results (Combinatorial Applications to Number Theory)

   Several number theoretical results are (sometimes a bit surprisingly) consequences of purely combinatorial statements. In this paper we deal with...

   Paul Erdös, Jaroslav Nešetřil, Vojtěch Rödl in Mathematics of Ramsey Theory

   Chapter 1990
   

5. A nonautonomous model of population growth

   With x = population size, the nonautonomous equation x = xf(t,x) provides a very general description of population growth in which any of the many...

   R. R. Vance, E. A. Coddington in Journal of Mathematical Biology

   Article 01 September 1989

6. Basic concepts from graph theory

   Both in mathematics and in its applications, one frequently considers certain pairs of elements of a set. Then it is quite natural to draw the...

   András Recski in Matroid Theory and its Applications in Electric Network Theory and in Statics

   Chapter 1989
   

7. NC-algorithms for graphs with small treewidth

   In this paper we give a parallel algorithm for recognizing graphs with treewidth ≤ k, for constant k, and building the corresponding...

   Hans L. Bodlaender in Graph-Theoretic Concepts in Computer Science

   Conference paper 1989
   

8. The transcendence of π has been known for about a century — but who was the man who discovered it?

   Rudolf Fritsch in Results in Mathematics

   Article 01 May 1984

9. H. S. M. Coxeter

   Für die meisten professionellen Mathematiker bedeutet die gelegentliche Beschäftigung mit mathematischen Spielereien ungefähr das Gleiche wie die...

   Martin Gardner in Mathematische Knobeleien

   Chapter 1984
   

10. Mathematics Curriculum

    How may we distinguish good work from bad? How can we devise critical standards for evaluating Mathematics Education in its environment. I shall...

    H. B. Griffiths, Ubiratan D’Ambrosio, ... Maassouma M. Kazim in Proceedings of the Fourth International Congress on Mathematical Education

    Chapter 1983
    

11. Cost-minimal trees in directed acyclic graphs

    A number of examples are given where one seeks a minimal-cost tree to span a given subset of the nodes of a connected, directed, acyclic graph (we...

    L. Nastansky, S. M. Selkow, N. F. Stewart in Zeitschrift für Operations Research

    Article 01 February 1974

12. The enumeration of minimal phylograms

    We consider the problem of finding a minimal tree to a set of nodes (of species represented by d characters) in a space of d -dimensions subject to the...

    Ludwig Nastansky, Stanley M. Selkow, Neil F. Stewart in Bulletin of Mathematical Biology

    Article 01 August 1973

13. H.S.M. Coxeter

    Für die meisten professionellen Mathematiker bedeutet die gelegentliche Beschäftigung mit mathematischen Spieiereien ungefähr das Gleiche wie die...

    Martin Gardner in Mathematische Knobeleien

    Chapter 1973