Simon Fraser University

The Alan Mekler Lecture Series

The Dr. Alan Mekler Memorial Endowment was established at Simon Fraser University by colleagues, friends and family in memory of Dr. Mekler. Dr. Mekler was a member of the Mathematics and Statistics Department from 1980 until his death from cancer in 1992. During his life, he was known to us as a juggler, birder, mathematician and lover of life. A valuable colleague, he was recognized internationally for his work in the applications of set theory and/or model theory to algebraic systems. He had an appreciation for and an understanding of much diverse mathematics.

The first priority of the Dr. Alan Mekler Memorial Endowment is to sponsor an annual lecture in pure mathematics. The inaugural lecture in the series was delivered on July 22, 1994, by Professor Paul Eklof of the University of California, Irvine. The lecture addressed Alan Mekler's life and work.

Paul Eklof (1994/95)

University of California, Irvine, July 22, 1994

Paul Eklof was born in Brooklyn in 1942. He received his Ph.D. from Cornell in 1968. He was a Gibbs Instructor at Yale from 1968 to 1970, and an assistant professor at Stanford from 1970-73. Since 1973 he has been on the faculty at the University of California at Irvine, attaining the rank of professor in 1978. Paul Eklof has published extensively. His research has focused on model theory, the theory of modules, and applications of model theory and set theory to algebra.

Title: "Alan Mekler: his life and work"
Abstract: While at Stanford, Paul Eklof was Alan Mekler's Ph.D. supervisor. He had a long collaboration with Alan, one of the fruits of which was the monograph: "Almost Free Modules: Set-theoretic methods" published by North-Holland in 1990, two years before Alan's death.

Back to top

Hugh Woodin (1995/96)

University of California, Berkeley, March 28, 1996 Dr. Hugh Woodin, born in Tucson in 1955, was an NSF Graduate Fellow from 1977-80, a Sloan Fellow in 1983, a Presedential Young Investigator in 1985 and the recipient of the Karp Prize in 1989. He was Assistant Professor at Cal Tech from 1980 to 83, and Professor from 1983-89. During this time, in 1984, he received his Ph.D. from Berkeley. In 1989 he joined the faculty at the University of California, Berkeley, where he has become world-renowned for his research in set theory.

Title: "Do sets suffice?"
Abstract: Has the proliferation of indeependence results reduced the foundational role of set theory to simply that of formalism? Is the apparent intractability of such fundamental problems as the Continuum Hypothesis evidence for the inadequacy of set theory?

Back to top

Keith Devlin (1996/97)

Saint Mary's College of California, Moraga, California, October 17, 1996 Keith Devlin is Dean of the School of Science at Saint Mary's College of California in Moraga, California. His research is focused on the development and use of mathematical techniques to study language, communication, and information. Many of you may know Dr. Devlin from his articles on Computers and Mathematics in the Notices of the AMS. He is also the editor of FOCUS, the news magazine of the Mathematical Association of America. His book "Logic and Information", published by Cambridge University Press in 1991, provides a comprehensive introduction to situation theory and situation semantics.

Title: "Goodbye Descartes?"

Abstract: Attempts to develop a mathematics of thought and language began with Aristotle and Zeno in ancient Greece and progressed through the work of Leibniz and then Boole to the mathematical logic and the mathematical linguistics of the twentieth century. After a rapid tour of this two thousand year development, I'll ask the question, "What will the twenty-first century bring by way of new developments in this area?" 

Back to top

Reinhard Diestel (1997/98)

University of Chemnitz, Germany, February 18, 1998 Reinhard Diestel received a PhD from the University of Cambridge, following research (1983-86) as a scholar of Trinity College under Béla Bollobás. He was a fellow of St. John's College, Cambridge, from 1986 to 1990. Research appointments and scholarships have taken him to Bielefeld (Germany), Oxford and the US. Since 1994 he has been Professor of Mathematics at the University of Chemnitz, Germany. Reinhard Diestel's main area of research is graph theory, especially infinite graph theory. He has published numerous papers and a research monograph, Graph Decompositions (Oxford 1990).

Title: "Dominating arithmetic functions, and the growth of infinite graphs."

Abstract: The growth of an infinite graph can be measured in various ways. Two of these, one due to Halin and the other to Thomassen, have turned out after many years to be almost equivalent. Given the superficial disparity of the two notions, this result points to an underlying deeper notion that may still not have been fully understood. Moreover, in the form of Halin's concept this notion sheds a surprising new light on the old set-theoretic problem of determining the bounding and domination numbers of arithmetic functions."

Back to top

Béla Bollobás (1998/99)

University of Memphis and Cambridge, May 12th, 1999 Béla Bollobás holds the Chair of Excellence in Combinatorics at the University of Memphis, and is a Fellow of Trinity College, Cambridge. He did his undergraduate work in Budapest and Cambridge, and his doctorates are also from those universities. In 1969, he left Hungary for England, and for over 25 years taught at Cambridge, where he supervised close to thirty research students. Dr. Bollobás works mostly in extremal and probabilistic combinatorics, and is especially interested in random graphs, random partial orders, percolation, and isoperimetric inequalities. His mathematical taste was greatly influenced by the late Professor Paul Erdös, with whom he collaborated for over 35 years. He has published about 250 research papers and several books, including Extremal Graph Theory~(1978), Graph Theory (1979), Random Graphs (1984), Combinatorics (1986) and Linear Analysis (1990). His most recent book, Modern Graph Theory, was published a few months ago by Springer Verlag. He is the founder and Editor-in-Chief of the international journal Combinatorics, Probability and Computing, and he serves on on the editorial boards of six other journals.

