ICM2002 Call for Abstracts of
Short Communications and Poster Sessions
The 24th International Congress of Mathematicians (ICM2002) will be held in Beijing, August 20-28, 2002.
All Ordinary Members of the Congress will have the opportunity to present their mathematical works in the form of a Short Communication or a Poster -- provided that
  • they have registered by May 1, 2002, and marked in the registration form that they want to present their work,
  • they have submitted an abstract by that date,
  • their contribution has been accepted by the Local Scientific Committee.

　
All presentations will be devided into 19 sections :

1. Logic
2. Algebra
3. Number Theory
4. Differential Geometry
5. Topology
6. Algebraic and Complex Geometry
7. Lie Groups and Representation Theory
8. Real and Comlex Analysis
9. Operator Algebras and Functional Analysis
10. Probability and Statistics
11. Partial Differential Equations
12. Ordinary Differential Equations and Dynamical Systems
13. Mathematical Physics
14. Combinatorics
15. Mathematical Aspects of Computer Science
16. Numerical Analysis and Scientific Computing
17. Applications of Mathematics in the Sciences
18. Mathematics Education and Popularization of Mathematics
19. History of Mathematics

(please refer ICM2002 Section Descriptions, Circular Letter CL05(2001/1/3), for more details)
The abstract for a Short Communication or a Poster must include the appropriate section number and 2000 MS Classification number so that the Communications and Posters can be grouped in coherent way for presentation. Only one Short Communication or Poster (and thus only one abstract) is allowed for each member. Abstracts may be submitted in English, French, German and Russian, with a preference in English. Abstracts should have the
following form (compare also the enclosed example):
__ Section Number (see above)
__ 2000 Mathematics Subject Classification Number
__ Name and affiliation of author(s)
__ Title
__ Abstract text (no more than 120 words)

Abstracts should be prepared in TeX with magnification 1000, textwidth 116 truemm and textheight 190 truemm.

　

Please note that the electronic submission at the WWW web server is strongly encouraged.

If you have trouble with using electronic submission at the WWW web server, the other way to submit your abstract is by email. All properly prepared abstracts submitted for selection by the Local Scientific Committee should be send to editor@beijing.icm2002.org.cn.

Abstracts of accepted Posters and Short Communications which are properly prepared and received by the deadline will be reproduced and distributed to all Ordinary Members when they pick up their registration package. The Local Scientific Committee will notify authors of acceptance/ rejection of their contribution.
Abstracts which do not conform to the stipulated rules will be returned to the author for resubmission.
Late abstracts will not be accepted. However, it is possible to present them in ad-hoc sessions that will be organized and announced during the conference. 　
Each Short Communication lasts 15 minutes including discussion. Short Communications are grouped into time slots of 45 minutes for three presentations. The rooms for Short Comminucations are equipped with an overhead projector and no blackboard. Each Poster session lasts 105 minutes;during that period the authors should stand by their posters and be available for questions and discussion. Authors presenting a Poster are advised to bring the material of the Poster with them when they come to the Congress since no facilities for preparing posters are available on site. The size of the individual poster panels is as follows: width 100 cm, height 120 cm.

Example Abstract
 
\textbf{Section:} 1

\textbf{2000 MS Classification:} 3,4,68

Welch, Philip, Kobe University, Japan
\\
{\bf The Length of Inifinite Time Turing Machine Computations}
\\
We show that the halting times of infinite time Turing machines (considered
as ordinals) are thenselves all halting outputs of such machines. This gives
a clarification of the nature of ``supertasks'' or infinite time
computations. The proof further yieds that the class of sets coded by outputs
of halting computations coincides with a level of G\"odel's constrcutible
hierarchy: namely that of $L_\lambda$ where $\lambda$ is the supremum of 
halting times. A number of other open questions are thereby answered.
　
　
　
　
　
　
　
Please send your suggestions and comment to: icmsec@beijing.icm2002.org.cn
Last modified: Aug. 13, 2002

2002 © Copyright by Chinese Mathematical Society. All Rights Reserved