This book presents up-to-date mathematical results in asymptotic theory on nonlinear regression on the basis of various asymptotic expansions of least squares, its characteristics, and its distribution functions of functionals of Least Squares Estimator. It is divided into four chapters. In Chapter 1 assertions on the probability of large deviation of normal Least Squares Estimator of regression function parameters are made. Chapter 2 indicates conditions for Least Moduli Estimator asymptotic normality. An asymptotic expansion of Least Squares Estimator as well as its distribution function are obtained and two initial terms of these asymptotic expansions are calculated. Separately, the Berry-Esseen inequality for Least Squares Estimator distribution is deduced. In the third chapter asymptotic expansions related to functionals of Least Squares Estimator are dealt with. Lastly, Chapter 4 offers a comparison of the powers of statistical tests based on Least Squares Estimators. The Appendix gives an overview of subsidiary facts and a list of principal notations. Additional background information, grouped per chapter, is presented in the Commentary section. The volume concludes with an extensive Bibliography. Audience: This book will be of interest to mathematicians and statisticians whose work involves stochastic analysis, probability theory, mathematics of engineering, mathematical modelling, systems theory or cybernetics.

X Kochendorffer, L.A. Kalu: lnin and their students in the 50s and 60s. Nowadays the most deeply developed is the theory of binary invariant relations and their combinatorial approximations. These combinatorial approximations arose repeatedly during this century under various names (Hecke algebras, centralizer rings, association schemes, coherent configurations, cellular rings, etc.-see the first paper of the collection for details) andin various branches of mathematics, both pure and applied. One of these approximations, the theory of cellular rings (cellular algebras), was developed at the end of the 60s by B. Yu. Weisfeiler and A.A. Leman in the course of the first serious attempt to study the complexity of the graph isomorphism problem, one of the central problems in the modern theory of combinatorial algorithms. At roughly the same time G.M. Adelson-Velskir, V.L. Arlazarov, I.A. Faradtev and their colleagues had developed a rather efficient tool for the constructive enumeration of combinatorial objects based on the branch and bound method. By means of this tool a number of "sports-like" results were obtained. Some of these results are still unsurpassed."

The Mathieu groups have many fascinating and unusual characteristics and have been studied at length since their discovery. This book provides a unique, geometric perspective on these groups. The amalgam method is explained and used to construct M24, enabling readers to learn the method through its application to a familiar example. The same method is then used to construct, among others, the octad graph, the Witt design and the Golay code. This book also provides a systematic account of 'small groups', and serves as a useful reference for the Mathieu groups. The material is presented in such a way that it guides the reader smoothly and intuitively through the process, leading to a deeper understanding of the topic.

This is the first book to contain a rigorous construction and uniqueness proof for the largest and most famous sporadic simple group, the Monster. The author provides a systematic exposition of the theory of the Monster group, which remains largely unpublished despite great interest from both mathematicians and physicists due to its intrinsic connection with various areas in mathematics, including reflection groups, modular forms and conformal field theory. Through construction via the Monster amalgam - one of the most promising in the modern theory of finite groups - the author observes some important properties of the action of the Monster on its minimal module, which are axiomatized under the name of Majorana involutions. Development of the theory of the groups generated by Majorana involutions leads the author to the conjecture that Monster is the largest group generated by the Majorana involutions.

This book is the first volume in a two-volume set, which will provide the complete proof of classification of two important classes of geometries, closely related to each other: Petersen and tilde geometries. There is an infinite family of tilde geometries associated with non-split extensions of symplectic groups over a field of two elements. Besides that there are twelve exceptional Petersen and tilde geometries. These exceptional geometries are related to sporadic simple groups, including the famous Monster group and this volume gives a construction for each of the Petersen and tilde geometries which provides an independent existence proof for the corresponding automorphism group. Important applications of Petersen and Tilde geometries are considered, including the so-called Y-presentations for the Monster and related groups, and a complete indentification of Y-groups is given. This is an essential purchase for researchers into finite group theory, finite geometries and algebraic combinatorics.