Title: "Projections of Bodies and Hereditary Properties of Graphs"

Abstract: A property P of graphs is hereditary if every induced subgraph of a graph in P is also in P. For a property P, we write Pn for the set of graphs in P with vertex set {1,... ,n}. Also, the P-chromatic number of a graph is the minimal number of classes in a vertex partition wherein each class spans a subgraph with property P. Much of extremal and probabilistic graph theory is concerned with the study of Pn for various hereditary properties. In this talk we shall address global questions of the following kind. What can we say about the growth of the function |Pn | for a hereditary property? What is the connection between |Pn | and the maximal size of a graph in P? What can we say about the P-chromatic number of a random graph? One of the tools used to attack these questions is an isoperimetric inequality concerning projections of bodies in Rn obtained with Thomason. In the talk we shall present this isoperimetric inequality, together with a number of recent results concerning hereditary properties, obtained jointly with Thomason, and Balogh and Weinreich. Dr. Bollobás spoke in the Discrete Mathematics seminar, 10:30, Thursday, May 13th - K9509.

Back to top

Persi Diaconis (1999/2000)

Stanford University, February 15, 2000 After running away from home to do magic at the age of 14, Persi Diaconis read Feller's Probability on his own before entering City College of New York at age 24. Completing his B.S. two years later (1971) he went on to Harvard for his MS (1972) and PhD (1974). He joined the Department of Statistics at Stanford in 1974. He has been Professor of Mathematics at Harvard and Cornell and is now Professor of Mathematics and of Statistics at Stanford. Winner of a MacArthur Foundation Fellowship, he has worked in many areas of probability and statistics; a random selection of examples includes asymptotic theory of Bayes estimates, finite de Finetti theorems, Markov Chain Monte Carlo, rates of convergence in the ergodic theorem for Markov chains, the statistics of vision, the mathematics of card shuffling, spectral analysis for ranked data, random matrix theory and applications of group theory in statistics. Volume 1 of Statistical Science, pages 319-334, has an entertaining interview with Professor Diaconis.

Title: "An introduction to random matrix theory"

Abstract: Typical unitary matrices show remarkable patterns in their eigenvalue distribution. This same pattern occurs in particle scattering data, the zeroes of the zeta function, and telephone encryption. I will explain the pattern and some of its applications.

Yuri Gurevich (2000/2001)

Microsoft Research, Redmond, WA, March 8, 2001 Yuri Gurevich (research.microsoft.com/~gurevich) heads the Foundations of Software Engineering group at Microsoft Research in Redmond, WA. He is Professor Emeritus of Electrical Engineering and Computer Science at the University of Michigan. He started his career as an algebraist. Then he became a logician. Finally he moved to computer science, where his main projects have been Abstract State Machines, Average Case Computational Complexity, and Finite Model Theory. Dr. Gurevich has been honored as a Dr. Honoris Causa of the University of Limburg, Belgium (1998), as a Fellow of the Association for Computing Machinery (1996), as well as a Fellow of the John Simon Guggenheim Memorial Foundation (1995).

Title: "What is an Algorithm?"

Abstract:One may think that the title problem was solved long ago by Church and Turing. It wasn't; there is more to an algorithm than the function it computes. (Besides, what function does an operating system compute? The term algorithm is understood broadly here.) The interest to the problem is not only theoretical. Applications include modeling, specification, verification, design and testing of software and hardware systems. The first part of the talk will be devoted to the sequential abstract state machine (ASM) thesis: every sequential algorithm is behaviorally equivalent to a sequential ASM. The thesis was proved recently (ACM Transactions on Computational Logic 1, no. 1, July 2000) from first principles. The remainder of the talk will be devoted to extensions of the thesis to general computations and to the current applications of ASMs in Microsoft and elsewhere.

Back to top

Martin Groetschel (2001/2002)

Konrad-Zuse-Zentrum, Berlin, February 14, 2002 (3.30pm in B9201) Martin Groetschel is a professor in the department of mathematics at the Technical University of Berlin and is Vice-President of the Konrad-Zuse Centre for Scientific Computing. His current research is focused on problems of optimization which arise in the management of public transportation, and in telecommunications. He is the author of more than 100 mathematical papers, and has also published extensively in the area of electronic information and communication as they relate to libraries. Amonst the books he has edited or authored, probably the best known is "The Handbook of Combinatorics" which he edited with R. Graham and L. Lovasz. He is the recipient of many honours, amongst them the 1982 Fulkerson Prize, the 1984 IBM Prize, the 1990 Karl Heinz Beckurts Prize, and the 1991 George B. Dantzig Prize. In 1999 he was elected as a foreign associate of the National Academy of Engineering, USA.

Title: "Mathematical Opportunities in Telecommunication"

Abstract: This talk will begin with a survey of mathematical challenges that arise in telecommunication. Mathematics is involved, e.g., in the design and manufacturing of chips, devices and network components, the choice of locations, the planning of the network topology, and the dimensioning of the equipment involved. Adequate cryptography, the need of fast data processing, demand routing and failure handling require efficient and reliable mathematical algorithms on the operational side. The presentation will focus on the problem of designing low-cost telecommunication networks that provide sufficient capacity to serve a given demand, are based on a chosen technology mix, satisfy various technical side constraints, and survive certain failure situations. This problem is difficult in theory and practice. It will be indicated how algorithms integrating polyhedral combinatorics, linear and integer programming, and various heuristic ideas can help solve real-world instances within reasonable quality guarantees in acceptable running times. This talk is based on work of the telecommunications research group at ZIB, the examples discussed and the computational results reported are from joint projects with several telecommunication companies. (Dr. Groetschel also gave a more specialized Discrete Math Seminar in the morning.)

