Hasil Pencarian  ::  Simpan CSV :: Kembali

Abstrak :
Problems in probability comprises one of the most comprehensive, nearly encyclopedic, collections of problems and exercises in probability theory. Many problems contain helpful hints and other relevant comments and a portion of the material covers some important applications from optimal control and mathematical finance. Readers of diverse backgrounds-from students to researchers-will find a great deal of value in this book and can treat the work as an exercise manual, a handbook, or as a supplementary text to a course in probability theory, control, and mathematical finance. The problems and exercises in this book vary in nature and degree of difficulty. Some problems are meant to test the reader's basic understanding, others are of medium-to-high degrees of difficulty and require more creative thinking. Other problems are meant to develop additional theoretical concepts and tools or to familiarize the reader with various facts that are not necessarily covered in mainstream texts. Additional problems are related to the passage from random walk to Brownian motions and Brownian bridges. The appendix contains a summary of the main results, notation and terminology that are used throughout the book. It also contains additional material from combinatorics, potential theory and Markov chains-subjects that are not covered in the book, but are nevertheless needed for many of the exercises included here.

Abstrak :
The study of combinatorial block designs is a vibrant area of combinatorial mathematics with connections to finite geometries, graph theory, coding theory and statistics. The practice of ordering combinatorial objects can trace its roots to bell ringing which originated in 17th century England, but only emerged as a significant modern research area with the work of F. Gray and N. de Bruijn. The book begins with background material on combinatorial block designs and combinatorial orderings, including Gray codes -- the most common and well-studied combinatorial ordering concept -- and universal cycles. The central chapter discusses how ordering concepts can be applied to block designs, with definitions from existing (configuration orderings) and new (Gray codes and universal cycles for designs) research. Two chapters are devoted to a survey of results in the field, including illustrative proofs and examples. The book concludes with a discussion of connections to a broad range of applications in computer science, engineering and statistics.

Abstrak :
Partitions, q-series, and modular forms contains a collection of research and survey papers that grew out of a Conference on partitions, q-series and modular forms at the University of Florida, Gainesville in March 2008. It will be of interest to researchers and graduate students that would like to learn of recent developments in the theory of q-series and modular and how it relates to number theory, combinatorics and special functions.

Abstrak :
This book introduces an array of fundamental mathematical structures. It also explores the delicate balance of intuition and rigor—and the flexible thinking—required to prove a nontrivial result. In short, this book seeks to enhance the mathematical maturity of the reader. The new material in this second edition includes a section on graph theory, several new sections on number theory (including primitive roots, with an application to card-shuffling), and a brief introduction to the complex numbers (including a section on the arithmetic of the Gaussian integers).

Abstrak :
The annual Workshop on Algorithm Engineering and Experiments (ALENEX) provides a forum for the presentation of original research in all aspects of algorithm engineering, including the implementation, tuning, and experimental evaluation of algorithms and data structures. ALENEX 2008, the tenth workshop in this series, was held in San Francisco, California on January 19, 2008. The workshop was sponsored by SIAM, the Society for Industrial and Applied Mathematics, and SIGACT, the ACM Special Interest Group on Algorithms and Computation Theory.

Abstrak :
This innovative textbook introduces a new pattern-based approach to learning proof methods in the mathematical sciences. Readers will discover techniques that will enable them to learn new proofs across different areas of pure mathematics with ease. The patterns in proofs from diverse fields such as algebra, analysis, topology and number theory are explored. Specific topics examined include game theory, combinatorics, and Euclidean geometry, enabling a broad familiarity. The author, an experienced lecturer and researcher renowned for his innovative view and intuitive style, illuminates a wide range of techniques and examples from duplicating the cube to triangulating polygons to the infinitude of primes to the fundamental theorem of algebra. Intended as a companion for undergraduate students, this text is an essential addition to every aspiring mathematician’s toolkit.

Abstrak :
Multiple dirichlet series, L-functions and automorphic forms gives the latest advances in the rapidly developing subject of Multiple Dirichlet Series, an area with origins in the theory of automorphic forms that exhibits surprising and deep connections to crystal graphs and mathematical physics. As such, it represents a new way in which areas including number theory, combinatorics, statistical mechanics, and quantum groups are seen to fit together. The volume also includes papers on automorphic forms and L-functions and related number-theoretic topics.