'Et moi, ... si j'avait su comment en revcnir. One service mathematics has rendered the je n'y scrais point aile.' human race. It has put common sense back where it belongs, on the topmost shclf next Jules Verne to the dusty canister labdlcd 'discarded non. The series is divergent; therefore we may be sense'. able to do something with it Eric T. Bell O. Heaviside Mathematics is a tool for thought. A highly necessary tool in a world where both feedback and non linearities abound. Similarly, all kinds of parts of mathematics serve as tools for other parts and for other sciences. Applying a simple rewriting rule to the quote on the right above one finds such statements as: 'One service topology has rendered mathematical physics .. .'; 'One service logic has rendered com puter science .. .'; 'One service category theory has rendered mathematics .. .'. All arguably true. And all statements obtainable this way form part of the raison d'etre of this series."

Let us assume that an observation Xi is a random variable (r.v.) with values in 1 1 (1R1 , 8 ) and distribution Pi (1R1 is the real line, and 8 is the cr-algebra of its Borel subsets). Let us also assume that the unknown distribution Pi belongs to a 1 certain parametric family {Pi() , () E e}. We call the triple GBPi = {1R1 , 8 , Pi(), () E e} a statistical experiment generated by the observation Xi. n We shall say that a statistical experiment GBPn = {lRn, 8 , P; ,() E e} is the product of the statistical experiments GBPi, i = 1, ... ,n if PO' = P () X ... X P () (IRn 1 n n is the n-dimensional Euclidean space, and 8 is the cr-algebra of its Borel subsets). In this manner the experiment GBPn is generated by n independent observations X = (X1, ... ,Xn). In this book we study the statistical experiments GBPn generated by observations of the form j = 1, ... ,n. (0.1) Xj = g(j, (}) + cj, c c In (0.1) g(j, (}) is a non-random function defined on e , where e is the closure in IRq of the open set e ~ IRq, and C j are independent r. v .-s with common distribution function (dJ.) P not depending on ().

X Kochendorffer, L.A. Kalu: lnin and their students in the 50s and 60s. Nowadays the most deeply developed is the theory of binary invariant relations and their combinatorial approximations. These combinatorial approximations arose repeatedly during this century under various names (Hecke algebras, centralizer rings, association schemes, coherent configurations, cellular rings, etc.-see the first paper of the collection for details) andin various branches of mathematics, both pure and applied. One of these approximations, the theory of cellular rings (cellular algebras), was developed at the end of the 60s by B. Yu. Weisfeiler and A.A. Leman in the course of the first serious attempt to study the complexity of the graph isomorphism problem, one of the central problems in the modern theory of combinatorial algorithms. At roughly the same time G.M. Adelson-Velskir, V.L. Arlazarov, I.A. Faradtev and their colleagues had developed a rather efficient tool for the constructive enumeration of combinatorial objects based on the branch and bound method. By means of this tool a number of "sports-like" results were obtained. Some of these results are still unsurpassed."

This second volume in a two-volume set provides a complete self-contained proof of the classification of geometries associated with sporadic simple groups: Petersen and tilde geometries. It contains a study of the representations of the geometries under consideration in GF(2)-vector spaces as well as in some non-Abelian groups. The central part is the classification of the amalgam of maximal parabolics, associated with a flag transitive action on a Petersen or tilde geometry. By way of their systematic treatment of group amalgams, the authors establish a deep and important mathematical result.

This book is the first volume in a two-volume set, which will provide the complete proof of classification of two important classes of geometries, closely related to each other: Petersen and tilde geometries. There is an infinite family of tilde geometries associated with nonsplit extensions of symplectic groups over a field of two elements. Besides that there are twelve exceptional Petersen and tilde geometries. These exceptional geometries are related to sporadic simple groups, including the famous Monster group and this volume gives a construction for each of the Petersen and tilde geometries that provides an independent existence proof for the corresponding automorphism group. Important applications of Petersen and tilde geometries are considered, including the so-called Y-presentations for the Monster and related groups, and a complete identification of Y-groups is given. This is an essential purchase for researchers in finite group theory, finite geometries and algebraic combinatorics.