Back to top

Jeff Weeks (2002/2003)

Canton, New York, December 4, 2002. Jeff Weeks is a freelance mathematician living in Canton, NY. He has an A.B. from Dartmouth College and a Ph.D. from Princeton University, both in mathematics. His main interests are geometry, topology, cosmology and education. After several years of teaching undergraduate mathematics, he resigned to care for his newborn son. When his son began school, Jeff began doing mathematical research and software development for the University of Minnesota's Geometry Center, designing and implementing software for creating and studying possible shapes for 3 dimensional space. Currently a MacArthur Fellow, he splits his time between research and education. His present research centers on a collaboration with cosmologists, with whom he plans to test the shape of theuniverse using satellite data to become available in 2002-2010. His educational activities have lead to a multimedia unit for middle schools on geometry and space. The unit uses classroom activities, computer games, and video to let students explore universes that are finite but have no boundaries. Jeff is the author of the book The Shape of Space (Marcel Dekker, 1985; second edition 2002), the unit Exploring the Shape of Space (Key Curriculum Press, 2001), and numerous research and expository articles.

Title: "The Curvature of Space"

Abstract: The talk will begin with an elementary introduction to curved space, using physical models and interactive 3D graphics to build intuition and demonstrate some surprising visual effects. We'll then see how physicists' understanding of a curved, expanding universe evolved over the 20th century, leading to measurements of the microwave background radiation which are now revealing the curvature of the observable universe. But even as these measurements answer old questions about the curvature of space, they raise new questions about the matter and energy it contains. (Intended Audience: For mathematics faculty, graduate students, and undergraduate math and physics majors. Note: The other half of the story, namely the topology of space, will be the subject of the evening lecture.) Public lecture on Burnaby Mountain (6.00pm in AQ3005)

Title: "The Shape of Space"

Abstract: When we look out on a clear night, the universe seems infinite. Yet this infinity might be an illusion. During the first half of this presentation, computer games will introduce the concept of a "multiconnected universe". Interactive 3D graphics will then take the viewer on a tour of several possible shapes for space. Finally, we'll see how data from a small NASA satellite could soon reveal the true shape of our universe. The only prerequisites for this talk are curiosity and imagination. (Intended Audience: For middle school and high school students, people interested in astronomy, and all members of the SFU community.)

Back to top

Helaman and Claire Ferguson (2003/2004)

November 18, 2003. Sculpture Exhibitions at SFU Burnaby and Harbour Centre Campuses Helaman Ferguson is both a sculptor whose work is located in institutions and collections worldwide and an internationally known mathematician whose algorithm has been listed as one of the top ten in the twentieth century. He enjoys a CRADA between his sculpture studio and NIST which is in the third generation of cable-based metrology systems. Claire Ferguson has written extensively on Helaman's work, including the Gold Ink and Ozzie Award winning book Helaman Ferguson: Mathematics in Stone and Bronze. She is a graduate of Smith College where she was an Ada Comstock Scholar. Together they have parented seven children.

Title: Mathematics in Stone and Bronze

Abstract: Helaman Ferguson's mathematical sculptures in stone and bronze celebrate ancient and modern mathematical discoveries, melding the universal languages of sculpture and mathematics. Using slides and video, Helaman and Claire trace Helaman's creations from initial concept, mathematical design, computer graphics, diamond cutting and final form. Their lectures have fascinated audiences worldwide, bringing together multiple disciplines and stimulating dialogue among them.

Back to top

Ivar Ekeland (2004/2005)

Director of the Pacific Institute of Mathematical Sciences, Professor at the University of British Columbia November 18, 2004. Ivar Ekeland is at present Canada Research Chair in Mathematical Economics at UBC, after a distinguished career at the University of Paris-Dauphine, of which he was President from 1989 to 1994. Dr. Ekeland is a gifted expositor of mathematics who has been awarded the Jean Rostand Prize for popularization of science. His books aimed at a popular audience are: "Mathematics and the Unexpected", "The broken dice, and other mathematical tales of chance", and "The best of all possible worlds", to appear (all published by Chicago U Press). His main contributions to mathematics have been in optimization theory, variational problems, classical mechanics, and symplectic topology. His research interests now lie in the interface between mathematics and economics. He has been investigating the microeconomic theory of demand, with the aim of developing mathematical tools whereby the theory can be tested and used towards policy-making. This will be the topic of his talk at 3:30, Thursday, November 18.

Title: "Are people rational?"

Abstract:In the standard model of economic theory, individuals are seen as strategic utility-maximizers. That is, they proceed by ranking alternatives by order of preferences, and by choosing the best one, and they incorporate into their own decision the anticipated decisions of others. In this talk, we will investigate whether this assumption is true. To do so, we will derive some mathematical consequences, and check whether they are observed in practical situations, such as soccer competitions and family expenditure.

Back to top


Dr. Jeffrey Lagarias (2005/2006)

