For many applications, a randomized algorithm is either the simplest or the fastest algorithm available, and sometimes both. This book introduces the basic concepts in the design and analysis of randomized algorithms. The first part of the text presents basic tools such as probability theory and probabilistic analysis that are frequently used in algorithmic applications. Algorithmic examples are also given to illustrate the use of each tool in a concrete setting. In the second part of the book, each chapter focuses on an important area to which randomized algorithms can be applied, providing a comprehensive and representative selection of the algorithms that might be used in each of these areas. Although written primarily as a text for advanced undergraduates and graduate students, this book should also prove invaluable as a reference for professionals and researchers.

Elementary set theory accustoms the students to mathematical abstraction, includes the standard constructions of relations, functions, and orderings, and leads to a discussion of the various orders of infinity. The material on logic covers not only the standard statement logic and first-order predicate logic but includes an introduction to formal systems, axiomatization, and model theory. The section on algebra is presented with an emphasis on lattices as well as Boolean and Heyting algebras. Background for recent research in natural language semantics includes sections on lambda-abstraction and generalized quantifiers. Chapters on automata theory and formal languages contain a discussion of languages between context-free and context-sensitive and form the background for much current work in syntactic theory and computational linguistics. The many exercises not only reinforce basic skills but offer an entry to linguistic applications of mathematical concepts. For upper-level undergraduate students and graduate students in theoretical linguistics, computer-science students with interests in computational linguistics, logic programming and artificial intelligence, mathematicians and logicians with interests in linguistics and the semantics of natural language

《概率论教程:英文版(第3版)》是一本享誉世界的经典概率论教材，令众多读者受益无穷。自出版以来。已被世界75％以上的大学的数万名学生使用。《概率论教程:英文版(第3版)》内容丰富，逻辑清晰，叙述严谨。不仅可以拓展读者的视野。而且还将为其后续的学习和研究打下坚实基础。此外，《概率论教程:英文版(第3版)》的习题较多，都经过细心的遴选，从易到难，便于读者巩固练习。本版补充了有关测度和积分方面的内容，并增加了一些习题。

This extraordinary volume contains a large part of the mathematical correspondence between A. Grothendieck and J.-P. Serre. It forms a vivid introduction to the study of algebraic geometry during the years 1955-1965. During this period, algebraic geometry went through a remarkable transformation, and Grothendieck and Serre were among central figures in this process. In the book, the reader can follow the creation of some of the most important notions of modern mathematics, such assheaf cohomology, schemes, Riemann-Roch type theorems, algebraic fundamental group, motives, etc. The letters also reflect the mathematical and political atmosphere of this period (Bourbaki, Paris, Harvard, Princeton, war in Algeria, etc.). Also included are letters written between 1984 and 1987. Theletters are supplemented by J-P.Serre's notes, which give explanations, corrections, and references to further results. The book is a unique bilingual (French and English) volume. The original French text is supplemented here by the English translation, with French text printed on the left-hand pages and the corresponding English text printed on the right. The book also includes several facsimiles of original letters. The original French volume was edited by Pierre Colmez and J-P. Serre. TheEnglish translation for this volume was translated by Catriona Maclean and edited by J-P. Serre and Leila Schneps. The book should be useful to specialists in algebraic geometry, mathematical historians, and to all mathematicians who want to experience the unfolding of great mathematics.

This volume contains a collection of clever mathematical applications of linear algebra, mainly in combinatorics, geometry, and algorithms. Each chapter covers a single main result with motivation and full proof in at most ten pages and can be read independently of all other chapters (with minor exceptions), assuming only a modest background in linear algebra. The topics include a number of well-known mathematical gems, such as Hamming codes, the matrix-tree theorem, the Lovasz bound on the Shannon capacity, and a counterexample to Borsuk's conjecture, as well as other, perhaps less popular but similarly beautiful results, e.g., fast associativity testing, a lemma of Steinitz on ordering vectors, a monotonicity result for integer partitions, or a bound for set pairs via exterior products. The simpler results in the first part of the book provide ample material to liven up an undergraduate course of linear algebra. The more advanced parts can be used for a graduate course of linear-algebraic methods or for seminar presentations. Table of Contents: Fibonacci numbers, quickly; Fibonacci numbers, the formula; The clubs of Oddtown; Same-size intersections; Error-correcting codes; Odd distances; Are these distances Euclidean?; Packing complete bipartite graphs; Equiangular lines; Where is the triangle?; Checking matrix multiplication; Tiling a rectangle by squares; Three Petersens are not enough; Petersen, Hoffman-Singleton, and maybe 57; Only two distances; Covering a cube minus one vertex; Medium-size intersection is hard to avoid; On the difficulty of reducing the diameter; The end of the small coins; Walking in the yard; Counting spanning trees; In how many ways can a man tile a board?; More bricks--more walls?; Perfect matchings and determinants; Turning a ladder over a finite field; Counting compositions; Is it associative?; The secret agent and umbrella; Shannon capacity of the union: a tale of two fields; Equilateral sets; Cutting cheaply using eigenvectors; Rotating the cube; Set pairs and exterior products; Index. (STML/53)

《北京高等教育精品教材:数学分析讲义(第1册)》是作者在清华大学数学科学系（1987-2003）及北京大学数学科学学院（2003-2009）给本科生讲授数学分析课的讲稿的基础上编成的，一方面，作者力求以近代数学（集合论，拓扑，测度论，微分流形和微分形式）的语言来介绍数学分析的基本知识，以使同学尽早熟悉近代数学文献中的表述方式。另一方面在篇幅允许的范围内，作者尽可能地介绍数学分析与其他学科（特别是物理学）的联系，以使同学理解自然现象一直是数学发展的重要源泉。

