The Bieberbach Conjecture and Milin's Functionals
by Arcadii Z. Grinshpan
azg@math.usf.edu
The Bieberbach conjecture (1916) for the Taylor coefficients of one-to-one analytic functions is one of the most famous and inspirational problems of mathematics. This conjecture remained open for nearly 70 years until in 1984 L. de Branges proved a stronger conjecture for certain logarithmic functionals proposed by I. M. Milin in 1971.
de Branges' approach was based on Loewner's parametric method (1923), a classic tool in geometric function theory, but it involved other fields of mathematics as well. Simplifications made by several authors during 1984-1997 have led to the present proof, which is now accessible to many readers.
Decision Making: A Golden Rule
by Dimitris A. Sardelis and Theodoros M. Valahas
dereef@hol.gr
This article is an educational exposition of a classical optimal-stopping problem, the dowry problem. Its solution is presented by building on easily understandable special cases. A pattern of optimal strategies emerges, which is ultimately expressed by general conditions that lead to the (1/e) golden decision rule.
A Tale of Two Integrals
Six solutions are presented that are based on other combinatorial or geometrical/topological results. These are:
A Mathematical Excursion: From the Three-Door Problem to a Cantor-Type Set
NOTES
An Inequality Relating the Circumradius and Diameter of
Cutting a Polyomino into Triangles of Equal Areas
A Short Proof of Turaacute;nŐs Theorem
A Characterization of the Set of Points of Continuity of a Real Function
THE EVOLUTION OF...
PROBLEMS AND SOLUTIONS
REVIEWS
An Accompaniment to Higher Mathematics
Journey Into Mathemtics: An Introduction to Proofs
Mathematical Thinking: Problem Solving and Proofs
The Social Life of Numbers: A Quechua Ontology of Numbers
Reviewed by John Meier and Trisha Thorme
TELEGRAPHIC REVIEWS
EDITOR'S ENDNOTES
by Vilmos Totik
totik@math.usf.edu
In the paper several approaches are presented to the following simple-looking but highly non-trivial combinatorial-analysis problem:
[0,1] such that the integrals of f and g over I are both equal to 1/2. This problem is equivalent to the following problem without integrals: On a blackjack machine one can win or lose one dollar at a time. Suppose two players playing once per minute during a period find that eventually both of them win exactly 2N dollars. Show that there was a time interval during which both of them won exactly N dollars.
![]()
by Jaume Paradís, Pelegrí Viader, and Lluís Bibiloni
jaume.paradis@econ.upf.es, pelegri.viader@econ.upf.es, l.bibiloni@uab.es
Can you imagine a connection between the well-known three-door problem--also known as the Monty Hall problem--and a set with a complex structure like Cantor's set? We offer a generalization of the three-door problem, the n-box problem, whose solution provides us with a system for real number representation, Pierce expansions. Through these expansions we get a new enumeration of the positive rationals and also a Cantor-type set containing only transcendental numbers.![]()
Two-Dimensional Lattice-Point-Free Convex Bodies
by Poh Wah Awyong
awyongpw@nievax.nie.ac.sg
by Sherman K. Stein
stein@math.ucdavis.edu
by William Staton
mmstaton@olemiss.edu
by Sung Soo Kim
sskim@newton.hanyang.ac.kr
The Literal Calculus of Vieacute;te and Descartes
by I. G. Bashmakova and G. S. Smirnova
By George R. Exner
By Joseph Rotman
By John P. D'Angelo and Douglas B. West
Reviewed by Joseph H. Silverman
jhs@math.brown.edu
and Philosophy of Arithmetic
By Gary Urton
meierj@lafayette.edu, tat2@cornell.edu