Professor, Department of Mathematics University of Michigan Monday, May 8th, 2006 at 4:00 pm in AQ 3150. Reception to follow in K9509 Dr. Jeffrey Lagarias was an undergraduate at MIT, where he was a Putnam Fellow (top 5) in 1970. He received an MS in 1972 and a PhD in 1974 at MIT with theses in number theory. He worked at A.T.&T Bell Laboratories from 1974 to 1995, and at A.T.&T. Labs-Research from 1995 to 2004. Subsequent to this he joined the mathematics faculty at the University of Michigan. He has held visiting positions at the University of Maryland (mathematics), Rutgers University (computer science), and University of Paris 7 (physics). He is a fellow of the American Association for the Advancement of Science. His research areas include algebraic and analytic number theory, computational topology, discrete geometry, mathematical optimization and mathematical physics. His interests include such challenging problems as the 3x+1 problem, the theory of knots and the Riemann hypothesis.

Title: "The Riemann Hypothesis: the good, the bad, and the ugly"

Abstract: The Riemann hypothesis (RH) is the most famous and important unsolved problem in pure mathematics. Since the 1980's researchers (Montgomery, Odlyzko, Sarnak etc.) have found new theoretical and empirical evidence in its favor. The main part of the talk describes the "explicit formula" of prime number theory, gives some reformulations of the RH, and surveys current evidence for its truth. The concluding part discusses proposed approaches of various mathematicians to reverse engineer a (still unknown) geometric "big picture" that would explain the RH.

Back to top

Curriculum Vitae