本书将两千多年的数学发展历程融为十二章内容，每章都包含了三个基本组成部分，即历史背景、人物传记以及在这些“数学杰作”中所表现出的创造性。作者精心挑选了一些杰出的数学家及其所创造的伟大定理，如欧几里得、阿基米德、牛顿和欧拉。而这一个个伟大的定理，不仅串起了历史的年轮，更是串起了数学这门学科所涵盖的各个深邃而不乏实用性的领域。当然，这不是一本典型的数学教材，而是一本大众读物，它会让热爱数学的人体会到绝处逢生的喜悦，让讨厌数学的人从此爱上数学。

A standard source of information of functions of one complex variable, this text has retained its wide popularity in this field by being consistently rigorous without becoming needlessly concerned with advanced or overspecialized material. Difficult points have been clarified, the book has been reviewed for accuracy, and notations and terminology have been modernized. Chapter 2, Complex Functions, features a brief section on the change of length and area under conformal mapping, and much of Chapter 8, Global-Analytic Functions, has been rewritten in order to introduce readers to the terminology of germs and sheaves while still emphasizing that classical concepts are the backbone of the theory. Chapter 4, Complex Integration, now includes a new and simpler proof of the general form of Cauchy's theorem. There is a short section on the Riemann zeta function, showing the use of residues in a more exciting situation than in the computation of definite integrals.

This book grew out of a course of lectures given to third year undergraduates at Oxford University and it has the modest aim of producing a rapid introduction to the subject. It is designed to be read by students who have had a first elementary course in general algebra. On the other hand, it is not intended as a substitute for the more voluminous tracts such as Zariski-Samuel or Bourbaki. We have concentrated on certain central topics, and large areas, such as field theory, are not touched. In content we cover rather more ground than Northcott and our treatment is substantially different in that, following the modern trend, we put more emphasis on modules and localization.

This elegant book by distinguished mathematician John Milnor, provides a clear and succinct introduction to one of the most important subjects in modern mathematics. Beginning with basic concepts such as diffeomorphisms and smooth manifolds, he goes on to examine tangent spaces, oriented manifolds, and vector fields. Key concepts such as homotopy, the index number of a map, and the Pontryagin construction are discussed. The author presents proofs of Sard's theorem and the Hopf theorem.

Our understanding of how the human brain performs mathematical calculations is far from complete, but in recent years there have been many exciting breakthroughs by scientists all over the world. Now, in The Number Sense, Stanislas Dehaene offers a fascinating look at this recent research, in an enlightening exploration of the mathematical mind. Dehaene begins with the eye-opening discovery that animals--including rats, pigeons, raccoons, and chimpanzees--can perform simple mathematical calculations, and that human infants also have a rudimentary number sense. Dehaene suggests that this rudimentary number sense is as basic to the way the brain understands the world as our perception of color or of objects in space, and, like these other abilities, our number sense is wired into the brain. These are but a few of the wealth of fascinating observations contained here. We also discover, for example, that because Chinese names for numbers are so short, Chinese people can remember up to nine or ten digits at a time--English-speaking people can only remember seven. The book also explores the unique abilities of idiot savants and mathematical geniuses, and we meet people whose minute brain lesions render their mathematical ability useless. This new and completely updated edition includes all of the most recent scientific data on how numbers are encoded by single neurons, and which brain areas activate when we perform calculations. Perhaps most important, The Number Sense reaches many provocative conclusions that will intrigue anyone interested in learning, mathematics, or the mind. "A delight." --Ian Stewart, New Scientist "Read The Number Sense for its rich insights into matters as varying as the cuneiform depiction of numbers, why Jean Piaget's theory of stages in infant learning is wrong, and to discover the brain regions involved in the number sense." --The New York Times Book Review "Dehaene weaves the latest technical research into a remarkably lucid and engrossing investigation. Even readers normally indifferent to mathematics will find themselves marveling at the wonder of minds making numbers." --Booklist

高等近世代数，ISBN：9787111191605，作者：（美）罗特曼

《分形几何:数学基础及其应用》(第2版)是一本全面介绍分形几何理论及其在各领域应用的专著。全书分成两部分，第一部分阐述了分形与分形几何的一般理论，包括维数的各种概念及计算方法，分形的局部结构，分形的射影、乘积和交集等；第二部分主要是分形的应用举例，包括自相似集和自仿射集、函数的图、数论和纯数学中的例子、动力系统、Julia集、随机分形及物理应用等。《分形几何:数学基础及其应用》(第2版)还提供了课程建议和较为全面的参考文献。

《应用随机过程概率模型导论》是一部经典的随机过程著作, 叙述深入浅出、涉及面广，主要内容有随机变量、条件概率及条件期望、离散及连续马尔可夫链、指数分布、泊松过程、布朗运动及平稳过程、更新理论及排队论等；也包括了随机过程在物理、生物、运筹、网络、遗传、经济、保险、金融及可靠性中的应用，特别是有关随机模拟的内容, 给随机系统运行的模拟计算提供了有力的工具。《应用随机过程概率模型导论》有约700道习题, 其中带星号的习题还提供了解答。

Defines symmetry through a discussion of its many uses in a wide variety of fields both academic and natural.

Optimization is an important tool used in decision science and for the analysis of physical systems used in engineering. One can trace its roots to the Calculus of Variations and the work of Euler and Lagrange. This natural and reasonable approach to mathematical programming covers numerical methods for finite-dimensional optimization problems. It begins with very simple ideas progressing through more complicated concepts, concentrating on methods for both unconstrained and constrained optimization.