========================================================================= Date: Thu, 31 Oct 91 09:56:29 GMT Reply-To: Turkish Mathematician's Discussion List TURKMATH Sender: Turkish Mathematician's Discussion List TURKMATH From: Haluk DEMIRBAG Subject: Re: LateX/TeX'ten normal text'e ceviren program... On Tue,29 Oct 91 10:26:30 +0200 Mustafa Akgul der ki; > Bu sorunun YUNUS'a sorulmasi gerekir. Ben henuz tam soruyu gormedim. Iletirseniz memnun olurum, su an uye degilim... > Hangi opeartying system'de calisiyorsunuz ona bagli. Elbette; VM/SP CMS, VAX, UNIX, OS/2 ve PC/MS DOS benim isimi gorurdu... > DVI file'i dump terminal'da basan bazi programlar var. > Detaylari ogrenince daha uzun yazarim Tesekkurler... Bu listeye bir yigin dosya gececegim, "listowner" olarak derleyip bilgi bankasi olusturabilirseniz Turk matematikcileri size minnetter olacaktir... Bu bilgileri Ingiltere'de "NISS Bulletin Board" merkezinden burasi icin "download" etmistim... Ilki ekte... 8<--------------------------Buradan kesiniz-(C)------------------------>8 Subject: NISS Bulletin Board - Section P1B Services Offered (27-08-91) Annual Software Guide : sent automatically to all maths/stats (first edition Nov 89) : and other relevant departments Quarterly Newsletter : sent to all on the mailing list Monthly News Sheet : see P1B2 for index of contents to Aug 91 Info Sheets: available on demand - see P1D for details DERIVE working group: see P1B1 for details MATLAB working group: see P1B3 for details Bulletin Board Database of software and persons available for individual enquirers - see P1G for further details Contact CTIMATH @ BHAM to be entered on the mailing list 8<--------------------------Buradan kesiniz-(C)------------------------>8 CTIMATH @ BHAM adresi Turkiye'deki arkadaslar icin, CTIMATH@BHAM.AC.UK seklinde olmali simdilik "relay" uzerinden gitmeniz gerekebilir... Ya da uzak adresi "%" isareti ile "userid" olarak alabilirsiniz... Ingiltere'deki arkadaslar metnin icindeki orijinal adresi kullanabilirler JANET te calisir... Metnin icinde gecen ilgili kisimlari hemen pesinden yolluyorum... _ |-| /-\ |_ |_| |< ========================================================================= Date: Thu, 31 Oct 91 17:24:52 GMT Reply-To: Turkish Mathematician's Discussion List TURKMATH Sender: Turkish Mathematician's Discussion List TURKMATH From: Haluk DEMIRBAG Subject: NISS Bulletin Board - Section P1D2 8<--------------------------Buradan kesiniz-(C)------------------------>8 How to obtain information sheets automatically (27-08-90) ---------------------------------------------- Information sheets can now be obtained within minutes from the Centre by sending a short email message to cti-server @ bham The message consists of two lines with the following format: Request: Topic: The heading and subhead must be drawn from the index on P1D1 using lower case. Information is also available for the Minitab UK Users Group using the same email address. For further information, send the following message Request: MUGUK Topic: INDEX 8<--------------------------Buradan kesiniz-(C)------------------------>8 _ |-| /-\ |_ |_| |< ========================================================================= Date: Thu, 31 Oct 91 17:31:50 GMT Reply-To: Turkish Mathematician's Discussion List TURKMATH Sender: Turkish Mathematician's Discussion List TURKMATH From: Haluk DEMIRBAG Subject: NISS Bulletin Board - Section J3L 8<--------------------------Buradan kesiniz-(C)------------------------>8 UK Mathematica User Group Mathematica is a leading software package for doing mathematics by computer. The European Marketing Organisation of the manufacturers, Wolfram Research Inc., is based in the UK. A UK User Group is in its formative stage. The inaugural meeting is held at the National Exhibition Centre in Birmingham on Thursday, the 25th of April, 1991. The initial contacts are: Andrew Carr or Jaap Hoek at Clecom, tel. 021-471 4199 Please watch this space for updates of contact information and for additional electronic services to be set up (in collaboration with the CTI Centre for Mathematics and Statistics). 8<--------------------------Buradan kesiniz-(C)------------------------>8 _ |-| /-\ |_ |_| |< ========================================================================= Date: Fri, 1 Nov 91 16:18:05 -0500 Reply-To: Turkish Mathematician's Discussion List TURKMATH Sender: Turkish Mathematician's Discussion List TURKMATH From: Selman Nas Subject: liste ismi Su degistirip turkmat yapsak nasil olur... 3-0 ondeyiz galiba..selman ========================================================================= Date: Thu, 31 Oct 91 17:20:49 GMT Reply-To: Turkish Mathematician's Discussion List TURKMATH Sender: Turkish Mathematician's Discussion List TURKMATH From: Haluk DEMIRBAG Subject: NISS Bulletin Board - Section P1G 8<--------------------------Buradan kesiniz-(C)------------------------>8 Extracts from the Centre's Software Database (04-07-91) ======================================================= An up-to-date printout of the latest information on any piece of software can be extracted from the database. In addition, an up-to date list of programs can be extracted from the database on any given topic, and made available on request. Please contact CTIMATH @ BHAM for further details. The following software was added to the database between the publication of the Guide to Software for Teaching in March and the date at the top of this page: Mathematics Course Material =========================== Computer Graphics for Differential Eqns Differential Equations and Surfaces DTREE Parasol-II PDE solver Microcomputer Quantum Mechanics Software Graphics Calculator Graphing Equations LogicLab Deriver DeriverPlus PREDCALC Spectre SFFT Software Microcomputers and Mathematics Chaos, Fractals and Dynamics discoverForm Geometry and Computers M371 Symbolic Algebra ================ SENAC Theorist Operational Research ==================== LP100 XPRESS-MP Statistics Courseware ===================== Time Series Library Statistical Analysis Systems ============================ C-Stat JMP Specialist Statistical Software =============================== N!Power Discovery Picture Statistics WINSMTH Forecast Plus Graphics Packages ================= Mandelbrot XY Calc Capgraph GraphiC 4.0 MINSQ SlideWrite Plus Numerical Packages ================== FFT87 v4.0 Difeq MINIMAT Partial Differential Equations Solver PathWays SCI-CALC Authoring Packages ================== 101 Scripts and Buttons Genesis HyperDA HyperTutor Icon Factory Plus 1.1 Script Expert SuperCard HyperX Intelligent Developer Desktop Facilities ================== Access Mac DOS Mounter SoftPC for the Mac EndNote AccessPC TechWriter Armatures Equasor Expressionist SMATH Mathematics Typewriter Mathematics Interactive Problem Package 8<--------------------------Buradan kesiniz-(C)------------------------>8 _ |-| /-\ |_ |_| |< ========================================================================= Date: Sat, 2 Nov 91 15:22:59 +0200 Reply-To: Turkish Mathematician's Discussion List TURKMATH Sender: Turkish Mathematician's Discussion List TURKMATH From: Mustafa Akgul Subject: Re: LateX/TeX'ten normal text'e ceviren program... Bu konuda bir suru program var: en basta dvitty var bu nroff/troff gibi: yani TeX output'u .dvi file'i ascii terminal'de gosterir yada adi printer'de bas Crudetype diye bir program var sanirim Msdos'da calisiyor ayni isi gorur. VAX'larda dvi2vdu programi var vt100 yada biraz iyi terminal'lerde .dvi file'in Ayrica workstation'larda calisan bir suru DVIPREVIER programi var, tabii PC ortaminda calisanlarida var> Yanliz bunun icin TeX in bu programlara ek olarak yuklenmesi gerekir Yanliz TeX'le ilgili tartismalrin YUNUS'da olmasi daha anlamli. Her TURKMATH uyesinin ayni zamanda bir TeX kullanicisi olmasi cok yararli olur, ama sart degil tabii; sayet civarinda TeX'i kullanabilen ve yardim edecek birileri var ise. Saygilar ========================================================================= Date: Sat, 2 Nov 91 19:22:35 GMT Reply-To: Turkish Mathematician's Discussion List TURKMATH Sender: Turkish Mathematician's Discussion List TURKMATH From: Haluk DEMIRBAG Subject: Re: Mathematical Review Subject Classification > > We have placed Subject Classicifacition of AMS/Math reviews in TeX form > in TURKMATH filelist. It is in LaTeX format; though you can modify it > to be in plain tex format quite easily. Ben komutu yollayali iki gun olmasina ragmen bana yollanmadi... Sebebi arastirilabilirler kumesine girer mi girmez mi? Unutmadan, Ingilizce mi konusuyoruz Turkce mi? Yine unutmadan, 3-0 TURKMAT'cilar galip... Lutfen oylansin! Bunlari asmadan Matematik yapacaklar beni urkutuyor insancasina... Listeye TURKMAT'i isteyenler evet, istemeyenler hayir diyemezler mi idi acaba? Onlarca mesaj yolladim hepsi kayip, neler oluyor? Lutfen aciklama yapilsin! Bu listede baska kimse yok mu? > To get it: send the following command to LISTSERV@TRMETU > GET MATHCLAS TEX > > Best regards Bir seyler oluyor, aciklanmiyor, tarafcilik, kargasa ve silsile... Henuz saygilarim ile... _ |-| /-\ |_ |_| |< [You can twist perception; reality won't budge. Neil Peart] ========================================================================= Date: Mon, 4 Nov 91 18:12:34 +0200 Reply-To: Turkish Mathematician's Discussion List TURKMATH Sender: Turkish Mathematician's Discussion List TURKMATH From: Mustafa Akgul Subject: Netlib help & Index ===== general NETLIB index ===== Welcome to netlib, a system for distribution of mathematical software by electronic mail. This index is the reply you'll get to: mail netlib@ornl.gov send index. To examine the full index for any library send a request of the form: send index from eispack. To search for all software with certain keywords: find cubic spline. To search for somebody in Gene Golub's address list: Who is Joan Doe? displays entries containing "Joan" and "Doe". (no spelling correction!) You may include several requests in a single piece of mail, but put each on a separate line. Here are some additional forms a request may take... send dgeco from linpack (Retrieves routine DGECO and all routines it calls from the LINPACK library.) send only dgeco from linpack (Retrieves just DGECO and not subsidiary routines.) send dgeco but not dgefa from linpack (Retrieves DGECO and subsidiaries, but excludes DGEFA and subsidiaries.) send list of dgeco from linpack (Retrieves just the file names rather than the contents; this can be helpful when one already has an entire library and just wants to know what pieces are needed in a particular application.) Send the requests to "netlib@ornl.gov" even though replies appear to be coming from "netlibd@ornl.gov". You'll be talking to a program, so don't expect it to understand much English. For background about netlib, see Jack J. Dongarra and Eric Grosse, Distribution of Mathematical Software Via Electronic Mail, Comm. ACM (1987) 30,403--407. The default precision is double; to get single, prefix the library name with "s". However, if the library only comes in one precision, that's what you will be sent. To save space we remove sequence numbers and maintain a central set of machine dependent constants. Otherwise the codes, which are almost all in Fortran, are as received from the authors. Bugs found in core libraries like eispack will receive prompt attention; in general, we will forward comments (and annual lists of recipients) to the code authors. Many of these codes are designed for use by professional numerical analysts who are capable of checking for themselves whether an algorithm is suitable for their needs. One routine can be superb and the next awful. So be careful! -------quick summary of contents--------- a - approximation algorithms (almost empty, but soon to grow) alliant - set of programs collected from Alliant users apollo - set of programs collected from Apollo users benchmark - various benchmark programs and a summary of timings bihar - Bjorstad's biharmonic solver bmp - Brent's multiple precision package cheney-kincaid - programs from the 1985 text kincaid-cheney - programs from the 1990 text conformal - Schwarz-Christoffel codes by Trefethen; Bjorstad+Grosse core - machine constants, Level 1, 2, and 3 BLAS domino - communication and scheduling of multiple tasks; Univ. Maryland eispack - matrix eigenvalues and vectors elefunt - Cody and Waite's tests for elementary functions fishpack - separable elliptic PDEs; Swarztrauber and Sweet fitpack - Cline's splines under tension fftpack - Swarztrauber's Fourier transforms fmm - software from the book by Forsythe, Malcolm, and Moler fn - Fullerton's special functions gcv - Generalized Cross Validation go - "golden oldies" gaussq, zeroin, lowess, ... graphics - ray-tracing harwell - MA28 sparse linear system hompack - nonlinear equations by homotopy method itpack - iterative linear system solution by Young and Kincaid lanczos - Cullum and Willoughby's Lanczos programs lanz - Large Sparse Symmetric Generalized Eigenproblem laso - Scott's Lanczos program for eigenvalues of sparse matrices linpack - gaussian elimination, QR, SVD by Dongarra, Bunch, Moler, Stewart lp - linear programming machines - short descriptions of various computers matlab - software from the MATLAB user's group microscope - Alfeld and Harris' system for discontinuity checking minpack - nonlinear equations and least squares by More, Garbow, Hillstrom misc - everything else na-digest - archive of mailings to NA distribution list napack - numerical algebra programs news - Grosse's Netlib News column for na-net, SIAM News, SIGNUM Newsletter ode - ordinary differential equations odepack - ordinary differential equations from Hindmarsh paranoia - Kahan's floating point test pascal - codes from J.C. Nash, Compact Numerical Methods pchip - hermite cubics Fritsch+Carlson picl - portable instrumented communication library for multiprocessors pltmg - Bank's multigrid code; too large for ordinary mail polyhedra - Hume's database of geometric solids port - the public subset of PORT library pppack - subroutines from de Boor's Practical Guide to Splines quadpack - univariate quadrature by Piessens, de Donker, Kahaner siam - typesetting macros for SIAM journal format slatec - machine constants and error handling package from the Slatec library sparse - a set of c codes for sparse systems of equations sparspak - George + Liu, sparse linear algebra core specfun - transportable special functions spin - simulation and validation of communication protocols, Gerard Holzmann toeplitz - linear systems in Toeplitz or circulant form by Garbow toms - Collected Algorithms of the ACM vfftpk - A vectorized package of Fortran for fast Fourier transform y12m - sparse linear system (Aarhus) --------a bit more detail-------- The first few libraries here are widely regarded as being of high quality. The likelihood of your encountering a bug is relatively small; if you do, we certainly want to hear about it! CORE Machine constants (i1mach,r1mach,d1mach), blas (level 1, 2 and 3) EISPACK A collection of Fortran subroutines that compute the eigenvalues and eigenvectors of nine classes of matrices. The package can determine the eigensystems of complex general, complex Hermitian, real general, real symmetric, real symmetric band, real symmetric tridiagonal, special real tridiagonal, generalized real, and generalized real symmetric matrices. In addition, there are two routines which use the singular value decomposition to solve certain least squares problems. Developed by the NATS Project at Argonne National Laboratory. (d.p. refer to eispack, s.p. refer to seispack) FFTPACK A package of Fortran subprograms for the Fast Fourier Transform of periodic and other symmetric sequences This package consists of programs which perform Fast Fourier Transforms for both complex and real periodic sequences and certian other symmetric sequences. Developed by Paul Swarztrauber, at NCAR. FISHPACK A package of Fortran subprograms providing finite difference approximations for elliptic boundary value problems. Developed by Paul Swarztrauber and Roland Sweet. FNLIB Wayne Fullerton's special function library. (single and double) GO Golden Oldies: routines that have been widely used, but aren't available through the standard libraries. Nominations welcome! HARWELL Sparse matrix routine MA28 from the Harwell library. from Iain Duff LINPACK A collection of Fortran subroutines that analyze and solve linear equations and linear least squares problems. The package solves linear systems whose matrices are general, banded, symmetric indefinite, symmetric positive definite, triangular, and tridiagonal square. In addition, the package computes the QR and singular value decompositions of rectangular matrices and applies them to least squares problems. Developed by Jack Dongarra, Jim Bunch, Cleve Moler and Pete Stewart. (all precisions contained here) PPPACK Subroutines from: Carl de Boor, A Practical Guide to Splines, Springer Verlag. This is an old version, from around the time the book was published. We will install a newer version as soon as we can. TOMS Collected algorithms of the ACM. When requesting a specific item, please refer to the Algorithm number. ---------------- In contrast to the above libraries, the following are collections of codes from a variety of sources. Most are excellent, but you should exercise caution. We include research codes that we haven't tested and codes that may not be state-of-the-art but useful for comparisons. The following list is chronological, not by merit: MISC Contains various pieces of software collected over time and: the source code for the netlib processor itself; the paper describing netlib and its implementation; the abstracts list maintained by Richard Bartels. FMM Routines from the book Computer Methods for Mathematical Computations, by Forsythe, Malcolm, and Moler. Developed by George Forsythe, Mike Malcolm, and Cleve Moler. (d.p. refer to fmm, s.p. refer to sfmm) QUADPACK A package for numerical computation of definite univariate integrals. Developed by Piessens, Robert(Appl. Math. and Progr. Div.- K.U.Leuven) de Donker, Elise(Appl. Math. and Progr. Div.- K.U.Leuven Kahaner, David(National Bureau of Standards) (slatec version) TOEPLITZ A package of Fortran subprograms for the solution of systems of linear equations with coefficient matrices of Toeplitz or circulant form, and for orthogonal factorization of column- circulant matrices. Developed by Burt Garbow at Argonne National Laboratory, as a culmination of Soviet-American collaborative effort. (d.p. refer to toeplitz, s.p. refer to stoeplitz) ITPACK Iterative linear system solvers for symmetric and nonsymmetric sparse problems. Includes ITPACK 2C (single and double precision), ITPACKV 2C (vectorized version of ITPACK 2C), and NSPCG. Developed by Young and Kincaid and the group at U of Texas. BIHAR Biharmonic solver in rectangular geometry and polar coordinates. These routines were obtained from Petter Bjorstad, Veritas Research, Oslo Norway in July 1984. LANCZOS procedures computing a few eigenvalues/eigenvectors of a large (sparse) symmetric matrix. Jane Cullum and Ralph Willoughby, IBM Yorktown. LASO A competing Lanczos package. David Scott. CONFORMAL contains routines to solve the "parameter problem" associated with the Schwarz-Christoffel mapping. Includes: SCPACK (polygons with straight sides) from Nick Trefethen. CAP (circular arc polygons) from Petter Bjorstad and Eric Grosse. FITPACK A package for splines under tension. (an early version) For a current copy and for other routines, contact: Alan Kaylor Cline, 8603 Altus Cove, Austin, Texas 78759, USA BENCHMARK contains benchmark programs and the table of Linpack timings. MACHINES contains information on high performance computers that are or soon to be made available MINPACK A package of Fortran programs for the solution of systems of nonlinear equations and nonlinear least squares problems. Five algorithmic paths each include a core subroutine and an easy-to-use driver. The algorithms proceed either from an analytic specification of the Jacobian matrix or directly from the problem functions. The paths include facilities for systems of equations with a banded Jacobian matrix, for least squares problems with a large amount of data, and for checking the consistency of the Jacobian matrix with the functions. Developed by Jorge More', Burt Garbow, and Ken Hillstrom at Argonne National Laboratory. (d.p. refer to minpack, s.p. refer to sminpack) PORT The public subset of the PORT library. Includes the latest version of Gay's NL2SOL nonlinear least squares. The rest of the PORT3 library is available by license from AT&T. Y12M calculation of the solution of systems of linear systems of linear algebra equations whose matrices are large and sparse. authors: Zahari Zlatev, Jerzy Wasniewski and Kjeld Schaumburg PCHIP is a fortran package for piecewise cubic hermite inter- polation of data. It features software to produce a monotone and "visually pleasing" interpolant to monotone data. Fred N. Fritsch, Lawrence Livermore National Laboratory LP Linear Programming - At present, this consists of one subdirectory, data: a set of test problems in MPS format, maintained by David Gay. For more information, try a request of the form send index for lp/data ODE various initial and boundary value ordinary differential equation solvers: colsys, dverk, rkf45, ode A subset of these in single precision is in the library sode. ODEPACK The ODE package from Hindmarch and others. This is the double precision verison; to get sp refer to sodepack. Alan Hindmarch, Lawrence Livermore National Laboratory ELEFUNT is a collection of transportable Fortran programs for testing the elementary function programs provided with Fortran compilers. The programs are described in detail in the book "Software Manual for the Elementary Functions" by W. J. Cody and W. Waite, Prentice Hall, 1980. SPECFUN is an incomplete, but growing, collection of transportable Fortran programs for special functions, and of accompanying test programs similar in concept to those in ELEFUNT. W.J. Cody, Argonne National Laboratory PARANOIA is a rather large program, devised by Prof. Kahan of Berkeley, to explore the floating point system on your computer. SLATEC library DoE policy apparently prohibits us from distributing this. Contact the National Energy Software Center or your congressman. HOMPACK is a suite of FORTRAN 77 subroutines for solving nonlinear systems of equations by homotopy methods. There are subroutines for fixed point, zero finding, and general homotopy curve tracking problems, utilizing both dense and sparse Jacobian matrices, and implementing three different algorithms: ODE-based, normal flow, and augmented Jacobian. DOMINO is a set of C-language routines with a short assembly language interface that allows multiple tasks to communicate and schedules local tasks for execution. These tasks may be on a single processor or spread among multiple processors connected by a message-passing network. (O'Leary, Stewart, Van de Geijn, University of Maryland) GCV software for Generalized Cross Validation, from: Woltring, (univariate spline smoothing ); Bates, Lindstrom, Wahba and Yandell (multivariate thin plate spline smoothing and ridge regression). Cheney-Kincaid programs from: Ward Cheney & David Kincaid, Numerical Mathematics and Computing, 2nd ed., 1985. Kincaid-Cheney programs from: Ward Cheney & David Kincaid, Numerical Analysis: The Mathematics of Scientific Computing, 1990. POLYHEDRA a database of angles, vertex locations, and so on for over a hundred geometric solids, compiled by Andrew Hume. GRAPHICS presently just contains some C routines for testing ray-tracing A approximation algorithms (almost empty, but soon to grow) lowess: multivariate smoothing of scattered data; Cleveland+Devlin+Grosse Apollo A set of programs collected from Apollo users. Alliant A set of programs collected from Alliant users. parmacs - parallel programmming macros for monitors and send/receive Rusty Lusk, Argonne National Laboratory, June 5, 1987 (lusk@mcs.anl.gov) sched - The Schedule Package is an environment for the transportable implementation of parallel algorithms in a Fortran setting. Jack Dongarra and Dan Sorensen, Univ of Tenn. and Rice Univ., June 5, 1987 (dongarra@cs.utk.edu sorensen@rice.edu) NAPACK A collection of Fortran subroutines to solve linear systems, to estimate the condition number or the norm of a matrix, to compute determinants, to multiply a matrix by a vector, to invert a matrix, to solve least squares problems, to perform unconstrained minimization, to compute eigenvalues, eigenvectors, the singular value decomposition, or the QR decomposition. The package has special routines for general, band, symmetric, indefinite, tridiagonal, upper Hessenberg, and circulant matrices. Code author: Bill Hager, Mathematics Department, Penn State University, University Park, PA 16802, e-mail: hager@psuvax1.bitnet or hager@psuvax1.psu.edu. Related book: Applied Numerical Linear Algebra, Prentice-Hall, Englewood Cliffs, New Jersey. Book scheduled to appear in December, 1987. SPARSPAK Subroutines from the book "Computer Solution of Large Sparse Positive Definite Systems" by George and Liu, Prentice Hall 1981. Sparse A library of subroutines written in C that solve large sparse systems of linear equations using LU factorization. The package is able to handle arbitrary real and complex square matrix equations. Besides being able to solve linear systems, it is solves transposed systems, find determinants, multiplies a vector by a matrix, and estimate errors due to ill-conditioning in the system of equations and instability in the computations. Sparse does not require or assume symmetry and is able to perform numerical pivoting (either diagonal or complete) to avoid unnecessary error in the solution. Sparse also has an optional interface that allow it to be called from FORTRAN programs. Ken Kundert, Alberto Sangiovanni-Vincentelli. (sparse@ic.berkeley.edu) SLAP This is the official release version 2.0 of the Sparse Linear Algebra Package: a SLAP for the Masses! It contains "core" routines for the iterative solution symmetric and non-symmetric positive definite and positive semi-definite linear systems. Included in this package are core routines to do Iterative Refinement iteration, Preconditioned Conjugate Gradient iteration, Preconditioned Conjugate Gradient iteration on the Normal Equations, Preconditioned BiConjugate Gradient iteration, Preconditioned BiConjugate Gradient Squared iteration, Orthomin iteration and Generalized Minimum Residual iteration. Core routines require the user to supply "MATVEC" (Matrix Vector Multiply) and "MSOLVE" (Preconditiong) routines. This allows the core routines to be written in a way that makes them independent of the matrix data structure. For each core routine there are several drivers and support routines that allow the user to utilize Diagonal Scaling and Incomplete Cholesky/Incomplete LU factorization as preconditioners with no coding. The price for this convience is that one must use the a specific matrix data structure: SLAP Column or SLAP Triad format. Written by Mark K. Seager & Anne Greenbaum problem-set: This set of directories is a collection of problems for automated theorem provers. It is partioned by subject. Larry Wos, Argonne National Laboratory sequent software from the Sequent Users Group. Jack Dongarra 9/88 UNCON/DATA test problems: unconstrained optimization, nonlinear least squares. Problems from More, Garbow, and Hillstrom; Fraley, matrix square root; Hanson, Salane; McKeown; De Villiers and Glasser; Dennis, Gay, and Vu. Collected by Chris Fraley. JAKEF is a precompiler that analyses a given Fortran77 source code for the evaluation of a scalar or vector function and then generates an expanded Fortran subroutine that simultaneously evaluates the gradient or Jacobian respectively. A. Griewank, Argonne National Laboratory, griewank@mcs.anl.gov, 12/1/88. sparse-blas an extension to the set of Basic Linear Algebra Subprograms. The extension is targeted at sparse vector operations, with the goal of providing efficient, but portable, implementations of algorithms for high performance computers. convex!dodson@anl-mcs.ARPA Mon Aug 31 19:53:21 1987 (Dave Dodson) voronoi - compute Voronoi diagram or Delaunay triangulation. From research!sjf Thu May 5 14:09:33 EDT 1988 matlab - software from the MATLAB Users Group. Christian Bischof bischof@mcs.anl.gov 12/89 picl - is a subroutine library that implements a generic message-passing interface for a variety of multiprocessors. It also provides timestamped trace data, if requested. authors: Geist, Heath, Peyton, and Worley, Oak Ridge National Lab. worley@msr.epm.ornl.gov 4/17/90. parallel - a directory containing information on parallel processing and high-performance computing. MADPACK is a a compact package for solving systems of linear equations using multigrid or aggregation-disaggregation methods. Imbedded in the algorithms are implementations for sparse Gaussian elimination and symmetric Gauss-Seidel (unaccelerated or accelerated by conjugate gradients or Orthomin(1)). This package is particularly useful for solving problems which arise from discretizing partial differential equations, regardless of whether finite differences, finite elements, or finite volumes are used. It was written by Craig Douglas. ParaGraph - a graphical display system for visualizing the behavior and performance of parallel programs on message-passing multiprocessors. Authors: Michael T. Heath and Jennifer A. Etheridge. heath@ncsa.uiuc.edu, 9/4/91 NAPACK A collection of Fortran subroutines to solve linear systems, to estimate the condition number or the norm of a matrix, to compute determinants, to multiply a matrix by a vector, to invert a matrix, to solve least squares problems, to perform unconstrained minimization, to compute eigenvalues, eigenvectors, the singular value decomposition, or the QR decomposition. The package has special routines for band, symmetric, indefinite, tridiagonal, upper Hessenberg, and circulant matrices. Code author: Bill Hager, Mathematics Department, University of Florida, Gainesville, FL 32611, e-mail: hager@math.ufl.edu. Related book: Applied Numerical Linear Algebra, Prentice-Hall, Englewood Cliffs, New Jersey, 1988. GMAT - >From Mark Seager (LLNL Oct 8, 1987) stategraph.shar This shar file contains the source code for the GMAT Stategraph analysis tool. This tool will analyze multiproces- sing trace files generated by the Cray Compatibility library on the Alliant FX/8. The input file specification is very similar to that for MTDUMP from Cray Research. timeline.shar This shar file contains the source code for the GMAT Timeline analysis tool. This tool will assist the user in a time based analysis of multiprocessing trace files generated by the Cray Compatibility library on the Alliant FX/8. The input file specification is very similar to that for MTDUMP from Cray Research. gmat.shar This shar file contains documentation the GMAT multi- processing Time Line and State Graph tools. It also includes some (compaced and uuencoded) sample trace files for use with the tools. vfftpk - A vectorized package of Fortran subprograms for the fast Fourier transform of multiple real sequences FORTRAN contains tools specific to Fortran. At present, it contains a single-double precision converter. TYPESETTING troff and LaTeX macros, mostly written at Bell Labs. Also, AMS-TeX macros by Arnold, Lucier, and SIAM. C++ miscellaneous codes in the C++ language. At present this includes Hansen's C++ Answer Book. OPT miscellaneous optimization software. Contains Brent's praxis. BIB bibliographies: Golub and Van Loan, 2nd ed. CRPC software available from the NSF Science and Technology Center for Research in Parallel Computation SPIN simulation and automated validation of communication protocols. from the book ``Design and Validation of Computer Protocols,'' by Gerard J. Holzmann PASCAL At present, codes from J.C. Nash, Compact Numerical Methods for Computers: Linear Algebra and Function Minimisation, Second Edition Adam Hilger: Bristol & American Institute of Physics: New York, 1990 LANZ Large Sparse Symmetric Generalized Eigenproblem Mark T. Jones, Argonne National Laboratory Merrell L. Patrick, Duke University and NSF PVM software and papers on a Parallel Virtual Machine and additional software environment for its use. Jack Dongarra, University of Tennessee and Oak Ridge National Lab. SVDPACK is a Fortran-77 library of subroutines for computing the singular values and singular vectors of large sparse matrices. Mike Berry, University of Tennessee. ========================================================================= Date: Mon, 4 Nov 91 16:45:51 GMT Reply-To: Turkish Mathematician's Discussion List TURKMATH Sender: Turkish Mathematician's Discussion List TURKMATH From: Haluk DEMIRBAG Subject: HELP COMMANDS Madem soz NETLIB'ten acildi, bu listeyi de canlandiralim biraz... Geceleri lutfen... Bilmem anlatabiliyor muyum? Gazaniz mubarek olsun... _ |-| /-\ |_ |_| |< 8<--------------------------Buradan kesiniz-(C)------------------------>8 # # ####### ####### # ##### ###### ## # # # # # # # # # # # # # # # # # # # ###### # # # ###### # # # # # # # # # # ## # # # # # # # # ####### # ####### ##### ###### ********************************************************************* The current version of netlib which you are accessing is maintained by Dr. Tim Hopkins and Maggie Bowman. The software was acquired and installed at the University of Kent in 1989 after making modifications and improvements. Any comments or bug reports about the system or its supplied routines should be mailed to netlib-suggest@ukc.ac.uk The netlib software was originally devised and implemented by Jack J. Dongarra and Eric Grosse at the Argonne National Lab near Chicago and at AT & T Bell Labs in Murray Hill, New Jersey. ********************************************************************* ==================== general NETLIB index ===================== ACCESS ====== Netlib originally functioned as a software server via e-mail only. However, in May 1991 an ni-ftp service was introduced. The e-mail database and the ni-ftp database overlap but are not identical. Below are instructions on how to use netlib using each access method. Access via e-mail ----------------- Netlib distributes mathematical software by electronic mail. Put the netlib commands in the body of your mail message to netlib@ukc.ac.uk or on the subject line. Do NOT include any other text at all. The netlib software expects netlib commands only and will try and process any extraneous text and send the resulting failure message back to you. This index is the reply you'll get to: mail netlib@ukc.ac.uk send index. To examine the full index for any library send a request of the form: send index from eispack. To execute a netlib program: execute f2c will execute the f2c program with the data you supply and email you the resulting output. ("send index for exec" for a list of executable files available and more information on how to submit your data). To obtain a list of updates (additions and amendments) to the library: send updates from updates For a bibliographic search: find schumaker from approximation find aasen from linalg To search for all software with certain keywords:(somewhat out of date) find cubic spline. To search for somebody in Gene Golub's address list or obtain the e-mail address for a netlib user (only consenting netlib users are accessible); Who is Joan Doe? displays entries containing "Joan" and "Doe". (no spelling correction!) You may include several requests in a single piece of mail, but put each on a separate line. Here are some additional forms a request may take... send dgeco from linpack (Retrieves routine DGECO and all routines it calls from the LINPACK library.) send only dgeco from linpack (Retrieves just DGECO and not subsidiary routines.) send dgeco but not dgefa from linpack (Retrieves DGECO and subsidiaries, but excludes DGEFA and subsidiaries.) send list of dgeco from linpack (Retrieves just the file names and sizes rather than the contents; this can be helpful when one already has an entire library and just wants to know what pieces are needed in a particular application.) For background about netlib, see Jack J. Dongarra and Eric Grosse, Distribution of Mathematical Software Via Electronic Mail, Comm. ACM (1987) 30,403--407. (A copy of this may be requested from netlib send netlib-paper from misc ) The default precision is double; to get single, prefix the library name with "s". However, if the library only comes in one precision, that's what you will be sent. To save space we remove sequence numbers and maintain a central set of machine dependent constants. Otherwise the codes, which are mostly in Fortran, are as received from the authors. Bugs found in core libraries like eispack will receive prompt attention. Many of these codes are designed for use by professional numerical analysts who are capable of checking for themselves whether an algorithm is suitable for their needs. One routine can be superb and the next awful. So be careful! All files/directories in the e-mail general index labelled "(ni-ftp)" will also be accessible via ni-ftp. However, for the complete list of ni-ftp accessible files you must consult the 00DIRECTORY via ni-ftp. Access via ni-ftp ----------------- Netlib originally functioned as a software server via e-mail only. In May 1991 an ni-ftp service was introduced. This service provides a more efficient means of accessing netlib's large files and those containing non-printable characters. Indeed, files larger than 0.5 Mb. will only be accessible via ni-ftp, although all currently supported files via e-mail will remain. Both databases continue to be regularly updated. The ni-ftp database and the e-mail database overlap but are not identical. Existing small netlib files will remain as e-mail accessible only. Larger existing netlib files will be available via both methods. New large files will be ni-ftp accessible only. This includes a directory of unix tools which is frequently updated. (Consult your local system administrator for the specific method of ni-ftp used at your site since many variations exist.) Using ni-ftp, all accesses must be of the form: path-of-file from uk.ac.ukc.harrier user guest password (00DIRECTORY, 00FILES & 00README all begin with two ZERO'S). The ni-ftp request: 00DIRECTORY from uk.ac.ukc.harrier will return a listing of the entire contents of the ni-ftp database including the path to each directory. The ni-ftp request: path-to-library/00FILES from uk.ac.ukc.harrier will return a listing of the contents of the specified library. The ni-ftp request: path-to-library/00README from uk.ac.ukc.harrier will return a more detailed description of each file in the specified library. The ni-ftp request: path-to-library/file from uk.ac.ukc.harrier will return the specified file from that library. For example, if you require eispack.tar.Z from the netlib/eispack library the ni-ftp request: netlib/eispack/eispack.tar.Z from uk.ac.ukc.harrier will return that file. All files/directories in the e-mail general index labelled "(ni-ftp)" will also be accessible via ni-ftp. However, for the complete list of ni-ftp accessible files you must consult the 00DIRECTORY via ni-ftp. Libraries available via e-mail ============================== Quick Summary of Contents ------------------------- a - approximation algorithms alliant - set of programs collected from Alliant users amos - special functions by D. Amos. = toms/644 apollo - set of programs collected from Apollo users benchmark - various benchmark programs and a summary of timings bib - bibliographies bihar - Bjorstad's biharmonic solver blas3 - matrix * matrix BLAS bmp - Brent's multiple precision package c - another "misc" library, for software written in C c++ - code in the C++ language cascade - analysis and design of linear control systems cheney-kincaid - programs from the text Numerical Mathematics and Computing. conformal - Schwarz-Christoffel codes by Trefethen; Bjorstad+Grosse contin - continuation, limit points core - machine constants, vector and matrix * vector BLAS dierckx - spline fitting domino - communication and scheduling of multiple tasks; Univ. Maryland eispack - matrix eigenvalues and vectors (complete library via ni-ftp) elefunt - Cody and Waite's tests for elementary functions errata - corrections to numerical books exec - a list of executable programs (provided as a netlib service to users) f2c - Fortran to C translator (complete library via ni-ftp)(also executable) fishpack - separable elliptic PDEs; Swarztrauber and Sweet fitpack - Cline's splines under tension fftpack - Swarztrauber's Fourier transforms (complete library via ni-ftp) fortran - Contains tools specific to Fortran. fmm - software from the book by Forsythe, Malcolm, and Moler fn - Fullerton's special functions gcv - Generalized Cross Validation gmat - multi-processing Time Line and State Graph tools. go - "golden oldies" gaussq, zeroin, lowess, ... graphics - ray-tracing harwell - MA28 sparse linear system hompack - nonlinear equations by homotopy method itpack - iterative linear system solution by Young and Kincaid jakef - automatic differentiation of Fortran subroutines kincaid-cheney - programs from the 1990 text lanz - Large Sparse Symmetric Generalized Eigenproblem lanczos - Cullum and Willoughby's Lanczos programs (complete library via ni-ftp) laso - Scott's Lanczos program for eigenvalues of sparse matrices linpack - gaussian elimination, QR, SVD by Dongarra, Bunch, Moler, Stewart (complete library via ni-ftp) lp - linear programming machines - short descriptions of various computers matlab - complete MATLAB Users Group Software Library microscope - Alfeld and Harris' system for discontinuity checking minpack - nonlinear equations and least squares by More, Garbow, Hillstrom misc - everything else na-digest - archive of mailings to NA distribution list nagmag - archive of the Nag User Group e-mail digest napack - numerical algebra programs news - Grosse's Netlib News column for na-net, SIAM News, SIGNUM Newsletter ode - ordinary differential equations odepack - ordinary differential equations from Hindmarsh opt - optimization paranoia - Kahan's floating point test paragraph - graphical display system for visualizing the behaviour of parallel algorithms parmacs - parallel programmming macros pascal - Linear Algebra and Function Minimisation pchip - hermite cubics Fritsch+Carlson pdes - the MATLAB package for solving systems of linear equations(Partial Differential Equations) picl - generic message-passing interface for multiprocessors pltmg - edition 6.1 of the Piecewise Linear Triangle Multi Grid Package(pltmg) poly2 - convert polyhedra objects to ASCII description for use by CAD polyhedra - Hume's database of geometric solids port - the public subset of PORT library pppack - subroutines from de Boor's Practical Guide to Splines presto - environment for writing object-oriented parallel programs in C++ pvm - a Parallel Virtual Machine quadpack - univariate quadrature by Piessens, de Donker, Kahaner research - miscellanea from AT&T Bell Labs, Computing Science Research Centre sched - environment for portable parallel algorithms in a Fortran setting. scilib - Fortran emulation of CRAY SCILIB sequent - Software from the Sequent Users Group. Jack Dongarra 9/88. slap - Seager + Greenbaum, iterative methods for symmetric and unsymmetric slatec - machine constants and error handling package from the Slatec library sparse - Kundert + Sangiovanni-Vincentelli, C sparse linear algebra sparse-blas - BLAS by indirection sparspak - George + Liu, sparse linear algebra core specfun - transportable special functions spin - simulation and validation of communication protocols, Gerard Holzmann stringsearch - string matching toeplitz - linear systems in Toeplitz or circulant form by Garbow toms - Collected Algorithms of the ACM (large algorithms only via ni-ftp). typesetting - typesetting macros and preprocessors uncon - optimization test problems updates - list of updates (additions and amendments) to netlib software vanhuffel - total least squares, partial SVD by Van Hufell vfftpk - Fourier transform of multiple real sequences voronoi - Voronoi diagrams and Delaunay triangulations y12m - sparse linear system (Aarhus) --------A Bit More Detail------------------------------------------ exec The index for this library lists all the current "executable" files and how you go about executing them. The first few libraries here are widely regarded as being of high quality. The likelihood of your encountering a bug is relatively small; if you do, we certainly want to hear about it! core Machine constants (i1mach,r1mach,d1mach), blas (level 1 and 2) eispack (complete library available via ni-ftp) A collection of Fortran subroutines that compute the eigenvalues and eigenvectors of nine classes of matrices. The package can determine the eigensystems of complex general, complex Hermitian, real general, real symmetric, real symmetric band, real symmetric tridiagonal, special real tridiagonal, generalized real, and generalized real symmetric matrices. In addition, there are two routines which use the singular value decomposition to solve certain least squares problems. Developed by the NATS Project at Argonne National Laboratory. (d.p. refer to eispack, s.p. refer to seispack) fftpack (complete library available via ni-ftp) A package of Fortran subprograms for the Fast Fourier Transform of periodic and other symmetric sequences This package consists of programs which perform Fast Fourier Transforms for both complex and real periodic sequences and certain other symmetric sequences. Developed by Paul Swarztrauber, at NCAR. fishpack A package of Fortran subprograms providing finite difference approximations for elliptic boundary value problems. Developed by Paul Swarztrauber and Roland Sweet. fn Wayne Fullerton's special function library. (single and double) go Golden Oldies: routines that have been widely used, but aren't available through the standard libraries. Nominations welcome! harwell Sparse matrix routine MA28 from the Harwell library. from Iain Duff linpack (complete library available via ni-ftp) A collection of Fortran subroutines that analyze and solve linear equations and linear least squares problems. The package solves linear systems whose matrices are general, banded, symmetric indefinite, symmetric positive definite, triangular, and tridiagonal square. In addition, the package computes the QR and singular value decompositions of rectangular matrices and applies them to least squares problems. Developed by Jack Dongarra, Jim Bunch, Cleve Moler and Pete Stewart. (all precisions contained here) pppack Subroutines from: Carl de Boor, A Practical Guide to Splines, Springer Verlag. This is an old version, from around the time the book was published. We will install a newer version as soon as we can. toms Collected algorithms of the ACM. When requesting a specific item, please refer to the Algorithm number. (ni-ftp available for large algorithms only). -------------------------------------------------------------------- In contrast to the above libraries, the following are collections of codes from a variety of sources. Most are excellent, but you should exercise caution. We include research codes that we haven't tested and codes that may not be state-of-the-art but useful for comparisons. The following list is alphabetical, not by merit: a approximation algorithms (almost empty, but soon to grow) lowess: multivariate smoothing of scattered data; Cleveland+Devlin+Gross alliant A set of programs collected from Alliant users. apollo A set of programs collected from Apollo users. benchmark contains benchmark programs and the table of Linpack timings. bib bibliographies: Golub and Van Loan, 2nd ed. bihar Biharmonic solver in rectangular geometry and polar coordinates. These routines were obtained from Petter Bjorstad, Veritas Research, Oslo Norway in July 1984. c++ miscellaneous codes in the C++ language. At present this includes Hansen's C++ Answer Book. Cheney-Kincaid programs from: Ward Cheney & David Kincaid, Numerical Mathematics and Computing. conformal contains routines to solve the "parameter problem" associated with the Schwarz-Christoffel mapping. Includes: SCPACK (polygons with straight sides) from Nick Trefethen. CAP (circular arc polygons) from Petter Bjorstad and Eric Grosse. contin methods for continuation and limit points, notably version 6.1 of PITCON, written by Werner Rheinboldt and John Burkardt, University of Pittsburgh. dierckx A package of spline fitting routines for various kinds of data and geometries. Written by: Professor Paul Dierckx, Dept. Computer Science, K. U. Leuven, Celestijnenlaan 200A, B-3030 Heverlee, Belgium. domino is a set of C-language routines with a short assembly language interface that allows multiple tasks to communicate and schedules local tasks for execution. These tasks may be on a single processor or spread among multiple processors connected by a message-passing network. (O'Leary, Stewart, Van de Geijn, University of Maryland) elefunt is a collection of transportable Fortran programs for testing the elementary function programs provided with Fortran compilers. The programs are described in detail in the book "Software Manual for the Elementary Functions" by W. J. Cody and W. Waite, Prentice Hall, 1980. f2c is a Fortran to C converter under development by David Gay (AT&T Bell Labs) Stu Feldman (Bellcore) Mark Maimone (Carnegie-Mellon University) Norm Schryer (AT&T Bell Labs) ( complete library via ni-ftp) fitpack A package for splines under tension. (an early version) For a current copy and for other routines, contact: Alan Kaylor Cline, 8603 Altus Cove, Austin, Texas 78759, USA fmm Routines from the book Computer Methods for Mathematical Computations, by Forsythe, Malcolm, and Moler. Developed by George Forsythe, Mike Malcolm, and Cleve Moler. (d.p. refer to fmm, s.p. refer to sfmm) fortran Contains tools specific to Fortran. At present, it contains a single-double precision converter. gcv software for Generalized Cross Validation univariate spline smoothing, from: Woltring; Bates,Lindstrom, Wahba, and Yandell. gmat Mark Seager (LLNL Oct 8, 1987) multi-processing Time Line and State Graph tools. graphics presently just contains some C routines for testing ray-tracing hompack is a suite of FORTRAN 77 subroutines for solving nonlinear systems of equations by homotopy methods. There are subroutines for fixed point, zero finding, and general homotopy curve tracking problems, utilizing both dense and sparse Jacobian matrices, and implementing three different algorithms: ODE-based, normal flow, and augmented Jacobian. itpack Iterative Linear System Solver based on a number of methods: Jacobi method, SOR, SSOR with conjugate gradient acceleration or with Chebyshev (semi-iteration - SI) acceleration. Developed by Young and Kincaid and the group at U of Texas. jakef is a precompiler that analyses a given Fortran77 source code for the evaluation of a scalar or vector function and then generates an expanded Fortran subroutine that simultaneously evaluates the gradient or Jacobian respectively. For scalar functions the ratio between the run-time of the resulting gradient routine and that of the original evaluation routine is never greater than a fixed bound of about five. The storage requirement may be considerable as it is also proportional to the run-time of the original routine. Since no differencing is done the partial derivative values obtained are exact up to round-off errors. A. Griewank, Argonne National Laboratory, griewank@mcs.anl.gov, 12/1/88. lanczos (complete library via ni-ftp) procedures computing a few eigenvalues/eigenvectors of a large (sparse) symmetric matrix. Jane Cullum and Ralph Willoughby, IBM Yorktown. lanz Large Sparse Symmetric Generalized Eigenproblem Mark T. Jones, Argonne National Laboratory Merrell L. Patrick, Duke University and NSF laso A competing Lanczos package. David Scott. lp Linear Programming - At present, this consists of one subdirectory, data: a set of test problems in MPS format, maintained by David Gay. For more information, try a request of the form send index for lp/data machines contains information on high performance computers that are or soon to be made available matlab Complete MATLAB User Group Software Library microscope is a portable FORTRAN software system for the analysis of multivariate functions. Given an interpolation or approximation scheme, it allows the following questions, among others, to be answered: Does the scheme interpolate? How often is it differentiable? What functions does it reproduce exactly? If the scheme is polynomial, what is its polynomial degree? Where is the smoothness of a function reduced? Where are the bugs in a FORTRAN implementation? Peter Alfeld and Bill Harris. Department of Mathematics,University of Utah, Salt Lake City, Utah 84112 Tel.: 801-581-6842 or 801-581-6851 minpack A package of Fortran programs for the solution of systems of nonlinear equations and nonlinear least squares problems. Five algorithmic paths each include a core subroutine and an easy-to-use driver. The algorithms proceed either from an analytic specification of the Jacobian matrix or directly from the problem functions. The paths include facilities for systems of equations with a banded Jacobian matrix, for least squares problems with a large amount of data, and for checking the consistency of the Jacobian matrix with the functions. Developed by Jorge More', Burt Garbow, and Ken Hillstrom at Argonne National Laboratory. (d.p. refer to minpack, s.p. refer to sminpack) misc Contains various pieces of software collected over time and: the source code for the netlib processor itself; the paper describing netlib and its implementation; the abstracts list maintained by Richard Bartels. napack A collection of Fortran subroutines to solve linear systems, to estimate the condition number or the norm of a matrix, to compute determinants, to multiply a matrix by a vector, to invert a matrix, to solve least squares problems, to perform unconstrained minimization, to compute eigenvalues, eigenvectors, the singular value decomposition, or the QR decomposition. The package has special routines for general, band, symmetric, indefinite, tridiagonal, upper Hessenberg, and circulant matrices. Code author: Bill Hager, Mathematics Department, Penn State University, University Park, PA 16802, e-mail: hager@psuvax1.bitnet or hager@psuvax1.psu.edu. Related book: Applied Numerical Linear Algebra, Prentice-Hall, Englewood Cliffs, New Jersey. Book scheduled to appear in December, 1987. ode various initial and boundary value ordinary differential equation solvers: colsys, dverk, rkf45, ode A subset of these in single precision is in the library sode. odepack The ODE package from Hindmarch and others. This is the double precision version; to get sp refer to sodepack. Alan Hindmarch, Lawrence Livermore National Laboratory opt miscellaneous optimization software. Contains Brent's praxis. paranoia is a rather large program, devised by Prof. Kahan of Berkeley, to explore the floating point system on your computer. paragraph A graphical display system for visualizing the behavior of parallel algorithms on message-passing multiprocessor architectures. parmacs - parallel programmming macros for monitors and send/receive Rusty Lusk, Argonne National Laboratory, June 5, 1987 (lusk@anl-mcs.arpa) pascal At present, codes from J.C. Nash, Compact Numerical Methods for Computers: Linear Algebra and Function Minimisation, Second Edition Adam Hilger: Bristol & American Institute of Physics: New York, 1990 pchip is a fortran package for piecewise cubic hermite inter- polation of data. It features software to produce a monotone and "visually pleasing" interpolant to monotone data. Fred N. Fritsch, Lawrence Livermore National Laboratory pdes - contains the MATLAB package for solving systems of linear equations using multigrid or aggregation-disaggregation methods. picl - is a subroutine library that implements a generic message-passing interface for a variety of multiprocessors. It also provides timestamped trace data, if requested. authors: Geist, Heath, Peyton, and Worley, Oak Ridge National Lab. pltmg PLTMG edition 6.1 is a package for solving an elliptic partial differential equation in general regions of the plane. It features adaptive local mesh refinement, multigrid iteration, and a pseudo-arclength continuation option for parameter dependencies. The package includes an initial mesh generator and several graphics packages. Full documentation can be obtained in the PLTMG User's Guide available from SIAM. (jan.1991). poly2 A program written in C to convert objects of the form used by Andrew Hume's catalogue of polyhedra to the ASCII object description form used by Wavefront Technologies' CAD, animation and rendering package. polyhedra a database of angles, vertex locations, and so on for over a hundred geometric solids, compiled by Andrew Hume. port The public subset of the PORT library. Includes the latest version of Gay's NL2SOL nonlinear least squares. The rest of the PORT3 library is available by licence from AT&T. presto PRESTO is an environment for writing object-oriented parallel programs in the C++ programming language. PRESTO provides the programmer with a set of pre-defined object types that simplify the construction of parallel programs. PRESTO runs on Sequent Symmetry DYNIX 3.0 and DEC VAX ULTRIX 2.0. pvm PVM stands for Parallel Virtual Machine. It is a software package that allows the utilization of a heterogeneous network of parallel and serial computers as a single computational resource. PVM consists of two parts: a daemon process that any user can install on a machine, and a user library that contains routines for initiating processes on other machines, for communicating between processes, and synchronizing processes. quadpack A package for numerical computation of definite univariate integrals. Developed by Piessens, Robert(Appl. Math. and Progr. Div.- K.U.Leuven) de Donker, Elise(Appl. Math. and Progr. Div.- K.U.Leuven Kahaner, David(National Bureau of Standards) (slatec version) research miscellanea from AT&T Bell Labs, Computing Science Research Centre, Murray Hill, New Jersey sched - The Schedule Package is an environment for the transportable implementation of parallel algorithms in a Fortran setting. Jack Dongarra and Dan Sorensen, Argonne National Laboratory, June 5, 1987 (dongarra@anl-mcs.arpa sorensen@anl-mcs.arpa) scilib SCIPORT is a portable FORTRAN emulation of CRAY SCILIB, a library of scientific applications subprograms developed by Cray Research, Inc. for use with its CRAY supercomputers. sequent Software from the Sequent Users Group. Jack Dongarra 9/88 slap This is the official release version 2.0 of the Sparse Linear Algebra Package: a SLAP for the Masses! It contains "core" routines for the iterative solution symmetric and non-symmetric positive definite and positive semi-definite linear systems. Included in this package are core routines to do Iterative Refinement iteration, Preconditioned Conjugate Gradient iteration, Preconditioned Conjugate Gradient iteration on the Normal Equations, Preconditioned BiConjugate Gradient iteration, Preconditioned BiConjugate Gradient Squared iteration, Orthomin iteration and Generalized Minimum Residual iteration. Core routines require the user to supply "MATVEC" (Matrix Vector Multiply) and "MSOLVE" (Preconditioning) routines. This allows the core routines to be written in a way that makes them independent of the matrix data structure. For each core routine there are several drivers and support routines that allow the user to utilize Diagonal Scaling and Incomplete Cholesky/Incomplete LU factorization as preconditioners with no coding. The price for this convenience is that one must use the a specific matrix data structure: SLAP Column or SLAP Triad format. Written by Mark K. Seager & Anne Greenbaum slatec library DoE policy apparently prohibits us from distributing this. Contact the National Energy Software Center or your congressman. sparse A library of subroutines written in C that solve large sparse systems of linear equations using LU factorization. The package is able to handle arbitrary real and complex square matrix equations. Besides being able to solve linear systems, it is solves transposed systems, find determinants, multiplies a vector by a matrix, and estimate errors due to ill-conditioning in the system of equations and instability in the computations. Sparse does not require or assume symmetry and is able to perform numerical pivoting (either diagonal or complete) to avoid unnecessary error in the solution. Sparse also has an optional interface that allow it to be called from FORTRAN programs. Ken Kundert, Alberto Sangiovanni-Vincentelli. (sparse@ic.berkeley.edu) sparspak Subroutines from the book "Computer Solution of Large Sparse Positive Definite Systems" by George and Liu, Prentice Hall 1981. specfun is an incomplete, but growing, collection of transportable Fortran programs for special functions, and of accompanying test programs similar in concept to those in ELEFUNT. W.J. Cody, Argonne National Laboratory spin simulation and automated validation of communication protocols. from the book ``Design and Validation of Computer Protocols,'' by Gerard J. Holzmann stringsearch This is a library of code, test data and harnesses for various kinds of string matching. The first set are single string routines based on Boyer-Moore and described in detail in "Fast String Searching", Hume and Sunday, Software-Practice and Experience, to appear. toeplitz A package of Fortran subprograms for the solution of systems of linear equations with coefficient matrices of Toeplitz or circulant form, and for orthogonal factorization of column- circulant matrices. Developed by Burt Garbow at Argonne National Laboratory, as a culmination of Soviet-American collaborative effort. (d.p. refer to toeplitz, s.p. refer to stoeplitz) uncon uncon/data ( only one subdirectory at present) test problems: unconstrained optimization, nonlinear least squares. Problems from More, Garbow, and Hillstrom; Fraley, matrix square root; Hanson, Salane; McKeown; De Villiers and Glasser; Dennis, Gay, and Vu. Collected by Chris Fraley. vanhuffel The TLS problem assumes an overdetermined set of linear equations AX = B, where both the data matrix A as well as the observation matrix B are inaccurate. The subroutine PTLS solves the Total Least Squares (TLS) problem by using a Partial Singular Value Decomposition (PSVD), hereby improving considerably the computational efficiency with respect to the classi- cal TLS algorithm. Sabine VAN HUFFEL ESAT Laboratory, KU Leuven. Kardinaal Mercierlaan 94, 3030 Heverlee, Belgium vfftpk A vectorized package of Fortran subprograms for the fast Fourier transform of multiple real sequences. Authors : Roland A. Sweet and Linda L.Lindgren voronoi Algorithms for Voronoi regions and Delaunay triangulations. Currently contains Fortune's 2d sweepline method. y12m calculation of the solution of systems of linear systems of linear algebra equations whose matrices are large and sparse. authors: Zahari Zlatev, Jerzy Wasniewski and Kjeld Schaumburg 8<--------------------------Buradan kesiniz-(C)------------------------>8 ========================================================================= Date: Tue, 5 Nov 91 09:34:00 GMT Reply-To: Turkish Mathematician's Discussion List TURKMATH Sender: Turkish Mathematician's Discussion List TURKMATH From: MAP005@VAXA.BANGOR.AC.UK turkmat icin evet Z. Arvasi ========================================================================= Date: Tue, 5 Nov 91 15:14:59 GMT Reply-To: Turkish Mathematician's Discussion List TURKMATH Sender: Turkish Mathematician's Discussion List TURKMATH From: htc@ABER.AC.UK Subject: uyelik... uye olmak istiyorum.Selamlar.Himmet Can ========================================================================= Date: Tue, 5 Nov 91 17:48:43 +0200 Reply-To: Turkish Mathematician's Discussion List TURKMATH Sender: Turkish Mathematician's Discussion List TURKMATH From: Mustafa Akgul Subject: Re: uyelik... Uye yaptim. Uye olmak icin LISTSERV@TRMETU'ya SUB TURKMATH Himmet Can demeniz yeterdi. Neyse, hayirli olsun. Selamlar ========================================================================= Date: Wed, 6 Nov 91 10:19:00 GMT Reply-To: Turkish Mathematician's Discussion List TURKMATH Sender: Turkish Mathematician's Discussion List TURKMATH From: MAP016@VAXA.BANGOR.AC.UK Turkmat a evet , Turkmath ' a hayir Idris Dag ========================================================================= Date: Wed, 6 Nov 91 15:59:49 TUR Reply-To: Turkish Mathematician's Discussion List TURKMATH Sender: Turkish Mathematician's Discussion List TURKMATH From: Tezer Sonmez Subject: turkmathor turkmat ? herkese selam , Anlamad`g`m sey <<<<<<>>>>>>>>>>> ayiriminin yapilmasi.Ne farkilari var. Yanit istiyorum? Saygilar`mla T . S ========================================================================= Date: Wed, 6 Nov 91 22:25:00 PST Reply-To: Turkish Mathematician's Discussion List TURKMATH Sender: Turkish Mathematician's Discussion List TURKMATH From: ANESIN@UCIVMSC Subject: Duzeltme Biraz onceki yazimda Nasrettin Hoca yazacagima Nasreddin Hoca yazmisim. Turk dili konusunda yazdigim yazida boyle bir hata yapmamaliydim. Duzeltir, ozur dilerim. Ali ========================================================================= Date: Wed, 6 Nov 91 23:12:21 GMT Reply-To: Turkish Mathematician's Discussion List TURKMATH Sender: Turkish Mathematician's Discussion List TURKMATH From: Tahsin.Yomralioglu@NEWCASTLE.AC.UK Subject: Re: Message of Wed, 06 Nov 91 10:19:00 GMT Re: > > Turkmat a evet , Turkmath ' a hayir > Idris Dag TURKMAT`a evet. Tahsin ========================================================================= Date: Thu, 7 Nov 91 10:54:34 +0200 Reply-To: Turkish Mathematician's Discussion List TURKMATH Sender: Turkish Mathematician's Discussion List TURKMATH From: Mustafa Akgul Subject: Re: Message of Wed, 06 Nov 91 10:19:00 GMT TURKMAT vs TURKMATH tartismasini lutfen keselim artik. Bu tartismayi lutfen bitirelim artik. Yurtdisindaki bazi arkadaslar cesitli nedenlerle TURKMAT kelimesini tercih ediyorlar. Bu karsilik yurt icindeki arkadaslar TURKMATH biciminde kalmasinda yarar goruyorlar. Bu konuda bir oylama YAPMIYORUZ. Dolayisiyla komse oylari saymiyor, bunun bir anlami yok. List'deki tarismalarin en az yarisi isim uzerine olursa, o list'in hic bir anlami olmaz. Bu gun ogleden sonra, toplayacagimiz veri tabani konusunda bir oneri gececegim liste. Lutfen onu okuyun, oneri ve elestirilerinizi bekliyorum, AMA Lutfen kendi formunuzu hemen gondermeyin. Bunlari kimin toplayacagi kimin hazirliyacagi henuz belli degil. Bir gonullu var ise, sevinirim. Saygilar Mustafa Akgul ========================================================================= Date: Wed, 6 Nov 91 22:19:00 PST Reply-To: Turkish Mathematician's Discussion List TURKMATH Sender: Turkish Mathematician's Discussion List TURKMATH From: ANESIN@UCIVMSC Subject: Neden Turkmat Turkmath ile Turkmat'in arasinda ne ayrim var? Yanitlamaya calisayim. Elbet biri Ingilizce, oburu Turkce. Daha dogrusu biri Ingilizce olan Turkish Mathematicians'in kisaltilmisi, oburu Turkce olan Turk Matematikcileri'nin kisaltilmis. Sorulan sorunun bu olmadigini biliyorum. Bu ayrimi hepimiz biliyoruz. Amacim soruldugunu sandigim soruyu daha da acikca sormak: neden Turkce konusmaliyiz, ve, asil onemlisi, neden agimizin adi Turkce olmali? Soruyu ters cevirebilirim: Neden Ingilizce olsun agimizin adi? Ve bu soruyu sormakla demagoji yapmis olmam. Cunku, Turkiye'de kurulan bir agin, tum uyelerinin Turkce bildigi bir agin, icinde Turkce yazilan bir agin Turkce adli olmasi en dogalidir, Ingilizce adli olmasi ise dogal olmayanidir. Dogali aciklamak yerine, dogal olmayaninin aciklanmasini istemekten dogal ne vardir! Ama daha da oteye gidecegim, ve onemli degilmis gibi gorunen bu ad sorununu neden onemli buldugumu aciklamaya calisacagim. Bir tartismaya girmeden once bir takim olgularda anlasmak gerekir. Cunku tartismaya belli bir noktadan baslanir, ve tartisanlarin bu noktaya dek dusunce ayriligina dusmedikleri varsayilir. Dogrusu hangi noktada oldugumuzu bilmiyorum. Hangi konularda anlastigimizi bilmiyorum. Bu nedenden su varsayimlari yapiyorum: Hepimiz, Turk dilinin onemini kavramis insanlariz. Turk diline onem veriyoruz, Turk dilinin korunmasi gerektigini biliyoruz. Cunku, bir halkin ancak kendi dilinde en dogruyu dusunebilecegini, en guzeli yaratabilecegini biliyoruz. Dilin, halkin asagi yukari kimlik karti oldugunda anlasiyoruz. Dilin olmemesi gerektigine, yasamasi, gelismesi gerektigine, bunun icin de dilin kullanilmasi gerektigine, ve dil yetersiz kaliyorsa dili zenginlestirmek gerektigine inaniyoruz. Turkce olmasaydi, ne Halide Edip, ne Tevfik Fikret, ne Nazim Hikmet, ne Karacaoglan, ne Nasreddin Hoca olurdu. Bunun bilincindeyiz. Turk dili olmasaydi, Turk ekini (kulturu) olmazdi, Turk bilinci, benligi, kimligi olmazdi. Bunun bilincindeyiz. Dunya, cesitli ekinlerin varligiyla guzeldir. Bundan kuskumuz yok. Buraya dek asagi yukari anlastigimizi varsayip, tartismayi bir asama ileri goturmek istiyorum. Demek ki yukaridaki nedenlerden dolayi Turk dilini korumaliyiz. Bizler aydin oldugumuzdan, okuma olanagi buldugumuzdan daha da bilincli, daha da titiz olmaliyiz bu konuda. Cunku bizler okuyan, yazan, ogreten kisileriz. Toplumda agirligimiz buyuk. Genc beyinleri biz besliyoruz. Onlara model oluyoruz. Hepimizin sinifinda bize hayran olan ogrencilerimiz yok mudur? Vardir elbet. Boyle bir ogrencinin olmasi bizi mutlu etmez mi? Bizi taklit etmeye calisacak bu ogrenciye Turkce konusmasini ogretmek istemez miyiz? Profesor dile onem vermezse, docent neden versin? Docent onem vermezse, asistan neden versin? Asistan onem vermezse, ogrenci neden versin? Adimizin Turkmath olmasindan dilimize onem vermedigimiz cikiyor ortaya. Belki onem vermemiz gerektiginde anlasiyoruz, ama onem verip vermedigimiz konusunda anlasamiyoruz. Sorun salt Turkmath adinda degil ki! Kimi arkadasin da dedigi gibi, sorun salt Turkmath olsa, gercekten onemli olmazdi. Ama arkasindan ne geliyor? Bir arkadas yazi yaziyor, "Cut from here" diye... Neden Ingilizce yazar anlamiyorum? "Buradan kesiniz" demek varken... Bu dilimize, benligimize, kisiligimize saygisizlik degil midir? Yoksa "Buradan kesiniz" cirkin mi? Anababalarimiz, atalarimiz cirkin bir dil mi konusuyorlardi? Yazarlarimiz ayip bir dilde mi yaziyorlar? Neden "Cut from here" diye yaziliyor? Ben de bunu bilmek istiyorum! Saygisizligin ozellikle yapildigini da sanmiyorum. Konunun ustunde dusunulmediginden... Ve bu da "Turkmath" adindan kaynaklaniyor ornegin. Eger, bir kurulusun adi Ingilizce'yse, eger o dernegin ileri gelenleri, kuruculari dile gereken onemi vermiyorlarsa, arada bir "cut from here" diye yaziyorlarsa, o kurulusun uyeleri de baslarlar Ingilizce yazmaya. Bilen-bilmeyen, hepimiz, kafamizi, gozumuzu yara yara, duse kalka Ingilizce konusuruz. Su adini unuttugum yeni televizyon kanalinin adi da Ingilizce degil mi? Dilerseniz oyle yapalim. Bundan boyle Ingilizce konusalim, hatta Turkiye adini haritadan silelim. Boylece yorgan gider, kavga biter. Elimizden geldigince Turkce yazmali, konusmaliyiz. Gucumuz sinirli elbet. Dunya bilim dali Ingilizce. Ingilizce okuyoruz, Ingilizce yaziyoruz, bilimden sozederken Ingilizce'yi daha kolay kullaniyoruz. Bu ne yazik ki boyle. Yalniz bizde degil, dunyanin her yerinde bu boyle. Dunyaya karsi koyacak gucumuz yok. Gonul isterdi ki Doga Turkce olsun, ve - ornegin Sovyetler dergisi Doklady'nin yaptigi gibi - yazilar Ingilizce'ye cevrilsin daha sonra. Olanaklarin kisitli oldugunu ve buna olanak olmadigini biliyorum. Bilimsel yazilarimizin baskalarinin da okumasi icin Ingilizce yazmaya zorunluyuz, zorlandiriliyoruz, ve karsi koymaya gucumuz yetmiyor. Ama gucumuz yettigince Turkcemizi koruyalim, saygi duyalim. Biz, okur yazar takimi bu saygiyi gostermezsek kim gosterecek? Bu konuda yazilan bir-iki yaziya degineyim aklimda kaldiginca. Bir Turk ekolunden sozedenler oldu. Sanki agzimdan oyle bisey cikmis gibi. Sanki matematigin evrensel oldugunu bilmiyormusum gibi. Itri'den, Mozart'tan sozetti ayni kisi. Sanki "arkadaslar Gauss, Hilbert, Poincare gibi gavurlari okumayalim" demisim gibi... Bir baskasi, yurt disinda olanlarin sucluluk duygusuyla Turkmat adini istediklerini yazdi. Ne ince psikolog bu arkadas! Bu konuda sunu soylemek istiyorum. Bu aga girdiysem, Turk oldugumdan ve matematikci oldugumdan girdim. Yani, herbirinize yakinlik duydugumdan. Kendimi bu agdaki herkesle esit gordugumden. Kimsenin beni dislamaya hakki olmadigi gibi, kendimi dislattirmam da. Bu ag benimdir de. Ali ========================================================================= Date: Thu, 7 Nov 91 05:12:00 PST Reply-To: Turkish Mathematician's Discussion List TURKMATH Sender: Turkish Mathematician's Discussion List TURKMATH From: ANESIN@UCIVMSC Subject: Tartisma ve oylama sursun Tartismayi kesme yanlisi degilim. Yedi kisi Turkmath adinin degistirilmesini istiyor. Buna karsilik, uc kisi bunun onemli olmadigini savundu. Bir dorduncu kisi de yanitlamaya calistigim soruyu sordu. Ben oylari sayiyorum. Bunun bir Turkiye'dekiler, disaridakiler oylamasi oldugunu sanmiyorum. Oyle bir veri yok elimde. Eger, Turkiye'deki arkadaslar sessiz kalmayi yegliyorsa, cekimser oy kullaniyorlar demektir. Oylari ne 'evet' nede 'hayir' yonunde sayilmali. Bence oylamayi surdurelim. Bu agi kuranlar toplumsal bir gorev yapmislardir. Kendilerine herbirimiz tesekkur ediyoruz. Ancak bu ag kimsenin ozel mali degildir, hepimizindir. Kimsenin sozu, dusuncesi, bir baskasinin sozunden, dusuncesinden daha degerli degildir. Olmamalidir. Kimse de belli bir toplulugun sozcusu degildir. Her birimizin bir bilgisayari var. Isteyen, dusuncesini yazar; isteyen oylamada bulunur. Demokratik bir duzende kuruluslar da demakrasiyle isler. Agimizin da demokratik bir yapisi olmalidir. Eger, Mustafa Akgul'un dedigi gibi gercekten Turkiye'deki matematikciler Turkmath yanlisi iseler, yazsinlar, gorelim. Illa degissin ad demiyorum. Cogunlugun dedigi olsun diyorum. Azinliktaysam, her demokratin yapacagi gibi, boynumu buker razi olurum oylamanin sonucuna. Ali ========================================================================= Date: Thu, 7 Nov 91 06:02:00 PST Reply-To: Turkish Mathematician's Discussion List TURKMATH Sender: Turkish Mathematician's Discussion List TURKMATH From: ANESIN@UCIVMSC Subject: Oylama yontemi Bence oylama, tartismanin basladiginda varolan kisilerce yapilsin. Sonradan giren oylamada bulunamasin. Yoksa, bu ag kamuya acik oldugundan, birimiz yandaslarini aga sokar ve kendi yonunde oy kullandirtir. Bu kural kabul edilirse, dort kisi Turkmat yonunde oy kullanmis demektir. Dedigim gibi, oylayalim. Sonuca elbet razi olacagim. Baska secenegim de yok ki zaten. Ali ========================================================================= Date: Thu, 7 Nov 91 06:58:00 PST Reply-To: Turkish Mathematician's Discussion List TURKMATH Sender: Turkish Mathematician's Discussion List TURKMATH From: ANESIN@UCIVMSC Subject: Regular subgroups of GL_n(K) \def\includedin{\subseteq} \def\into{} \def\iso{\cong} \def\intersect{\cap} \def\mod{{\roman\ mod\ }} \def\det{{\roman det}} \def\sdprod{\kern -1pt>\kern -5.4pt \triangleleft\kern 2pt} \def\tr{{\roman\ tr\,}} \def\Zz{{\Bbb Z}} \def\GG{{\Cal G}} \magnification \magstep1 \document \topmatter \abstract{We classify the groups from the title. The result is interpreted in terms of nearfields, and applied to a problem in the model theory of permutation groups.} \subjclass{03C60, 20H20, 51J20} \author Gregory Cherlin \footnote{Partially supported by NSF grant 8603157}, Theo Grundh\"ofer \footnote{Support from the Alexander von Humboldt Foundation is gratefully acknowledged}, Ali Nesin\footnote{Partially supported by NSF grant 8801021. This work was done while visiting Notre Dame. The author would like to thank the members of that department for their gracious hospitality.}, and Helmut V\"olklein \footnote{Partially supported by NSA grant MDA 904-89-H-2028} \endauthor \affil Rutgers University and M.S.R.I.; \\ Math. Institut, Universit\"at T\"ubingen, 7400 T\"ubingen; \\ University of California at Irvine and M.S.R.I.; and \\ Department of Mathematics, Univ. of Florida, Gainesville, FL 32611 \endaffil \title Sharply transitive linear groups over algebraically closed fields \endtitle \endtopmatter \heading 1. INTRODUCTION \endheading \medskip We prove the following theorem on sharply transitive linear groups. \proclaim{THEOREM} Let $K$ be an algebraically closed field and $G$ a subgroup of GL${}_n(K)$ which acts sharply transitively on the set of non-zero vectors in $K^n$. Then either $n=1$ and $G=K^*$, or $n=2$ and the following holds: $G= ZG \cdot G_0$ is the product of its center $ZG$ (a group of scalars) with $G_0= G \cap \roman{SL}_2(K)$, where $ZG \cap G_0 = \{\pm 1\}$; furthermore, there is a real closed subfield $L$ of $K$ such that $K=L(\sqrt{-1})$ and an $L$-subalgebra $D$ of the matrix algebra M${}_2(K)$, isomorphic to the quaternion division algebra over $L$, such that $G_0 \iso \roman{SU}_2(K,L)$ is the group of elements of $D$ of norm 1. \endproclaim We remark that for $n=2$ it would be enough to assume that $K$ is quadratically closed; then the only change is that $L$ is no longer real closed, but Euclidean (i.e., an ordered field whose positive elements are all squares). The second and fourth author's interest in this theorem came from the theory of near\-fields and planes coordinatized by them. In these terms, the theorem amounts to the classification of the nearfields over algebraically closed fields. This can be seen as a counterpart to Zassenhaus' well-known classification of the finite nearfields \cite{Z}. The first and third author's interest in this issue arose from a problem in the model theory of permutation groups. A permutation group $G$ is said to be sharply $n$-transitive on the set $X$ if it acts regularly on the set of ordered $n$-tuples of distinct elements of $X$. The third author has proved that an infinite sharply 3-transitive superstable group is of the form $PSL_2(k)$ with $k$ algebraically closed, in its natural action on the projective line \cite{Ne1}, and has conjectured that infinite sharply 2-transitive groups of finite U-rank are similarly of {\sl standard form\/}, namely: $k_+\sdprod k^\times$ with $k$ an algebraically closed field. This conjecture naturally divides in two parts: that any such group {\sl splits} as $N\sdprod H$ with $N$ some normal subgroup and with $H$ the stabilizer of a point; and that the split groups are standard. All finite sharply 2-transitive groups are split, and it is possible that this also holds for all infinite ones (with no stability hypothesis). Our theorem yields the following information concerning the split case (Corollary 4, \S2): \proclaim{Corollary} Let $G=N\sdprod H$ be a split infinite sharply 2-transitive superstable group of finite U-rank. If the centralizer of $H$ in End$ N$ is infinite, then $G$ is of standard form. In particular superstable nearfields of finite U-rank of characteristic 0 are algebraically closed fields. \endproclaim \heading 2. NEARFIELDS OVER ALGEBRAICALLY CLOSED FIELDS\endheading The main theorem can be rephrased in the language of nearfields, and applied to the model theoretic problem considered in the introduction. We make those consequences of the theorem explicit here. A nearfield $(F,+,*)$ is called a {\sl Dickson nearfield} if there is a division ring $D=(F,+,\cdot)$ and a mapping $\alpha: D^* \rightarrow \roman{Aut}(D)$ such that \ $x*y= x \cdot \alpha(x)y$ for all $x,y \in D^*$; then the map $\alpha$ satisfies $\alpha(x \cdot \alpha(x)y)= \alpha(x)\alpha(y)$. We say that such a Dickson nearfield is of {\it Kalscheuer type} if $D$ is a quaternion division algebra over a real closed field $L$ and $\alpha$ is constant on the norm classes of $D$. Then $\alpha$ is the composition of the norm map $D^* \rightarrow L^+$ (= the group of positive elements of $L$) and an arbitrary homomorphism $\beta: L^+ \rightarrow D^*/L^* (= \roman{Aut}(D))$. (Since the image of $\beta$ is abelian, it is actually contained in $K^*/L^*$ for some 2-dimensional subfield $K$ of $D$). As an abelian group, $L^+$ is just a vector space over the rationals, hence there is a vast number of such maps $\beta$. Nearfields of this type were first studied by Kalscheuer \cite{K} in his work on continuous nearfields, where $D$ is the division ring of real quaternions and $\beta$ is continuous, hence of the form $\beta(t)= \roman{exp}(i\lambda \ \roman{log}(t))$ mod $L^*$ for some real parameter $\lambda$. Recall that the {\sl kernel} of a nearfield is the subnearfield (actually a division ring) consisting of the elements $x$ satisfying both $x(y+z)=xy+xz$ and $(y+z)x=yx+zx$ for all $y,z$. Now we can restate our theorem as \proclaim{Corollary 1} Let $F$ be a nearfield that is of finite dimension $n$ over an algebraically closed field $K$ contained in the kernel of $F$. Then either $n=1$ and $F=K$, or $n=2$ and $F$ is a Dickson nearfield of Kalscheuer type. \endproclaim An immediate consequence of this is \proclaim{Corollary 2} Let $F$ be a nearfield that is finite-dimensional over a division ring $H$ contained in the kernel of $F$. If $H$ is a quaternion algebra over some real closed field, then $F=H$. \endproclaim We now turn to the model theory of permutation groups. Let $N\sdprod H$ be an infinite sharply 2-transitive group. Then $N$ is abelian and $H$ acts regularly on $N^\times$ (see e.g. \cite{Ke}, 5.11-12). Let $E$ be the additive endomorphism ring of $N$ and view $H$ as a subgroup of the invertible elements o f $E$, acting on the right. \proclaim{Lemma} $C_E(H)$ is interpretable in $G$. \endproclaim Proof: Fix $x\in N^\times$. If $f\in C_E(H)$ and $f(x)=x'$, then for $y\in N^\times$ we have $y=x^h$ for some unique $h\in H$, and $y^f=x'^h$. It is easy to derive an interpretation for $C_E(H)$ from this.\qed \proclaim{Corollary 3} Let $\GG = N{\sdprod H}$ be a split sharply 2-transitive group which is superstable of finite U-rank. If $K=C_E(H)$ is infinite then $K$ is an algebraically closed field and $\GG\iso K_+\sdprod K^\times$. \endproclaim Proof: $K$ is a superstable ring. As $N$ is $H$-irreducible, $K$ is a division ring, hence an algebraically closed field \cite{Ch}. Let $V$ be $N$ with its $K$-structure, and $G=H$. Then $n=$dim $V \le $ U-rk $G$. This restores the notation of the theorem. If $n=1$ we are done. If $n=2$ then $L$ is interpretable in $\GG$ and hence is superstable, hence algebraically closed, a contradiction. \qed \proclaim{Corollary 4} If $F$ is a superstable nearfield of finite U-rank and infinite center then $F$ is standard. \endproclaim This applies in particular if $F$ is of characteristic zero. It is reasonable to conjecture that infinite superstable sharply 2-transitive groups are all of standard form, and in particular that superstable nearfields are commutative. (It is known that superstable fields are either finite or algebraically closed.) One extreme possibility we have not been able to eliminate is the following: $G=A\sdprod H$, $A$ is abelian with no proper infinite definable subgroups, $|ZH|=2$, $H/ZH$ a bad group of Morley rank 3. In particular $H/ZH$ would be a simple linear group with no involution; it is not known whether such groups exist at all. The model theory of nearfields has been investigated by Felgner \cite{Fe}, who looked at the pseudofinite case, and also by Schulz \cite{S}. \heading 3. THE PROOF OF THE MAIN THEOREM \endheading The hypotheses and notation of the main theorem are in force throughout this section. Let $K^*$ denote the multiplicative group of $K$. As $K$ is algebraically closed, all $g\in G$ have nontrivial eigenvectors. By the regularity hypothesis, elements of $G$ commute if and only if they have a common eigenvector, and are conjugate if and only if they have a common eigenvalue. We refer to these criteria as the {\sl commutation} and {\sl conjugacy} criteria below. Clearly $G$ acts irreducibly on $V:= K^n$, hence by Schur's Lemma, the center $ZG$ acts as a group of scalars. We will now proceed to prove the theorem in a series of lemmas, using induction on $n$. The case $n=1$ is trivial, so assume $n>1$. For $g \in G$ let $C(g)$ denote the centralizer of $g$ in $G$. \proclaim {Lemma 1} If $g\in G-ZG$ and $V_\alpha\ne (0)$ is the $\alpha$-eigenspace of $g$ in $V$ (for some $\alpha \in K$), then $V_\alpha$ has dimension 1, and the map that sends each $h \in C(g)$ to the eigenvalue of $h$ on $V_\alpha$ is an isomorphism from $C(g)$ to $K^*$. \endproclaim Proof: $C(g)$ acts on $V_\alpha$, and we claim first that it acts regularly on the nonzero vectors of $V_\alpha$. If $v,w \ne 0$ are in $V_\alpha$ and $h$ is the (unique) element of $G$ with $h \cdot v=w$ , then $[g,h]v=v$ and thus $h\in C(g)$. The regularity of $C(g)$ on $V_\alpha \backslash \{0\}$ follows. Now if the dimension $d$ of $V_\alpha $ is 1, the claim follows. So assume $d>1$. Then it follows by induction that $d=2$ and $C(g)$ has the structure specified in the conclusion of the theorem. In particular $G$ contains a noncentral element $g'$ of order 4, which has $\pm \sqrt{-1}$ as its eigenvalues. Since the characteristic of $K$ is not 2 and $g'$ is of order 4, $g'$ is diagonalizable with two distinct eigenvalues, and it must have an eigenspace $V'$ of dimension $\ge 2$ since $n>2$. Again it follows that dim $V'=2$ and $C(g')$ has the structure specified in the conclusion of the theorem. Thus $C(g')$ has both a central element (namely, $g'$) and a noncentral element of order 4. By the conjugacy criterion they are conjugate in $C(g)$ (since $C(g)$ acts regularly on $V'$), which is a contradiction.\qed \proclaim {Lemma 2} Let $g,g' \in G-ZG$. (a) The elements $g,g'$ commute if and only if they have the same set of eigenspaces. (b) We have either $C(g)=C(g')$ or $C(g) \cap C(g')= ZG$. (c) If $N(g)$ denotes the normalizer of $C(g)$ in $G$, then $N(g)/C(g)$ acts regularly on the set of eigenspaces of $g$. (d) $C(g)$ and $C(g')$ are conjugate. \endproclaim Proof: (a) follows from the commutation criterion and the fact that the eigenspaces are 1-dimensional. Claim (b) follows from (a). For the transitivity in (c), let $v,w$ be eigenvectors for $g$ and let $h$ be the element of $G$ with $hv=w$. Then $g$ and $g^h$ have $v$ as an eigenvector, hence $g \in C(g) \cap C(g^h)$ (by the commutation criterion); thus $C(g)=C(g^h)$ (by (b)), and so $h\in N(g)$. This shows the transitivity. On the other hand if $hV_\alpha=V_\alpha$ with $V_\alpha$ the $\alpha$-eigenspace of $g$, then $h\in C(g)$ (by the commutation criterion), which shows the regularity. For (d), after a suitable conjugation we can assume $g,g'$ share a common eigenvector, and apply (a,b). \qed \proclaim {Lemma 3} (a) $n=2$, and char$(K) \ne 2$. (b) Every $g\in G-ZG$ has $2$ distinct eigenvalues, and $[N(g):C(g)]=2$. \endproclaim Proof: Let $g\in G-ZG$. By Lemma 2(c) the number $m$ of distinct eigenvalues of $g$ is $[N(g):C(g)]$, which is independent of $g$ by Lemma 2(d). Suppose $m=1$, and write $n=q^re$ where $q=$ char$(K)$ (or $q=1$, if char$(K)$=0), and $e \not \equiv 0$ (mod $q$). Then any element $f$ of the commutator subgroup $G'$ of $G$ has as its only eigenvalue an $e$-th root of unity (since det$(f)=1$ ), hence $f^e$ has eigenvalue 1 and so $f^e=1$. Since $X^e-1$ is a separable polynomial, $f$ is diagonalizable, hence is a scalar $\lambda \cdot id_V$, with $\lambda$ an $e$-th root of unity. So $G'$ is finite and central in $G$. Hence the commutator yields a bi-multiplicative map $G \times G \rightarrow G'$, and this map must be trivial since $G$ is divisible and $G'$ is finite. Thus $G$ is abelian, and so $G= ZG$ a group of scalars, which is absurd. Thus $m>1$, and so there is $h \in N(g)$ whose image in $N(g)/C(g)$ has prime order $p$. Then Lemma 2(b) shows $$ C(g) \cap C(h) = ZG \tag 1$$ Since $h^p \in C(g)$ it follows that $$ h^p \in ZG \tag2$$ In particular since $h$ has more than one eigenvalue, the characteristic of $K$ is not $p$. The element $h$ induces an automorphism $\sigma$ of order $p$ of $C(g)$. Let $U_p$ be the group of elements of $C(g)$ of $p$-power order. Since $C(g) \cong K^*$, $U_p$ is a Pr\"ufer group, and its automorphism group is isomorphic to $ \Zz_p^\times$, the invertible $p$-adic integers. Now we show $p=2$. If $p>2$ there is no element of order $p$ in $\Zz_p^\times$ (cf. \cite{Am}), so $U_p\includedin C(g)\intersect C(h)=ZG$. Now $ZG$ is the group of fixed points of the automorphism $\sigma$ of prime order $p$ acting on a divisible abelian group, whose $p$-torsion lies in $ZG$; hence $ZG$ is $p$-divisible (in additive notation, if $px\in ZG$ and $py=x$ then $\sigma y=y+z$ with $p^2z=0$, hence $y=\sigma^py=y+pz$ and $pz=0, \ \sigma x=x$). As $h^p\in ZG$ and $ZG$ is $p$-divisible, we can take $h^p=1$. Now if $v$ is an eigenvector for $g$, then $h$ fixes the vector $v+hv+\ldots+h^{p-1}v$, which is nontrivial by Lemma 2(c). This is a contradiction, which shows that $p=2$. Now $h^2$ is a scalar (by (2)), hence $h$ has at most two distinct eigenvalues. Thus $m \le 2$. Since $m>1$, we have $m=2$. Furthermore since char$(K)\ne2$, $h$ is diagonalizable, with 1-dimensional eigenspaces (Lemma 1), so $n=2$. This proves (a). As $m=2$, (b) follows from Lemma 2(c). \qed \proclaim {Lemma 4} Let $G_0=G\intersect SL(2,K)$. Then $G=ZG \cdot G_0$ with $ZG\intersect G_0= \{\pm 1\}$. \endproclaim Proof: Clearly $-1 \in G$ (since an element of $G$ of order 2 can only have one eigenvalue), hence $ZG\intersect G_0= \{\pm 1\}$. Let $g\in G-ZG$. As $[N(g):C(g)]=2$ and $C(g)$ is divisible abelian with a unique involution, if $h\in N(g)-C(g)$ then $h$ induces an automorphism of order 2 on $C(g)$ and $g=g_+g_-$ where $h$ centralizes $g_+$ and inverts $g_-$. Then $g_+\in ZG$ and $g_-$ is conjugate to its inverse, and has two distinct eigenvalues. Since these eigenvalues cannot be the pair $\{1,-1\}$ they must be a pair $\{\alpha,\alpha^{-1}\}$ and thus $g_-\in G_0$.\qed To identify the group $\overline G_0:= G_0/<-1>$, we will use the geometry of involutions of $\overline G_0$, inspired by Bachmann \cite{Ba}. \proclaim{Notation} For $g\in G_0$ let $C_g=C_{G_0}(g)$ and $N_g=N_{G_0}(C_g)$. Let $\overline G_0=G_0/<- 1>$. \endproclaim \proclaim {Lemma 5} Let $g\in G_0-\{\pm1\}$. Then: \endproclaim {\sl \item {1.} $C_g$ is abelian and 2-divisible. \item {2.} $[N_g:C_g]=2$ \item {3.} $N_g-C_g$ consists of elements of order 4, each of which acts on $C_g $ by inversion. \item {4.} All elements of order 4 in $G$ lie in $G_0$, and are conjugate in $ G_0$. \item {5.} The involutions of $\overline G_0$ are exactly the images in $\overline G_0$ of elements of order 4 in $G_0$. } Proof: (5) is clear, and we know $C_g$ is abelian. If $h\in N(g)-C(g)$ then $h\equiv h'\mod ZG$ for some $h'\in N_g-C_g$ (by Lemma 4). Thus $[N_g:C_g]\ge 2$. Also $ N_g-C_g \includedin N(g)-C(g)$, hence $[N_g:C_g]= 2$. By the proof of Lemma 4, each $h \in N_g-C_g$ acts on $C_g$ by inversion; in particular, $h^2 \in C_g$ must be an involution, hence $h$ is of order 4. This proves (2) and (3). By the conjugacy criterion one sees that all elements of $G$ of order 4 are conjugate, and (4) follows. It remains to show that $C_g$ is 2-divisible. By Lemma 4, $C_g/(\pm1)\iso K^\times/ZG$ is 2-divisible, and by (4) it follows that $C_g$ is also 2-divisible. \qed \proclaim {Lemma 6} For any two distinct involutions of $\overline G_0$ there is another involution in $\overline G_0$ distinct from the two and centralizing both. \endproclaim Proof: Let $i,j\in G_0$ be elements of order 4 representing distinct involutions $\overline\imath ,\overline\jmath$ of $\overline G_0$. Let $g=ij\notin \{\pm1\}$. Then $C(g)$ contains a unique cyclic subgroup $\langle k\rangle$ of order 4, and this $k$ is in $G_0$. As $i,j$ invert $g$, they normalize $C(g)$, hence either invert or centralize $k$. In either case $\overline\imath,\overline\jmath$ centralize $\overline k$. If $\overline\imath,\overline\jmath$ do not commute, then clearly they are distinct from $\overline k$; if they do commute, then $\overline k=\overline g= \overline\imath\overline\jmath$, which again implies $\overline k \ne \overline\imath, \overline k \ne \overline\jmath$. \qed \proclaim{Lemma 7} $G_0$ equals its own commutator subgroup $G_0'$. \endproclaim Proof: By Lemma 5.3, we have for each $g \in G_0$ that $g^{-1}= g^j$ for some $j \in G_0$. Thus $g^{-2} = [g,j] \in G_0'$. So $G_0'$ contains all squares of $G_0$; but by Lemma 5.1, each element of $G_0$ is a square. \qed \bigpagebreak Now let $A$ be the 3-dimensional K-vector space of all trace 0 matrices in M${}_2(K)$. The determinant yields a non-degenerate quadratic form $Q$ on $A$. The group $G_0$ acts on $A$ by conjugation, leaving $Q$ invariant. This gives an embedding of $\overline G_0 = G_0/<-1>$ into the special orthogonal group SO${}_3(Q)$, and via this embedding we will regard $\overline G_0$ as a subgroup of SO${}_3(Q)$. Let $I$ (resp., $I_0$) be the set of involutions in SO${}_3(Q)$ (resp., in $\overline G_0$). \proclaim{Lemma 8} (a) Each involution $\nu \in I$ has a 1-dimensional eigenspace $A^+(\nu)$ and a 2-dimensional eigenspace $A^-(\nu)$, corresponding to the eigenvalue $+1$ and $-1$, respectively. These eigenspaces are non-degenerate (relative $Q$), and for each non-degenerate 1-space (resp., 2-space) $X$ in $A$ there is a unique $\nu \in I$ with $X= A^+(\nu)$ (resp., $X=A^-(\nu)$). \newline (b) For distinct $\nu,\nu_1,\nu_2 \in I$, the following are equivalent: (i) $\nu$ centralizes $\nu_1$ and $\nu_2$. (ii) $A^+(\nu)= A^-(\nu_1) \cap A^-(\nu_2)$ (iii) $A^-(\nu)= A^+(\nu_1) + A^+(\nu_2)$ \endproclaim Proof: An elementary exercise in Linear Algebra (all contained in \cite{Ba}). \qed \smallpagebreak Now let $\Cal P$ (resp., $\Cal L$) denote the set of all $A^+(\nu)$ (resp., $A^-(\nu)$) for $\nu \in I_0$. Then $\Cal P$ (resp., $\Cal L$) is a set of points (resp., lines) of the projective plane $\pi_A$ associated with $A$, and we are going to show that $(\Cal P, \Cal L)$ is a subplane of $\pi_A$. Take $\nu_1 \ne \nu_2$ in $I_0$. By Lemma 6 there is $\nu \in I_0$ distinct from $\nu_1, \nu_2$, and centralizing $\nu_1,\nu_2$. Hence by Lemma 8(b), the lines of $\Cal L$ (resp., the points of $\Cal P$) associated to $\nu_1$ and $\nu_2$ intersect in the point of $\Cal P$ (resp., are joined by the line of $\Cal L$) associated to $\nu$. Clearly, $(\Cal P,\Cal L)$ is not contained in a triangle, hence it is a subplane of $\pi_A$. Choose points $Kb_1,...,Kb_4$ in $\Cal P$ forming a (non-degenerate) quadrangle. Then $b_1,b_2,b_3$ form a basis of $A$, and we may assume $b_4= b_1+b_2+b_3$. This gives homogeneous coordinates on $\pi_A$ such that the above points have coordinates $(1,0,0),(0,1,0),(0,0,1)$ and $(1,1,1)$, respectively. Then it follows from the usual geometric interpretation of addition and multiplication that the elements $t \in K$ for which the point $(t,0,1)$ lies in $\Cal P$ form a subfield $L$ of $K$. Furthermore, $\Cal P$ consists exactly of those points in $\pi_A$ with some coordinate triple in $L^3$. In other words, if $\pi_B$ denotes the projective plane associated to the $L$-vector space $B= Lb_1+Lb_2+Lb_3$, then the canonical image of $\pi_B$ in $\pi_A$ equals the subplane $(\Cal P,\Cal L)$. \proclaim{Lemma 9} $\overline G_0$ leaves $B$ invariant. \endproclaim Proof: Viewing PGL$(A)$ as a collineation group of $\pi_A$, we first note that the identity is the only element of PGL$(A)$ acting trivially on the subplane $\pi_B$ (namely, such an element would in particular fix four points forming a quadrangle). Hence the subgroup $\Phi$ of PGL$(A)$ fixing $\pi_B$ is isomorphic to a collineation group of $\pi_B$ containing PGL$(B)$. But the stabilizer in $\Phi$ of any quadrangle in $\pi_B$ is trivial, hence $\Phi$ coincides with PGL$(B)$ (embedded naturally into PGL$(A)$). Thus the inverse image of $\Phi$ in GL$(A)$ is $\Psi:= K^* \cdot \roman{GL}(B)$. Now $\overline G_0$ is contained in $\Psi$, hence also in the commutator subgroup of $\Psi$ (by Lemma 7). Thus $\overline G_0 \subseteq \roman{SL}(B)$, which means that $\overline G_0$ leaves $B$ invariant. \qed Every 1-dimensional subspace of $B$ is of the form $A^+(\nu) \cap B$ for some $\nu \in I_0$. Since all $\nu \in I_0$ are conjugate under $\overline G_0$ (Lemma 5.4, 5.5) it follows that $\overline G_0$ acts transitively on the 1-spaces in $B$. Thus we may assume det$(b) \in L$ for all $b \in B$ (replacing $B$ by $\alpha B$ for some $\alpha \in K $, if necessary); further, if $b \ne 0$ then det$(b) \ne 0$ (since $b$ lies in some space $A^+(\nu)$, which is $Q$-anisotropic). Thus det gives an anisotropic quadratic form on $B$, invariant under $\overline G_0$. Viewing $B$ as an anisotropic quadratic space via det, we get $\overline G_0 \subseteq \roman{SO}_3(B)$. \proclaim{Lemma 10} (a) $[K:L]=2$, hence $L$ is a real closed field and char$(K)=0$. (b) The eigenvalues $x$ of each $g \in G_0$ have norm N${}_{K/L}(x)=1$. \endproclaim Proof: Let $x,x^{-1}$ be the eigenvalues of some $g \in G_0$. By Lemma 5.1 we have $x=y^2$ where $y,y^{-1}$ are the eigenvalues of some $h \in G_0$. Then $y^2,y^{-2},1$ are the eigenvalues of its image $\overline h \in \overline G_0$ acting on $A$. Assuming (a) momentarily, we derive (b). For $x,y,g,h$ as above, since $\overline h|_B \in $ SO${}_3(B)$, it follows from (a) that $1=$ N${}_{K/L}(y^2)=$ N${}_{K/L}(x)$, proving (b). Thus it only remains to prove (a). With $x,y,g,h$ as above, since $\overline h$ fixes $B$, the trace tr$(\overline h)=y^2+y^{-2}+1$ lies in $L$. Now tr$(g)= x+x^{-1}=y^2+y^{-2} \in L$, so we get $$\hbox{For all $g \in G_0$ we have tr$(g) \in L$.}\leqno(1)$$ Since $x$ is an eigenvalue of $\overline h$ on $A$, if $x \in L$ then $\overline h$ has an eigenvector $v$ in $B$ with eigenvalue $x$, and $\det(v^h)=x^2\det(v)$; since det is anisotropic on $B$, we find $x=\pm1$. This shows: $$\hbox{If $x \ne \pm1$ is an eigenvalue of some $g\in G_0$, then $x \not \in L$.}\leqno(2)$$ By Burnside's theorem \cite{Ja, p.213}, $G_0$ contains a basis $g_1,...,g_4$ of the matrix algebra M${}_2(K)$. Since the trace form on M${}_2(K)$ is non-degenerate, the map \ $\phi: \roman{M}_2(K) \rightarrow K^4$ sending any $m \in \roman{M}_2(K)$ to the 4-tuple $(\roman{tr}(mg_1),...,\roman{tr}(mg_4))$ is a linear isomorphism. Additionally, $\phi(G_0) \subseteq L^4$ by (1). Hence $G_0 \subseteq Lm_1+ ... + L m_4$ for certain $m_1,...,m_4 \in \roman{M}_2(K)$. Thus for $w \ne 0$ in $K^2$ we have \ $G_0 \cdot w \subseteq L m_1(w) +...+ L m_4(w)$. So the $L$-vector space $W$ spanned by $G_0 \cdot w$ has dimension $\le 4$ over $L$. Clearly, the set $k$ of all $t\in K$ with $tW \subseteq W$ is a subfield of $K$, with $[k:L] \le 4$. Since $kw$ ($\subseteq Kw$) cannot exhaust all of $W$, we even get $[k:L] \le 2$. If $x$ is an eigenvalue of some $g \in G_0$ then $xw \in G_0 \cdot w$, hence $xW \subseteq W$ and so $x \in k$. Now (2) shows that $k \ne L$. Hence $[k:L]=2$. Thus $W$ has dimension 2 over $k$. Choose a basis $w_1,w_2$ of $W$ over $k$. Then this is also a basis of $K^2$ (over $K$). Now any line in $K^2$ through 0 whose slope in $w_1,w_2$-coordinates does not lie in $k$ intersects $W$ trivially. Hence such a line cannot exist (since $G_0$ acts transitively on the lines in $K^2$ through 0, and leaves $W$ invariant). This proves $k=K$, hence $[K:L] = [k:L]=2$. The rest of the claim follows. \qed \medpagebreak Let $i\in K$ with $i^2=-1$. Since det${}|_B$ is an anisotropic quadratic form over the real closed field $L$, its non-zero values are all positive or all negative (in the unique order on $L$). Replacing $B$ by $iB$ if necessary, we may thus assume det$(b)>0$ for all $b\ne 0$ in $B$. Any $g \in M_2(K)$ can be written uniquely as $g= \mu \cdot 1 + b_1+ ib_2$ with $\mu \in K, \ b_1,b_2 \in B$. For $g\in G_0$, since $g$ centralizes itself and normalizes $B$, we get $ b_1^g=b_1$ and $b_2^g=b_2$. If $g \ne \pm 1$, it follows that $b_1$ and $b_2$ are linearly dependent over $L$ (since each non-identity element of SO${}_3(B)$ has a 1-dimensional fixed space in $B$). Thus every $g \in G_0$ is of the form $g= \mu \cdot 1 + \lambda b$ for some $b \in B, \lambda,\mu \in K$. Now $\mu= \roman{tr}(g)/2$, and \ tr$(g) \in L$ (by (1) from the proof of Lemma 10). Furthermore, $1= \roman{det}(g)= \mu^2+ \lambda^2 \roman{det}(b)$, hence $\lambda^2 \in L$. Now we will show that $\lambda^2 \ge 0$, so that $\lambda \in L$, and we may conclude that: \proclaim{Lemma 11} $G_0$ is contained in $D:= L \cdot 1+B$. \endproclaim Proof: To show that $\lambda^2 \ge 0$ it suffices to show that $\mu^2 \le 1$ (since det$(b) \ge 0$ by the choice of $B$ above). But the eigenvalues $x,x^{-1}$ of $g$ have norm 1 (by Lemma 10) and satisfy \ $\mu = (x+x^{-1})/2$. Thus \ $|\mu|= |x+x^{-1}|/2 \le (|x|+|x^{-1}|)/2 =1$ \ (where $|.|$ is the usual absolute value, i.e., the square root of N${}_{K/L}$). Thus also $\mu^2 \le 1$.\qed \medpagebreak Since $G_0$ contains 4 linearly independent elements, it follows that the $L$-span of $G_0$ equals $D$. Thus $D$ is a subalgebra of M${}_2(K)$. Any $d \ne 0$ in $D$ is of the form $d= \mu \cdot 1+ b$ with $\mu \in L, b \in B$ not both zero; hence \ det$(d)= \mu^2+ \roman{det}(b) > 0$. Thus $D$ is a (4-dimensional) division algebra over $L$, hence is the quaternion (division) algebra over $L$. Furthermore $G_0$ is contained in the group SU${}_2(K,L)$ of quaternions of norm 1, and from the transitive action of $G_0$ on the 1-spaces in $K^2$ it follows that $G_0$ contains all elements of SU${}_2(K,L)$ of order 4. These elements generate the group, hence \ $G_0 = \roman{SU}_2(K,L)$. \Refs \ref\key{\bf [Am]} \by Y. Amice \book Les nombres $p$-adiques \publ Presses Univ. France \publaddr Paris \yr 1975 \endref \ref\key{\bf[Ba]} \by F. Bachmann \book Aufbau der Geometrie aus dem Spiegelungsbegriff \bookinfo Die Grundlehren der mathematischen Wissenschaften \vol XCVI \publ Springer-Verlag \publaddr Berlin-G\"ottingen-Heidelberg \yr 1959 \endref \ref\key{\bf[Ch]} \by G. Cherlin \paper Superstable division rings \inbook Logic Colloquium 1977 \publ North-Holland \publaddr Amsterdam \pages 99-111 \yr 1978 \endref \ref\key{\bf[Fe]} \by U. Felgner \paper Pseudofinite nearfields \inbook Near-rings and Near-fields \publ North-Holland \publaddr Amsterdam \yr 1987 \bookinfo ed. Betsch \endref \ref\key{\bf [Ja]} \by N. Jacobson \book Basic Algebra II \publ W. H. Freeman and Company \yr 1989 (2nd edition) \endref \ref \key {\bf [K]} \by F. Kalscheuer \paper Die Bestimmung aller stetigen Fastk\"orper \"uber dem K\"orper der reellen Zahlen als Grundk\"orper \jour Abh. Math. Sem. Hamb. Univ. \vol 13 \yr 1940 \pages 413-435 \endref \ref\key{\bf[Ke]} \by W. Kerby \book On infinite sharply transitive multiply transitive groups \bookinfo Hamburger Mathematische Einzelschriften \vol 6 \yr 1974 \endref \ref\key{\bf[Ne1]} \by A. Nesin \paper On sharply multiply transitive superstable groups \jour PAMS \pages (to appear) \endref \ref\key{\bf[Ne2]} \by A. Nesin \paper Nonsolvable groups of Morley rank 3 \jour J. Algebra \vol 124 \yr 1989\pages 199-218 \endref \ref\key{\bf[S]} \by K. U. Schulz \paper Undecidability of the theory of finite nearfields \jour Resultate Math. \vol 14\yr 1988\pages 340-348 \endref \ref \key{\bf[Z]} \by H. Zassenhaus \paper \"Uber endliche Fastk\"orper \jour Abh.Math.Sem.Hamb.Univ. \vol 11 \yr 1936 \pages 187-220 \endref \enddocument ========================================================================= Date: Thu, 7 Nov 91 07:17:00 PST Reply-To: Turkish Mathematician's Discussion List TURKMATH Sender: Turkish Mathematician's Discussion List TURKMATH From: ANESIN@UCIVMSC Subject: Duzenli gruplar Biraz once, ilgilenecek olanlar icin bir yazi gectim. AMSppt'de yazilmis yazi, ve Proc of the AMS'de yayinlandi yakin bir gecmiste. Konu su: K cebirsel kapali bir cisim olsun (an algebraically closed field). G < GL_n(K) bir altgrup olsun. Eger G'nin su ozelligi varsa, G'ye duzenli grup diyelim: K^n \ {0} daki her x ve y vektorleri icin G'de, gx = y esitligini saglayan bir ve bir tane g ogesi vardir. Soru: Hangi K'lar ve n'ler icin GL_n(K)'nin duzenli alt gruplari vardir, ve bu alt gruplar nelerdir? Yazida bu soruya yanit veriliyor. Eger, yazinin basindaki mantiga uygulamalari atarsaniz, yazinin geri kalan bolumunu anlamak icin lineer cebirden ote fazla bir bilgiye gerek yok. Sonlara dogru biraz geometri ve cebir gerekiyor. Iki duzenli grup ornegi vereyim. 1) n = 1 olsun, ve G = GL_1(K) = K* olsun. G duzenlidir. 2) K = C (kompleks sayilar) ve n = 2 icin bir ornek: H Hamilton sayilari olsun. H = R^4 = C^2. H'i iki boyutlu bir sag C-vektor uzayi olarak gorun. H^* grubu, H'a solundan "act" etsin. Boylece, H^* < GL_2(C) ve H^* duzenli bir gruptur. Yukaridaki soruya "yanit": n = 1 yada 2'dir. Eger n = 1 ise, o zaman birinci ornektir G. Eger n = 2 ise, K'nin karakteristigi 0 olmalidir, ve G, ikinci gruba "cok benzer". Yazi, Gregory Cherlin, Theo Grundhofer, Helmut Volklein'la birlikte yazi lmistir . Acik soru: n = p olsun, ve K karakteristigi p > 0 ve separably closed (ayrimsal kapali?) bir cisim olsun. GL_p(K)'nin duzenli alt gruplarini bul. Yolladigim yazinin ilk sayfalari, boyle bir ornek olabilecegi hissini verdi bana. Boyle bir ornek, geometride onemli olacaktir. Ali ========================================================================= Date: Thu, 7 Nov 91 18:09:00 PST Reply-To: Turkish Mathematician's Discussion List TURKMATH Sender: Turkish Mathematician's Discussion List TURKMATH From: ANESIN@UCIVMSC Subject: Oylama yontemi H harfi konusunun inada bindigini gozlemliyorum. Oysa biz matematikciler inada gore degil, mantiga gore hareket ederiz. Agin adinin Turkmath olmasini mantiksiz buluyorum. Mantiginin aciklanmasini istedim, doyurucu bir yanit gelmedi. Doyurucu bir yanit gelse oyumun rengini hemen degistirecegim. Daha once yolladigim bir yazi bana gelmedi galiba, yada geldi de sabahin erken saatinde ayrimina varmadan sildim. Yineliyorum. Elinize gectiyse ozur dilerim. Oylama yapma yanlisiyim. Ancak oylamanin tartisma basladiginda agda olanlar arasinda yapilmasindan yanayim. Cunku, agimiz kamuya acik oldugundan, aramizdan biri yandaslarini salt oy versinler diye aga cagirabilir. Boyle bisey olacagini sandigimdan degil de kusku dusmesin oylamaya diye... Bu kurali uygularsak, Turkmath'in adinin degismesinden yana 4 kisi var: Haluk Demirbag, Naci Ozer, Selman Nas Bey'ler ve ben Ali. Karsi oy kullanan olmadi. "Onemli degil" diyen oldu. Umarim bu iyi niyetimin, demokratligimin bir kaniti olur. Oy verelim. Gercekten azinliktaysam, basinizi agritmam sonra. Oylamanin sonucuna razi olurum. Cogunluk boyle istiyormus derim, ve sesim kisilir. Ne kuserim, ne surat asarim. En azindan belli etmem. Eger, bu ad sorunu onemli degilse, bir kahvelik hatirim kalsin. Ne bir kahveligi, bir kahvehanelik! Ali ========================================================================= Date: Fri, 8 Nov 91 10:07:07 TUR Reply-To: Turkish Mathematician's Discussion List TURKMATH Sender: Turkish Mathematician's Discussion List TURKMATH From: Bulent Karasozen Subject: Matematik Dunyasi Sayin TURKMATH uyeleri, Yaklasik bir yildir Turk Matematik Dernegi tarafindan UNESCO'nun katkilariyla Matematik Dunyasi adli bir dergi yayinlanmaktadir. Dergi matematige ilgi duyan herkese acik olup ozellikle orta ogretimde ve toplumda matematige ilginin artmasini amaclamaktadir. Dergi iki ayda bir yayinlanmaktadir. Su ana kadar uc sayisi yayinlanmis olup, dorduncusu baskidadir. Yurtici tek nusha satis fiyati bu yil icin 3000 TL olup, yillik abonman ucreti yine bu yil icin 10000 TL dir. Yurtdisina gonderimlerde buna posta ucretinin de eklenmesi gerekmektedir. Ilgi duyan arkadaslar tanitma amaciyla bir nusha gondermek istiyoruz. Bu arkadaslarin adreslerini bildirmelerini rica ederiz. Saygilarimla. Bulent Karasozen ========================================================================= Date: Fri, 8 Nov 91 11:18:58 +0200 Reply-To: Turkish Mathematician's Discussion List TURKMATH Sender: Turkish Mathematician's Discussion List TURKMATH From: Mustafa Akgul Subject: Turkmath veri tabani Bu mesaji dun Net'e gectim ama bir nedenle dagilmadi. Ekteki oneriyi okuyun: elestri ve onerileri bekliyorum. ama LUTFEN FORMLARI HENUZ GONDERMEYIN. Ben sonra nereye nasil gonderilecegini duyuracagim. \basla \name< ....> \title<...> \institution<....> \dept< > \email< > \email<..> \smail< > \officephone< > \homephone< > \fax< > \telex< > \keywords< > \subjectclass< > \description< > \notes< > \bitti Aciklamalar Benim dusundugum TeX formatinda bir data base. Gerektiginde TeX'den hard copy bastirabilmek. Uye olmiyan Turk matematikcilerini de bu data base'e dahil etmek (isteyenleri tabii). Su anda bir suru universite enet'e dahil degil. Sanirim isimler genellikle acik. istedigim gerekli bilginin \name biciminde yazilmasi. Gerekli bilgi < > arasinda yazilmasi TeX acisindan bir kolaylik yaratacak, ayrica umarim AWK gibi programlarda da kullanilabilir. \email'i iki kere yazdim. Burada demek istedigim, ozellikle yurt disindaki EDU disindaki arkadaslar icin anlamli, alternate adresleri vermek. Bazan bazi adreslere Turkiye'den ulasmak mumkun olmuyor. O nedenle alternatif adres vermekte yarar var. \dept department'i belirtiyor; benim dusundugum bu bilginin adres'ten bagimsiz verilmesi; terkar ama ben yararli olacagi kanisindayim. \subjectclass< >, MR subject classification'daki numaralar, mumkun oldugunca `precise' verilmesini oneririm. \keywords<..>, o kadar precise olmazsa da ana basliklari icermeli: fonksiyonel analiz, cebirsel geometri, optimizasyon gibi, \description< > da amacladigim herkesin kendi kelimelweriyle calisma alanini vermesi. \notes< > ise bunlarin disinda yazilmasinda yarar gorulen oteki seyler. MATEMATIK IFADELER ve TURKCE AKSANLAR \description< > ve \notes< > de sayet matematik semboller kullanmak gerekirse bunun basit TeX formatinda yazilmasinda yarar var. Sayet semboller plain TeX ve LaTeX'de var ise onlarin kullanilmasi. AKSANLARA gelince: Ben bunlarin EASYTURK.STY'le yazilmasini oneririm. esayturk.sty TeX/LaTeX icin gelistirilmis turkce aksanlari yazmaya yarayan macrolar'i iceren dosyanin adi. Bu sty'de cok kullanilan aksanlar icin harfin onune = koymak yetiyor. (matematik anlamda = istiyenler, ='ligi matematik icinde rahatca kullanabilirler). Boylece =u =U =o =O =c =C =g =G =s =S =i =I bilinen standard aksanlari uretiyor, sapka yada ^ aksani icin ise harfin onune ! (unlem) konuyor: boylece !a !A !u !U !i !I ise bu tur aksanlari uretiyor. Bu sty file'i TeX icinde kullanmak istiyenler YUNUS FILELIST'den alabilirler ( Su anda FILELIST'e konmamis durumda ama bir-iki gun icinde koyacagiz). ========================================================================= Date: Fri, 8 Nov 91 11:22:17 +0200 Reply-To: Turkish Mathematician's Discussion List TURKMATH Sender: Turkish Mathematician's Discussion List TURKMATH From: Mustafa Akgul Subject: ARCHIE : archieve of archieve servers The ARCHIE Mail Server HELP for the archie mail server, as of 31 Oct, 1991 (modified from the KISS help file) Requests to this server should be addressed to archie@cs.mcgill.ca To contact us humans, mail to archie-l@cs.mcgill.ca For your information anonymous FTP may be performed through the mail by an ftp-mail server. Send a message with the word 'help' in it to: ftpmail@decwrl.dec.com for an explanations on how to use it. NOTE: The BITFTP server at Princeton no longer accepts requests from non-BITNET sites. If you *are* at a BITNET site you may use: bitftp@pucc.bitnet Send 'help' in a message to it. NOTE: The Subject: line is processed as if it were part of the main message body: no special keywords are required. Note that the "help" command is exclusive. All other commands in the same message are ignored. Command lines begin in the first column. All lines that do not match a valid commands are ignored. Results are now sorted by archive hostname in lexical order. An archie UNIX man page and it's straight ASCII text file equivalent are available on archie.mcgill.ca in the ~ftp/archie/doc directory as archie.man.roff and archie.man.txt respectively. If you would like this delivered by mail see 'manpage' command for more information. If you suspect that your results may exceed 45Kb in length, you should ask that they be compressed. See the 'compress' command below. We hope to automate this procedure (or split large requests) in the future. The server recognizes 10 commands. If a message not containing any valid requests or an empty message is received, it will be considered to be a 'help' request. path This lets the requestor override the address that would normally be extracted from the header. If you do not hear from the archive server within oh, about 2 days, you might consider adding a "path" command to your request. The path describes how to mail a message from cs.mcgill.ca to your address. cs.mcgill.ca is fully connected to the Internet. BITNET users can use the convention user@site.BITNET UUCP users can use the convention user@site.uucp help Will send you this message. prog [ ...] A search of the "archie" database is performed with each (a regular expression as defined by ed(1)) in turn, and any matches found are returned to the requestor. Note that multiple may be placed on one line, in which case the results will be mailed back to you in one message. If you have multiple "prog" lines, then multiple messages will be returned, one for each line [This doesn't work as expected at the moment... stay tuned]. Any regular expression containing spaces must be quoted with single (') or double (") quotes. ALL OTHER ed(1) rules must be followed. NOTE: The searches are CASE SENSITIVE. The ability to change this will hopefully be added soon. site | A listing of the given will be returned. The fully qualified domain name or IP address may be used. list [ ...] List all of the sites names currently stored in the database that match (a regular expression as defined by ed(1)). Multiple can be placed on one 'list' line [There maybe some problems with this while the format of the database is being reorganized. Try multiple 'list' lines if this doesn't work]. The format of the resulting list is: site name, site IP address and date last updated in the archie database. whatis [ ...] Search the Software Description Database (SDD) for (case insensitive). The SDD is a text database containing the names and short descriptions of about 3500 software packages, documents and datasets available on the Internet. If you have any corrections or additions, mail them to archie-admin@cs.mcgill.ca Multiple arguments may be placed on the same 'whatis' command line. servers List all the archie server hosts worldwide manpage ["txt" | "nroff"] Send a copy of the archie manual page. Without any arguments the preformatted ASCII manual page will be returned. This can also be specified with the "txt" argument. That is manpage txt Will return the preformatted manual page. The nroff (UNIX) manual format can be obtained by specifying the "nroff" argument. It is probably a good idea to use the compress command in conjunction with this request, if you have access to the UNIX compress(1) and uudecode(1) utilities. compress ALL of your files in the current mail message will be "compressed" and "uuencoded". When you receive the reply, remove everything before the "begin" line and run it through "uudecode". This will produce a .Z file. You can then run "uncompress" on this file and get the results of your request. quit Nothing past this point is interpreted. This is provided so that the occasional lost soul whose signature contains a line that looks like a command can still use the server without getting a bogus response. ========================================================================= Date: Fri, 8 Nov 91 16:01:25 SET Reply-To: Turkish Mathematician's Discussion List TURKMATH Sender: Turkish Mathematician's Discussion List TURKMATH From: Erdal Guzyurdu Subject: Turkmat Bence de turkmat olmasi lazim madem oylama yapiliyor bende turkmat diyeyim.. bir ogrenci ========================================================================= Date: Fri, 8 Nov 91 09:30:00 PST Reply-To: Turkish Mathematician's Discussion List TURKMATH Sender: Turkish Mathematician's Discussion List TURKMATH From: ANESIN@UCIVMSC Subject: Turkmath'in adi Turkmath adi tartismasini actigimda, tartismanin bu derece sertlesecegini dusunemedim. Daha birbirimizi tanimadan, birbirimize isinmadan tartismanin sertlesmesi, polemige donmesi iyi olmadi. Mustafa Akgul'un de onerisine uyarak tartismayi simdilik kesmemizi oneriyorum. Daha ileri bir tarihte, katilim arttiginda, dostluklar ilerlediginde, tartismanin iliskileri zedelemeyecegi bir anda tartismayi ve oylamayi yeniden gundeme getirmemizi oneriyorum. Ali ========================================================================= Date: Fri, 8 Nov 91 20:58:05 +0200 Reply-To: Turkish Mathematician's Discussion List TURKMATH Sender: Turkish Mathematician's Discussion List TURKMATH From: Mustafa Akgul Subject: Re: Turkmath'in adi Ali Nesin'in onerisine katiliyorum. Once Listeyi adam edelim. Dunya daki tum Turk matematikcileri uye yapalim. Aramizda canli ve verimli bir diyalog olsun, Turkiye'deki universiteler network'a girsin, uye sayimiz `stabilize' olsun, ondan sonra adini tartisabiliriz. Yanliz adi, daha once de yazdigim gibi, Antakya'daki ulusal kongrede oylanmisti zaten. O zaman Turkmat onerisi yoktu ama, orada buyuk bir cogunluk o ismi kabul etmisti zaten. Saygilarimla ========================================================================= Date: Fri, 8 Nov 91 00:01:00 PST Reply-To: Turkish Mathematician's Discussion List TURKMATH Sender: Turkish Mathematician's Discussion List TURKMATH From: ANESIN@UCIVMSC Subject: Sevilen sayilar Birinci sinif bilgisayarcilara ders veriyorum bu yil. Ilk kez veriyorum bu dersi ve hosuma gidiyor. Dunku konu suydu: Diyelim bir bilgisayar programi yapacaksiniz. Program oyun oynayacak. Oyun soyle: 1'den 10'a dek bir tamsayi sececeksiniz, bilgisayar da tuttugunuz sayinin, ornegin 5'ten buyuk olup olmadigini soracak; buyukse, 6 yada 7'ye esit olup olmadigini soracak.. Yani evet-hayir oyunu. En sonunda bilgisayar bulacak elbet tuttugunuz sayiyi. Sonra sira sizde. Bilgisayar bir sayi tutacak, siz bilmeye calisacaksiniz. En cabuk kim bilirse kazanacak. Nasil bir program yapmali ki, bilgisayarin kazanma sansini arttirmali? Elbet her sayinin tutulma olasiligi ayniysa, sayilari ortadan bolmeye calisirsiniz. Ama her sayinin tutulma olasiligi ayni degilse, yani bazi sayilarin tutulma olasiligi daha fazlaysa, algoritma'yi degistirmeniz gerekir. Ornegin, 3 sayisinin tutulma olasiligi %99 ise, bilgisayarin ilk sorusu "tuttugun sayi 3'mu?" olmali ki %99 olasilikla bir soruda bilebilsin. Sinifa bir sapkayla girdim, 81 kisilik siniftan, kucuk bir kagida 1'den 10'a dek bir sayi yazmalarini istedim. Sonuc soyle oldu: 1 sayisini 3 kisi tuttu 2 sayisini 5 kisi tuttu 3 sayisini 8 kisi tuttu 4 sayisini 6 kisi tuttu 5 sayisini 10 kisi tuttu 6 sayisini 10 kisi tuttu 7 sayisini 19 kisi tuttu 8 sayisini 7 kisi tuttu 9 sayisini 8 kisi tuttu 10 sayisini 5 kisi tuttu. Yarina verdigim odev: oyle bir bilgisayar programi yapin ki, bilgisayar, yukaridaki olasiliklara uygun olarak tutulan bir sayiyi olabildigince cabuk bulabilsin. Yani eger program, i sayisini s_i soru sorarak buluyorsa, (3s_1 + 5s_2 + 8s_3 + .... + 5s_10)/81 sayisi minimal olsun. Huffman adli bir adamin gelistirdigi guzel bir algoritma var. Bu tur sorulari cozuyor. Asagi yukari her dort kisiden biri 7 sayisini secti. Elbet kulturden kaynaklaniyor bu secim. Turkiye'de ayni deneyi yapan oldu mu? Ve sonuc nasildi? Ali ========================================================================= Date: Sun, 10 Nov 91 22:30:10 +0200 Reply-To: Turkish Mathematician's Discussion List TURKMATH Sender: Turkish Mathematician's Discussion List TURKMATH From: Sinan Sertoz Asagidaki mektup Notices of the American Mathematical Society, October 1991, Vol 38, No 8'de cikti: Value of AMS membership Thank you for your kind invitation to rejoin the AMS. However, AMS membership may be the least value for the most money of all professional societies. I began to realize the low benefit/cost ratio of AMS membership after joining the American Society of Heating, Refrigerating & Air Conditioning Engineers (ASHRAE) and later the Institute of Electrical and Electronics Engineers (IEEE). In both organizations there are local support groups, active lobbying at all levels, a monthly superb journal of general interest, an at least quarterly newspaper, very low cost subscription to technical journals, and other benefits. For example, yearly dues to ASHRAE include a high quality, cloth bound 9x14, 600 page new edition of one of the four handbooks of standard practices. Or with IEEE membership comes subscriptions to prestigious monthly journals such as Trans. Auto. Control plus the monthly Control Systems Magazine, together costing only additional $15. The AMS Notices is amateurish when compared to IEEE Spectrum. Both ASHRAE and IEEE make a sincere commitment to bettering the professional well-being of the rank and file member. In contrast AMS reenforces the present quaint, elitist, and professionally suicidal attitudes within the mathematical community. Much of the classical mathematics was developed to compensate for a lack of computing power. Now the computing power exists and mathematics is forever changed. Yet the AMS, run by troglodytes from the waning disciplines, conduct business as usual. The refereeing system and journal backlogs are a disgrace- of no pressing concern to the entrenched, who belong to preprint closed-loops that guarantee publication, but terminally discouraging to the young researcher. The talent flows elsewhere. Reports such as the COMAP/Exxon survey, Math outside of math [see Notices April 1990, pages 408-411], show the bulk of advanced mathematics is being taught outside of mathematics departments. No wonder. We insist on teaching what our clients do not need nor want to know. The mathematical workers that will be remembered from this era will be the non-mathematicians (e.g., Hamming, Feigenbaum, Hopfield), for they are working on the relevant. Therefore, for these and other reasons, I must decline your invitation to rejoin the AMS. C.R. MacCluer Michigan State University. Yukaridaki mektupta sozu edilen yazi, Mathematics Outside of Mathematics Departments, S.A. Garfunkel ve G.S Young, matematik bolumleri disinda verilen matematik derslerinin icerigini ve neden bu dersleri matematik bolumlerinin vermedigini sorgulayan bir arastirmanin sonuclarini veriyor. Kisaca, matematik bolumleri disinda verilen matematik derslerinin iceriklerini ve derinliklerini yeterli bulmuslar. Bu derslerin niye matematik bolumlerinden istenmedigi sorusuna ise kabaca bes baslik altinda toplanabilecek cevaplar almislar: 1) The mathematics faculty does not know or appreciate applications, 2) Mathematics faculty teach mathematics as an art with full abstractions, not as a tool, 3) Topics span too many mathematics courses, 4) The mathematics departments have not kept up with new applied mathematics, 5) Mathematics courses do not give students the knowledge or the mathematical maturity for further work. Ayrica bu yazinin onemli iki cumlesi de soyle "... mathematics faculty are responsible for and content with this state of affairs." ve "... we have shared the results of this survey with a number of mathematicians and mathematics educators and seen no evidence of shock, dismay or surprise.". (Notices dergisinin bu sayisini bulamayanlara bu yazinin bir kopyasini gonderebilirim). Bu mektuptaki elestirilebilecek yonleri bir kenara birakiyorum. Ornegin cikan dergilerin sayisina ve fiyatina bakip dernege ona gore girmek zaten pek savunulamaz. Ayrica bir muzik okuluna gidip en cok satan plak ve kasetler sizin bolumun disinda besteleniyor diye elestiri yoneltmek de ne bunu soyleyeni yuceltir ne de o muzik okulunu kucultur. Benim asil tartismak istedigim yukaridaki mektubun hakli yanlari. Her applied matematikci kendi bildigi kadar matematigin disinda bir matematik olmadigini ve eger varsa da onlarin onemsiz oldugunu dusunur. Ornegin yukarda control teorisi calistigi belli olan MacCluer bunun disinda onemi olabilecek bir uygulamanin var olabileceginden suphelenmemekte. Bu ben merkezciligi doguran ise "cahil cesaretidir". Bu cahilligin sorumlusu yine matematikcilerin kendileri olsa gerek. Herkes kendi ihtiyaci olan matematigi elbette en onemli matematik diye sunacaktir. Matematik bolumlerindeki matematikciler kendi `fildisi kulelerinden' gercek dunyaya inip matematigin yaratilmasi yaninda ogretilmesi ve gunluk problemlere uygulanmasi konusuna da `tenezzul' etseler yukaridaki mektupta hem dile getirilen hem de sergilenen hastaliklar bu denli ilerlemezdi. Matematik ile uygulayicilari arasindaki kopukluk ki husmete donusup kemiklesmistir, kisa zamanda tamir edilemeyecek. Cunku yukarida da atifta bulunulan o "troglodyte"lar (fosiller) bu husumetin getirdigi kliklesmeler sayesinde "entrenched" (sandalye sahibi) olmuslardir. Yine yarini kurmak genclere kaliyor. Alinacak ilham ise cok cok gerilerde; Gauss bir yandan matematigin en teorik problemlerini inceliyor bir yandan elektromanyetik calisiyordu. Bir yandan Oklid disi geommetrilerin aksiyomlarini arastiriyor bir yandan elinde gozlem aletleri Almanya daglari uzerinde ucgenlerin ic acilarindaki sapmayi olcup yerkurenin egimini bulmaya calisiyordu. Poincare'ye hemen hemen herseyi bildigi icin "evrensel kume" deniyordu. Sonra ne oldu? Bazi seyleri bilmemek ovunulecek bir sey olamaya basladi. Bilgisizligimize mazeret olarak bilmeye tenezzul etmedigimizi soylemeye basladik. Ve ayni silah karsidan da bize atilmaya baslandi. Bu gun uygulayicilar matematigin pek cogunu bilmiyorlar ve bilmeye gerek olmadigini saniyorlar, tipki bizim gibi! Birbirimizden korkmadan, sirf meraktan, biraz daha matematik ogrenmeye tenezzul edemez miyiz? Sinan Sertoz ========================================================================= Date: Sat, 9 Nov 91 17:06:14 GMT Reply-To: Turkish Mathematician's Discussion List TURKMATH Sender: Turkish Mathematician's Discussion List TURKMATH From: rek@ABER.AC.UK Subject: yanlis isim Degerli Ilgililere: TURKMATH'e uyeligimin kabulu icin tesekkurler. Fakat ayni anda basvuru yaptigimiz 'ZIYA ARGUN' ile ismim karistirilmis anlasilan. username bana ait fakat isim ben degilim. Bu durumun duzeltilmesini rica ederim SAygilarimla RESAT KASAP ========================================================================= Date: Mon, 11 Nov 91 10:10:57 +0200 Reply-To: Turkish Mathematician's Discussion List TURKMATH Sender: Turkish Mathematician's Discussion List TURKMATH From: AKMAN@TRBILUN Subject: Re: Sevilen sayilar Ali Nesin'in sevilen sayilarla ilgili anekdotu ilgincti; zevkle okudum. Eger yanlis anlamadiysam (kusura bakmayin bugun Pazartesi, hani "I don't like Mondays" diyen sarkida oldugu gibi) anlattigi olay "Interpolation Search" denilen log-logaritmik arama yontemine uygun dusuyor. Bu gurupta ilk mesajim. Herkese en iyi dileklerle. Varol Akman ========================================================================= Date: Mon, 11 Nov 91 11:39:02 +0200 Reply-To: Turkish Mathematician's Discussion List TURKMATH Sender: Turkish Mathematician's Discussion List TURKMATH From: AKMAN@TRBILUN Subject: Re: Sevilen sayilar -> ozur Kusura bakmayin, Ali Nesin'in yukaridaki konuda mesajina verdigim yanit tam bir zirvalik oldu. Aslinda kendisinin zaten orijinal yazida belirttigi (ve benim atladigim) gibi Huffman's tree bu is icin bicilmis kaftan. Benim interpolation search zirvaligimi bagislayin. Hatami telafi icin belki su kaynagi belirtmem (ki Huffman's tree'yi bence cok guzel anlatiyor) bir bagislama nedeni olabilir: T. C. Hu, COMBINATORIAL ALGORITHMS, Addison-Wesley, 1982. -- Varol Akman Bilkent University, Ankara Logic is logic, that's all I say. - OLIVER WENDEL HOLMES ========================================================================= Date: Thu, 31 Oct 91 11:12:30 GMT Reply-To: Turkish Mathematician's Discussion List TURKMATH Sender: Turkish Mathematician's Discussion List TURKMATH From: Haluk DEMIRBAG Subject: NISS Bulletin Board - Section P1D _ |-| /-\ |_ |_| |< 8<--------------------------Buradan kesiniz-(C)------------------------>8 INFORMATION SHEETS (27-08-91) Information sheets are available from the Centre under various headings and subheadings; a list of these is given on page P1D1, correct up to the above date. Info sheets are available on request from the Centre by post or email. Let us know which ones you require We can be contacted on 021-414 4800 or ctimath @ bham. Some info sheets are available by automatic file server. You can get these by sending a very short message to cti-server @ bham. See page P1D2 for further details. P1D1: index of info sheets P1D2: how to obtain automatically 8<--------------------------Buradan kesiniz-(C)------------------------>8 ========================================================================= Date: Mon, 11 Nov 91 16:15:44 +0200 Reply-To: Turkish Mathematician's Discussion List TURKMATH Sender: Turkish Mathematician's Discussion List TURKMATH From: Mustafa Akgul Subject: Re: Sevilen sayilar -> ozur Huffman tree'nin Ali nesin'in problemi icin bicilmis kaftan oldugundan pek emin degilim. Bu biraz'da `seach' yada `querry' yontemine bagli. Hoffman tree coding icin optimal. Sayet search belirli bir sirayla sayilari = mi diye test edecekse, Hoffman tree'nin BFS ( Breath First Search)'le sorgulanmasi makul gozukur. Sayet sorulama binary degilse niye bir binary tree kuruluyor? Binary bir sorgulamanin da Hufmann tree'yle nasil yapilacagi bana acik degil. Bence binary sorgulama icin uygunu Tarjan'in Sleator ve Bent'le gelistirdigi biased search trees. Olasilik dagilimi belirli oldugunu gore optimal treee de kurulabilir. Varol'un ilk onerisi o kadar yanlis degildi gibi geliyor. Saygilar ========================================================================= Date: Sat, 9 Nov 91 12:20:02 GMT Reply-To: Turkish Mathematician's Discussion List TURKMATH Sender: Turkish Mathematician's Discussion List TURKMATH From: Haluk DEMIRBAG Subject: Re: Turkmat > > Bence de turkmat olmasi lazim madem oylama yapiliyor bende turkmat diyeyim.. > > bir ogrenci Varan 8... Ben sayiyorum... Benim yolladigim son iki mesajimi daha kac gun tutabileceksiniz? Bu aksam elime gecmez ise, uyelerin hepsine son iki mesajimi kendi ellerim ile yollayacagim... Iki dakikami alir... Son durum; TURKMAT'a evet diyenler 8, TURKMATh'a evet diyenler ise 0 (sifir)... _ |-| /-\ |_ |_| |< (TURKMAT'a evet, TURKMATh'a hayir.) ========================================================================= Date: Mon, 11 Nov 91 08:20:26 GMT Reply-To: Turkish Mathematician's Discussion List TURKMATH Sender: Turkish Mathematician's Discussion List TURKMATH From: Haluk DEMIRBAG Subject: Deneme(!) mesaji... Mesajlarim ile birileri oynuyor... Son iki mesajim islerine gelmediginden olacak dagitilmadi... Tekrarliyorum, birakin mesajlarimi. Kustahlik, rezalet, ayrilikcilik, nedir bu be? Aciklama yapilsin! Simdiye kadar yeterince kibar oldum... Yeter be! _ |-| /-\ |_ |_| |< (TURKMAT'a evet, TURKMATh'a hayir.) ========================================================================= Date: Tue, 12 Nov 91 11:29:12 +0200 Reply-To: Turkish Mathematician's Discussion List TURKMATH Sender: Turkish Mathematician's Discussion List TURKMATH From: Mustafa Akgul Subject: Re: Deneme(!) mesaji... Haluk arkadas gerektiginden fazla hassas davraniyor. Tum BITNET sistemi volunteer temelinde calisir. Haluk arkadasin 9'unda attigi mesaj bugun dagitildi. Bunun ozellikle yapildigi kanisinda. Bu yanlis bilgilenme ve `ehim'den kaynaklaniyor. Bu tavir network adabina uymuyor (`ehim' ``vehim'' olacakti). ODTU'deki arkadaslarin birlerinin mesajini kontrol etmek icin ne vakitleri var Mesaj ODTU'ye gec ulasmis olabilir, yada ODTU'nun isinin yogunlugu nedeniyle gec dagilmis olabilir. Benim gonderdigim bir suru file dagilmadi bile. Software'de bug bile olabilir. Bu sadece TURKMATH'de degil YUNUS ve DOST'da oldu bir kac kere. Lutfen bir birimize karsi daha saygili olalim. Anlasilan Haluk arkadas Ali Nesin ve benim Oylama ile ilgili mesajimizi almamisti o zman. Lutfen TURKMAT konusunda artik yazisma yapmayalim. Saygilar Mustafa Akgul ========================================================================= Date: Tue, 12 Nov 91 11:24:42 TUR Reply-To: Turkish Mathematician's Discussion List TURKMATH Sender: Turkish Mathematician's Discussion List TURKMATH From: Tezer Subject: yeter Selam, Insanlarimizin hala,kisir dongu icinde olduklarini gordukce hem uzuluyorum hem de kiziyorum.Degisin beyler, caga ayak uydurun.Tabii ki, Milliyetcilik olmal` , ama kafalarinizi degistirmediginiz zaman yaptiginiz bilimin hic kimseye faydasi olmaz.Bu agin kurulma amaci aramizdaki iletisimi bilimsel acidan kolaylastirmakti.Ama bizler ne yapiyoruz.Bir <<< h >>>> harfiyle ugrasiyoruz.Herseyin bir kolayi oldugu gibi , zaman icinde adimizida degistirebiliriz.Demokratik bir ag olduguna gore bu da kolay. Madem oyle, bende oyumu inat olsun diye soyleyim. Simdi hic birsey yapmayalim. Katilimi artiralim.Sonra gereken neyse hep beraber kararini verelim. sayg`lar`mla TEZER SONMEZ METUCC - ANKARA ========================================================================= Date: Tue, 12 Nov 91 11:42:45 +0200 Reply-To: Turkish Mathematician's Discussion List TURKMATH Sender: Turkish Mathematician's Discussion List TURKMATH From: Erdal Arikan Subject: Re: Sevilen sayilar -> ozur Mustafa Akgul'un notu uzerine.. Huffman tree search icin de kullanilabilir. Huffman tree yalnizca binary duruma sinirli degil; d-ary search icin de optimal. Erdal Arikan ========================================================================= Date: Tue, 12 Nov 91 11:54:27 +0200 Reply-To: Turkish Mathematician's Discussion List TURKMATH Sender: Turkish Mathematician's Discussion List TURKMATH From: Mustafa Akgul Subject: Re: Sevilen sayilar -> ozur Huffman tree, d-ary yapmak mumkun. Ali'nin ogreginde nasil sorgulama yapacaksin? Ben hala goremiyorum. ========================================================================= Date: Tue, 12 Nov 91 12:46:00 GMT Reply-To: Turkish Mathematician's Discussion List TURKMATH Sender: Turkish Mathematician's Discussion List TURKMATH From: MAP002@VAXA.BANGOR.AC.UK Subject: Re: Turkmat turkmat'a evet, turkmath'a hayir ========================================================================= Date: Fri, 8 Nov 91 16:26:51 GMT Reply-To: Turkish Mathematician's Discussion List TURKMATH Sender: Turkish Mathematician's Discussion List TURKMATH From: Haluk DEMIRBAG Subject: Re: Matematik Dunyasi > > Sayin TURKMATH uyeleri, > Yaklasik bir yildir Turk Matematik Dernegi tarafindan UNESCO'nun katkilariyla > Matematik Dunyasi adli bir dergi yayinlanmaktadir. Dergi matematige ilgi > duyan herkese acik olup ozellikle orta ogretimde ve toplumda matematige > ilginin artmasini amaclamaktadir. Dergi iki ayda bir yayinlanmaktadir. > Su ana kadar uc sayisi yayinlanmis olup, dorduncusu baskidadir. > Yurtici tek nusha satis fiyati bu yil icin 3000 TL olup, yillik abonman > ucreti yine bu yil icin 10000 TL dir. Yurtdisina gonderimlerde buna > posta ucretinin de eklenmesi gerekmektedir. > Ilgi duyan arkadaslar tanitma amaciyla bir nusha gondermek istiyoruz. > Bu arkadaslarin adreslerini bildirmelerini rica ederiz. > Saygilarimla. > Bulent Karasozen Haluk Demirbag Department of Textile Industries, The University, Leeds, LS2 9JT, ENGLAND _ |-| /-\ |_ |_| |< (TURKMAT'a evet, TURKMATh'a hayir.) ========================================================================= Date: Fri, 8 Nov 91 16:15:03 GMT Reply-To: Turkish Mathematician's Discussion List TURKMATH Sender: Turkish Mathematician's Discussion List TURKMATH From: Haluk DEMIRBAG Subject: MATlab MATlab'dan ibret alalim, gormek ve bakmak... Asagidakiler Turk matematikcilerinin ilgisini ceker dusuncesi ile... _ |-| /-\ |_ |_| |< (TURKMAT'a evet, TURKMATh'a hayir.) 8<--------------------------Buradan kesiniz-(C)------------------1----->8 NISS Bulletin Board - Section P1E4 MATLAB User Group software archive (05-07-91) ============================================= The software archive currently contains a diverse collection of Matlab M-files and utility files that are of general interest. When you sign up for the User Group (see page P1F6 for details) you will receive instructions on how to submit and obtain archive files, as well as back issues of the Matlab Digest, a collection of MUG members' comments, questions and user tips compiled and sent out by Chris Bischof at Argonne National Laboratory. The user group strongly encourages you to submit your own M-files to the archive; those functions may be exactly what another Matlab user is looking for! 8<--------------------------Buradan kesiniz-(C)------------------2----->8 NISS Bulletin Board - Section P1F6 MATLAB User Group (05-07-91) ============================ This currently numbers of 1500 members from over 29 countries. Send an email message with your email and physical mailing address to: matlab-users-request @ mcs.anl.gov You will receive instructions on how to submit and obtain files from the software archive (see page P1E4), as well as back issues of the Matlab Digest, a collection of MUG members' comments, questions and user tips compiled and sent out by Chris Bischof at Argonne National Laboratory. 8<--------------------------Buradan kesiniz-(C)------------------------>8 ========================================================================= Date: Mon, 11 Nov 91 22:30:00 PST Reply-To: Turkish Mathematician's Discussion List TURKMATH Sender: Turkish Mathematician's Discussion List TURKMATH From: ANESIN@UCIVMSC Subject: Huffman'in algoritmasi (?) Okuldan bir hocanin yazdigi ve derslerimi anlatmak icin yararlandigim notlarda Huffman'in algoritmasini anlatiyor. Bunun gercekten Huffman'in algoritmasi olup olmadigini bilmiyorum. Konuyu daha iyi ogrendikce notlara guvenilmemesi gerektigini de ogrendim. Ama, notlarda Huffman adi verilen algoritmanin soruyu cozdugune eminim. Varol Akman'in kaynakca verdigi Hu'nun kitabina da bakacagim ayrica (kendisine tesekkur ederim). Algoritmayi anlatayim. p_1, ... , p_m sayilari m olayin (event) olasiliklari olsun (p_1 + ... + p_m = 1). Oyle m yaprakli bir "binary tree" kurmaliyiz ve bu agacin her yapragina p_1, ... , p_m sayilarini oyle yerlestirmeliyiz ki, eger s_i tamsayisi, agacin kokunden i-ninci yapragina olan uzakligiysa, p_1s_1 + .... + p_ms_m sayisi, olabildigince kucuk bir sayi olsun. (Agacin her noktasi, bir soruyu simgeliyor ve s_i = bilgisayarin i olasiligini bulmak icin sordugu sayi sayisi). Bu agaci tumevarimla bulacagiz. Bu agaca, "(p_1, ... , p_m) icin en kucuk agac" adini vereyim bu yazilik. Birinci $IK: m = 2. Iki yaprakli agac isi gorur. Ikinci $IK: p_1, ... , p_{m+1} olasiliklarimiz olsun. Once bu olasilik sayilarini buyukten kucuge yazalim, ve p_1 > p_2 > .... > p_m > p_{m+1} oldugunu varsayalim (burada > simgesi, "> yada =" anlamina geliyor). Tumevarim varsayimiyla, p_1, ... , p_{m-1}, p_m + p_{m+1} olasiliklari icin en kucuk bir agac vardir. Bu agacin p_m + p_{m+1} yapragina iki dal ekleyip, bu dalin uclarina p_m ve p_{m+1} olasiliklarini yerlestirelim. Elde ettigimiz yeni agac, p_1, ... , p_m, p_{m+1} icin en kucuk agactir. Bu agacin gercekten en kucuk agac oldugu da tumevarimla kanitlaniyor elbet. Bir hinlik disinda kanit oldukca kolay. Istek olursa gecerim kaniti. Ali ========================================================================= Date: Thu, 31 Oct 91 09:39:10 GMT Reply-To: Turkish Mathematician's Discussion List TURKMATH Sender: Turkish Mathematician's Discussion List TURKMATH From: Haluk DEMIRBAG Subject: Re: HOLDer'lar.. On Tue,29 Oct 91 10:52:10 +0200 Mustafa Akgul der ki; > Sizin mesajlariniz 5 gun sonra dagitildi. Gene de memnun olmalisiniz. TURKMATh'in saglikli olarak calismasini ben de isterim. Adinin TURKMAT olmasi ve isminin Turkcelestirilmesini istedigim gibi! > TRMETU-TREARN arasi bir kac gundur kapaliydi ve 1200 tane file yolda > KAYBOLDU. Aciklamaniz icin cok tesekkur ederim... > Biraz daha anlayisli olun. Maalesef gercek bu su anda. Siz de yurt disinda ulkesine olumlu katkida bulunmak isteyenler icin bi- razcik anlayisli olabilir mi idiniz? Lutfen oylama yapin... Benim oyum TURKMATH isminin TURKMAT ve tanim satirinin da Turkce olmasi seklinde... Tesekkur ederim. > Saygilar Herkesin Cumhuriyet bayrami kutlu olsun... _ |-| /-\ |_ |_| |< [The scenery in the play was beautiful, but the actors got in front of it. Alexander Woollcott] ========================================================================= Date: Thu, 31 Oct 91 11:12:30 GMT Reply-To: Turkish Mathematician's Discussion List TURKMATH Sender: Turkish Mathematician's Discussion List TURKMATH From: Haluk DEMIRBAG Subject: NISS Bulletin Board - Section P1D _ |-| /-\ |_ |_| |< 8<--------------------------Buradan kesiniz-(C)------------------------>8 INFORMATION SHEETS (27-08-91) Information sheets are available from the Centre under various headings and subheadings; a list of these is given on page P1D1, correct up to the above date. Info sheets are available on request from the Centre by post or email. Let us know which ones you require We can be contacted on 021-414 4800 or ctimath @ bham. Some info sheets are available by automatic file server. You can get these by sending a very short message to cti-server @ bham. See page P1D2 for further details. P1D1: index of info sheets P1D2: how to obtain automatically 8<--------------------------Buradan kesiniz-(C)------------------------>8 ========================================================================= Date: Wed, 13 Nov 91 21:25:00 GMT Reply-To: Turkish Mathematician's Discussion List TURKMATH Sender: Turkish Mathematician's Discussion List TURKMATH From: Haluk DEMIRBAG Subject: Re: Turkmat > > turkmat'a evet, turkmath'a hayir Varan 9... Asagidakileri ikinci defa aliyor olabilirsiniz, onemli olabilir diye sansa birakmiyorum... _ |-| /-\ |_ |_| |< (TURKMAT'a evet, TURKMATh'a hayir.) 8<--------------------------Buradan kesiniz-(C)------------------------>8 NISS Bulletin Board - Section P1F5 REDUCE Mailing List (01-05-90) ============================== This list had over 100 members at NOV-88. To join, mail to: reduce-forum-request@nsf or: reduce-forum-request@org.rand@EARN-RELAY Queries, bug reports, etc. should be sent to: reduce@org.rand@EARN-RELAY There is also a REDUCE network library - see section F2B for details. 8<--------------------------Buradan kesiniz-(C)------------------------>8 NISS Bulletin Board - Section P1F6 MATLAB User Group (05-07-91) ============================ This currently numbers of 1500 members from over 29 countries. Send an email message with your email and physical mailing address to: matlab-users-request @ mcs.anl.gov You will receive instructions on how to submit and obtain files from the software archive (see page P1E4), as well as back issues of the Matlab Digest, a collection of MUG members' comments, questions and user tips compiled and sent out by Chris Bischof at Argonne National Laboratory. 8<--------------------------Buradan kesiniz-(C)------------------------>8 ========================================================================= Date: Wed, 13 Nov 91 16:20:00 EST Reply-To: Turkish Mathematician's Discussion List TURKMATH Sender: Turkish Mathematician's Discussion List TURKMATH From: ROSS@LCC.EDU Lansing Community College, 13-NOV-1991 To those at METU, Department Of Mathematics, I have been asked to say hello from Ayla Ayalp, Belgin Karaman, Yidiray Ozan and Muhiddin Uguz. Dale Ross ROSS@LCC.EDU ========================================================================= Date: Wed, 13 Nov 91 22:15:00 PST Reply-To: Turkish Mathematician's Discussion List TURKMATH Sender: Turkish Mathematician's Discussion List TURKMATH From: ANESIN@UCIVMSC Subject: Mustafa Akgul'un Huffman'a itirazi uzerine Eger, makina "tuttugun sayi {1,3,4,7} kumesinde mi?" gibi herhangi bir soru sorabiliyorsa, Hufmann'in agaci algoritmayi veriyor. Bunda anlasiyoruz galiba. Mustafa Akgul'un sorusu ilginc. Dogru anladiysam sunu soruyor: Eger makinanin, yalniz "tuttugun sayi n'den buyuk mudur?" turunden sorular sorabildigini varsayarsak algoritma nedir? Huffman'in agacinin bu soruya yanit verip vermedigini bilmiyorum. Sanki verirmis gibi bir duygu vardi, ama gecti simdi. Aklima bir algoritma geldi. Pek sevmedim. Yine de geceyim: Tutabilecegimiz sayilar {1, .... , N} kumesinde olsun. Bu kumeden herhangi bir n sayisi secelim. Ilk soru "tuttugun sayi n'den buyuk mudur?" olsun. Boylece iki dal elde ettik. Tumevarimla, her iki dala gelecek en ekonomik agaci biliyoruz. Bu iki agaci, iki dala ekleyelim, ve boylece elde ettigimiz buyuk agaca T(n) adini verelim. T(n)'in "ortalama soru sayisini" kolayca hesaplayabiliriz (iki kucuk agacin "ortalama soru sayisini" kullanan bir cebirsel formulle bulunur). Bu sayi Ort(n) olsun. Simdi {Ort(1), ... , Ort(N)} kumesinin en kucuk sayisi bulalim. Diyelim Ort(m) bu sayi. T(m) optimum agactir. Ali ========================================================================= Date: Thu, 14 Nov 91 09:02:49 +0200 Reply-To: Turkish Mathematician's Discussion List TURKMATH Sender: Turkish Mathematician's Discussion List TURKMATH From: Mustafa Akgul Subject: Re: Mustafa Akgul'un Huffman'a itirazi uzerine Ali'nin sorusunun cevabi sanirim coktan biliniyor. cesitli turden binary trees. En son kaynaklar, Sleator-Tarjan-Bengt ( alt kumeleri dahil), biased search trees. bir suru yerde cikti. Siam Computing'de en azindan bazi lari bulunabilir ========================================================================= Date: Thu, 14 Nov 91 11:09:14 TUR Reply-To: Turkish Mathematician's Discussion List TURKMATH Sender: Turkish Mathematician's Discussion List TURKMATH From: tosun terrzioglu In-Reply-To: Message of Wed, 13 Nov 91 16:20:00 EST from Thank you for the message from Ayla ,Belgin,Muhittin and Yildiray. Could you please say HELLO from us at METU-Math department? We also would like to congragulate Yildiray.Thank you. ========================================================================= Date: Thu, 14 Nov 91 11:23:26 +0200 Reply-To: Turkish Mathematician's Discussion List TURKMATH Sender: Turkish Mathematician's Discussion List TURKMATH From: Mustafa Akgul Subject: Bir Rica Lutfen gelen mail'lere cevap verirken dikkatli olalim. Bir kisiye yazmak yerine listeye YAZMAYALIM. Bu hem network'deki trafigi gereksiz yere artirmayacak, hemde uyeleri biktirmiyacaktir. Ayla, Belgin, Muhittin ve Yildiray arkadaslara gelince: (Her ne kadar selam sadece ODTU'deki arkadaslara geldiyse de) Ben obnlari `PROTESTO EDIYORUM' . Musadenizle aciklayayim: ODTU disindakilere selam gondermedikleri icin degil. Ama once e-mail'i ogrenip o mesaji kendileri gecebilirdi. Daha onemlisi, TURKMATH'a uye olup, kendi mesajlarini gecebilirler, ve hizim `cok bilimsel' tartismalarimiza katkida bulunabilirlerdi. Bu arkadaslari TURKMATH'a uye olmaya cagiriyorum. (Bu meyanda bir mesaji ROSS'a ilettim zaten) Saygilar ========================================================================= Date: Thu, 14 Nov 91 09:33:00 GMT Reply-To: Turkish Mathematician's Discussion List TURKMATH Sender: Turkish Mathematician's Discussion List TURKMATH From: MAP006@VAXA.BANGOR.AC.UK TURKMATH' a HAYIR , TURKMAT 'A EVET ========================================================================= Date: Thu, 14 Nov 91 09:35:00 GMT Reply-To: Turkish Mathematician's Discussion List TURKMATH Sender: Turkish Mathematician's Discussion List TURKMATH From: MAP006@VAXA.BANGOR.AC.UK Subject: OY TURKMATH 'A HAYIR TURKMAT 'EVET NEBI ONDER ========================================================================= Date: Thu, 14 Nov 91 12:52:00 GMT Reply-To: Turkish Mathematician's Discussion List TURKMATH Sender: Turkish Mathematician's Discussion List TURKMATH From: MAP002@VAXA.BANGOR.AC.UK Subject: RE: OY TURKMAT'A EVET, TURKMATH'A HAYIR T.GEYIKLI ========================================================================= Date: Thu, 14 Nov 91 15:53:55 TUR Reply-To: Turkish Mathematician's Discussion List TURKMATH Sender: Turkish Mathematician's Discussion List TURKMATH Comments: Resent-From: Yavuz Darendelioglu Comments: Originally-From: Haluk DEMIRBAG From: Yavuz Darendelioglu Subject: TURKMATh > TURKMAT ----------------------------Original message---------------------------- Mon, 11 Nov 91 17:35:00, "Re: TURKMATh" konulu DOST'taki yaziniza cevap: > Neynis bu TURKMATh in engelleme isi anlamadim. Anlatsaniz > memnun olurum. Tesekkurler. > Ali Muni Seden Sayin Seden, Turkiye'de ODTU'de (TRMETU.BITNET) LISTSERVer uzerinde TURKMATH isimli bir liste acildi, listenin adi "Turkish Mathematician's Discussion List", adinda "Turk" kelimesi var, adi Ingilizce ve dili Turkce (by default)... Su anda liste uyesi 9 kisi adinin degistirilmesini istiyor, digerleri oy kullanmadi henuz... Yani adinin TURKAMTH'tan TURKMAT'a degistirilmesi- ni ve isminin de Turkcelestirilmesini istiyoruz... Fakat liste sahipleri dikkate almadiklari gibi oradan "birileri" benim TURKMATH'a yolladigim mesajlari ayiklayip, dagitilmasina engel oluyor... Konu kisaca bu, TURKMATH'taki eski yazismalari LOG dosyalarindan alabilirsiniz... Cesitli dusunceler olabilir, ama ben TURKMATH'i Turkcelestirilmesini istiyorum, baska 8 kisi gibi... Yanliz olsam bile buralarda savasmaya yemin ettim! Bu gidis ile, birakin Amerika'daki cocuklari Turkiye'deki aydinlar Ingilizce konusmak zorunda birakilangiller familaysina dahil olacaklar, tum DOST'lari bu konuda oy vermeye davet ediyorum... Aksi taktirde dusunenlere saygi duymak ile beraber, supheli gozler ile bakmak durumunda kalacagim... 10 Kasim gunu gecti, TURKMATH'in adi halen TURKMATH... Saygilarim ile... _ |-| /-\ |_ |_| |< (TURKMAT'a evet, TURKMATh'a hayir.) ========================================================================= Date: Thu, 14 Nov 91 16:28:02 +0200 Reply-To: Turkish Mathematician's Discussion List TURKMATH Sender: Turkish Mathematician's Discussion List TURKMATH From: Erdal Arikan Subject: Re: Mustafa Akgul'un Huffman'a itirazi uzerine Akgul'un belirttigi bicimde sorulari sinirlarsak, kodlama teorisinde lexicographic adi verilen kodlar search icin kullanilabilir. Bu durumda Huffman algoritmasi calismiyor Akgul'un belirttigi gibi, ve optimal kodu veren basit bir algoritma bildigim kadariyla bilinmiyor. Konuyla ilgili iyi bir referans var: Gilbert, E.N. and Moore, E.F., Variable length binary encodings, Bell System Technical Journal, vol. 38, pp. 933-967, 1959. Ayrica, kodlarin search stratejisi olarak kullanilabilecegi konusunda ilk referrans da herhalde: Sobel, M. Group testing to efficiently classify all defectives in a binomial sample. In: Information and Decision Processes (ed. Machol, R.E.) Mc Graw Hill, N.Y. pp. 127-161. ========================================================================= Date: Thu, 14 Nov 91 16:40:32 +0200 Reply-To: Turkish Mathematician's Discussion List TURKMATH Sender: Turkish Mathematician's Discussion List TURKMATH From: AKMAN@TRBILUN Subject: son isim tartismalari uzerine WITTGENSTEIN: He is too long-winded, he keeps on saying the same thing over and over again. When I read him I always wanted to say "Oh all right, I agree, I agree, but please get on with it." - Varol Akman Bilkent Universitesi, Ankara - Varol Akman Bilkent University, Ankara Logic is logic, that's all I say. - OLIVER WENDEL HOLMES ========================================================================= Date: Thu, 14 Nov 91 13:30:39 GMT Reply-To: Turkish Mathematician's Discussion List TURKMATH Sender: Turkish Mathematician's Discussion List TURKMATH From: zia@ABER.AC.UK Subject: oylama TURKMATH'A HAYIR TURKMAT'A EVET ZIYA ARGUN ========================================================================= Date: Thu, 14 Nov 91 13:13:39 GMT Reply-To: Turkish Mathematician's Discussion List TURKMATH Sender: Turkish Mathematician's Discussion List TURKMATH From: hud@ABER.AC.UK Subject: oylama Artik dayanamadigim icin ben de bu konuda oyumu sunuyorum. TURKMAT'A EVET. Ayricada buradaki butun yazismalarda guzel Turkcemizin kullanilmasi icinde Ayriyetten bir EVET daha. Huseyin Demir ========================================================================= Date: Fri, 15 Nov 91 18:44:39 GMT Reply-To: Turkish Mathematician's Discussion List TURKMATH Sender: Turkish Mathematician's Discussion List TURKMATH From: Haluk DEMIRBAG Subject: Re: OY > > TURKMATH 'A HAYIR TURKMAT 'EVET > NEBI ONDER Varan 10... _ |-| /-\ |_ |_| |< (TURKMAT'a evet, TURKMATh'a hayir.) 8<--------------------------Buradan kesiniz-(C)------------------------>8 NISS Bulletin Board - Section P1D1 INDEX TO INFORMATION SHEETS AVAILABLE (27-08-91) Heading: general Subheads: the centre, seminar, diary, index, accommodation Heading: package Subheads: calm, derive, citext, mathematica, questionnaires, tex Heading: workshop Date: Subhead: computer algebra 14-07-89 engineering maths 15-09-89 time series 05-04-90 discrete maths 15-06-90 numerical maths 21-09-90 optimisation 21-11-90 applied maths 10-01-91 minitab 03-01-91 matlab 19-03-91 cont.. Heading: review Subheads: as below Most reviews are contained in newsletters as dated below. Some are available as info sheets, by surface or email. cas1: Reaction on meeting REDUCE and DERIVE (Feb 90) cas2: Letter in response to this (May 90) cas3: Computer algebra systems at Poly South-West and Paisley College (Aug 90) cas4: Using DERIVE to enhance maths teaching (Nov 90) cas5: DERIVE version 2.01 Review (Feb 91) cas6: REDUCE and its use in teaching (Aug 91) cas7: Teaching with Mathematica (Aug 91) bbcmac: Turn your Mac into a BBC Micro (Feb 91) blss: Draft of a BLSS review for "American Statistician" cia: Confidence Interval Analysis (May 90) exp: Review of EXP (Aug 91) form1: Review of Formula/One (Aug 91) formu: Formulator: wysiwyg maths typesetting (May 91) gina: Review of Graphs in Numerical Analysis (Nov 90) kaleid: Review of Kaleidagraph (May 91) logo: Non-Euclidean Geometry with Logo (Aug 91) mathcad: MathCAD in Mathematics Teaching (Feb 91) mathtype: MathType Review (Feb 91) matlab1: Review of MATLAB (Feb 90) matlab2: MATLAB in teaching Applied Maths (Aug 91) milo: Milo: an intelligent but simple CAS (May 91) mim: Review of MIM (May 91) ode: ODE version 2.5 Review (Feb 91) page 4 lists CTI projects .. Heading: project Subhead: 29, 30, 65, 71, 91, 98, 109, 120 citext 29: The Kent Teaching Initiative 30: Statistics Teaching at Lancaster - see also R1E2A 65: Computer Enhanced Learning of Mathematics at Loughborough - see also P1E2A 71: Nimbus Teaching Project (Newcastle) 91: Sussex software library - see also P1A2B 98: Maths Software Development and Teaching Lab at Aberystwyth - see also P1A2C 109: Use of Computer Facilities for teaching Mathematical Manipulation - see also P1A2D 120: The CALM project - see also P1A2E citext: Computer Illustrated Texts 8<--------------------------Buradan kesiniz-(C)------------------------>8 NISS Bulletin Board - Section P1D2 How to obtain information sheets automatically (27-08-90) ---------------------------------------------- Information sheets can now be obtained within minutes from the Centre by sending a short email message to cti-server @ bham The message consists of two lines with the following format: Request: Topic: The heading and subhead must be drawn from the index on P1D1 using lower case. Information is also available for the Minitab UK Users Group using the same email address. For further information, send the following message Request: MUGUK Topic: INDEX 8<--------------------------Buradan kesiniz-(C)------------------------>8 ========================================================================= Date: Fri, 15 Nov 91 18:08:00 PST Reply-To: Turkish Mathematician's Discussion List TURKMATH Sender: Turkish Mathematician's Discussion List TURKMATH From: ANESIN@UCIVMSC Subject: Yeni bir teorem (Wilkie'den) Ingiliz matematikcisi Alex Wilkie, yillardir yanitlanamayan bir soruyu yanitladi iki ay once. Teoremi anlatayim. Once tanimlar: Z = tamsayilar halkasi. R = reel sayilar. M_n = Z[x_1, ... , x_n, exp(x_1), ... , exp(x_n)] bildigimiz polinomlar halkasi (Z uzerine). Eger f, M_n'de bir polinomsa, S(f) = {x \e R^n: f(x) = 0} f'in sifir kumesi olsun. Eger m < = n ise, p(n,m): R^n ---->> R^m, bildigimiz izdusum olsun. Eger A = p(n,m)(S(f)) ise, A'ya guzel kume diyelim. (Yani sifir kumelerinin izdusumlerine guzel kumeler diyoruz). Wilkie'nin teoremi: Eger A < R^n guzel bir kumeyse, R^n \ A kumesi de guzel bir kumedir. Modeller teorisinde bu teorem su bicimi aliyor: "The theory Th(R, +, . , exp) is model complete." Baska bir deyisle her formul "existential" bir formule esdeger. Yani, Tarski'nin reel sayilarla ilgili unlu teoreminin dogal bir genellesmesi olarak gorulebilir. Daha "decidability" sorunu cozulmus degil. Uc hafta once bir konferansta bu konudaki ilerlemelerini anlatti Wilkie. Sonuca cok yakinmis izlenimini verdi. Simdiye dek cozmus de olabilir. Ali ========================================================================= Date: Sat, 16 Nov 91 05:35:02 GMT Reply-To: Turkish Mathematician's Discussion List TURKMATH Sender: Turkish Mathematician's Discussion List TURKMATH From: Haluk DEMIRBAG Subject: Re: yeter (Yetere yeter!) > > Selam, Selama selam, > Insanlarimizin hala,kisir dongu icinde olduklarini gordukce hem uzuluyorum > hem de kiziyorum.Degisin beyler, caga ayak uydurun.Tabii ki, Milliyetcilik > olmal` , ama kafalarinizi degistirmediginiz zaman yaptiginiz bilimin hic > kimseye faydasi olmaz.Bu agin kurulma amaci aramizdaki iletisimi bilimsel > acidan kolaylastirmakti.Ama bizler ne yapiyoruz.Bir <<< h >>>> harfiyle > ugrasiyoruz.Herseyin bir kolayi oldugu gibi , zaman icinde adimizida > degistirebiliriz.Demokratik bir ag olduguna gore bu da kolay. Siz hangi milliyetcilikten bahsediyorsunuz? Hangi caga ayak uydurmaktan? Ingilizceyi utanmasaniz resmi dil yapacaksiniz, hanimlar beyler; Turkce konusun, yazin, yayin ondan sonra cagdan bahsedin. Araclar ile amaclari karistirmayin lutfen. Nedir menfaatiniz? Aciklayin? Biz de bile- lim Turkiye'nin bagrinda Turk dusmanlarinin dilini bana savunamazsiniz. Sizi ve siz gibi ihanet dolu sozler ile 'kisir donguler' den bahseden- leri siddet ile kiniyorum... Bu milletin dili Turkcedir... Kendinize geliniz... Bu kisma son olarak; siz bu listeye bir matematiksel katkida bulundunuz da engellleyen mi oldu? Hodri meydan! > Madem oyle, bende oyumu inat olsun diye soyleyim. Sunu acik olarak, buyuk harfler ile soyleyin lutfen! Turkiye'de Ingilizce egitim yapan bir universitede olmayi ayricalik olarak almayiniz. Ben Ingilizce konusmak zorunda olduguma utaniyorum. Siz oralarda insan- lara tepeden bakiyor olabilirsiniz, oysa! > Simdi hic birsey yapmayalim. Katilimi artiralim.Sonra gereken neyse hep > beraber kararini verelim. Beyler insanlari zorla klavye basina cekmezsiniz, 70 uye bir listenin yurumesi icin yeterlidir... Yeterki etkin insanlar olsun... > sayg`lar`mla Ingilizceyi cok seviyorsunuz bari Turkce klavye de kullanmayin siz... > TEZER SONMEZ > > METUCC - ANKARA Turkcelestiremediklerimizdenmisiniz? _ |-| /-\ |_ |_| |< (TURKMAT'a evet, TURKMATh'a hayir.) ========================================================================= Date: Sat, 16 Nov 91 05:59:45 GMT Reply-To: Turkish Mathematician's Discussion List TURKMATH Sender: Turkish Mathematician's Discussion List TURKMATH From: Haluk DEMIRBAG Subject: Re: oylama > > TURKMATH'A HAYIR TURKMAT'A EVET > ZIYA ARGUN Varan 11... Turkcelestiremediklerimizdenmisiniz? _ |-| /-\ |_ |_| |< (TURKMAT'a evet, TURKMATh'a hayir.) ========================================================================= Date: Sat, 16 Nov 91 06:02:17 GMT Reply-To: Turkish Mathematician's Discussion List TURKMATH Sender: Turkish Mathematician's Discussion List TURKMATH From: Haluk DEMIRBAG Subject: Re: oylama > > Artik dayanamadigim icin ben de bu konuda oyumu sunuyorum. > TURKMAT'A EVET. Ayricada buradaki butun yazismalarda guzel > Turkcemizin kullanilmasi icinde Ayriyetten bir EVET daha. > > Huseyin Demir Varan 12... Katiliyorum, lutfen Turkce konusalim. Imali Ingilizce konusanlar (!) tarafimdan mukafatlandirilacaklardir (!). Burada ayni zamanda sorumluluklarim da var... Ataya saygisizlik tarihte bu kadar buyuk olmamasti... Turkcelestiremediklerimizdenmisiniz? _ |-| /-\ |_ |_| |< (TURKMAT'a evet, TURKMATh'a hayir.) ========================================================================= Date: Sun, 17 Nov 91 23:56:00 PST Reply-To: Turkish Mathematician's Discussion List TURKMATH Sender: Turkish Mathematician's Discussion List TURKMATH From: ANESIN@UCIVMSC Subject: Bir kitaptan "Kadinlar ve Matematik Egitimi" adli bir kitap okuyorum. Kanada'da gerceklesmis bir konferansin konusmalarini iceriyor kitap. Ilk yazar Stella Baruk. Stella Baruk'un daha once "Echec et maths" adli bir kitabini okumustum cok sevmistim. Yazisinin kadinlarla ozellikle ilgisi yok. Su gibi okunan guzel bir yazi. Ama ne yazik ki cok onemli savlar kisaca, bastan savma yazilmis. Bir arkadasimin deyimiyle: "guzelim biftek ipe bagliymis, tam yutmaya hazirlaniyordum ki agzimdan cektiler". Tezini aciklayacak zamanim yok; bir-iki eglencelik sunayim. Bir ogrenciye ucgen, dortgen, besgen... anlatiyor. Sira altigene geliyor. Ogrenci firliyor: - Altigeni biliyorum! - Aman ne guzel! Nedir altigen? - Altigenin dort kosesi vardir! - Aman yapma! - Evet! Altigenin dort kosesi vardir. - Nasil biliyorsun? - Biliyorum iste, altigenin dort kosesi vardir. Stella Baruk'un istedigi, yanlisin neden yapildigini anlamak. Ogrenciyi sorguluyor uzun uzun ve yanlisin kaynagi ortaya cikiyor. Olay Fransa'da geciyor ve ogrenci Fransiz. Fransa bir altigeni andirdigindan, Fransizlar, Fransa'dan sozederken altigen (Hexagone) derler. Ogrenci bigun televizyonda hava durumunu dinlerken su tumceyi duymus: "Altigenimizin dort bir yanini soguk hava dalgasi kaplamistir". Stella Baruk radyo dinliyor. Spiker soyle diyor: - Cesti'nin muzigi, Gabrielli'nin muziginin vardigi tepelerin derinligine inemez. (Sonunda unlem yok, bunu cok dogal olarak soyluyor!) Stela Baruk, bu gibi tumcelerin insanlari (ve daha cok cocuklari) matematige yabancilastirdigini savunuyor. Cok onemli bir sozcuk kullaniyor yazisinda: ISTEK. Ogrenci, istedigini ogrenmek ister. Ornegin (a + b)^2 = a^2 + b^2. Bu yanlisin sik yapilmasi bir raslanti degildir, diyor. Ogrenci oyle ogrenmek ister... Cok onemli dedigi, ama dedigim gibi ustunden soyle bir geciyor konunun. Biftek karnima inmediyse de agzimda cok guzel bir tat birakti. Ali ========================================================================= Date: Mon, 18 Nov 91 10:59:58 TUR Reply-To: Turkish Mathematician's Discussion List TURKMATH Sender: Turkish Mathematician's Discussion List TURKMATH Comments: W: Invalid RFC822 field -- "TURKMATH'IN KURULUSU,ISLEYISI VE BEKLENTILERIMIZ KONUSUNDA:". Rest of header flushed. From: "T.Terzioglu" TURKMATH TRMETU 0 5 15 62 1 0 0 1 0 0 1 0 0 0 19 ========================================================================= Date: Mon, 18 Nov 91 10:59:58 TUR Reply-To: Turkish Mathematician's Discussion List TURKMATH Sender: Turkish Mathematician's Discussion List TURKMATH Comments: W: Invalid RFC822 field -- "TURKMATH'IN KURULUSU,ISLEYISI VE BEKLENTILERIMIZ KONUSUNDA:". Rest of header flushed. From: "T.Terzioglu" TURKMATH TRMETU 0 5 15 62 1 0 0 1 0 0 1 0 0 0 19 ========================================================================= Date: Mon, 18 Nov 91 11:43:07 +0200 Reply-To: Turkish Mathematician's Discussion List TURKMATH Sender: Turkish Mathematician's Discussion List TURKMATH From: Sinan Sertoz Subject: Kafes noktalari Asagidaki soru hakkinda neler biliniyor? a, b, c ve d reel sayilar olmak ve ad-bc sifirdan farkli olmak uzere u=(a,b) ve v=(c,d) olsun. L={mu+nv|m ve n tam sayi} olsun. Duzlemdeki bir p noktasi bir A ucgeninin i) koselerinden biri ise ii) kenarlarindan biri uzerinde ise ya da iii) icinde ise p noktasi A ucgenine aittir diyelim. A verilen bir ucgen olsun. Oyle B ucgenleri bulmak istiyorum ki i) L'nin hicbir noktasi B'ye ait olmasin, ii) B ile A benzer ucgenler olsun. Sorular: 1) Bu konuda neler biliniyor? ve bazi seylerin bilindigini umarak; 2) Bu sekilde cizilen B ucgenlerinin alanlarinin alabilecegi en buyuk deger nedir? ========================================================================= Date: Mon, 18 Nov 91 14:50:01 GMT Reply-To: Turkish Mathematician's Discussion List TURKMATH Sender: Turkish Mathematician's Discussion List TURKMATH From: ava@ABER.AC.UK Subject: uye olma hk. Turkmat'a uye olmak istiyorum. ava@uk.ac.aber ========================================================================= Date: Mon, 18 Nov 91 21:11:16 GMT Reply-To: Turkish Mathematician's Discussion List TURKMATH Sender: Turkish Mathematician's Discussion List TURKMATH From: Haluk DEMIRBAG Subject: Konusuz... 8<--------------------------Buradan kesiniz-(C)------------------------>8 Date: 7 November 1991, 13:52:13 GMT From: Haluk DEMIRBAG Phone: 44-0532-333788 Office ; 44-0532-439022 Home To: TURKMATH@EARN.TRMETU Subject: Re: Message of Wed, 06 Nov 91 10:19:00 GMT > > TURKMAT vs TURKMATH tartismasini lutfen keselim artik. > Bu tartismayi lutfen bitirelim artik. > Yurtdisindaki bazi arkadaslar cesitli nedenlerle TURKMAT kelimesini > tercih ediyorlar. > Bu karsilik yurt icindeki arkadaslar TURKMATH biciminde kalmasinda > yarar goruyorlar. Bir dakika; nasil oluyor da yurt icindeki arkadaslar ve yurt disindaki arkadaslar adina, sadece 7 kisi oy kullanmis iken ve hepsi de TURKMATh'a hayir TURKMAT'a evet demisken, genellleme yapabiliyorsunuz? Sadece 7 kisi oy kullandi ve hepsi de TURKMATh'a hayir TURKMAT'a evet dedi... Sizden belki on defa "yurt disindan listeye 'reply' edilince TRMETU kelimesi program tarafindan -ikinci satirda oldugu icin- okunmuyo- yor bir satirda uc tane olan TURKMATh kelimesi bire indirilebilir mi?" diye rica ettim, siz sadece birini kaldirdiniz. Sadece Turkiye'de bulunan Matematikcilere acik olan bir matematik 'discussion list' oluyor bu durumda, e tabi orada BITNET ya da EARN kelimesini kullanmiyorsunuz ki Siz de reply problemi yok... Bu arada yurt disindaki arkadaslarin cogu devletin resmi burslu ogrencisidir, bunu da dikkate alin, kimse burada keyfi icin bulunmuyor. Adinda 'Turkish' kelimesinin oldugu bir listenin adinin Ingilizce olmasi hakarettir, ustelik listede Turkce ('by default') konusuluyor iken!! > Bu konuda bir oylama YAPMIYORUZ. 7 kisi oylama yapti bile, listede Ingilizce konusun, adi Ingilizce olsun. Turkce konusuluyor. Ama adi Ingilizce... Nedir bu? Siz aciklamayi yapin ondan sonra buyuk harfler ile 'yapmiyoruz' dersiniz... > Dolayisiyla komse oylari saymiyor, bunun bir anlami yok. Ben sayiyorum, sizin icin anlami yok olabilir, 7 kisi icin anlami var, B E N S A Y I Y O R U M. Ben Turk'um, ve Turkiye'de adinda 'Turkish' kelimesi olan haberlesme agimin adinin Turkcelestirilmesini taleb ediyorum, sizi bilmem, bende RUH var, vesselam... 10 Kasim gunu ATA'ya sayginizi gorecegim... Bu isi halletmek bana ulvi bir gorev! TURK, OGUN, CALIS, GUVEN! (M. K. ATATURK) > List'deki tarismalarin en az yarisi isim uzerine olursa, o list'in > hic bir anlami olmaz. Kac kisi matematik ile ilgili konustu da engel olundu, o zaman oylama yapin lutfen... Yolladigim bilgilerden memnun olmayanlar var ise, hemen keserim. > Bu gun ogleden sonra, toplayacagimiz veri tabani konusunda bir > oneri gececegim liste. > Lutfen onu okuyun, oneri ve elestirilerinizi bekliyorum, > AMA Lutfen kendi formunuzu hemen gondermeyin. > Bunlari kimin toplayacagi kimin hazirliyacagi henuz belli degil. > Bir gonullu var ise, sevinirim. TURK matematigi adina yapilan hersey Turkce oldugu halde ve ne idugu bel- li iken ben gonullu olurum... Karbon kopyalari Ingilizce ise evet, asil- lari TURKce olsun lutfen... > Saygilar > Mustafa Akgul 8<--------------------------Buradan kesiniz-(C)------------------------>8 NISS Bulletin Board - Section P1E4 MATLAB User Group software archive (05-07-91) ============================================= The software archive currently contains a diverse collection of Matlab M-files and utility files that are of general interest. When you sign up for the User Group (see page P1F6 for details) you will receive instructions on how to submit and obtain archive files, as well as back issues of the Matlab Digest, a collection of MUG members' comments, questions and user tips compiled and sent out by Chris Bischof at Argonne National Laboratory. The user group strongly encourages you to submit your own M-files to the archive; those functions may be exactly what another Matlab user is looking for! 8<--------------------------Buradan kesiniz-(C)------------------------>8 Unutmadan; bir arkadas bir yerden olup olmadigimi sormus, o yerden degilim... _ |-| /-\ |_ |_| |< (TURKMAT'a evet, TURKMATh'a hayir) 8<--------------------------Buradan kesiniz-(C)------------------------>8 ========================================================================= Date: Mon, 18 Nov 91 21:15:06 GMT Reply-To: Turkish Mathematician's Discussion List TURKMATH Sender: Turkish Mathematician's Discussion List TURKMATH From: Haluk DEMIRBAG Subject: Konusuz 2... 8<--------------------------Buradan kesiniz-(C)------------------------>8 Date: 6 November 1991, 06:32:02 GMT From: Haluk DEMIRBAG Phone: 44-0532-333788 Office ; 44-0532-439022 Home To: TURKMATH@EARN.TRMETU Subject: Henuz 5-0 TURKMAT'cilar TURKMATh'cilara galip,sessizlik revacta! 5-0 TURKMAT'cilar onde, hala sessiz mi kalinacak? Liste sahibi 'medeni- ce' bir oylamaya gidemez mi idi acaba? Oylamaya gidilsin lutfen! Sizin amaciniz ne? Bakin ben ne guzel yaziyorum. Kimden korkuyorsunuz? Ne yapmak istiyorsaniz aciklayin da biz de bilelim. Eger bu listeye uye olup ta rahatsiz olmuyorsaniz, lutfen sahsima karsi yaziniz! Listenin adinda "Turkish" kelimesi var, listenin adi Ingilizce, listede herkes nedense Turkce yaziyor; bu ne perhiz bu ne lahana tursusu? Rezalet be! A c i k l a m a yapilsin! Rahatsiz olmayanlari da kiniyorum, carpikliklari sonuna dek elestirmeye ant ictim. 10 Kasim gunu, bu listenin adinin Turkce yapilip yapilmamasi, "ucgen" kelimesini Turkceye kazandiran ve dogrusal dusunen matema- tikcilere yuzeysel dusunmeyi profesyonelce, TURKCE isaret eden dehaya, ince, sakin, sinsi, amacli ve gudumlu ihanet sorusunu getirecektir... Hanimlar, Beyler! N'GENSEL dusunelim. Topoloji tarafindan lutfen! _ |-| /-\ |_ |_| |< [It's better to have a smart foe, than a stupid friend. Turkish Proverb] 8<--------------------------Buradan kesiniz-(C)------------------------>8 List of Seminar Topics and Speakers (18-01-91) The CTICMS Centre and Computer-based Learning of Engineering Mathematics: Dr Mike Beilby, CTICMS, Faculty of Education, The University, Birmingham B15 2TT Tel:021-414 4800 JANET: ctimath @ birmingham The CTICMS Centre - Using the Computer to teach Engineering Mathematics: Dr Cliff Beevers, Department of Mathematics, Heriot-Watt University, Riccarton, Edinburgh EH14 4AS Tel: 031-449 5111 JANET: mthceb @ heriot-watt.vaxb The CTICMS Centre and the CATAM project - Computer Aided Teaching ofApplied Mathematics: Dr Robert Harding, Dept of Applied Mathematics and Theoretical Physics, University of Cambridge, Silver Street, Cambridge CB3 9EW Tel: 0223 337900 JANET: rdh1 @ cam.phx The CTICMS Centre and the CIText project - Computer Illustrated Texts: Dr Robert Harding, Dept of Applied Mathematics and Theoretical Physics, University of Cambridge, Silver Street, Cambridge CB3 9EW Tel: 0223 337900 JANET: rdh1 @ cam.phx The CTICMS Centre - Teaching Number Theory and Algebra on a Micro: Dr Terence Jackson, Mathematics Department, University of York, Heslington, York YO2 5DD Tel: 0904 433080 JANET: thj 1 @ York The CTICMS Centre - Teaching Computational Mathematics: Dr Gordon Makinson, Department of Mathematics, University of Kent, Canterbury CT2 7NX Tel: 0227 764000 JANET: gojm @ UKC The CTICMS Centre - Teaching Numerical Methods: Dr Doug Quinney, Dept of Mathematics, University of Keele, Staffordshire ST5 5BG Tel: 0782 621111 JANET: maa07 @ Keele.seq1 The CTICMS Centre: Computer Enhanced Learning of Mathematics: Tom Scott, Department of Mathematics, Napier Polytechnic, 219 Colinton Road, Edinburgh EH14 1DJ Tel: 031-444 2266 JANET: SDZ506 @ napier.prime The CTI Centre for Statistics: Dr Adrian Bowman, Department of Statistics, University, Glasgow G12 8QW. Tel: 041 339 8855 ext 4046, JANET: ctistat @ glasgow.vme The CTICMS Centre and Computer Illustrated Texts in Statistics: Dr Derek Robinson, Mathematics Division, School of Mathematical and Physical Sciences, University of Sussex, Brighton BN1 9QH. Tel: 0273 606755 JANET: MMFE5 @ sussex.cluster Introducing REDUCE into the undergraduate curriculum: Professor R Shail, Department of Mathematics, University of Surrey, Guildford, Surrey GU2 5XH Tel: 0483 571281 JANET: mat016 @ uk.surrey.sysh Teaching and Learning Mathematics on the Computer: Dr Allan Hayes, Department of Mathematics, The University, Leicester LE1 7RH Tel: 0533 523883 JANET: hay @ Leicester The Mathematical MacTutor System: G E Bell, J O'Connor, or E F Robertson, Department of Mathematical Sciences, The University, St Andrews, Fife, KY16 9SS. Tel: 0334 76161 ext 8123 JANET: pmser @ uk.ac.st-and Linear Programming Modelling with the Computer: Dr Alan Munford, Department of Mathematical Statistics and Operational Research, The University, Exeter EX4 4PU, Tel: 0392 264470 JANET: agm @ uk.ac.exeter.msor The CTICMS Centry - Generalised Linear Models and GLIM: John Hinde, Department of Mathematical Statistics and Operational Research, The University, Exeter EX4 4PU Tel: 0392 264473 JANET: jph @ uk.ac.exeter.msor 8<--------------------------Buradan kesiniz-(C)------------------------>8 8<--------------------------Buradan kesiniz-(C)------------------------>8 ========================================================================= Date: Tue, 19 Nov 91 09:30:56 TUR Reply-To: Turkish Mathematician's Discussion List TURKMATH Sender: Turkish Mathematician's Discussion List TURKMATH From: PROHVK04@TREARN Selamlar. Eger Turkce'yi yasatmak istiyorsak onu kullanmaliyiz. Ozellikle de 'aydin kesim' diye bilinen ya da adlandirilan bizler. Bu konuda bir ornek vermek istiyorum: CONCORDE ucaklarini hepimiz biliriz. Bu Ingiliz-Fransiz ortak yapimi ucaklarin yapim projesi, tek bir 'E' harfi yuzunden uzun bir sure askida kalmis. Sadece bir 'E' harfi.... Projenin adi Ingilizce mi Fransizca mi olacak diye? CONCORDE ya da CONCORD... Sonunda Fransizlar Ingilizlere cok yuklu bir miktar para vererek sorunu halletmisler. Ayni sorun Ingiltere-Fransa arasindaki MANS TUNELI'nin yapiminda da ortaya cikti. Trafik levhalari ve tren icindeki yazilar neyce olacak diye. Uzun sure konusulup tartisildi. Bu saydiklarim is olsun, ya da kisir dongu olsun diye yapilan tartismalar degildir. Amac insanlarin kendi dilini korumasi ve diger insanlara ogretmek istemesidir. Bugun bir Mitterrand bal gibi Ingilizce bilir ama Bush ile konusurken kesinlikle Fransizca konusur. Neden? Bizde ise tersi olur. Ingilizce bilmeyenlerimiz bile, herkes ne kadar marifetli oldugumuzu gorsun diye ingilizce konusur. Gerekli ya da gereksiz yerlerde. Ben bir ODTU'luye listelerinde neden surekli ingilizce konusuldugunu (ya da en azindan adlarinin neden ingilizce oldugunu) sormustum. Bana 'bizim okulda yabanci ogrenciler var. Boylece onlar da konusmalara katiliyorlar' demisti. Benim mantigim burda zorlaniyor iste. Yabanci ogrenciler sizin ulkenize ogrenim yapmaya geliyorlar, siz onlara TURKCE'yi ogretmeyip, Ingilizce iletisim kurmaya kalkiyorsunuz! Olay bir kultur asilamasidir. O, insana Turkce'yi ogretmek zorundasiniz. Hangi tarihte hatirlamiyorum, Suriye devlet bakani Hafiz Esat Turkiye'ye gelmisti. Ve Turgut Ozal ile TURKCE konusmustu gorusmelerde. Cunku yuksek ogrenimini Turkiye'de yapmis. Iste anlatmakistedigim olay bu. Onun orda Turkce konusmasi benim icin bir gurur kaynagi. Yabanci konuklar ulkemize geldiginde, bizim devlet buyuklerimiz Ingilizce konusmayi adet haline getirdiler. Cok yakinda herkes Turk dilinin Ingilizce oldugunu dusunmeye baslayacak. Bence hepimiz Turkce'ye sahip cikmaliyiz. Bunu sadece bu listede gecen "H" tartismasi icin soylemiyorum. Yabanci dilleri ogrenmeliyiz ama kendi dilimizin tanitimini da yapmaliyiz. En azindan ana dilimizin Turkce oldugunu unutmamaliyiz. M. ========================================================================= Date: Tue, 19 Nov 91 10:15:18 TUR Reply-To: Turkish Mathematician's Discussion List TURKMATH Sender: Turkish Mathematician's Discussion List TURKMATH From: Tosun Terzioglu Subject: ACIKLAMA Turkmath'in kurulusu,isleyisi ve beklentilerimiz konusunda biraz gecikerek te olsa bazi aciklamalar yapmak isterim. 2-5 Eylul tarihlarinde Antakya'da yapilan 4.Ulusal Matematik Sempozyumunda Turkiyedeki matematikcilerin birbirleriyle ve dunyadaki matematikcilerle iletisim kurmasi,Turk Matematik Derneginin uyelerine kolayca ulasmasi gibi konular da gundeme geldi katilanlarin oybirligi ile Turkmath'in kurulmasi kararlastirildi. Ancak bircok universitemiz henuz bilgisayar agina baglanmadi. Ayrica bagli olanlar da bolumdeki tek terminalden veya bir baska binadaki terminalden calismak zorunda.Bu durumun bu yil icinde duzelecegini,agin yayginlasacagini ve hatta Azerbaycan Akademisinin de baglanacagini umuyoruz.Bu agi ancak gercek amacina uygun kullanmaya ozen gosterirsek yararli olacagina ve giderek gelisecegine inaniyorum. Saygilarimla. T.Terzioglu(Turk Matematik Dernegi Baskani) ========================================================================= Date: Tue, 19 Nov 91 12:57:55 +0200 Reply-To: Turkish Mathematician's Discussion List TURKMATH Sender: Turkish Mathematician's Discussion List TURKMATH From: AKMAN@TRBILUN Subject: TURKMATH'in amaci >[ Yazinin bas tarafi yer kazanmak icin cikarilmistir. ] Bu agi ancak >gercek amacina uygun kullanmaya ozen gosterirsek yararli olacagina >ve giderek gelisecegine inaniyorum. Saygilarimla. > > T.Terzioglu(Turk Matematik Dernegi Baskani) Bu "uyariya" tum kalbimle katiliyor, bu listede---mesela A. Nesin'in, M. Akgul'un, S. Sertoz'un gayet guzel gosterdigi gibi---matematikle ilgili ilginc tartismalarin surmesini umutla bekliyorum. V. Akman, Bilkent Universitesi, Ankara - Varol Akman Bilkent University, Ankara Logic is logic, that's all I say. - OLIVER WENDEL HOLMES ========================================================================= Date: Tue, 19 Nov 91 04:02:00 PST Reply-To: Turkish Mathematician's Discussion List TURKMATH Sender: Turkish Mathematician's Discussion List TURKMATH From: ANESIN@UCIVMSC Subject: Dayanamadim daha fazla Ben de artik dayanamayacagim. Turkiye'den neden Turkmath'in adi konusunda kimseden ses cikmadigini gittikce daha iyi anliyorum. Onceden de kestiriyordum ama simdi hic kuskum kalmadi. Sindirme var. Korkutma var. Gozdagi verme var. Insanlar ya sinmisler ses cikaramiyorlar, yada kendi kendilerini aldatip, biz de buyuklerimiz gibi dusunuyoruz diyorlar. Deliller: 1) Bir-iki arkadasim bana ozel yazi yazmak isterken yanlislikla aga gectiler yazilarini. Bu arkadaslarin agda oyun oynayacak ciddiyetten uzak kisiler olmadiklari acik. Belli ki bir yanlislik yapmislardi, ilk gunlerin acemiligini cekiyorlardi. Buna karsin koca koca harflerle "LUTFEN OZEL MESAJLARINIZI OZEL YOLLAYIN" dendi. Kocaman harflerle yazmak azarlamak demektir. Kimsenin kimseyi azarlamaya hakki yoktur. Hele bilim adamlari arasinda... Demek bu tur sert cikismalara oylesine alisilmis ki, bir-iki yanlisligi bile kaldiramiyor bazilari. Kendimi ilkokulda sandim birara, ve cok sasirdim. Daha once hic boyle matematikci iliskisi gormemistim. 2) Mustafa Akgul, <<"TURKMAT vs TURKMATH tartismasini lutfen keselim artik. Bu tartismayi lutfen bitirelim artik. [...] Bu konuda bir oylama YAPMIYORUZ >> diye yazdi. "Lutfen" sozcugunu dikkate alip, "Tartismayi keselim" de bir emir olmadigini varsaysam bile, "bu konuda bir oylama YAPMIYORUZ" la vurgulanan "burasi benden sorulur" dusuncesinden cok rahatsiz oldum. Burasi hepimizden sorulur. Yazandan, okuyandan sorulur. 3) Son olarak Sayin Tosun Terzioglu Turkmath/Turkmat tartismasinin son bulmasini ima etti ve, imzasinin yanina Turk Matematikciler Dernegi Baskani diye de ekledi. Bunun, ya bilincaltindan, yada bilerek, sindirme amaciyla yazilmis oldugunu saniyorum ve dogru bulmuyorum. Gercekten Turkmath adi onemli degilmis. O denli onemli sorunlarimiz varmis ki, bu hic kalirmis. Onca kisi Turkiye'de. Kirktan fazla. Bir tanesi bile Turkmath adi degistirilsin demedi. Bu sizleri dusundurmuyor mu? Herkesin ayni dusuncede olmasi dogal midir yoksa? Kim hakli, kim haksiz sorusu sormuyorum. Turkmath adi onemli midir diye de sormuyorum. Sorum su: Diyelim yukarida haksizlik yaptim. Ve kimsenin kimseyi korkuttugu yok, herkes ozgur, dileyen dusuncesini yazar. Peki, Turkiye'den onca kisiden biri nasil olur da "resmi" goruse ses cikarmaz? Nasil olur da hic cizirti cikmaz? Herkes ayni dusuncede. Oh ne guzel! Nerede, ne zaman 40 kisinin ayni goruste oldugu gorulmus de burada gorulsun. Lutfen bu yazdiklarim uzerine DUSUNUN. Yanildigimdan emin bile olsaniz dusunun. Bir de bakmissiniz hakliymisim! Ali ========================================================================= Date: Wed, 20 Nov 91 13:32:33 +0200 Reply-To: Turkish Mathematician's Discussion List TURKMATH Sender: Turkish Mathematician's Discussion List TURKMATH From: Mustafa Akgul Subject: Veri tabani - revised Ekte onerdigimiz veri tabani icin form ve aciklamalar. Bazi eklemeler yaptim: ev adresi, mezuniyet yil, okul ve bolumleri, ve Ph.D. tex `title'ini ekledim. Eklenecek baska seyler var mi? Bir iki gun icinde nereye gonderilecegini duyururuz. Saygilar %%%%%%%%%%%%%%%%%%%%%% \basla \name< ....> \title<...> \institution<....> \dept< > \email< > \email<..> \officeaddres< > \homeaddres< > \officephone< > \homephone< > \fax< > \telex< > \bsdegre< > \msdegree< > \phddegree< > \phdtitle< > \keywords< > \subjectclass< > \description< > \notes< > \bitti Aciklamalar Benim dusundugum TeX formatinda bir data base. Gerektiginde TeX'den hard copy bastirabilmek. Uye olmiyan Turk matematikcilerini de bu data base'e dahil etmek (isteyenleri tabii). Su anda bir suru universite enet'e dahil degil. Sanirim isimler genellikle acik. istedigim gerekli bilginin \name biciminde yazilmasi. Gerekli bilgi < > arasinda yazilmasi TeX acisindan bir kolaylik yaratacak, ayrica umarim AWK gibi programlarda da kullanilabilir. \email'i iki kere yazdim. Burada demek istedigim, ozellikle yurt disindaki EDU disindaki arkadaslar icin anlamli, alternate adresleri vermek. Bazan bazi adreslere Turkiye'den ulasmak mumkun olmuyor. O nedenle alternatif adres vermekte yarar var. \dept department'i belirtiyor; benim dusundugum bu bilginin adres'ten bagimsiz verilmesi; tekrar ama ben yararli olacagi kanisindayim. \subjectclass< >, MR subject classification'daki numaralar, mumkun oldugunca `precise' verilmesini oneririm. \keywords<..>, o kadar precise olmazsa da ana basliklari icermeli: fonksiyonel analiz, cebirsel geometri, optimizasyon gibi, \description< > da amacladigim herkesin kendi kelimeleriyle calisma alanini vermesi. \bsdegree< >, \msdegree< >, \phddegree< > de bekledigimiz mezun olunan okul, department ve yil bilgisi. \phdtitle< >'da amacladigimiz Ph.D. tezinin adi. \notes< > ise bunlarin disinda yazilmasinda yarar gorulen oteki seyler. MATEMATIK IFADELER ve TURKCE AKSANLAR \description< > ve \notes< > de sayet matematik semboller kullanmak gerekirse bunun basit TeX formatinda yazilmasinda yarar var. Sayet semboller plain TeX ve LaTeX'de var ise onlarin kullanilmasi. AKSANLARA gelince: Ben bunlarin EASYTURK.STY'le yazilmasini oneririm. esayturk.sty TeX/LaTeX icin gelistirilmis turkce aksanlari yazmaya yarayan macrolar'i iceren dosyanin adi. Bu sty'de cok kullanilan aksanlar icin harfin onune = koymak yetiyor. (matematik anlamda = istiyenler, ='ligi matematik icinde rahatca kullanabilirler). Boylece =u =U =o =O =c =C =g =G =s =S =i =I bilinen standard aksanlari uretiyor, sapka yada ^ aksani icin ise harfin onune ! (unlem) konuyor: boylece !a !A !u !U !i !I ise bu tur aksanlari uretiyor. Bu sty file'i TeX icinde kullanmak istiyenler'e gonderebilirim. ========================================================================= Date: Wed, 20 Nov 91 12:18:25 GMT Reply-To: Turkish Mathematician's Discussion List TURKMATH Sender: Turkish Mathematician's Discussion List TURKMATH From: zia@ABER.AC.UK Subject: trmetu Sayin Mustafa AKGUL Bey, Herhalde kendiniz yazip kendiniz okuyorsunuzdur. Cunku bu haberlesme agi uyelerine hitap etmekten cok uzak.. Sebebi ise yoneticileri uyelerine karsi kulaklarini tikamis durumda. Sizden musbet sorumluluk bekliyoruz. Bizi sevindir ve utandir. Z. Argun ========================================================================= Date: Wed, 20 Nov 91 14:26:50 +0200 Reply-To: Turkish Mathematician's Discussion List TURKMATH Sender: Turkish Mathematician's Discussion List TURKMATH From: Mustafa Akgul Subject: uyelerin dokumu 19 Kasim 1991 tarihi itibariyla uye durumu: UK 16 FR 2 AU (Yeni Dunya!) 1 USA 15 TURKIYE TRAKDENIZ 1 TRANAVM1 1 (Anadolu) TREARN 2 (Ege) TRIUVM11 3 (Istanbul Universitesi) TRITU 2 TRBOUN 1 (Bogazici) TRCUNIV 1 ( Cukurova) TRMETU 37 TRBILUN 14 (Bilkent) ERCIYAS, KARADENIZ, GAZIANTEP, YILDIZ, MARMARA, HACETTEPE, DOKUZEYLUL, Universitelirinden hic uyemiz yok. (Bunlar enet'e bagli, bu liste eksik olabilir) VAN, ERZURUM, INONU ve ANKARA Universiteleri enet'e bagli degiller bildigim kadariyla. Bu arada bazi uyeleri kaybettik. Saygilarimla. ========================================================================= Date: Wed, 20 Nov 91 16:02:14 +0200 Reply-To: Turkish Mathematician's Discussion List TURKMATH Sender: Turkish Mathematician's Discussion List TURKMATH From: Ulug Capar Subject: TURKMAT'a hayir TURKMATH-TURKMAT tartismasini bir suredir sessizce izliyorum. Daha onceleri de mantiksiz ve anlamsiz bircok tartismaya taniklik etmistim ama bu kadar uzun surenini hatirlamiyorum. 1) TURKMAT'i yabancilarin hicbiri anlamaz, T\"{u}rklerin anlamasi da TURK'u Ingilizce okuyup Ingilizce anlamlandirmalarina bagli.. Eger siz T\"{u}rkiyede ``Ben bir TURK matematikcisiyim (T\"{U}RK degil) derseniz bunu ancak Istanbul'daki bir grup azinligin dilimizi cok kotu konusan kucuk bir kesimi anlar. Ozet: TURKMAT da ileri suruldugu kadar T\"{u}rkce degil..Yegane T\"{u}rkce yani, yabanci bir kelime olan Matematigin ilk hecesinin T\"{u}rk imlasi ile yazilmis olmasindan ibaret.. 2) Ingilizce dilinde MATH bir kisaltma olmaktan cikmis, kelimenin kendisi halini almis. T\"{u}rkce' deki MAT oyle mi ya? Ben TURKMAT' in bir satrancci agi oldugunu da dusunebilirim. ( En taninmis Avrupa satranc dergilerinden birinin adi ``Schachmat''!) 3) Milli onur, milliyetcilik veya sovenlik (chauvinism) konusu yapilacak yuzlerce hakli durum olabilir ve var da..Fakat bu durum onlardan biri degil. Maksimum evrensel anlasilirlik ve komunikasyon saglamak, dunyadaki benzeri aglarla isbirligi kurmak, hatta yabanci uyeler kabul etmek agin amaclari arasinda. TURKMATH sozcugu de bu amaclara son derece uygun.. 4) Dil sovenligi konusunda akla ilk gelen uluslardan Alman'lar, cok eskilerde degil daha birkac onyil once Universite kursulerinde Almanca'dan baska dilde yazilmis kitap bulundurmamaga gayret ederlerdi. (Bunun altinda biraz da evrensel bilim ve teknolojiye cok buyuk katkilar yapmis olmalari gercegi yatardi). Simdi Almanya'da bircok lokal seminer, konferans ve `workshop'lar Ingilizce yapiliyor, hatta bazi lisans ustu programlar bile Ingilizce duzenleniyor. Bunlarin kitaplari da Ingilizce dilinde basiliyor. (Springer Verlag -Lecture Notes ve benzerlerinde buna sayisiz ornek bulabilirsiniz). Gonul ayni pozisyonda T\"{u}rkceyi gormek isterdi, fakat surasi bir gercek ki bugun Ingilizce bilim ve teknolojide evrensel bir dil (politikada degil mi?) niteliginde. Bunun nedenlerinden biri de Ingilizceyi belli bir duzeye kadar ogrenmenin diger buyuk bati dillerine oranla daha kolay olusu.. Bu durum Almanlar ve Japonlar dahil kimseyi rahatsiz etmiyor, kimse milli onur meselesi yapmiyor. 5) Dernek, kurulus ve benzerlerinde uyeler her konuda her akillarina estiklerinde genel kurul oylamasina gidemezler.. Bunun icin bazi usuller vardir, bu is genel kurul toplantilarinda veya milli kongrelerde olur. TURKMATH isminin oylanmasi T\"{u}rk Matematik Dernegi 1991 milli kongresinde yapilmis ve oy birligi ile kabul edilmistir. Dunyanin obur ucundan gozleyip ``efendim, uyeler seslerini cikaramamislar, baski ile kabul etmisler'' demek en hafifinden butun uyelere buyuk bir asagilamayi icerir. Gelecek yilki genel kurullara veya kongrelere katilir veya teleks gonderirseniz oylama yeniden gundeme gelir. Ancak unutulmamali ki gecen yilki kongrede oybirligi ile lehte oy kullananlarin sayisi 7(hadi 9 olsun)' nin cok ustunde idi. Fakat gene de simdi oylamada israrli iseniz ben oyumu kullanayim: TURKMATH' a EVET, TURKMAT' a HAYIR. Saygilarimla, Ulug Capar (T\"{u}rk Matematik Dernegi uyesi) ========================================================================= Date: Wed, 20 Nov 91 16:25:29 +0200 Reply-To: Turkish Mathematician's Discussion List TURKMATH Sender: Turkish Mathematician's Discussion List TURKMATH From: Enis Cetin Subject: Turkmath/turkmat >From: ANESIN@UCIVMSC >Subject: Dayanamadim daha fazla > Ben de artik dayanamayacagim. > > Turkiye'den neden Turkmath'in adi konusunda kimseden ses > cikmadigini Su ana kadar TURKMATH-TURKMAT tartismasina katilmamis olanlarin "midenizi bulandirdigini" soylediniz. Ben de artik dayanamayacagim. O zaman midenizin bulandigi bu ortami terkedin. Kimse sizi burada zorla tutmuyor. >cikmadigini gittikce daha iyi anliyorum. Onceden de >kestiriyordum ama simdi hic kuskum kalmadi. > > Sindirme var. Korkutma var. Gozdagi verme var. Insanlar ya >sinmisler ses cikaramiyorlar, yada kendi kendilerini aldatip, >biz de buyuklerimiz gibi dusunuyoruz diyorlar. Cok haklisiniz. Mustafa Akgul elinde sopasi koridorlarda dolasiyor. Akgul ayrica eski bir MIT ve CIA ajanidir, 'TURKMAT' diyenleri hemen fisliyor. Yeni liste uyelerine dagittigi formlar ne icin zannediyorsunuz ? Fislemek icin. > Ali Nesin Enis Cetin Not: > 3) Son olarak Sayin Tosun Terzioglu Turkmath/Turkmat >tartismasinin son bulmasini ima etti ve, imzasinin yanina >Turk Matematikciler Dernegi Baskani diye de ekledi. Bunun, >ya bilincaltindan, yada bilerek, sindirme amaciyla yazilmis 'yada 'yi ayrik yazmayip bitisik yazanlardan bizim Turkce ogretmeni not kirardi. ========================================================================= Date: Wed, 20 Nov 91 07:42:00 PST Reply-To: Turkish Mathematician's Discussion List TURKMATH Sender: Turkish Mathematician's Discussion List TURKMATH From: ANESIN@UCIVMSC Subject: Enis Cetin'e Kimsenin midemi bulandirdigini soylemedim. Yanlis animsiyorsunuz. "Yada" bitisik de yazilir. Ornegin, yasarken Turk Dil Kurumu uyesi olan Tahsin Sarac'in Fransizca Turkce sozlugunde, "Yada" bitisik yaziyor. Eger ileride hata yaparsam duzeltilmesi dilegiyle. Ali ========================================================================= Date: Wed, 20 Nov 91 17:46:28 +0200 Reply-To: Turkish Mathematician's Discussion List TURKMATH Sender: Turkish Mathematician's Discussion List TURKMATH From: Mefharet Kocatepe Subject: Lutfen yeter Bu Turkmath-Turkmat tartismasi kanimca gereginden cok fazla uzadi. Tartismayi baslatan ve surduren arkadaslarimiz konunun disina cikarak agin yoneticilerini ve bizi korkaklik ve sindirilmislikle, hatta (neredeyse) Ataturk'e saygisizlik ve vatan hainligi ile sucladilar. Bu arkadaslarin bu suclamalarini ve bu agda kullandiklari hakaret dolu dili siddetle kiniyorum. Sayilari birkaci gecmeyen bu arkadaslar oylama yapilmasi icin israr ediyorlar. Oysa Turkmath adini Antakya'daki 4. Ulusal Matematik Sempozyumunda 100 den fazla kisinin oybirligi ile kararlastirdigi defalarca soylendi. Bu ag birbirimizle kavga etmek icin kurulmadi. Bence bu arkadaslara gereginden fazla hosgoru gosterdik. Kendilerini artik bu tartismayi kesmeye ve daha saygili olmaya davet ediyorum. Saygilarimla Mefharet Kocatepe ========================================================================= Date: Wed, 20 Nov 91 18:07:57 +0200 Reply-To: Turkish Mathematician's Discussion List TURKMATH Sender: Turkish Mathematician's Discussion List TURKMATH From: Akif Eyler Subject: Re: Lutfen yeter TurkMath'a bugun katilmis birisi olarak, bugun gelen ilk dort yazida Math bulamadigimi belirtmek isterim. Isin basini bilmiyorum, ama Mefharet Kocatepe'nin son mesajina %100 katildigimi da ileteyim. Akif Eyler ========================================================================= Date: Wed, 20 Nov 91 20:24:48 GMT Reply-To: Turkish Mathematician's Discussion List TURKMATH Sender: Turkish Mathematician's Discussion List TURKMATH From: "H: Guray Gurlek" Subject: tranavm1 den ... Kisa yaziyorum: ULUG CAPAR arkadasimla ayni fikirdeyim. Gereksiz gormeme ragmen,israr edilirse oyumu TURKMATH a evet seklinde kullanirim. Amacimiz tum dunya capinda kultur alisverisi olmali,derim. Artik gercek konular gormek dilegiyle saygilar sunarim. H. GURAY GURLEK ========================================================================= Date: Wed, 20 Nov 91 22:43:00 PST Reply-To: Turkish Mathematician's Discussion List TURKMATH Sender: Turkish Mathematician's Discussion List TURKMATH From: ANESIN@UCIVMSC Subject: Hasan Akyildiz'dan mektup var Turkiye'den Hasan Akyildiz adli birisinden bir mektup aldim. Bir arastirma yapmis, daha once bu sonucun bilinip bilinmedigini soruyor. Ben ilginc buldum arastirmasini. Daha once de bir yerde gormemistim. Geciyorum. Ayrica arastirmasi Haluk Demirbag'in 1^k + 2^k + ... + n^k sorusunu da yanitliyor. f: R ----> R bir fonksiyon olsun. a bir reel sayi olsun. n de pozitif bir tamsayi. Amacimiz f(a) + f(a + 1) + ... + f(a + n) sayisini bulmak. Bu sayiyi bulmak icin oyle bir F(x) fonksiyonu bulalim ki f(x) = F(x+1) - F(x) olsun. [F fonksiyonuna, f fonksiyonunun "adi ilkeli" adi vermis Hasan Akyildiz]. Simdi, f(a) + f(a + 1) + ... + f(a + n) = F(a + n +1) - F(a) dir. Elbet f(x) n dereceli bir polinomsa, f fonksiyonunun n+1 dereceden bir adi ilkeli vardir. Bu da tumevarim yapmadan, 1^k + ... + n^k icin formulu bulmamizi saglar. [Raci'nin cozumunu biraz andiriyor, ama bu hem Raci'nin, hem de benim cozumumden daha yalin]. Benim cok hosuma gitti. Yalin, ve yalin oldugu kadar da guzel. Matematik Dunyasi'na girebilir mi bu yazi? Hasan Akyildiz'a arastirmasini dergiye yollamasini yazayim mi? Ali ========================================================================= Date: Thu, 21 Nov 91 10:29:42 TUR Reply-To: Turkish Mathematician's Discussion List TURKMATH Sender: Turkish Mathematician's Discussion List TURKMATH From: MATTOSUN@TRMETU Subject: matematik dunyasi Matematik Dunyasi'nda yeni yazarlar gormek istiyoruz. Yazarlar matematikci veya salt matematik meraklisi olabilirler. Adres: Cemal Koc,Matematik Bolumu,ODTU,06531,Ankara. Cemal Koc derginin editoru.Saygilarimla. T.Terzioglu ========================================================================= Date: Thu, 21 Nov 91 00:23:00 PST Reply-To: Turkish Mathematician's Discussion List TURKMATH Sender: Turkish Mathematician's Discussion List TURKMATH From: ANESIN@UCIVMSC Subject: Sinan Sertoz'un sorusunun ozel bir durumu Sinan Sertoz'un sorusu ilginc. Sorunun cok ozel bir durumuna bakayim dedim: Z x Z lattice'inin hic bir noktasi icine dusmeyecek en buyuk ikizkenar dik ucgenin alani nedir? Sanirim 9/4 (ucgenin tabani 3, yuksekligi 3/2 uzunlukta). Nasil kanitlanacagi uzerine hic bir dusuncem yok. Eger bu soruyu cozemezsek, genel soruyu hic cozemeyiz. Ali ========================================================================= Date: Thu, 21 Nov 91 11:01:28 +0200 Reply-To: Turkish Mathematician's Discussion List TURKMATH Sender: Turkish Mathematician's Discussion List TURKMATH From: Akif Eyler Subject: Re: Hasan Akyildiz'dan mektup var Ali Nesin'in sorusu: > Turkiye'den Hasan Akyildiz adli birisinden bir mektup aldim. Bir > arastirma yapmis, daha once bu sonucun bilinip bilinmedigini soruyor. Cevap: Bu yontem, kesikli matematikte gayet iyi biliniyor. Bu donem verdigim bir dersin kitabinda, "Finite Calculus" isimli bir alt bolum olarak, ayni metodu bulabilirsiniz. Kaynak: Graham, Knuth, Patashnik, "Concrete Mathematics", Addison-Wesley, 1989. M. Akif Eyler ========================================================================= Date: Thu, 21 Nov 91 11:42:11 +0200 Reply-To: Turkish Mathematician's Discussion List TURKMATH Sender: Turkish Mathematician's Discussion List TURKMATH From: Mefharet Kocatepe Subject: Re: Hasan Akyildiz'dan mektup var Bu mesaji yollamak uzereyken Akif Eyler'den de cevap geldigini farkettim. Akif'in soyledigi kitaba bakmadim henuz. Bernoulli sayilari iliskisinin ilginc oldugunu dusundugum icin mesaji yine de gonderiyorum. Spivak'in Calculus (Calculus on Manifolds degil) kitabinda bu konuda bazi seyler var. Herhangi bir f fonksiyonu icin T(n=a,b)f(n) notasyonunu f(a)+...+f(b) icin kullanacagim (Tabii a ve b tamsayi, veya b=sonsuz vb) 1) Chapter 2 Problem 7. p dogal sayi olmak uzere 1^p+2^p+...+n^p toplami (p+1)inci dereceden bir polinomdur. Bu p uzerinde tumevarim yapilarak ispatlanabilir. O zaman geriye bu polinomun p+2 tane olan katsayilarini bulmak oluyor. Ayni problemde n^(p+1) in katsayisinin 1/(p+1), n^p nin katsayisinin 1/2 oldugu soyleniyor. Tumevarimla bunu da gostermek mumkun. Diger katsayilari bulmak icin n'e p tane deger verip pxp lineer denklem sistemi cozmek yeterli. Ama kitapta diger katsayilarin ise Bernoulli sayilari ile iliskili oldugu soyleniyor. Kitapta p=1,...,p=10 icin formul verilmis. Ornegin: 1^5+...+n^5 = (1/6)n^6+(1/2)n^5+(5/12)n^4-(1/12)n^2 1^10+...+n^10 = (1/11)n^11+(1/2)n^10+(5/6)n^9-n^7+n^5 -(1/2)n^3+(5/66)n 2) Chapter 26 Problem 17 f(z)=z/(e^z-1) fonksiyonu z=0 da analytic oldugundan, z/(e^z-1)=T(n=0, sonsuz)(b_n/n!)(z^n) seri acilimi var. Yukaridaki b_n'ler Bernoulli sayilari. Problem sunu soyluyor. 1^p+...+n^p = n^(p+1)/(p+1) + n^p/2 + T(k=2,p)(b_k/k)C(p,k-1)n^(p-k+1) Tabii C(p,q)=(p!)/((q!)(p-q)!). 3) Chapter 26 Problem 17 de g polinom Problem 19 da ise g genel bir fonksiyon olmak uzere g(x)+g(x+1)+...+g(x+n) toplami icin Euler-Maclaurin Formulu veriliyor. g polinom ise g(0)+...+g(n)=\int_{0}^{n+1}g(t)dt + T(k=1,sonsuz)(b_k/k!)[g^{(k-1)}(n+1)-g^{(k-1)}(0)]. g polinom degilse sonsuz toplamin yerine bir sonlu toplam + kalan (remainder) yazmak gerekli. s_{n}(x)=T(k=0,n)C(n,k)b_{n-k}x^{k}, n inci Bernoulli polinomu ve R_{N}(x,n) = -T(j=0,n) \int_{x+j}^{x+j+1} [s_{N}(x+j+1-t)/N!] g^{(N)}(t) dt olmak uzere g(x)+g(x+1)+...+g(x+n)= \int_{x}^{x+n+1} g(t) dt + T(k=1,N) (b_k/k!) [g^{(k-1)}(x+n+1)-g^{(k-1)}(x)] + R_{N}(x,n). Yukarida "subscript" ve "superscript" icin bazan _n ,^n bazan da _{n}, ^{n} notasyonlarini kullandim. Bu karmasa icin ozur dilerim. Bernoulli sayilari ilk olarak 1^p+...+n^p ile iliskili olarak bulunmus. f(z)=z/(e^z-1) ile iliskisi Euler'e ait. Jacob Bernoulli (1654-1705). Saygilarimla Mefharet Kocatepe ========================================================================= Date: Thu, 21 Nov 91 14:22:45 +0200 Reply-To: Turkish Mathematician's Discussion List TURKMATH Sender: Turkish Mathematician's Discussion List TURKMATH From: Akif Eyler Subject: Re: Hasan Akyildiz'dan mektup var Mefharet Kocatepe'nin cevabi da cok guzel. (Bunlarin cogu daha once bahsettigim kitapta var. Bernoulli sayilarina da bir alt bolum ayrilmis.) Simdi soylemek istedigim, bu tur toplamlarda k=1...n yerine (mumkunse) k=0...n-1 kullanilmasinin daha iyi olacagi. Sonuclar bu sekilde daha guzel gorunuyor. Ornek: 1^10+...+n^10 = (1/11)n^11 +(1/2)n^10 +(5/6)n^9 -n^7 +n^5 -(1/2)n^3 +(5/66)n 0^10+...+(n-1)^10 = (1/11)n^11 -(1/2)n^10 +(5/6)n^9 -n^7 +n^5 -(1/2)n^3 +(5/66)n Isaretlerin sirasi daha hos degil mi? Bunu arzu etmemizin bir sebebi de, tamsayilardan gerceklere atlandiginda, ikinci toplamin [0,n] araliginda bir integrale benzetilmesidir. [1,n+1]'den daha basit degil mi? M. Akif Eyler Not: Konu acilmis iken, ben de bir soru getireyim: "Bu toplamlardaki ilk terimler cok iyi, belirsiz integral islemine benziyor. Acaba diger terimlerden nasil kurtulurum? Yani, oyle bir f(k,m) fonksiyonu olmali ki, (m sifir degilken) T(k=0...n-1)f(k,m-1) = f(n,m)/m olsun?" (Cevap ayni kitapta bulunabilir.) ========================================================================= Date: Thu, 21 Nov 91 16:50:21 +0200 Reply-To: Turkish Mathematician's Discussion List TURKMATH Sender: Turkish Mathematician's Discussion List TURKMATH From: Dept of Mathematics Subject: Seminer Duyurusu BILKENT UNIVERSITY DEPARTMENT OF MATHEMATICS SEMINAR ANNOUNCEMENT Subject: On the structure of certain quotient Lie Algebras Speaker: Melih Boral Date: Nov. 22, 1991 Time: 14.30 Place: A-331 ========================================================================= Date: Fri, 22 Nov 91 12:44:30 +1100 Reply-To: Turkish Mathematician's Discussion List TURKMATH Sender: Turkish Mathematician's Discussion List TURKMATH From: Irfan Altas Subject: ayisal Analizciler icin 2 makale Size asagida Sci.math.num-analysis News grubundan alInmIs 2 makale gonderiyorum. SayIsal Analizin 2 temel metodu Sonlu Farklar (Finite Differences) ve Sonlu Element (Finite Element) karsIlastIrIlmakta ve ilginc yaklasImlar verilmektedir. Sayisal Analizcilerin ilgisini cekecegini umit ediyorum. Ilgisini cekmeyenlerin bu uzun yazIyla vakitlerini aldIgIm icin simdiden ozur dilerim. Herkese sevgiler, Irfan Altas (AU, yeni dunyadan muhabiriniz) Not: 1) Ilginen arkadaslar olursa makalelerin devamini ozel olarak e-mail adreslerine gonderebilirim 2) Makalelerin subject bolumundeki SUNA kelimesi: "Series on Unified Numerical Approximations" Makale 1: -------------------------------------------------------------- From: rctthdb@dutrun2.tudelft.nl (Han de Bruijn) Newsgroups: sci.math.num-analysis,sci.philosophy.tech Subject: SUNA, The Manifesto The area of numerical mathematics is splitted up in two distinct disciplines, called respectively the Finite Difference method (F.D.) and the Finite Element method (F.E.). This fact is denied, by declaring that finite differences are merely a special case of finite elements (: O.C. Zienkiewicz), or trivialized, by "ignoring the siren voices from the finite element champ" (: D.B. Spalding). The contradiction is too profound to be neglected, however. Systems of coupled partial differential equations of considerable complexity, such as those describing fluid flow and heat transfer, can be made accessible to numerical treatment. Finite Difference Methods, but even more specificially Finite Volume Methods such as those described in [1], are very successful in this area. The robustness of the F.V. discretization schemes, employing just "Four Basic Rules", has no counterpart in Finite Element methodology. The main drawback of Finite Difference -like methods is well known, however. When attempting to get rid of inhomogeneous parts of the calculation domain, caused for example by curved boundaries, a considerable overhead is introduced, tending to make F.D./F.V. methods unworkable. When employing a Finite Element Method, curvilinear boundaries and topological complexity present no problem whatsoever. They are done in a uniform and natural fashion, which has no counterpart in Finite Difference methodology. This at last partly explains why F.E. methods have become so widely used in solid mechanics, where an accurate description of geometry and connectivity is important [2]. The main drawback of Finite Element Methods is well known, however. In order to formulate an F.E. discretization scheme properly, something like a variational or Galerkin principle has to be resorted to. When dealing with very complicated equations, especially those describing transport phenomena, this turns out to be a serious bottleneck. It is observed that the weak points of Finite Differences could be covered very precisely by the advantages of a Finite Element technique. The reverse is also true: certain drawbacks of a Finite Element method could be compensated easily, if it only were possible to use a Finite Difference approach in its context. All this cannot be true by coincidence. Let it be stated here very firmly that the existence of two (and more) separate numerical methods cannot be justified, neither from a scientific, nor from a practical point of view. If it were not possible to understand the nowadays situation within its historical context, then it could not be understood at all. Unification principle --------------------- | There should be ONE numerical method, instead of two (and more). | This method should be such that say Finite Differences and Finite Elements | are nothing else than just two different ways of looking at the same thing. | In other words, F.D. and F.E. are the two dual aspects of one and only one | universal numerical method. This Unification principle, instead of being merely a matter of philosophical consideration, will be shown in the sequel to imply far reaching mathematical consequences. For the moment being, it has to be considered as a basic axiom. There should be no doubt about the fact that Unified Numerical Approximations can be constructed, wishfully, on purpose, as an act of free will. The future is not what will happen to us, but: what we shall do. SUNA References: 1. S.V. Patankar; Numerical Heat Transfer and Fluid Flow; Hemisphere Publishing Company U.S.A. 1980. 2. O.C. Zienkiewicz; The Finite Element Method; 3th edition; Mc.Graw-Hill U.K. 1977. * Han de Bruijn; Applications&Graphics | "A little bit of Physics * No * TUD Computing Centre; P.O. Box 354 | would be NO idleness in * Oil * 2600 AJ Delft; The Netherlands. | Mathematics" (HdB). * for * E-mail: Han.deBruijn@RC.TUDelft.NL --| Fax: +31 15 78 37 87 ----* Blood ------------------------------------------------------------------------- 2. Makale: ------------------------------------------------------------------------- Isoparametric transformation is the standard approach where the Finite Element Method relies on when it has to deal with curved geometries: it's strong point. But let's consider first the simplest non-trivial finite element shape in two dimensions, the linear triangle, and see where isoparametric transformations do come from. Function behaviour is approximated inside 3 such a triangle by a _linear_ interpolation between the / \ function values at the vertices, or nodal points. / \ Let T be such a function, and x,y coordinates, / \ then: 1 ------------- 2 T = A.x + B.y + C Where the constants A, B, C are determined by: T1 = A.x1 + B.y1 + C T2 = ... But wait. The first of these equations can already be used to eliminate the constant C , once and forever: T - T1 = A.(x - x1) + B.(y - y1) Then the constants A and B are determined by: T2 - T1 = A.(x2 - x1) + B.(y2 - y1) T3 - T1 = A.(x3 - x1) + B.(y3 - y1) Two equations with two unknowns. The solution is found by Cramer's rule: A = [ (y3 - y1).(T2 - T1) - (y2 - y1).(T3 - T1) ]/J B = [ (x2 - x1).(T3 - T1) - (x3 - x1).(T2 - T1) ]/J Where: J = (x2 - x1).(y3 - y1) - (x3 - x1).(y2 - y1) = 2 * triangle area . So: T - T1 = h.(T2 - T1) + k.(T3 - T1) Where: h = [ (y3 - y1).(x - x1) - (x3 - x1).(y - y1) ]/J k = [ (x2 - x1).(y - y1) - (y2 - y1).(x - x1) ]/J Or: | h | | + (y3 - y1) - (x3 - x1) | | x - x1 | | | = | |/J | | | k | | - (y2 -y1) + (x2 - x1) | | y - y1 | The inverse of the following problem is recognized herein: | x - x1 | | x2 - x1 x3 - x1 | | h | | | = | | | | | y - y1 | | y2 - y1 y3 - y1 | | k | Or: x - x1 = h.(x2 - x1) + k.(x3 - x1) y - y1 = h.(y2 - y1) + k.(y3 - y1) But: T - T1 = h.(T2 - T1) + k.(T3 - T1) Typical! The _same_ expression holds for the function T as well as for the coordinates x and y . Which is precisely what people mean by an ISOPARAMETRIC ("same parameters") transformation. Now recall the formulas which express h and k into x and y: h = [ (y3 - y1).(x - x1) - (x3 - x1).(y - y1) ]/J k = [ (x2 - x1).(y - y1) - (y2 - y1).(x - x1) ]/J Thus h can be interpreted as: area of the sub-triangle spanned by the vectors (x - x1 , y - y1) and (x3 - x1 , y3 - y1) divided by the whole triangle area. And k can be interpreted as: area of the sub-triangle spanned by the vectors (x - x1 , y - y1) and (x2 - x1 , y2 - y1) divided by the whole triangle area. This is the reason why h and k are sometimes called _area-coordinates_. There are even _three_ of these coordinates in litterature (: Zienkiewicz). But one of them can be allways be safely discarded. I think it's a bad habit to retain a "coordinate" like (1 - h - k), being dependent on the other two. Instead of area-coordinates, we prefer to talk about _local coordinates_ h and k of an element, in contrast to the _global coordinates_ x and y . 3 It is possible that local coordinates coincide with the |\ global coordinates. A triangle for which this is the case | \ is called a _parent element_. The portrait of the parent | \ triangle is displayed here: rectangular, two sides equal. |______\ 1 2 Let's reconsider for a moment the expression: T - T1 = h.(T2 - T1) + k.(T3 - T1) Partial differentiation to h and k gives: dT/dh = T2 - T1 dT/dk = T3 - T1 So: T = T1 + h.dT/dh + k.dT/dk This is part of a Taylor series expansion around node (1). Such Taylor series expansions are very common in Finite Difference analysis. Now rewrite as follows: T = (1 - h - k).T1 + h.T2 + k.T3 Here the functions (1 - h - k) , h , k are called the SHAPE FUNCTIONS of the Finite Element. Shape functions Nk have the property that they are unity in one of the nodes (k), and zero in all other nodes. In our case: N1 = 1 - h - k ; N2 = h ; N3 = k So we have two representations, which are allmost trivially equivalent: T = T1 + h.(T2 - T1) + k.(T3 - T1) : Finite Difference like T = (1 - h - k).T1 + h.T2 + k.T3 : Finite Element like The two sets of functions (1,h,k) and (1-h-k,h,k) are mutually related as follows: F.D. <- F.E. F.E <- F.D. | 1 | | 1 1 1 | | 1-h-k | | 1-h-k | | 1 -1 -1 | | 1 | | h | = | 0 1 0 | | h | | h | = | 0 1 0 | | h | | k | | 0 0 1 | | k | | k | | 0 0 1 | | k | The two sets of functions can be conceived as two coordinate systems in an abstract three dimensional space. Then the above matrices are _transition_ matrices, belonging to F.D. <-> F.E. base transitions. Yes, the above is an instance of the Unification Principle (Re: SUNA, Manifesto). Not too difficult, eh? Well, not yet. To be continued ... * Han de Bruijn; Applications&Graphics | "A little bit of Physics * No * TUD Computing Centre; P.O. Box 354 | would be NO idleness in * Oil * 2600 AJ Delft; The Netherlands. | Mathematics" (HdB). * for * E-mail: Han.deBruijn@RC.TUDelft.NL --| Fax: +31 15 78 37 87 ----* Blood ========================================================================= Date: Fri, 22 Nov 91 15:21:29 +1100 Reply-To: Turkish Mathematician's Discussion List TURKMATH Sender: Turkish Mathematician's Discussion List TURKMATH From: Irfan Altas Subject: ozur Bir once gonderdigim mesajin subject kisminda "Sayisal" yerine " ayisal" cikmis. Galiba benim PC nin shift tusu pek iyi calismiyor. Ozur dilerim. Herkese sevgiler, Irfan Altas (AU, yeni dunyadan muhabiriniz) ========================================================================= Date: Fri, 22 Nov 91 09:15:36 +0200 Reply-To: Turkish Mathematician's Discussion List TURKMATH Sender: Turkish Mathematician's Discussion List TURKMATH From: Mustafa Akgul Subject: Symbolic Computation Conference Ekteki duyuruyu bzilarimizin ilgisini ceker diye duyuruyorum. Saygilar %%%%%% From NMBRTHRY@NDSUVM1.BITNET Fri Nov 22 04:01:54 1991 Return-Path: Received: from dicle.bcc.bilkent.edu.tr by bcc.bilkent.edu.tr (4.1/SMI-4.1) id AA19541; Fri, 22 Nov 91 04:01:54 +0200 Received: From trmetu.bitnet By trbilun.bitnet ; 22 Nov 91 00:57:38 GMT Received: from TRMETU by TRMETU.BITNET (Mailer R2.07) with BSMTP id 4534; Fri, 22 Nov 91 03:59:42 TUR Received: from YKTVMH3 by watson.vnet.ibm.com with "VAGENT.V1.0" id 8841; Thu, 21 Nov 1991 16:19:24 EST Received: from cyst.watson.ibm.com by yktvmh3.watson.ibm.com (IBM VM SMTP V2R2) with TCP; Thu, 21 Nov 91 16:19:23 EST Received: from irt.watson.ibm.com by cyst.watson.ibm.com (AIX 1.3/900528) id AA24046; Thu, 21 Nov 91 16:19:21 -0500 Received: from localhost.watson.ibm.com by irt.watson.ibm.com (5.65+/1.34) id AA05975; Thu, 21 Nov 91 16:19:20 -0500 X-External-Networks: yes Precedence: bulk Apparently-To: Approved-By: VICTOR@WATSON.BITNET Message-Id: <70946@nigel.ee.udel.edu> Newsgroups: bit.listserv.nmbrthry Date: Thu, 21 Nov 1991 16:19:18 -0500 Reply-To: Lakshman Sender: Number Theory List From: Lakshman Subject: CALL FOR PAPERS -- ISSAC 92 To: Multiple recipients of Status: RO CALL FOR PAPERS INTERNATIONAL SYMPOSIUM ON SYMBOLIC AND ALGEBRAIC COMPUTATION July 27-29, 1992 Berkeley, California The annual International Symposium on Symbolic and Algebraic Computation (ISSAC), sponsored by the ACM Special Interest Groups on Numerical Mathematics and on Symbolic & Algebraic Manipulation, will be held on the campus of the University of California at Berkeley, July 27-29, 1992. Papers present- ing original research on all aspects of symbolic and alge- braic computation are sought. Typical, but not exclusive topics of interest include: combined symbolic/numeric methods (special emphasis is placed on this subject); algo- rithms for problems in algebra, number theory, group theory, algebraic geometry, differential algebra, and differential equations; languages and systems for symbolic computation, parallel symbolic computation; automatic theorem proving and programming; applications of symbolic computation to mathematics, science, engineering, and education. PAPER SUBMISSION: Authors are requested to send 15 copies of their paper by January 14, 1992 to either of the program committee chair: Daniel Lazard LITP, Inst. Programmation, Universite Paris VI F-75230 Paris Cedex 05, France Barry Trager IBM T.J. Watson Research Ctr., P.O. Box 218 Yorktown Heights, NY 10598, USA Authors from locations where access to reproduction facili- ties is severely limited may submit a single copy of their paper. The submission should start with a succinct statement of the problem, the results achieved, an explanation of their significance, and a comparison with previous work. This material should be readily understandable to non- specialists. Technical development, directed toward the spe- cialist, should follow as appropriate. The length, excluding cover page and bibliography, should not exceed 10 pages. If authors believe that more details are necessary to substan- tiate the main claims of the paper, they may include a clearly marked appendix that will be read at the discretion of the program committee. The title should include the con- tact author's name, address, telephone number, and e-mail address if available. A paper must be received by January 14, 1992 (or postmarked by January 2 and sent airmail), or it risks rejection without consideration of merit. Simultaneous submission of essentially the same paper to another conference with pub- lished proceedings is not allowed. NOTIFICATION: Authors will be notified of acceptance or rejection by the program committee chairs by a letter mailed by the end of March. A final copy of each accepted paper is to be in the hands of the proceedings editor Paul Wang, Dept. Math. & Comput. Sci., Kent State Univ., Kent, OH 44342, by April 29. MEETING FORMAT: Authors of accepted papers will be expected to present their work at the Symposium. There will be a small number of researchers invited to speak on topics of general interest to the conference. PROGRAM COMMITTEE: Bruce Char, Henri Cohen, James Davenport, Jean Della Dora, John Gilbert, Lakshman Y. N., Daniel Lazard, Gerhard Michler, Michael Monagan, Jean-Jacques Risler, Horst Simon, Stanly Steinberg, Barry Trager, Carlo Traverso, and Richard Zippel. CONFERENCE OFFICERS: The organizing officers are Richard Fateman (local arrangements chair), Robert Grossman (treasurer), Erich Kaltofen (conference chair), Daniel Lazard (prog. committee co-chair), Moss Sweedler (publicity chair), Barry Trager (prog. committee co- chair), and Paul Wang (proceedings editor). LOCAL ARRANGEMENTS COMMITTEE: The local arrangements commit- tee consists of John Canny, James Demmel, Richard Fateman, and Kathy Yelick. For further information contact: Richard Fateman EECS Dept., Comput. Sci. Div. 571 Evans Hall University of California Berkeley, CA 94720 E-mail: fateman@cs.berkeley.edu Phone: (510) 642 1879 Erich Kaltofen Dept. Comput. Sci. Rensselaer Polytechnic Institute Troy, NY 12180-3590 E-mail: kaltofen@cs.rpi.edu Phone: (518) 276 6907 Moss Sweedler ACSyAM, Math. Sciences Institute 409 College Ave. Cornell University Ithaca, NY 14853 E-mail: jc5j@cornellc.cit.cornell.edu Phone: (607) 255 4373 =============================================================== A Postscript version of the above announcement can be obtained by ftp from anonymous@archive.cs.rpi.edu [Addr.: 128.113.53.18] from the file kaltofen/call.ps Keywords: ========================================================================= Date: Sat, 23 Nov 91 15:02:30 GMT Reply-To: Turkish Mathematician's Discussion List TURKMATH Sender: Turkish Mathematician's Discussion List TURKMATH From: PMT5RE@CMS1.LEEDS.AC.UK Subject: ISIM DEGISIKLIGI SAYIN TURKMAT UYELERI, BEN DE YURT DISINDA DOKTORA CALISMASI YAPAN, AYNI ZAMANDA YURT HASRETIYLE YANAN TUTUSAN BIRI OLARAK BU TURK MATEMATIKCILER LISTESININ ADININ NEDEN YABANCI DILDE YAZILMASI GEREKTIGINI ANLAMIS DEGILIM. BEN DE SOYLE DUSUNUYORUM: " TURKMAT'A EVET, TURKMATH'A HAYIR " CALISMALARINIZ DA BASARILAR. RIDVAN EZENTAS ========================================================================= Date: Thu, 21 Nov 91 12:53:04 EST Reply-To: Turkish Mathematician's Discussion List TURKMATH Sender: Turkish Mathematician's Discussion List TURKMATH From: TANBAY@TRBOUN Subject: Re: oylama Ben de artik dayanamadigim icin , her ne kadar oylamanin gecerliligi belli degilse de, oyluyorum. Oyumun tabii aciklamalari var, fakat bu konuda degil yazmak okumaktan ve ilgili mesajlari "delete" etmekten (ingilizce bir kelime kullandigim icin ozur dilerim!) bile biktigim icin, uzatmiyacagim: TURKMATH 'a EVET. Betul Tanbay ========================================================================= Date: Mon, 25 Nov 91 18:03:48 +0200 Reply-To: Turkish Mathematician's Discussion List TURKMATH Sender: Turkish Mathematician's Discussion List TURKMATH From: AKMAN@TRBILUN Subject: Uzun ama ilginc bilgilerle dolu bir mesaj DEGERLI ARKADASLAR- ASAGIDAKI MESAJI "SCI.MATH" ADLI "NEWS" GRUBUNDAN KOPYA ETTIM. ADI GECEN GRUBA ERISIM OLANAGI OLMAYAN ARKADASLAR ICIN ILGINC OLACAGINI DUSUNDUM. MESAJI "POST" EDEN KISININ HAKLARINI CIGNEMEMEK ICIN MESAJDA ("HEADER" KISMI DISINDA) HERHANGI BIR KISALTMA YAPMADIM. SAYGILAR. VAROL AKMAN BILKENT UNIVERSITESI, ANKARA ----------------------------->8 BURADAN KESINIZ 8<---------------------- Sender: alopez-o@maytag.uwaterloo.ca Reply-To: alopez-o@maytag.uwaterloo.ca Followup-To: sci.math Organization: University of Waterloo Lines: 642 Approved: news-answers-request@MIT.Edu Xref: trbilun sci.math:29 Archive-name: sci-math-faq This is a list of frequently asked questions for sci.math (version 2.5). Any contributions/suggestions/corrections are most welcome. (Thanks to all the people who already contributed). Please use * e-mail * on any comment concerning the FAQ list. FAQ is posted automatically twice a month. If you are a frequent reader of sci.math you may want to add FAQ to your kill file. Some changes in format have been made to accomodate the news.answers newsgroup. Changes of version will be important enough to deserve reading the FAQ list again. Additions are marked with a # on the table of contents. Still you may kill all versions of FAQ using the * wildcard. (Ask your local unix guru for ways to do so). Table of Contents ----------------- 1.- Fermat's Last Theorem, status of .. 2.- Four colour Theorem, proof of .. 3.- Values of Record Numbers 4.- General Netiquette 5.- Computer Algebra Systems, application of .. 6.- Computer Algebra Systems, references to .. 7.- Fields Medal, general info .. 8.- 0^0=1. A comprehensive approach .. 9.- 0.999... = 1. Properties of the real numbers .. 10.- Digits of Pi, computation and references .. 11.- There are three doors, The Monty Hall problem .. 12.- Surface and Volume of the n-ball. 13.- f(x)^f(x)=x, name of the function .. 14.- Projective plane of 10 dimensions .. Does anybody have references to any of the following results? If so, please e-mail them to me (alopez-o@maytag.UWaterloo.ca) so they can be added to the answers. Q: What is the current status of Fermat's last theorem? (There are no positive integers x,y,z, and n > 2 such that x^n + y^n = z^n) I heard that claimed to have proved it but later on the proof was found to be wrong. ... (wlog we assume x,y,z to be relatively prime) A: The status of FLT has remained remarkably constant. Every few years, someone claims to have a proof ... but oh, wait, not quite. Meanwhile, it is proved true for ever greater values of the exponent (but not all of them), and ties are shown between it and other conjectures (if only we could prove one of them), and ... so it has been for quite some time. It has been proved that for each exponent, there are at most a finite number of counter-examples to FLT. On the FLT Robert Silverman says: Here is a brief survey of the status of FLT. It is not intended to be 'deep',but rather is intended for non-specialists. The theorem is broken into 2 cases. The first case assumes (abc,n) = 1. The second case is the general case. What has been PROVED -------------------- First Case. It has been proven true up to 7.568x10^17 by the work of Wagstaff & Tanner, Granville&Monagan, and Coppersmith.They all used extensions of the Wiefrich criteria and improved upon work performed by Gunderson and Shanks&Williams. The first case has been proven to be true for an infinite number of exponents by Adelman, Frey, et. al. using a generalization of the Sophie Germain criterion Second Case: It has been proven true up to n = 150,000 by Tanner & Wagstaff. The work used new techniques for computing Bernoulli numbers mod p and improved upon work of Vandiver. The work involved computing the irregular primes up to 150,000. FLT is true for all regular primes by a theorem of Kummer. In the case of irregular primes, some additional computations are needed. UPDATE : Fermat's Last Theorem has been proved true up to exponent 1,000,000 in the general case. The method used was that of Wagstaff: enumerating and eliminating irregular primes by Bernoulli number computations. The computations were performed on a set of NeXT computers by Richard Crandall. Since the genus of the curve a^n + b^n = 1, is greater than or equal to 2 for n > 3, it follows from Mordell's theorem [proved by Faltings], that for any given n, there are at most a finite number of solutions. Conjectures ----------- There are many open conjectures that imply FLT. These conjectures come from different directions, but can be basically broken into several classes: (and there are interrelationships between the classes) (a) conjectures arising from Diophantine approximation theory such as The ABC conjecture, the Szpiro conjecture, the Hall conjecture, etc. For an excellent survey article on these subjects see the article by Serge Lang in the Bulletin of the AMS, July 1990 entitled "Old and new conjectured diophantine inequalities". Masser and Osterle formulated the following known as the ABC conjecture: Given epsilon > 0, there exists a number C(epsilon) such that for any set of non-zero, relatively prime integers a,b,c such that a+b = c we have max( |a|, |b|, |c|) <= C(epsilon) N(abc)^(1 + epsilon) where N(x) is the product of the distinct primes dividing x. It is easy to see that it implies FLT asymptotically. The conjecture was motivated by a theorem, due to Mason tha essentially says the ABC conjecture IS true for polynomials. The ABC conjecture also implies Szpiro's conjecture [and vice-versa] and Hall's conjecture. These results are all generally believed to be true. There is a generalization of the ABC conjecture [by Vojta] which is too technical to discuss but involves heights of points on non-singular algebraic varieties . Vojta's conjecture also imples Mordell's theorem. [already known to be true]. There are also a number of inter-twined conjectures involving heights on elliptic curves that are related to much of this stuff. For a more complete discussion, see Lang's article. (b) conjectures arising from the study of elliptic curves and modular forms. -- The Taniyama-Weil-Shmimura conjecture. There is a very important and well known conjecture known as the Taniyama-Weil-Shimura conjecture that concerns elliptic curves. This conjecture has been shown by the work of Frey, Serre, Ribet, et. al. to imply FLT uniformly, not just asymptotically as with the ABC conj. The conjecture basically states that all elliptic curves can be parameterized in terms of modular forms. There is new work on the arithmetic of elliptic curves. Sha, the Tate-Shafarevich group on elliptic curves of rank 0 or 1. By the way. An interesting aspect of this work is that there is a close connection between Sha, and some of the classical work on FLT. For example, there is a classical proof that uses infinite descent to prove FLT for n = 4. It can be shown that there is an elliptic curve associated with FLT and that for n=4, Sha is trivial. It can also be shown that in the cases where Sha is non-trivial, that infinite-descent arguments do not work; that in some sense 'Sha blocks the descent'. Somewhat more technically, Sha is an obstruction to the local-global principle [e.g. the Hasse-Minkowski theorem]. (c) Conjectures arising from some conjectured inequalities involving Chern classes and some other deep results/conjectures in arithmetic algebraic gemoetry. [about which I know epsilon]. I can't describe these results since I don't know the math. Contact Barry Mazur [or Serre, or Faltings, or Ribet, or ...]. Actually the set of people who DO understand this stuff is fairly small. The diophantine and elliptic curve conjectures all involve deep properties of integers. Until these conjecture were tied to FLT, FLT had been regarded by most mathematicians as an isolated problem; a curiosity. Now it can be seen that it follows from some deep and fundamental properties of the integers. [not yet proven but generally believed]. This synopsis is quite brief. A full survey would run to many pages. Q: Has the 4 colour theorem been solved? (Every planar map with regions of simple borders can be coloured with 4 colours in such a way that no two regions sharing a non-zero length border have the same colour.) A: This theorem was proved with the aid of a computer in 1976. The proof shows that if aprox. 1,700 (?) basic forms of maps can be colored with four colours, then any given map can be colored with four colours. So far nobody has been able to prove it without using a computer. In principle it is possible to emulate the computer proof by hand computations. References: K. Appel and W. Haken, Every planar map is four colourable, Bulletin of the American Mathematical Society, vol. 82, 1976 pp.711-712. K. Appel and W. Haken, Every planar map is four colourable, Illinois Journal of Mathematics, vol. 21, 1977, pp. 429-567. T. Saaty and Paul Kainen, The Four Colour Theorem: Assault and Conquest, McGraw-Hill, 1977. Q: What are the values of: largest known prime? A: The largest known prime (currently) is 391581*2^216193 - 1. See Brown, Noll, Parady, Smith, Smith, and Zarantonello, Letter to the editor, American Mathematical Monthly, vol. 97, 1990, p. 214. largest twin primes? A: The largest known twin primes are 1706595*2^11235 +- 1. See B. K. Parady and J. F. Smith and S. E. Zarantonello, Largest known twin primes, Mathematics of Computation, vol.55, 1990, pp. 381-382. (Please send updates to alopez-o@maytag.UWaterloo.ca) Q: I think I proved . OR I think I have a bright new idea. What should I do? A: Are you an expert in the area? If not, please ask first local gurus for pointers to related work (the "distribution" field may serve well for this purposes). If after reading them you still think your *proof is correct*/*idea is new* then send it to the net. Q: I have this complicated symbolic problem (most likely a symbolic integral or a DE system) that I can't solve. What should I do? A: Find a friend with access to a computer algebra system like MAPLE, MACSYMA or MATHEMATICA and ask her/him to solve it. If packages cannot solve it, then (and only then) ask the net. Q: Where can I get ? This is not a comprehensive list. There are other Computer Algebra packages available that may better suit your needs. A: Maple Purpose: Symbolic and numeric computation, mathematical programming, and mathematical visualization. Contact: Waterloo Maple Software, 160 Columbia Street West, Waterloo, Ontario, Canada N2L 3L3 Phone: (519) 747-2373 wmsi@daisy.uwaterloo.ca wmsi@daisy.waterloo.edu A: DOE-Macsyma Purpose: Symbolic and mathematical manipulations. Contact: National Energy Software Center Argonne National Laboratory 9700 South Cass Avenue Argonne, Illinois 60439 Phone: (708) 972-7250 A: Pari Purpose: Number-theoretic computations and simple numerical analysis. Available for Sun 3, Sun 4, generic 32-bit Unix, and Macintosh II. This is a free package, available by ftp from math.ucla.edu (128.97.64.16). Contact: questions about pari can be sent to pari@mizar.greco-prog.fr A: Mathematica Purpose: Mathematical computation and visualization, symbolic programming. Contact: Wolfram Research, Inc. 100 Trade Center Drive Champaign, IL 61820-7237 Phone: 1-800-441-MATH A: Macsyma Purpose: Symbolic and mathematical manipulations. Contact: Symbolics, Inc. 8 New England Executive Park East Burlington, Massachusetts 01803 United States of America (617) 221-1250 macsyma@Symbolics.COM A: Matlab Purpose: `matrix laboratory' for tasks involving matrices, graphics and general numerical computation. Contact: The MathWorks, Inc. 21 Eliot Street South Natick, MA 01760 508-653-1415 info@mathworks.com A: Cayley Purpose: Computation in algebraic and combinatorial structures such as groups, rings, fields, modules and graphs. Available for: SUN 3, SUN 4, IBM running AIX or VM, DEC VMS, others Contact: Computational Algebra Group University of Sydney NSW 2006 Australia Phone: (61) (02) 692 3338 Fax: (61) (02) 692 4534 cayley@maths.su.oz.au Q: Let P be a property about the Fields Medal. Is P(x) true? A: There are a few gaps in the list. If you know any of the missing information (or if you notice any mistakes), please send me e-mail. Year Name Birthplace Age Institution ---- ---- ---------- --- ----------- 1936 Ahlfors, Lars Helsinki Finland 29 Harvard U USA 1936 Douglas, Jesse New York NY USA 39 MIT USA 1950 Schwartz, Laurent Paris France 35 U of Nancy France 1950 Selberg, Atle Langesund Norway 33 Adv.Std.Princeton USA 1954 Kodaira, Kunihiko Tokyo Japan 39 Princeton U USA 1954 Serre, Jean-Pierre Bages France 27 College de France France 1958 Roth, Klaus Breslau Germany 32 U of London UK 1958 Thom, Rene Montbeliard France 35 U of Strasbourg France 1962 Hormander, Lars Mjallby Sweden 31 U of Stockholm Sweden 1962 Milnor, John Orange NJ USA 31 Princeton U USA 1966 Atiyah, Michael London UK 37 Oxford U UK 1966 Cohen, Paul Long Branch NJ USA 32 Stanford U USA 1966 Grothendieck, Alexander Berlin Germany 38 U of Paris France 1966 Smale, Stephen Flint MI USA 36 UC Berkeley USA 1970 Baker, Alan London UK 31 Cambridge U UK 1970 Hironaka, Heisuke Yamaguchi-ken Japan 39 Harvard U USA 1970 Novikov, Serge Gorki USSR 32 Beloruskii U USSR 1970 Thompson, John ? KA USA 37 U of Chicago USA 1974 Bombieri, Enrico Milan Italy 33 U of Pisa Italy 1974 Mumford, David Worth, Sussex UK 37 Harvard U USA 1978 Deligne, Pierre Brussels Belgium 33 IHES France 1978 Fefferman, Charles Washington DC USA 29 Princeton U USA 1978 Margulis, Gregori Moscow USSR 32 Infor.Proc.Moscow USSR 1978 Quillen, Daniel Orange NJ USA 38 MIT USA 1982 Connes, Alain Draguignan France 35 IHES France 1982 Thurston, William Washington DC USA 35 Princeton U USA 1982 Yau, Shing-Tung Kwuntung China 33 IAS USA 1986 Donaldson, Simon Cambridge UK 27 Oxford U UK 1986 Faltings, Gerd 1954 Germany 32 Princeton U USA 1986 Freedman, Michael Los Angeles CA USA 35 UC San Diego USA 1990 Drinfeld, Vladimir ? USSR 36 Phys.Inst.Kharkov USSR 1990 Jones, Vaughan Auckland N Zealand 38 UC Berkeley USA 1990 Mori, Shigefumi Nagoya Japan 39 U of Kyoto? Japan 1990 Witten, Edward ? USA 38 Princeton U/IAS USA References : International Mathematical Congresses, An Illustrated History 1893-1986, Revised Edition, Including 1986, by Donald J.Alberts, G. L. Alexanderson and Constance Reid, Springer Verlag, 1987. Tropp, Henry S., ``The origins and history of the Fields Medal,'' Historia Mathematica, 3(1976), 167-181. Q: What is 0^0 ? A: According to some Calculus textbooks, 0^0 is an "indeterminate form". When evaluating a limit of the form 0^0, then you need to know that limits of that form are called "indeterminate forms", and that you need to use a special technique such as L'Hopital's rule to evaluate them. Otherwise, 0^0=1 seems to be the most useful choice for 0^0. This convention allows us to extend definitions in different areas of mathematics that otherwise would require treating 0 as a special case. Notice that 0^0 is a discontinuity of the function x^y. From Concrete Mathematics p.162 (R. Graham, D. Knuth, O. Patashnik): "Some textbooks leave the quantity 0^0 undefined, because the functions x^0 and 0^x have different limiting values when x decreases to 0. But this is a mistake. We must define x^0 = 1 for all x, if the binomial theorem is to be valid when x=0, y=0, and/or x=-y. The theorem is too important to be arbitrarily restricted! By contrast, the function 0^x is quite unimportant." Published by Addison-Wesley, 2nd printing Dec, 1988. Another reference is: H. E. Vaughan, The expression '0^0', Mathematics Teacher 63 (1970), pp.111-112. (Send comments to alopez-o@maytag.UWaterloo.ca) Q: Why is 0.9999... = 1? A: In modern mathematics, the string of symbols "0.9999..." is understood to be a shorthand for "the infinite sum 9/10 + 9/100 + 9/1000 + ...." This in turn is shorthand for "the limit of the sequence of real numbers 9/10, 9/10 + 9/100, 9/10 + 9/100 + 9/1000, ..." Using the well-known epsilon-delta definition of limit, one can easily show that this limit is 1. The statement that 0.9999... = 1 is simply an abbreviation of this fact. oo m --- 9 --- 9 0.999... = > ---- = lim > ---- --- 10^n m->oo --- 10^n n=1 n=1 Choose epsilon > 0. Suppose delta = 1/-log_10 epsilon, thus epsilon = 10^(-1/delta). For every m>1/delta we have that | m | | --- 9 | 1 1 | > ---- - 1 | = ---- < ------------ = epsilon | --- 10^n | 10^m 10^(1/delta) | n=1 | So by the (epsilon-delta) definition of the limit we have m --- 9 lim > ---- = 1 m->oo --- 10^n n=1 An *informal* argument could be given by noticing that the following sequence of "natural" operations has as a consequence 1 = 0.9999.... Therefore it's "natural" to assume 1 = 0.9999..... x = 0.99999.... 10x = 9.99999.... 10x - x = 9 9x = 9 x = 1 Thus 1 = 0.99999.... References: E. Hewitt & K. Stromberg, Real and Abstract Analysis, Springer-Verlag, Berlin, 1965. W. Rudin, Principles of Mathematical Analysis, McGraw-Hill, 1976. Q: Where I can get pi upto a few hundred thousand digits of pi? Does anyone have an algorithm to compute pi to those zillion decimal places? A: MAPLE or MATHEMATICA can give you 10,000 digits of Pi in a blink, and they can compute another 20,000-200,000 overnight (range depends on hardware platform). It is possible to retrieve 1.25+ million digits of pi via anonymous ftp from the site wuarchive.wustl.edu, in the directory /info/pi. References from : jk87377@cs.tut.fi 1. David H. Bailey The computation of pi to 29,360,000 decimal digits using Borwein' quartically convergent algorithm Mathematics of Computation, Vol. 50, No. 181, Jan 1988, pp. 283-296 2. David H. Bailey Numerical results on the transcendence of constants involving pi, e, and Euler's constant Mathematics of Computation, Vol. 50, No. 181, Jan 1988, pp. 275-281 3. P. Beckman A history of pi Golem Press, CO, 1971 (fourth edition 1977) 4. J.M. Borwein and P.B. Borwein The arithmetic-geometric mean and fast computation of elementary functions SIAM Review, Vol. 26, 1984, pp. 351-366 5. J.M. Borwein and P.B. Borwein More quadratically converging algorithms for pi Mathematics of Computation, Vol. 46, 1986, pp. 247-253 6. J.M. Borwein and P.B. Borwein Pi and the AGM - a study in analytic number theory and computational complexity Wiley, New York, 1987 7. Shlomo Breuer and Gideon Zwas Mathematical-educational aspects of the computation of pi Int. J. Math. Educ. Sci. Technol., Vol. 15, No. 2, 1984, pp. 231-244 8. Y. Kanada and Y. Tamura Calculation of pi to 10,013,395 decimal places based on the Gauss-Legendre algorithm and Gauss arctangent relation Computer Centre, University of Tokyo, 1983 9. Morris Newman and Daniel Shanks On a sequence arising in series for pi Mathematics of computation, Vol. 42, No. 165, Jan 1984, pp. 199-217 10. E. Salamin Computation of pi using arithmetic-geometric mean Mathematics of Computation, Vol. 30, 1976, pp. 565-570 11. D. Shanks and J.W. Wrench, Jr. Calculation of pi to 100,000 decimals Mathematics of Computation, Vol. 16, 1962, pp. 76-99 12. Daniel Shanks Dihedral quartic approximations and series for pi J. Number Theory, Vol. 14, 1982, pp.397-423 13. David Singmaster The legal values of pi The Mathematical Intelligencer, Vol. 7, No. 2, 1985 14. Stan Wagon Is pi normal? The Mathematical Intelligencer, Vol. 7, No. 3, 1985 15. J.W. Wrench, Jr. The evolution of extended decimal approximations to pi The Mathematics Teacher, Vol. 53, 1960, pp. 644-650 Q: There are three doors, and there is a car hidden behind one of them... A: Read frequently asked questions from rec.puzzles, where the problem is solved and carefully explained. (The Monty Hall problem). Q: What is the formula for the "Surface Area" of a sphere in Euclidean N-Space. That is, of course, the volume of the N-1 solid which comprises the boundary of an N-Sphere. A: The volume of a ball is the easiest formula to remember: It's r^N times pi^(N/2)/(N/2)!. The only hard part is taking the factorial of a half-integer. The real definition is that x! = Gamma(x+1), but if you want a formula, it's: (1/2+n)! = sqrt(pi)*(2n+2)!/(n+1)!/4^(n+1) To get the surface area, you just differentiate to get N*pi^(N/2)/(N/2)!*r^(N-1). There is a clever way to obtain this formula using Gaussian integrals. First, we note that the integral over the line of e^(-x^2) is sqrt(pi). Therefore the integral over N-space of e^(-x_1^2-x_2^2-...-x_N^2) is sqrt(pi)^n. Now we change to spherical coordinates. We get the integral from 0 to infinity of V*r^(N-1)*e^(-r^2), where V is the surface volume of a sphere. Integrate by parts repeatedly to get the desired formula. Q: Anyone knows a name (or a closed form) for f(x)^f(x)=x Solving for f one finds a "continued fraction"-like answer f(x) = log x ----- log (log x ------ ........... A: This question has been repeated here from time to time over the years, and no one seems to have heard of any published work on it, nor a published name for it (D. Merrit proposes "lx" due to its (very) faint resemblence to log). It's not an analytic function. The "continued fraction" form for its numeric solution is highly unstable in the region of its minimum at 1/e (because the graph is quite flat there yet logarithmic approximation oscillates wildly), although it converges fairly quickly elsewhere. To compute its value near 1/e, I used the bisection method with good results. Bisection in other regions converges much more slowly than the "logarithmic continued fraction" form, so a hybrid of the two seems suitable. Note that it's dual valued for the reals (and many valued complex for negative reals). This function is a "built-in" function in MAPLE called W(x). MAPLE considers a solution in terms of W(x) as a closed form (like the erf function). If anyone ever runs across something published on the subject, please post. Q: The existence of a projective plane of order 10 has long been an outstanding problem in discrete mathematics and finite geometry. A: More precisely, the question is: is it possible to define 111 sets (lines) of 11 points each such that: for any pair of points there is precisely one line containing them both and for any pair of lines there is only one point common to them both. Analogous questions with n^2 + n + 1 and n + 1 instead of 111 and 11 have been positively answered only in case n is a prime power. For n=6 it is not possible. The n=10 case has been settled by Clement Lam. See Am. Math. Monthly, recent issue. As the "proof" took several years of computer search (the equivalent of 2000 hours on a Cray-1) it can be called the most time-intensive computer assisted single proof. The final steps were ready in January 1989. -------------------------------------------------------------------------- Questions and Answers _Compiled_ by: Alex Lopez-Ortiz alopez-o@maytag.UWaterloo.ca University of Waterloo Canada - Varol Akman Bilkent University, Ankara Logic is logic, that's all I say. - OLIVER WENDEL HOLMES ========================================================================= Date: Mon, 25 Nov 91 19:28:00 PST Reply-To: Turkish Mathematician's Discussion List TURKMATH Sender: Turkish Mathematician's Discussion List TURKMATH From: ANESIN@UCIVMSC Subject: Sozluk Ingilizce-Turkce matematiksel sozluk var mi? Yoksa, ortak bir calismayla hazirlayabiliriz. Varsa, eksiklerini giderebiliriz. Bu ise benim gibi bir istekli, gonullu var mi? Ali ========================================================================= Date: Tue, 26 Nov 91 04:41:00 PST Reply-To: Turkish Mathematician's Discussion List TURKMATH Sender: Turkish Mathematician's Discussion List TURKMATH From: ANESIN@UCIVMSC Subject: Ilginc yerel tikisik gruplar Gecenlerde "group representation" seminerinde, bir yerel tikisik (locally compact) grupun "connected component" inin grupun topolojisini ne denli etkiledigini tartisiyorduk. Karsimiza dogal olarak su soru cikti: G yerel tikisik bir grup olsun ve G'nin her tikisik (compact) alt-kumesinin sonlu oldugunu varsayalim. G hakkinda ne diyebiliriz? Her "discrete" grubun bu ozelligi vardir elbet. Baska ornek var midir? Varmis. Ornek su: G "abelian" bir grup olsun. S^1 = {c \in C: c^n = 1} = R/Z, daire grubu olsun. F = {f: G ---> S^1: f grup homomorfizm} olsun. G'ye, F'deki tum foksiyonlari surekli yapan en zayif topolojiyi koyalim. Bu topolojiyle G, 1) yerel tikisik bir gruptur, 2) her tikisik alt kume sonludur, 3) topoloji "discrete" degildir (G sonsuzsa). Glicksberg adli bir matematikcinin 1962 yilinda kanitladigi teorem yukaridaki ornekle cok yakindan ilgili: "Let (G, t) be a locally compact abelian group. Then a subset A of G is t-compact iff A is compact in the topology which G inherits from its Bohr compactification". Glicksberg teoreminin, discrete gruplar icin basit bir kaniti Comfort ve Trigos-Arrieta adli matematikcilerin, "General Topology and its Applications, 5th Northeast Conference, edited by Andima etal., 1991" de bulunabilir. Comfort ve Trigos-Arrieta, kanitlarinda Ramsey teoremini kullaniyorlar. Ali ========================================================================= Date: Tue, 26 Nov 91 16:30:50 +0200 Reply-To: Turkish Mathematician's Discussion List TURKMATH Sender: Turkish Mathematician's Discussion List TURKMATH From: Sinan Sertoz Subject: Problem Bu soruyu ogrenciler Ulug Capar'a sormus. O da bana bahsetti. Beraber bir cozum bulduk ama... soyle birkac satirlik `temiz' bir cozumu var sanki... Bir bilen soylesin: { cos n | n bir positiv tam sayi } setinin [-1,1] araliginda yogun oldugunu gosterin. Dil uzerine notlar: "positiv" lafini oldum olasi sevmem. "yogun" kelimesi "dense" anlami kullanildi; A seti B seti icinde diyecegiz eger A'nin kapanisi B' Problem uzerine not: Temiz bir ispat cikarmazsaniz bizim uzun ispati aga yayacagim. Hadi bakalim kolay gelsin! (*) (*) Yurt disindakilere not: bu sozler Sezen Aksu'nun (o da kim?) son aylarda cok meshur olan bir sarkisina ait. ========================================================================= Date: Tue, 26 Nov 91 16:56:20 +0200 Reply-To: Turkish Mathematician's Discussion List TURKMATH Sender: Turkish Mathematician's Discussion List TURKMATH From: Sinan Sertoz Subject: Re: Sozluk Turk Dil Kurumunun zamaninda hazirladigi boyle bir sozluk var. Bu sozlukte de epey terimin karsiligi var. Ama kelimeleri ortaya atmakla kelimeleri kullanmak ayni sey degil. Ilk once ITU gibi Turkce egitim yapan yerlerde kullanilan terimleri toplayip sonra da yeni kullanima giren kavramlar karsiligi kelimeleri derlemek gerekiyor. Birinci kriter kullanilirlik. Bunu test edecegimiz en iyi ortam da simdilik bu ag. Burada kullanacagimiz dili zamanla hepimiz ortak anlasma araci olarak benimseyecegiz saniyorum. Neleri kullanmamiz gerektigine daha az agirlik vererek neleri kullanmakta oldugumuza bakip bunlari derlememiz daha yapici bir yaklasim olacak. Bu arada su ana kadar bu agda kullanilan Turkce terimleri tarayip derlemekte de yarar var. Eger zaten kullanimda olan Turkce bir terim yerine biz burada baska bir kelime yakistirdiysak bunu duzeltmek de bilenlerin gorevi olsun... Ben de bu konuda calismaya gonulluyum. Saygilar Sinan Sertoz ========================================================================= Date: Mon, 25 Nov 91 20:31:02 GMT Reply-To: Turkish Mathematician's Discussion List TURKMATH Sender: Turkish Mathematician's Discussion List TURKMATH From: Haluk DEMIRBAG Subject: Re: TURKMAT'a hayir > > TURKMATH-TURKMAT tartismasini bir suredir sessizce izliyorum. Bundan boyle sesli izlersiniz artik... > Daha onceleri de mantiksiz ve anlamsiz bircok tartismaya taniklik > etmistim ama bu kadar uzun surenini hatirlamiyorum. Degerler ile mantik bir birinden cok farkli olgular... > 1) TURKMAT'i yabancilarin hicbiri anlamaz, T\"{u}rklerin anlamasi > da TURK'u Ingilizce okuyup Ingilizce anlamlandirmalarina bagli.. Beyefendi, burada Turklerin anlamasi soz konusu yabancilarin degil. Siz hangi TURKiye de yasiyorsunuz? > Eger siz T\"{u}rkiyede ``Ben bir TURK matematikcisiyim (T\"{U}RK degil) > derseniz bunu ancak Istanbul'daki bir grup azinligin dilimizi > cok kotu konusan kucuk bir kesimi anlar. Ozet: TURKMAT da ileri > suruldugu kadar T\"{u}rkce degil..Yegane T\"{u}rkce yani, yabanci > bir kelime olan Matematigin ilk hecesinin T\"{u}rk imlasi ile > yazilmis olmasindan ibaret.. Azinliklarin dilimizi cok kotu konustugunu ileri surmek saygisizlik daha da otesi hakarettir... Kendinize geliniz... Turkum diyen Turktur. Neden Turkcede 'mathematics' yazmiyorsunuz pek iyi? > 2) Ingilizce dilinde MATH bir kisaltma olmaktan cikmis, kelimenin > kendisi halini almis. T\"{u}rkce' deki MAT oyle mi ya? Ben > TURKMAT' in bir satrancci agi oldugunu da dusunebilirim. Burasi cok komik, bir daha okuyun ondan sonra kendiniz yargilayin lutfen. > ( En taninmis Avrupa satranc dergilerinden birinin adi ``Schachmat''!) 'Mat' kelimesinin Turkcesine sozlukte bir zahmet bakiniz... > 3) Milli onur, milliyetcilik veya sovenlik (chauvinism) konusu > yapilacak yuzlerce hakli durum olabilir ve var da..Fakat bu durum onlardan > biri degil. Maksimum evrensel anlasilirlik ve komunikasyon > saglamak, dunyadaki benzeri aglarla isbirligi kurmak, hatta yabanci > uyeler kabul etmek agin amaclari arasinda. TURKMATH sozcugu de > bu amaclara son derece uygun.. Milliyetcilik, sovenistlik ve bunun gibi kavramlarin anlamini sindirme- den kullanmayiniz lutfen! > 4) Dil sovenligi konusunda akla ilk gelen uluslardan Alman'lar, cok > eskilerde degil daha birkac onyil once Universite kursulerinde > Almanca'dan baska dilde yazilmis kitap bulundurmamaga gayret > ederlerdi. (Bunun altinda biraz da evrensel bilim ve > teknolojiye cok buyuk katkilar yapmis olmalari gercegi yatardi). > Simdi Almanya'da bircok lokal seminer, konferans ve > `workshop'lar Ingilizce yapiliyor, hatta bazi lisans ustu > programlar bile Ingilizce duzenleniyor. Bunlarin kitaplari da > Ingilizce dilinde basiliyor. (Springer Verlag -Lecture Notes > ve benzerlerinde buna sayisiz ornek bulabilirsiniz). > Gonul ayni pozisyonda T\"{u}rkceyi gormek isterdi, fakat surasi > bir gercek ki bugun Ingilizce bilim ve teknolojide evrensel bir dil > (politikada degil mi?) niteliginde. Bunun nedenlerinden biri de > Ingilizceyi belli bir duzeye kadar ogrenmenin diger buyuk > bati dillerine oranla daha kolay olusu.. Bu durum Almanlar ve > Japonlar dahil kimseyi rahatsiz etmiyor, > kimse milli onur meselesi yapmiyor. Turk milleti ile baska milletleri karsilastiramazsiniz, vesselam. Siz INGILIZceyi severgiller ailesine girdiginize gore onlarin sozlerini de dikkate alirsiniz, buyurun kana kana okuyun... "Although all nations are unique, the Turks are more unique than others. You cannot lump the Turks with another group of peoples..." Hotham, David, The Turks, Cok and Wyman ltd., London, 1972. Miller, W., The Ottoman Empire and Its successors. Unutmadan; TURK, OGUN, CALIS, GUVEN. (M.K.ATATURK) Yine unutmadan Ingilizler 'TURK' diyince oyle bir hatirliyorlar ki, inanamazsiniz... > 5) Dernek, kurulus ve benzerlerinde uyeler her konuda her akillarina > estiklerinde genel kurul oylamasina gidemezler.. Bunun icin bazi > usuller vardir, bu is genel kurul toplantilarinda veya milli > kongrelerde olur. TURKMATH isminin oylanmasi T\"{u}rk Matematik > Dernegi 1991 milli kongresinde yapilmis ve oy birligi > ile kabul edilmistir. Dunyanin obur ucundan gozleyip ``efendim, > uyeler seslerini cikaramamislar, baski ile kabul etmisler'' > demek en hafifinden butun uyelere buyuk bir asagilamayi icerir. > Gelecek yilki genel kurullara veya kongrelere katilir veya > teleks gonderirseniz oylama yeniden gundeme gelir. Ancak > unutulmamali ki gecen yilki kongrede oybirligi ile lehte > oy kullananlarin sayisi 7(hadi 9 olsun)' nin cok ustunde idi. Adini ne guzel de koymuslar, milli... Neresi milli bunun Beyefendi? Bu arada 'TURKMAT'a evet, TURKMATh'a hayir' diyenler 13 (on uc) olmustur. Insanlar neyin ne oldugunu bilmeden oy vermis olmasinlar. Ismi Ingilizce olacak dendi mi orada? Cevaplayin lutfen! > Fakat gene de simdi oylamada israrli iseniz ben oyumu > kullanayim: > TURKMATH' a EVET, TURKMAT' a HAYIR. Ihanet... Ataya saygisizlik... Yok mu baska oy kullanacak? > Saygilarimla, > Ulug Capar (T\"{u}rk Matematik Dernegi uyesi) Su dernegin adini da 'Turkish' olarak degistirin de anlasalim... Bu faaliyetler eminim ki birileri tarafindan biryerlere bildiriliyordur, siz hic meraklanmayiniz... Saygilarim ile... _ |-| /-\ |_ |_| |< (TURKMAT'a evet, TURKMATh'a hayir.) ========================================================================= Date: Wed, 27 Nov 91 11:55:12 +0200 Reply-To: Turkish Mathematician's Discussion List TURKMATH Sender: Turkish Mathematician's Discussion List TURKMATH From: Dept of Mathematics Subject: Seminer Duyurusu BILKENT UNIVERSITY DEPARTMENT OF MATHEMATICS SEMINAR ANNOUNCEMENT ALI ULGER Weakly Compact Subsets of Bochner Integrable Functions Date: Nov. 29, 1991 Time: 15:30 Place: A-331 ========================================================================= Date: Wed, 27 Nov 91 18:39:15 +0200 Reply-To: Turkish Mathematician's Discussion List TURKMATH Sender: Turkish Mathematician's Discussion List TURKMATH From: Sinan Sertoz Subject: Soru A oransiz bir arti sayi olsun. (positive irrational number) { n mod A | n bir tamsayi } setinin [-A,A] araliginda yogun oldugunu gosterin. ========================================================================= Date: Thu, 28 Nov 91 12:18:19 +1100 Reply-To: Turkish Mathematician's Discussion List TURKMATH Sender: Turkish Mathematician's Discussion List TURKMATH From: Irfan Altas Subject: Bir gazeteden alinti Size Australyada yayinlanan enbuyuk tirajli gazeteden bir alinti gonderiyorum (THE AUSTRALIAN, 2 Ekim 1991). Iyi okumalar. Herkese sevgiler, Irfan Altas (AU, yeni dunyadan muhabiriniz) COMPUTATIONAL ENGINEERING AND SCIENCE You and I are likely to sink into genteel poverty in the twenty first century, unless Australia moves quickly to exploit Computational Engineering and Science. Computational Engineering and Science (CES) will grow during the 1990s to the point where their combined influence on technological advancement may well be a dominant factor in establishing the future economic growth rate of each country and ultimately the relative economic ranking of different countries. In the twenty first century countries that have not taken policy decisions to foster the training of computational engineers and scientists and the transfer of computational engineering skills into industry will fall further and further behind in relation to economic competitiveness and their material standard of living. What is CES ? Computational Engineering and Science are those intellectual activities in engineering and science which exploit high performance computing, e.g. supercomputers, as their essential tool. Between 1980 and 1990 the computing power of the most powerful supercomputers has grown by a factor of 100, from 100 to 10,000 megaflop. Between 1990 and 2000 computing power is projected to grow by another factor of 100 to a million megaflops or one teraflop. The growth in computer power has gone hand-in-hand with a reduction in cost. At the present time the capital cost of computers is about US$8000 per megaflop. Significantly the Gartner Group, a U.S. computer think-tank, predicts that the cost will drop to about US$30 per megaflop by the year 2000 for the most powerful computers. Compared with labour, material and investment costs this will make computing power almost free. In addition it suggests that computing power will become a utility, like electricity, phones or gas, provided by centralised computing power stations. Since the transmission costs to interact with the centralised supercomputer are also relatively low this implies that the tyranny of distance within Australia is not a problem. In mid-1991 we have three accessible computing power stations in Australia, a CRAY-YMP in Melbourne, a Fujitsu VP2200 in Canberra and a Fujitsu VP2200 in Sydney. Other more specialised high performance computing equipment is also available. However we also have a horrendous shortage of skilled computational engineers and scientists to exploit these resources. Overcoming this shortage is a major challenge facing Australia in the 1990s. The rapid growth in computing power in the 1980s has made computational simulation a very cost-effective and time-efficient alternative to either the traditional experimental or analytic methods of investigating physical phenomena. This trend will accelerate in the 1990s and provide opportunities for integrated computational engineering leading to computational design as well as more fundamental physical investigations. Indeed the availability of teraflop computing power will make it feasible to embed the complete design process of an aerospace vehicle or automobile into an optimization computer program. The human input will be limited to choosing the objective function and the constraints, and to checking that the final design is acceptable. This poses an interesting question. Will a break with preconceived ideas create psychological problems if the computer chooses an optimised design that is radically different from, and probably better than, previous conventionally produced designs? Time will tell. In the USA, Japan and Europe high performance computing is being exploited to design and market cost-effective products in such industries as Transportation (Aerospace, Automobile), Oil and Gas Exploration, Chemicals, Electronics and Pharmaceuticals. Through increased R&D productivity, high performance computing is already producing positive increments to economic growth. The productivity gains are accumulative. The Gartner Group projects that the expenditure of US$1.9 billion in the USA between 1992 and 1996 to accelerate the development and further exploitation of high performance computing will increase the GNP of the United States by up to US$500 billion. That is, there is a huge multiplier effect associated with incremental investments in the intensive computing area. Since much of Australia's export earning capacity is via relatively unprocessed primary products the leverage for GNP growth may be even greater as long as the computational engineering investment is carefully directed in Australia. What is very clear is that many sections of Australian industry have to acquire computational engineering expertise as soon as possible to be competitive. A failure to do so will lead, almost certainly, to a reduction in our relative standard of living. In Australia, BHP is exploiting supercomputers for seismic analysis, oil reservoir simulation and steel making simulation. Companies like CRA and Comalco are improving the mineral separation process and the production of aluminium by using computational fluid dynamic computer programs. The electricity generating industry in Australia, particularly the Electricity Commission of NSW, are demonstrating considerable innovative leadership in exploiting computational fluid dynamic and heat transfer computer programs to improve power station performance and reliability, leading directly to cheaper electricity for everyone. However many more cost-saving applications of computational fluid dynamics and heat transfer are available for Australian industry, e.g. improving automobile design and large-scale ventilation and air-conditioning systems. In a different area, the development of improved wool quality and wheat yields via genetic engineering can be significantly accelerated by molecular dynamics simulations and the exploitation of computational quantum chemistry. Thus the two computer-intensive technologies of computational fluid dynamics and computational chemistry provide an effective means of adding significant value to Australia's major export industries. The expert use of computer simulation codes: i) reduces significantly the lead time in design and development ii) provides more detailed and comprehensive information iii) simulates conditions not reproducible in experimental tests. iv) makes the design process more cost-effective and time-efficient. The ultimate benefit for industry is greater productivity and hence greater profitability. Decision makers in many sectors of Australian industry are well aware of these benefits. However they are also aware of the chronic shortage of computational engineers and scientists in Australia. What skills do computational engineers have beyond those of conventional chemical, civil, mechanical, ... engineers? First they have the knowledge of computational mathematics to convert the complicated equations governing the physical phenomenon, e.g. flow in a cyclone separator, into algebraic equations that can be solved by a computer. Second, a knowledge of computer science is required to extract the maximum performance from the supercomputer. How should the shortage of computational engineers and scientists be overcome? In practice computational engineering research projects, in the university and research laboratory sectors, do lead to the direct import of some personnel trained outside of Australia. However there is a world-wide shortage and both the established economies of the USA, Japan and Europe, and the rapidly developing economies of Taiwan and South Korea are seeking as many computational engineers and scientists as possible. The only effective solution is to introduce formal training programs at the tertiary level. The teaching of Computational Engineering and Science as a separate discipline is being carried out at Colorado State University and one or two other American universities. But the lack of sufficient trained graduates is so serious that it is being investigated by the U.S. Mathematical Sciences Education Board of the National Academy of Sciences. The problem has an added urgency due to the expected growth of parallel supercomputers which place additional emphasis on the development of efficient algorithms to extract the potential computing power. In Australia no university is offering focussed training in Computational Engineering or Science. Clearly the multidisciplinary nature of the activity adds an extra impediment to rapid development. It is appropriate to establish postgraduate study programs in this area supporting computational research within particular disciplines. So a Diploma in Computational Engineering and/or Science and an equivalent Masters program is a suitable starting point. Long term it is desirable to offer undergraduate degrees in both Computational Engineering and Science. >From a national perspective the ability to undertake research and development in the computational engineering and science area, and to transfer the benefits to industry, requires a complementary educational program at both the undergraduate and postgraduate levels. There are two strategic choices. Either we can accept the continual decline in our relative standard of living gracefully and spend the rest of our days recalling, wistfully, former times of material well-being. Or we can act now, boldly and decisively. The urgent need is to set up focal points of Computational Engineering and/or Science in existing universities in each of the six or seven major population centres in Australia. Strong links with industry are clearly vital as is emphasised by the Prime Minister's Science Council in its recent report, Engineering in Australia (May 1991). Authors: Clive Fletcher, & Graham de Vahl Davis University of Sydney University of N.S.W. ========================================================================= Date: Wed, 27 Nov 91 17:49:00 PST Reply-To: Turkish Mathematician's Discussion List TURKMATH Sender: Turkish Mathematician's Discussion List TURKMATH From: ANESIN@UCIVMSC Subject: Ilginc Topolojik Gruplar (duzeltilmis) Gecenlerde "group representation" seminerinde, bir yerel tikisik (locally compact) grubun "connected component" inin, grubun Haar "measure" ini ne denli etkiledigini tartisiyorduk. Karsimiza dogal olarak su soru cikti: G topolojik bir grup olsun ve G'nin her tikisik (compact) alt-kumesinin sonlu oldugunu varsayalim. G hakkinda ne diyebiliriz? Her "discrete" grubun bu ozelligi vardir elbet. Baska ornek var midir? Varmis. Ornek su: G "abelian" bir grup olsun. S^1 = {c \in C: c^n = 1} = R/Z, daire grubu olsun. F = {f: G ---> S^1: f grup homomorfizm} olsun. G'ye, F'deki tum foksiyonlari surekli yapan en zayif topolojiyi koyalim. Bu topolojiyle G'nin her tikisik alt kume sonludur ve eger G sonluysa topoloji "discrete" degildir. Glicksberg adli bir matematikcinin 1962 yilinda kanitladigi teorem yukaridaki ornekle cok yakindan ilgili: "Let (G, t) be a locally compact abelian group. Then a subset A of G is t-compact iff A is compact in the topology which G inherits from its Bohr compactification". Glicksberg teoreminin, discrete gruplar icin basit bir kaniti Comfort ve Trigos-Arrieta adli matematikcilerin, "General Topology and its Applications, 5th Northeast Conference, edited by Andima etal., 1991" de bulunabilir. Comfort ve Trigos-Arrieta, kanitlarinda Ramsey teoremini kullaniyorlar. Ali ========================================================================= Date: Wed, 27 Nov 91 17:43:00 PST Reply-To: Turkish Mathematician's Discussion List TURKMATH Sender: Turkish Mathematician's Discussion List TURKMATH From: ANESIN@UCIVMSC Subject: Topolojik gruplar yazisina duzeltme. Gecenlerde topolojik gruplar uzerine gectigim yazida onemli bir hata yapmisim. Yerel tikisik olan bir grubun hem discrete olmamasini hem de her tikisik kumesinin sonlu olmasini istemisim! Tek ozurum, uykusuz gecen bir gecenin sabahinda yazmam yaziyi. Bir baska yerinde de bilerek onemsiz bir yalan soylemistim. Duzeltip, ayni yaziyi bir kez daha gececegim. Bir de Hans Zassenhaus uzerine bir yazi yazmistim. Nedense dagilmadi. En azindan bana gelmedi. O yaziyi da gececegim. Iki kez alip da yaziyi silmek zahmetinde kalanlardan ozur dilerim. Ali ========================================================================= Date: Thu, 28 Nov 91 16:20:53 +0200 Reply-To: Turkish Mathematician's Discussion List TURKMATH Sender: Turkish Mathematician's Discussion List TURKMATH From: Mustafa Akgul Subject: Re: Topolojik gruplar yazisina duzeltme. Bu gunler de Izmir hic guvenilir degil . Cok sik kesiliyor. Ayrica LISTSERV'de bazan numaralar cekiyor. Bazi mail'leri dagitmiyor. benim de basima bir kac kere geldi. Bunlari yaziyorum ki, bilesiniz sadece size olmuyor bu tip gariplikler. Saygilarimla ========================================================================= Date: Thu, 28 Nov 91 17:12:06 +0200 Reply-To: Turkish Mathematician's Discussion List TURKMATH Sender: Turkish Mathematician's Discussion List TURKMATH From: Sinan Sertoz Karismak gibi olmasin ama: compact karsiliginda TIKIZ kullaniliyor. discrete karsiliginda sozluk AYIRTIK yaziyor ama kullanani ben duymadim. Gecenlerde Akif KESiKLi dedi, daha guzel geldi bana. Sinan Sertoz ========================================================================= Date: Thu, 28 Nov 91 17:28:16 +0200 Reply-To: Turkish Mathematician's Discussion List TURKMATH Sender: Turkish Mathematician's Discussion List TURKMATH From: AKMAN@TRBILUN Subject: kaybolan mesajlar Benim de son uc mesajim maalesef kaybolmus gibi geliyor. En azindan bunlarin kopyalari bana tekrar gelmedi. Sanirim TURKMATH'in boyle bir "forwarding" kurali yok. Bu durumda kaybolduklarini varsayiyorum. Bu durumda bence bir sorun var demektir. Ornegin ben son gonderdigim mesajimin (ki baska bir---ilginc oldugunu sandigim---mesajdan alintiydi) "machine-readable" formunu yitirdim; tekrar gonderemiyorum. Bu sorunun teknik nedenlerini bir arastirsak diyorum... Ya da bazi onlemler dusunelim. Ornegin mesajlarin biraraya toplanip "batch"ler halinde uyelere gonderilmesi ve her "batch"in numaralanmasi gibi. (Bazi arkadaslar bilirler, Amerika'daki LINGUIST grubu boyle calisiyor; ustelik onlar konulara gore siniflama bile yapiyorlar ama onu yapmak simdilik biraz fazla yuk olabilir.) Mustafa (Akgul) arkadasimiz bu ise zaten yeterince zaman ayirip fedakarlik yapiyor, sagolsun. Onun icin bu mesajimin bir elestiri olarak alinmamasini diliyorum. Herkese en iyi dileklerle, Varol Akman Bilkent Universitesi, Ankara - Varol Akman Bilkent University, Ankara Logic is logic, that's all I say. - OLIVER WENDEL HOLMES ========================================================================= Date: Thu, 28 Nov 91 09:17:00 PST Reply-To: Turkish Mathematician's Discussion List TURKMATH Sender: Turkish Mathematician's Discussion List TURKMATH From: ANESIN@UCIVMSC Subject: Tikiz, tikisik, ayirtik, kesikli vb. Sinan Sertoz'e duzelttigi icin tesekkur ederim. Bu konuda hic alingan degilimdir. "Tikiz" sozcugu guzel. "Kesikli" sozcugu de guzel. "Ayirtik" tan daha guzel. Ama bence "Kesik" daha da guzel. "Kopuk" da denilebilir. "Yerel Tikisik" i da sevmistim. Uydurmamin tumuyle yokolmasina gonlum el vermiyor. Bu adin yakisacagi bir kopek ariyorum. Soyle kocaman, babacan ve bol tuylu bir kopek... Zassenhaus yazim yine gelmedi. Teknik sorunlardan olduguna kuskum yok. Ali ========================================================================= Date: Thu, 28 Nov 91 09:33:00 PST Reply-To: Turkish Mathematician's Discussion List TURKMATH Sender: Turkish Mathematician's Discussion List TURKMATH From: ANESIN@UCIVMSC Subject: Ja-Ja'yi kucumseme Nazif Hep Ja-Ja konusurmus. Ataturk de dinlermis. Ja-Ja cay, Ataturk de raki icermis. Dereden tepeden konusurmus Ja-Ja. Agzindan ballar aktigini sanmiyorum. Ataturk'un Ja-Ja'yi dinlemesinin nedeni Ja-Ja'nin guzelligi olacak. Kesinlikle oyledir. Cok guzel bir kadinmis. Hala daha guzel. Ja-Ja Ataturk'un olumuyle biten bolumu soyle bitiriyor: "I thought he was a weary, tired, sick man, and he wanted to be amused. And I had amused him in the last months of his life." Iste bu tam gercek galiba. Ataturk eglenmek istemis. Ali ========================================================================= Date: Thu, 28 Nov 91 11:47:00 PST Reply-To: Turkish Mathematician's Discussion List TURKMATH Sender: Turkish Mathematician's Discussion List TURKMATH From: ANESIN@UCIVMSC Subject: Ozur Dilerim Ozel bir mesajimi yanlislikla Turkmath'a gecmisim. Ozur dilerim. Gitmesi gereken yazilarim gitmiyor, gitmemesi gerekenler gitmiyor! Merak edenler olmussa: Zsa Zsa Gabor'un ozyasamini okuyordum. Ataturk'le gizli bulusup sohbet ettiklerini yaziyordu. Bir arkadasima yaziyordum o konu uzerine. Yeniden ozur dilerim. Ali ========================================================================= Date: Thu, 28 Nov 91 20:41:48 GMT Reply-To: Turkish Mathematician's Discussion List TURKMATH Sender: Turkish Mathematician's Discussion List TURKMATH From: Haluk DEMIRBAG Subject: Re: Ja-Ja'yi kucumseme Nazif > Hep Ja-Ja konusurmus. Ataturk de dinlermis. > Ja-Ja cay, Ataturk de raki icermis. > Dereden tepeden konusurmus Ja-Ja. Agzindan ballar aktigini > sanmiyorum. Ataturk'un Ja-Ja'yi dinlemesinin nedeni Ja-Ja'nin guzelligi > olacak. Kesinlikle oyledir. Cok guzel bir kadinmis. Hala daha guzel. > Ja-Ja Ataturk'un olumuyle biten bolumu soyle bitiriyor: > "I thought he was a weary, tired, sick man, and he wanted to > be amused. And I had amused him in the last months of his > life." > > Iste bu tam gercek galiba. Ataturk eglenmek istemis. > Ali Sayin Nesin, tam bu mesaja saldirmak uzere idim ki, aciklayan mesajiniz ulasti, su kitap cok ilginc bir kitaba benziyor. Kimligini bana ozel olarak yazabilir misiniz? Posta kodu yukarida... Mesajlar kayboluyor, karisiyor, benim mesajlar ozel olarak kaybediliyor, karisiyor benim de kafam inanin cok ama cok karisiyor... Hazir su Turkce- lestirme calismalarina baslamisken su isimden baslasa idik nasil olurdu? Bu arada benim su nacizane esek sorusunu cozen bir matematikci yok mu? Odulu -kim olursa olsun, hangi sehirde olursa olsun- Iskender Kebap, ben vatana donunce... Turkcelestiremediklerimizden misiniz? _ |-| /-\ |_ |_| |< (TURKMAT'a evet, TURKMATh'a hayir.) ========================================================================= Date: Mon, 25 Nov 91 21:35:53 GMT Reply-To: Turkish Mathematician's Discussion List TURKMATH Sender: Turkish Mathematician's Discussion List TURKMATH From: Haluk DEMIRBAG Subject: Re: ISIM DEGISIKLIGI > > SAYIN TURKMAT UYELERI, > BEN DE YURT DISINDA DOKTORA CALISMASI YAPAN, AYNI ZAMANDA > YURT HASRETIYLE YANAN TUTUSAN BIRI OLARAK BU TURK MATEMATIKCILER > LISTESININ ADININ NEDEN YABANCI DILDE YAZILMASI GEREKTIGINI > ANLAMIS DEGILIM. > BEN DE SOYLE DUSUNUYORUM: > " TURKMAT'A EVET, TURKMATH'A HAYIR " > > CALISMALARINIZ DA BASARILAR. > RIDVAN EZENTAS > Varan 13... 13 rakaminin ugursuzluguna inanmadigimi bilmenizi isterim... Duyarli Turk matematikcilerini oylamaya davet ediyorum. Saygilarim ile... _ |-| /-\ |_ |_| |< (TURKMAT'a evet, TURKMATh'a hayir.) ========================================================================= Date: Fri, 29 Nov 91 13:31:01 +0200 Reply-To: Turkish Mathematician's Discussion List TURKMATH Sender: Turkish Mathematician's Discussion List TURKMATH From: Sinan Sertoz Subject: Ergodic cozum Demistim ki: "A oransiz bir arti sayi olsun. (positive irrational number) { n mod A | n bir tamsayi } setinin [-A,A] araliginda yogun oldugunu gosterin." Beklentim `temiz' bir cozum idi: "Sonuc X prensibinin ozel bir halinden cikar." gibi... Konunun ergodic teoriye ait oldugunu ve oradaki bazi ilk prensiplerden ciktigini ogrendim. (Erdal Arikan'a tesekkurler.) Iste Cozum: Tanimlar: X kumesi uzerinde T:X--->X olcuyu koruyan bir donusum ve E, X kumesinin olculebilir bir alt kumesi olsun. Eger E'deki bir x elemani icin T^n(x)'in tekrar E'de olmasini saglayan en az bir n>0 tam sayisi varsa, x'e "geri gelen nokta" ya da kisaca "geri gelir" diyelim. Teorem: Bu durumda E'nin hemen hemen her noktasi geri gelir. Kaynak: P.R. Halmos, Lectures on Ergodic Theory, Chelsea Publ. Co. (1956) (QA614.H3) sayfa 10. Bu teoremin yukaridaki problemi nasil cozdugunun gosterilmesini de okuyucuya birakiyorum! Tesekkurler: Bu eglenceli probleme beni bulastirarak ufkumun genislemesini saglayan Ulug Capar'a tesekkurler. ========================================================================= Date: Wed, 27 Nov 91 17:53:00 PST Reply-To: Turkish Mathematician's Discussion List TURKMATH Sender: Turkish Mathematician's Discussion List TURKMATH From: ANESIN@UCIVMSC Subject: Hans Zassenhaus (ikinci yollayisim) Hans Zassenhaus gecen Cumartesi olmus. 90 yaslarindaydi. Dort yil once onemli ve uzun bir yazi yazmisti. Dickson olmayan sonsuz bir "near-field" buldugunu soyluyordu (tanimlar yazinin sonunda). Bu uzun yillar yaniti bilinmeyen bir soruydu. Yazi cok karmasikti bana gore. Okuyamadim. Yazida bir yanlis bulunmus daha sonra. Yanlis duzeltilememisti. Theo Grundhofer adli Alman geometricisiyle Zassenhaus yeni bir yazi yazip Dickson olmayan sonsuz bir baska near-field buldular. Hans Zassenhaus'un bildigim iki onemli calismasi: 1) Sonlu near-field'lerin siniflandirilmasi. Bu siniflandirma (1936), sonlu basit gruplarin siniflandirilmasinda onemlidir. Ve sanirim, geometriyle grup teorisinin iliskisini gosteren ilk calismalardan biridir (Jordan'in ve Matthieu'nun calismalarindan sonra). Yaniliyor olabilirim. Yine de en onemli calismalardan biri oldugundan kuskum yok. 2) Schur-Zassenhaus teoremi: G sonlu bir grup olsun. H \normal G ise, ve (|H|, |G/H|) = 1 ise, o zaman G'nin oyle bir K alt-grupu vardir ki G = HK ve H \kesisme K = {1} dir. Eskiden bu teoremde, "ya G/H yada H cozumludur (solvable)" kosulu da vardi. Ama Feit-Thompson teoremi, bu kosulu gereksiz kildi sonradan. Fasizm sirasinda Zassenhaus'un ne yaptigini bilmiyorum. Yakinda AMS''in degilerinden birinde yasam oykusu cikar ogreniriz. *********** Tanimlar: Near-field = division ring - one of the distributivity laws. Ornek: q, bir asal sayinin ustu olsun. x, y \in F_{q^2}* (Galois cismi) icin, su carpimi tanimlayalim: x*y = xy eger x bir kareyse. xy^q degilse. (F_{q^2}, +, *) bir near-field'dir. 7 karsi-ornek disinda tum sonlu near-field'ler bu yukaridaki ornege "benzerler", ve bu ornege "benzeyen" near-field'lere Dickson near-field adi verilir. Ali ========================================================================= Date: Sat, 30 Nov 91 00:00:00 PST Reply-To: Turkish Mathematician's Discussion List TURKMATH Sender: Turkish Mathematician's Discussion List TURKMATH From: ANESIN@UCIVMSC Subject: Esek problemi Haluk Demirbag'in "esek problemi" icin oldukca kafa yordum. Soruyu animsatayim: Daire biciminde bir tarlamiz var. Cemberin ustune bir kazik cakacagiz, kaziga bir ip baglayacagiz, ipe bir esek baglayacagiz (olme esegim olme!), ve tum bunlari oyle yapacagiz ki esek tarlanin yarisini yiyebilecek ancak. Alti saatlik bos zamanim vardi, ugrastim. Her denememde bir baska yanit buldum. Iclerinden en estetigini geciyorum: r tarlamizin yari capi olsun. s, ipin uzunlugu olsun. r/s = x olsun. Buldugum esitlik soyle: x^2\pi/2 = x^2 arcsin(x/2) + arcsin(1 - x^2/2) + x \sqrt{1 - x^2/4}. Ali