Updated: June 1992

  1. Name: Mekler, Alan Harvey
  2. Department: Mathematics & Statistics
  3. Date of Birth: 28 October 1947
  4. Current Rank: Professor
  5. Current Contract: (X) Tenured
  6. Educational Background:
  7. Degrees College/University/Institution Field of Study  Year
    B.A. York University, Toronto Mathematics

     1969

    M.A. York University, Toronto
    Mathematics  1970
    M.Sc. Stanford University, California Mathematics  1971
    Ph.D. Standford University, California Mathematics  1976

     

  8. Academic Research and Industrial Experience (List most recent last):
    Position held Dates Department and Institution
    Research Associate
    1976-78 Math, Carleton University
    Lecturer 1978-79 Math, University of Toronto
    Visiting Assistant Professor 1979-80 Math, Univ of Western Ontario
    Wissenschaft-Mitarbeiter 6/80-9/80 Math, Universitat Essen
    Assistant Professor 9/80-12/80  Math, Auburn University
    Assistant Professor 12/80-8/83  Math, Simon Fraser University NSERC Research Fellow
    Assistant Professor  9/83-1986  Math, Simon Fraser University NSERC Research Fellow
    Professor 1986-present  Math, Simon Fraser University
    Visiting Professor Jan-Apr 1989  The Hebrew University, Jerusalem
     Member  1989-90  Mathematical Sciences Research Institute


  9. Brief Description of Current Research Interests (Not more than 25 words.)

    Applications of set theory to algebra, stationary logic, abstract model theory.

  10. Membership of Learned Societies:

    Canadian Mathematical Society

    Association for Symbolic Logic

    American Mathematical Society

  11. Awards, Citations and Honors: (Listed serially with dates and full details. Most recent listed last).

    Doctoral Fellowship, The Canada Council

  12. Record of Research Funding: (Please list only those monies in a given year which have been, or will be, received during the fiscal year April 1 to March 31. Please list the title of the award, the source and the type of award, and the date and duration of the award. If it is a joint award, please list the co-investigators.)

    NSERC Operating Grant 1980-81 $ 3,500 Applications of model theory and theory and set theory to algebra

    NSERC Operating Grant 1981-82 $ 5,300 Applications of model theory and set theory to algebra

    NSERC Operating Grant 1982-83 $ 6,112 As above.

    NSERC Operating Grant 1983-84 $10,600 As above.

    NSERC Operating Grant 1984-85 $11,130 As above.

    NSERC Operating Grant 1985-86 $17,856 As above.

    NSERC Operating Grant 1986-87 $17,856 As above.

    NSERC Operating Grant 1987-88 $17,856 As above.

    NSERC Operating Grant 1988-89 $24,840 As above.

    NSERC Operating Grant 1989-90 $24,840 As above.

    NSERC Operating Grant 1990-91 $24,840 As above.

    NSERC Operating Grant 1991-92 $35,000 As above.

  13. Record of Full-time Personnel: (Please list those individuals who are full-time under your supervision, i.e. PDF's, Technicians, Research Associates, Research Assistants. Please list the title of the position, the date of appointment, highest degree or technical qualification, and the source of funds which supports them. Please list in order: PDF's, Research Associates, Research Assistants and Technicians.)

    Mr. G. Schlitt (B.Sc.) - Research Assistant - Summer 1985/Fall 1985 (Supported by NSERC grant)

    Dr. G. Srour - Postdoctoral Fellow - 1985/86. (Supported by NSERC grant)

    M. Gilchrist - Summer 1986, Summer 1987.

    R. Lapsley - Summer 1988

    M. Gilchrist - Summer 1988, Fall, 1989.

    G. Schlitt - 1990 - Postdoctoral Fellow

  14. Record of Invited Talks: (At meetings, at other universities, or at research establishments. Please give the date, the title of the talk, and the name and address of the organization to which the talk was delivered.)

    1976 The number of k-free Abelian groups and the size of Ext, Bicentennnial Abelian Group Theory Conference, Las Cruces, New Mexico.

    1978 Almost free groups, York University, Toronto.

    1980 Applications of logic to algebra, Universitat Essen, Essen, Germany.

    1981 L(Q) may have the Weak Beth property, Bedford College, London, England.

    1981 Stationary Logic of Ordinals, Institute for Advanced Studies, The Hebrew University, Jerusalem, Israel.

    1982 Beyond First Order Logic, University of California, Irvine, California.

    1982 Categoricity results for Low -free algebras, Special Session on Model Theory, American Mathematical Society, College Park, Maryland.

    1982 Structure of ?1-separable groups, Abelian Group Theory Conference, Honolulu, Hawaii.

    1982 Finitely additive measures on N , York University, Toronto.

    1982 Structure of ?1-separable groups, Kobe University, Kobe, Japan.

    1983 Categoricity results for Low -free algebras, University of Waterloo.

    1983 Set theory and structure theory for Abelian groups, Universitat Freiburg.

    1983 Almost free algebras, Mathematics Colloquium Zurich (ETH & Universitat Zurich).

    1983 Finitely additive measures on N , Special Session on Logic, Canadian Math. Soc. Summer Meeting, Vancouver.

    1984 A lawless order, Mathematics Colloquium, University of California, Irvine.

    1984 Groups embeddable in the homeomorphisms of Q. Dalhousie University (Colloquium).

    1984 Stability of nilpotent groups, Forking Festival, University ofIllinois, Chicago.

    1984 Lawless Order, Special year in Logic, University of Maryland,College Park, Maryland.

    1984 Classification theory and stationary logic, Mid-AtlanticMathematical Logic Seminar. Princeton University, Princeton, New Jersey.

    1985 The Solution to Crawley's Problem, Abelian Group Theory Meeting at Oberwolfach, Oberwolfach, West Germany.

    1985 Almost Free Algebras, Marquette University, Milwaukee, Wisconsin. (Colloquium).

    1985 Reflexive Abelian Groups, Marquette University, Milwaukee, Wisconsin (Algebra Seminar).

    1985 Groups embeddable in the homeomorphisms of Q. Rutgers University (Logic Seminar).

    1985 Classification theory and stationary logic. Conference on Classification Theory, University of Illinois, Chicago, Illinois.

    1986 Almost Free Algebras, Conference on Model Theory. Model Theoretic Algebra and Models of Arithmetic, University of Notre Dame, Notre Dame, Indiana.

    1986 The structure of dual groups, University of Colorado, Colorado Spring, Colorado (Colloquium).

    1986 Abelian groups of the form Hom (A, Z ), Mid-Atlantic MathematicalLogic Seminar. Rutgers University, New Brunswick, New Jersey.

    1986 Uncountable Abelian groups. Wesleyan University, Middletown, Connecticut (Colloquium).

    1986 Almost free algebras, McMaster University, Hamilton, Ontario (Algebra Seminar).

    1986 Almost free algebras, Bowling Green State University, Bowling Green, Ohio (Colloquium).

    1986 Almost free algebras, University of Calgary, Calgary, Alberta, (Combinatorics Seminar).

    1986 Uncountable Abelian groups, University of Calgary, Calgary, Alberta (Colloquium).

    1987 Dual groups, Set Theory and its Applications Conference at York,York University, Toronto

    1988 Almost Free Groups, London Mathematical Society Seminar, Durham(July), U.K.

    1988 Almost Free Algebras, Helsinki University (July).

    1988 Low-free algebras, Connecticut Logic Seminar, Yale University, NewHaven, Connecticut.

    1989 Almost free algebras, University California, Irvine.

    1989 Almost free modules, Abelian Group theory meeting, Oberwolfach, Germany.

    1989 Set theoretic methods in algebra, Logic Club, University of California, Berkeley.

    1989 Sequences of dual groups, Mid-Atlantic Model theory, Seminar, Berkeley.

    1989 Set theoretic methods in abelian group theory, University of California, Davis.

    1989 Sequences of dual groups, Special Session in Model Theory, CMS Winter Meeting.

    1990 Mathematics for the Sauna, Midwest Model Theory Meeting, University of Wisconsin, Parkside.

    1990 Almost Free Algebras: 20 years of progress, ASL Summer meeting

    1990 Logic Colloquium '90, Helsinki (Invited speaker).

    1990 Dual Groups: Department of Maths, University of Melbourne,Melbourne, Australia.

    1990 Groups and long Ehrenfeucht-Fraisse games, Special Session on Interactions of Logic and Group Theory, A.M.S. Meeting, Irvine, California.

    1991 Homogeneous Posets, NATO Meeting on Finite and Infinite Combinatorics, Banff, Alberta (Invited speaker).

  15. Record of Professional Distinction: (e.g. serving on a review panel for a government or granting agency; serving on advisory committee for government meeting; serving as an officer of a professional society.)

    Executive Committee, Institute of Applied Logic

    Board of Directors, Canadian Math. Society, 1986-91, Nominating Committee 1989-91.

    Grant Selection Committee, NSERC 1989-91

    Editor, CJM and CBM 1992 -

  16. Administrative and Committee Responsibilities at Simon Fraser University: Give the full name of the committee (Departmental, Faculty, Senate, University). If possible, specify the semesters involved and any special position held (e.g. Chairman).
    1. Departmental Committees:

      Undergraduate Studies Committee (1981-82)

      Colloquium Chairman (1982-1986)

      Co-ordinator for Mathematical Logic Seminar (1981-)

      Graduate Studies (1990-)

      DTC (1991-92)

    2. Faculty Committees:
    3. University Committees:
  17. Record of Community Services:
  18. Graduate Student Supervision:
    1. Please list the students who have completed a thesis under you, as Senior Supervisor:
      Student's Name Degree Date of Completion Thesis Title
      Laflamme, C. M.Sc. Summer 1983 Structure of Nonstandard
      Schlitt, G. M.Sc. Summer 1986 Some results on reflexivity
      Lapsley, R. M.Sc. Summer 1990 Trees, Orders and Forcing
    2. Please list those students who are currently working on a degree under you, as Senior Supervisor:
      Student's Name Degree Semester Student Began Degree Status: Active, On Leave, Other
      Gilchrist, M. Ph.D. 1985-3 Active
  19. Names of Students on Whose Committees You Sit: (but not as Senior Supervisor), and the degree for which the student is enrolled.
    Student's Name Degree for which Enrolled
    Yi, X. Ph.D.
    Gilchrist, M. Ph.D.
    Szpitun, L. Ph.D.
    Schipperus, R. M.Sc.
  20. Teaching and Research Record: (For each teaching semester, please list each course taught together with its calendar descriptor and title. Please make a note of any special teaching assignments and/or requirements. Please indicate any semesters which were used for sabbatical leave, administrative leave, leaves of absence, or for any other special purpose.)
    Semester Course Descriptor and Title Comments
    81-1 252-3 Calculus IV
    81-2 - Teaching Semester
    81-3 808-4 Mathematical Logic III
    82-1 144-3 Intro. to Pure Math.
    82-2   Research
    82-3   Teaching Semester
    83-1 807-4 Math Logic: Selected Topics
    83-2   Research
    83-3 808-4 Mathematical Logic III
    84-1   Research
    84-2 452-3 Set Theory
    84-2 251-3 Calculus III
    84-3   Research
    85-1 426-3 Intro. to Lebesgue Theory
    85-1 306-3(1) Formal Languages and Automata with Applications
    85-2   Research
    85-3 438-3(1) Linear Algebra
    86-1 807-4 Math. Logic: Selected Topics
    86-1 308-3 Linear Programming
    86-2   Research
    86-3   Research
    87-1 800-4 Pure Math: Selected Topics
    87-2 451-3(1) Mathematical Logic
    87-2 438-3 Linear Algebra
    87-3 831-4 Real Analysis 1
    87-3 438-3 Linear Algebra
    87-3 GSS-1  
    88-1 812-4 Algebra 1
    88-2   Research
    88-3 144-3 Intro. to Pure Math.
    88-3 300-3 Intro. to Formal Languages and Automata with Applications
    89-1   Sabbatical
    89-2   Sabbatical
    89-3   Sabbatical
    90-1 440-3 Galois Theory
    90-1 242-3 Introduction to Analysis
    90-2   Research
    90-3 438-3 Linear Algebra
    91-1 444-3 Topology
    91-2   Research
  21. Publication List: (Please list in time order (last paper last) only refereed papers. Use the format - full authorship, the title, the name and volume of the journal or the equivalent information if the article appeared in a book, first and last page numbers and the year. The authorship format should be identical to that in the original publication. Please also list work which have been accepted for publication.)

    Total No. of Publications in Refereed Journals or Refereed Conference Proceedings = 51.

    1. Mekler, A.H., Theories with models of prescribed cardinalities, J. of Symbolic Logic 42, (1977), 251-253.
    2. Mekler, A.H., The size of epimorphic extensions, Algebra Universalis 8, (1978), 228-232.
    3. Mekler, A.H., The number of k-free groups and the size of ext, in Abelian Group Theory, Springer-Verlag Lecture Notes in Mathematics, No. 616, (1977), 323-331.
    4. Mekler, A.H., Model Complete theories with a distinguished sub-structure, Proc. Amer. Math. Soc. 75, (1979), 294-299.
    5. Mekler, A.H., On residual properties, Proc. Amer. Math. Soc. 78, (1980), 187-188.
    6. Mekler, A.H., How to construct almost free groups, Canad. J. Math. 32, (1980), 1206-1228.
    7. Eklof, P.C., and Mekler, A.H., On constructing indecomposable groups in L, J. Algebra 49, (1977), 96-103.
    8. Eklof, P.C., and Mekler, A.H., Infinitary stationary logic and Abelian groups, Fund. Math. CXII, (1981), 1-15.
    9. Eklof, P.C., and Mekler, A.H., Stationary logic of finitely determinate structures, Ann. Math. Logic 17, (1980), 227-269.
    10. Mekler, A.H., Stability of nilpotent groups of class 2 and prime exponent, J. of Symbolic Logic 46, (1981), 781-788.
    11. Herre, H., Smith, Kenneth, W., and Mekler, A.H., Superstable graphs, Fund. Math. CXVIII, (1983), 75079.
    12. Mekler, A.H., On Shelah's Whitehead groups and CH, Rocky Mountain J. Math. 12, (1982), 271-278.
    13. Mekler, A.H., 1-separable groups of mixed type, in Abelian Group Theory, Springer-Verlag Lecture Notes in Math. No. 874, (1981), 114-126.
    14. Mekler, A.H., Primitive rings are not definable in Loo, Comm. Alg., 10, (1982), 1689-1690.
    15. van den Dries, L.P.D., Glass, A.M.W., MacIntyre, A., Mekler, A.H. and Poland, J., Elementary equivalence and the commutator subgroup Glasgow Math. J. 23, (1982), 115-117.
    16. Mekler, A.H., Pelletier, D., and Taylor, A., A note on a lemma of Shelah concerning stationary sets, Proc. Amer. Math. Soc., 82, (1981), 764-768.
    17. Eklof, P.C., Mekler, A.H. and Shelah, S., Almost disjoint Abelian groups, Israel J. Math. 49 (1984), 34-54.
    18. Mekler, A.H. and Shelah, S., Stationary logic and its friends I, Notre Dame J. Formal Logic, 26, No. 2 (1985), 129-138.
    19. Mekler, A.H., Stationary logic of ordinals, Annals of Pure and Applied Logic 26, (1984) 47-68.
    20. Mekler, A.H., c.c.c. forcing without combinatorics, J. Symbolic Logic 49 (1984), 830-832.
    21. Eklof, P.C., and Mekler, A.H., On endomorphism rings of w1-separable primary groups. Abelian Group Theory, Springer-Verlag Lecture Notes in Mathematics No. 1006 (1983), 320-339.
    22. Mekler, A.H., Proper forcing and Abelian groups, Abelian Group Theory, Springer-Verlag Lecture Notes in Mathematics No. 1006 (1983), 285-303.
    23. Mekler, A.H., Finitely additive measures on N and the additive property, Proc. Amer. Math. Soc. 92 (1984), 439-444.
    24. Holland, W.C., Mekler, A.H., and Shelah, S., Lawless order, Order 1, (1985), 383-397.
    25. Mekler, A.H. and Shelah, S., Stationary logic and its friends II, Notre Dame J. Formal Logic. 27, No. 1 (1986) 39-50.
    26. Holland, W.C., Mekler, A.H. and Shelah, S., Total orders whose carried groups satisfy no laws, proceedings of the First International Symposium on Ordered Algebraic Structures. Luminy-Marseilles 1984. Heldeman Verlag Berlin (1986) 29-33.
    27. Mekler, A.H., and Shelah, S., w-elongations and Crawley's Problem. Pacific J. Math. 121, No. 1 (1986), 121-132.
    28. Mekler, A.H. and Shelah, S., The Solution to Crawley's Problem, Pacific J. Math. 121, No. 1 (1986), 133-134.
    29. Mekler, A.H. and Shelah, S., When k-free to implies strongly k-free, Abelian Group Theory, Gordon and Breach (1987) 137-148.
    30. Mekler, A.H., Groups embeddable in the autohomeomorphisms of Q, J. London Math. Society (2) 33 (1986) 49-58.
    31. Mekler, A.H., Classification Theory and Stationary Logic, Canadian J. Math. 39, No. 4, (1987) 893-907.
    32. Holland, W.C., Mekler, A.H., and Reilly, N.R., Varieties of Lattice Ordered Groups in which Prime Powers Commute, Algebra Universalis. 23 (1986), 196-214.
    33. Mekler, A.H. and Nelson, E.M., Equational Bases of "If-Then-Else", SIAM J. Compute., 16 (1987), 465-485.
    34. Eklof, P.C., Mekler, A.H., Shelah, S., On Strongly-Non-Reflexive Groups, Israel J. Math., 59 (1987), 283-298.
    35. Mekler, A.H., The structure of groups which are almost the direct sum of countable Abelian Groups, Trans. Amer. Math. Soc. 303, No. 1, (1987), 145-160.
    36. Eklof, P.C. and Mekler, A.H., Categoricity Results for Lok-free Algebras, Annals of Pure and Applied Logic, 37 (1988), 81-99.
    37. Eklof, P.C., Huber, M., Mekler, A.H., Totally Crawley Groups, J. of Algebra, 112 (1988), 370-384.
    38. Adamek, J., Mekler, A.H., Nelson, E., Reiterman, J., On the logic of continuous algebras, Notre Dame J. Formal Logic. 29 (1988), 365-380.
    39. Mekler, A.H. and Shelah, S., Diamond and l-systems. Fundamenta Mathematica, 131 (1988), 46-51.
    40. Mekler, A.H. and Shelah, S., Uniformization Principles, J. Symbolic Logic, Vol. 54, No. 2, (1989), 441-459.
    41. Komjath, P., Mekler, A.H., Pach, J., Some universal graphs, Israel Math. J., Vol.64, No.2, (1988), 158-168.
    42. Mekler, A.H. and Shelah, S., Low-free algebras, Algebra Universalis, Algebra Universalis, 26 (1989) 351-366.
    43. Mekler, A.H. and Shelah, S., The consistency strength of "every stationary set reflects", Israel J. Math, Vol. 67, No.3, (1989) 353-366.
    44. Mekler, A.H., Universal structures in Power ?1, J. Symbolic Logic. 55 (1990) 466-477.
    45. Macpherson, D., Mekler, A.H., and Shelah, S., The number of infinite substructures. Proc. Cambridge Phil. Soc., 109 (1991) 109-209.
    46. Mekler, A.H. and Shelah, S., Determining Abelian p-groups from their n-Socles (Communications in Algebra). 181 (1990) 287-307.
    47. Mekler, A.H., Almost Free Groups in Varieties. J. of Algebra. Vol. 145, No.1 (1992) 128-142.
    48. Mekler, A.H., E. Nelson and S. Shelah, A variety with solvable but not uniformly solvable word problem, London Math. Soc. (To appear)
    49. Mekler, A.H., Rubin, M. and Steinhorn, C., Dedekind completeness and the algebraic complexity of O-minimal structures. Can. J. Math. (To appear)
    50. Mekler, A.H., Shelah, S., Every coseparable group may be free. Israel J. Math.
    51. Mekler, A.H., Homogeneous partially ordered sets, Conference on Finite and Infinite Combinatorics in Sets and Logic.
    52. Covington, J., Macpherson, D. and Mekler, A., Stabilisers of ideals and infinite symmetric groups, J. Aust. Math. Soc.(Accepted 1992).
    53. Mekler, Alan H. and Shelah, S., The canary tree, Canadian Bull. Math.(Accepted 1992).
    54. Mekler, Alan H. and Covington, J. Stabilizers of trivial ideals, Bulletin London Mathematical Society. (Accepted 1992).
    55. Eklof, Paul C. and Mekler, Alan H., Almost Free Modules. Set-theoretic methods, Book Reviews, Bull A.M.S. (reviewer Lazlo Fuchs) (Accepted 1992).

    Books:

    1. Eklof, P.C. and Mekler, A.H., Almost Free Modules: Set TheoreticMethods, North Holland, 1990 (481 pages) (about 90 pages consist of results which are being published for the first time.)

    Submitted:

    1. Mekler, A.H., Shelah, S., Compactness results for isomorphism quantifiers. Annals of Math.
    2. Mekler, A.H., Shelah, S. and Vaananen, J., The Ehrenfeucht-Fraisse-game of length w1, Trans. Amer. Math. Soc.
    3. Covington, J. and Mekler, A., Subgroups of infinite symmetric groups which are full for large sets, J. of Algebra.
    4. Eklof, Paul C., Mekler, A. and Shelah, S., On coherent systems of projections for ?1 - separable groups, Comm. Alg.
    5. Mekler, A., Schipperus, R., Shelah, S. and Truss, J.K., The Non-embeddability of AAut G into the homeomorphism group of the rationals.
    6. Mekler, A.H., Scattered Subsets of Q.
    7. Mekler, A., Nelson, E. and Shelah, S., A Variety with Solvable, but not Uniformly Solvable, Word Problem, London Mathematical Society.
    8. Mekler, A., Schipperus, R., Shelah, S., The Random Graph and Automorphisms of the Rational World, AMS.

    Other Publications:

    1. Appendix to "Incompactness in Regular Cardinals" by S. Shelah Notre Dame J. Formal Logic, 26 (1985), 195-228.
    2. How hard is the word problem in free lattice ordered groups? Abstracts of the AMS (1984) 84T-06-175 p. 203.

Dr. Alan Mekler Memorial Endowment

Revised Terms of Reference

The Dr. Alan Mekler Memorial Endowment was established at Simon Fraser University by colleagues, friends and family in memory of Dr. Mekler. Dr. Mekler was a member of the Mathematics and Statistics Department from 1980 until his death from cancer in 1992. During his life, he was known to us as a juggler, birder, mathematician and lover of life. A valuable colleague, he was recognized internationally for his work in the applications of set theory and/or model theory to algebraic systems. He had an appreciation for and an understanding of much diverse mathematics.

Purpose of the Endowment

The purpose of the Endowment will be to enhance mathematical research activities in the Mathematics and Statistics Department. The first priority of the Mekler Endowment will be to sponsor the Alan Mekler Lecture Series in Pure Mathematics. Once a year, a renowned mathematician (when appropriate a logician, but more broadly one true to the mathematical spirit that Alan Mekler exemplified) will be invited to visit the Mathematics and Statistics Department for a period of two days to two weeks. During the visit, the Lecturer will present a Colloquium to the Department and may choose to give additional specialist talks. An annual Alan Mekler Reception will be held in conjunction with this visit.

Should additional funds be available from the interest earned on the Endowment, Alan Mekler Graduate Scholarships will be awarded. Awards of approximately $500 will be made annually to graduate students in pure mathematics (with preference given to students in logic). The number of awards will be determined by the funds available. Recommendations of candidates for the Alan Mekler Scholarships will be made on the Application for a Private Graduate Scholarship form by May 15th and must be accompanied by:

  1. copies of all post-secondary transcripts
  2. one letter of reference from a faculty member familiar with the applicant's work The award will be made by the Dean of Graduate Studies on the recommendation of the Chair, Mathematics and Statistics Department on behalf of the Senate Graduate Awards Adjudication Committee.
Program Coordination

The Lecture Series will be managed by the Appointments and Long Range Planning Committee of the Mathematics and Statistics Department. The annual lecturer will receive an honorarium and all travel and accommodation costs during his/her stay at Simon Fraser University.

Fund Administration

The Dr. Alan Mekler Memorial Endowment Fund will be held by Simon Fraser University. The administrator of the Endowment Fund will be the Chair of the Mathematics and Statistics Department, or her/his delegate.

The capital of the Endowment Fund will be held in perpetuity. Until such time as the Endowment reaches $25,000, no disbursements will be made. After the Endowment reaches $25,000, a portion of the interest earned on the Endowment will be used each year to support the Dr. Alan Mekler Lecture Series. The remaining interest will be used to award Alan Mekler Graduate Scholarships. Any remaining funds in a given year will be reinvested in the Endowment Fund.

In the event that circumstances make the specified use of the Endowment Fund no longer practicable or desirable, the Board of Governors of Simon Fraser University is hereby authorized to make any changes it may deem necessary in the terms or use of the Endowment Fund, such changes, however, to be in keeping as far as possible with the original spirit and general intent of the Endowment Fund.

Accepted on behalf of:

Mr. Bill Bean, Director, Development, Simon Fraser University and Ms. Barbara Kukan, by Dr. Katherine Heinrich, Chair, Mathematics and Statistics, and Dr. Bruce Clayman, Dean, Graduate Studies, Simon Fraser University.

1993

Dr. Alan Mekler's Pictures of Puffins

A photo such as these is given to each Mekler Lecturer.