This book contains nineteen papers from among the twenty-five papers presented at the Second International Conference on Fibonacci Numbers and Their Applications. These papers have been selected after a careful review by well known referee's in the field, and they range from elementary number theory to probability and statistics. The Fibonacci numbers are their unifying bond. It is anticipated that this book will be useful to research workers and graduate students interested in the Fibonacci numbers and their applications. October 1987 The Editors Gerald E. Bergum South Dakota State University Brookings, South Dakota, U.S.A. Andreas N. Philippou University of Patras Patras, Greece Alwyn F. Horadam University of New England Armidale, N.S.W., Australia xiii THE ORGANIZING COMMITTEES LOCAL COMMITTEE INTERN A TIONAL COMMITTEE Bergum, G., Chairman Philippou, A. (Greece), Chairman Edgar, H., Co-chalrman Horadam, A. (Australia), Co-chalrman Bergum, G. (U.s.A.) Thoro, D. Kiss, P. (Hungary) Johnson, M. Long, C. (U.S.A.) Lange, L.

Brauer had already introduced the defect of a block and opened the way towards a classification by solving all the problems in defects zero and one, and by providing some evidence for the finiteness of the set of blocks with a given defect. In 1959 he discovered the defect group, and in 1964 Dade determined the blocks with cyclic defect groups.
In 1978 Alperin and BrouA(c) discovered the Brauer category, and BrouA(c) and the author determined the blocks having a nilpotent Brauer category. In 1979, the author discovered the source algebra which determines all the other current invariants, representing faithfully the block a " and found its structure in the nilpotent blocks. Recently, the discovery by Rickard that all blocks with the same cyclic defect group and the same Brauer category have the same homotopic category focussed great interest on the new, loose relationship between blocks called Rickard equivalence.
This book describes the source algebra of a block from the source algebra of a Rickard equivalent block and the source of the Rickard equivalence.

This book provides a complete exposition of equidistribution and counting problems weighted by a potential function of common perpendicular geodesics in negatively curved manifolds and simplicial trees. Avoiding any compactness assumptions, the authors extend the theory of Patterson-Sullivan, Bowen-Margulis and Oh-Shah (skinning) measures to CAT(-1) spaces with potentials. The work presents a proof for the equidistribution of equidistant hypersurfaces to Gibbs measures, and the equidistribution of common perpendicular arcs between, for instance, closed geodesics. Using tools from ergodic theory (including coding by topological Markov shifts, and an appendix by Buzzi that relates weak Gibbs measures and equilibrium states for them), the authors further prove the variational principle and rate of mixing for the geodesic flow on metric and simplicial trees-again without the need for any compactness or torsionfree assumptions. In a series of applications, using the Bruhat-Tits trees over non-Archimedean local fields, the authors subsequently prove further important results: the Mertens formula and the equidistribution of Farey fractions in function fields, the equidistribution of quadratic irrationals over function fields in their completions, and asymptotic counting results of the representations by quadratic norm forms. One of the book's main benefits is that the authors provide explicit error terms throughout. Given its scope, it will be of interest to graduate students and researchers in a wide range of fields, for instance ergodic theory, dynamical systems, geometric group theory, discrete subgroups of locally compact groups, and the arithmetic of function fields.

This book presents advances in matrix and tensor data processing in the domain of signal, image and information processing. The theoretical mathematical approaches are discusses in the context of potential applications in sensor and cognitive systems engineering.
The topics and application include Information Geometry, Differential Geometry of structured Matrix, Positive Definite Matrix, Covariance Matrix, Sensors (Electromagnetic Fields, Acoustic sensors) and Applications in Cognitive systems, in particular Data Mining."

The book offers an original view on channel coding, based on a unitary approach to block and convolutional codes for error correction. It presents both new concepts and new families of codes. For example, lengthened and modified lengthened cyclic codes are introduced as a bridge towards time-invariant convolutional codes and their extension to time-varying versions. The novel families of codes include turbo codes and low-density parity check (LDPC) codes, the features of which are justified from the structural properties of the component codes. Design procedures for regular LDPC codes are proposed, supported by the presented theory. Quasi-cyclic LDPC codes, in block or convolutional form, represent one of the most original contributions of the book. The use of more than 100 examples allows the reader gradually to gain an understanding of the theory, and the provision of a list of more than 150 definitions, indexed at the end of the book, permits rapid location of sought information.

Significant progress has been made during the last 15 years in the solution of nonlinear systems, particularly in computing fixed points, solving systems of nonlinear equations and applications to equilibrium models. This volume presents a self-contained account of recent work on simplicial and continuation methods applied to the solution of algebraic equations. The contents are divided into eight chapters. Chapters 1 and 2 deal with Kuhn's algorithm. Chapter 3 considers Newton's method, and a comparison between Kuhn's algorithm and Newton's method is presented in Chapter 4. The following four chapters discuss respectively, incremental algorithms and their cost theory, homotopy algorithms, zeros of polynomial mapping, and piecewise linear algorithms. This text is designed for use by researchers and graduates interested in algebraic equations and computational complexity theory.

From the reviews of the first edition:

"It is certainly no exaggeration to say that A Singular Introduction to Commutative Algebra aims to lead a further stage in the computational revolution in commutative algebra . Among the great strengths and most distinctive features is a new, completely unified treatment of the global and local theories. making it one of the most flexible and most efficient systems of its type....another strength of Greuel and Pfister's book is its breadth of coverage of theoretical topics in the portions of commutative algebra closest to algebraic geometry, with algorithmic treatments of almost every topic....Greuel and Pfister have written a distinctive and highly useful book that should be in the library of every commutative algebraist and algebraic geometer, expert and novice alike."

J.B. Little, MAA, March 2004

The second edition is substantially enlarged by a chapter on Groebner bases in non-commtative rings, a chapter on characteristic and triangular sets with applications to primary decomposition and polynomial solving and an appendix on polynomial factorization including factorization over algebraic field extensions and absolute factorization, in the uni- and multivariate case."

The theories of V. V. Wagner (1908-1981) on abstractions of systems of binary relations are presented here within their historical and mathematical contexts. This book contains the first translation from Russian into English of a selection of Wagner's papers, the ideas of which are connected to present-day mathematical research. Along with a translation of Wagner's main work in this area, his 1953 paper 'Theory of generalised heaps and generalised groups,' the book also includes translations of three short precursor articles that provide additional context for his major work. Researchers and students interested in both algebra (in particular, heaps, semiheaps, generalised heaps, semigroups, and groups) and differential geometry will benefit from the techniques offered by these translations, owing to the natural connections between generalised heaps and generalised groups, and the role played by these concepts in differential geometry. This book gives examples from present-day mathematics where ideas related to Wagner's have found fruitful applications.

The notion of right-ordered groups is fundamental in theories of I-groups, ordered groups, torsion-free groups, and the theory of zero-divisors free rings, as well as in theoretical physics. Right-Ordered Groups is the first book to provide a systematic presentation of right-ordered group theory, describing all known and new results in the field. The volume addresses topics such as right-ordered groups and order permutation groups, the system of convex subgroups of a right-ordered group, and free products of right-ordered groups.

The book deals with dynamical systems, generated by linear mappings of finite dimensional spaces and their applications. These systems have a relatively simple structure from the point of view of the modern dynamical systems theory. However, for the dynamical systems of this sort, it is possible to obtain explicit answers to specific questions being useful in applications.

The considered problems are natural and look rather simple, but in reality in the course of investigation, they confront users withplenty of subtle questions and their detailed analysis needs a substantial effort.

The problems arising are related to linear algebra and dynamical systems theory, and therefore, the book can be considered as a natural amplification, refinement and supplement to linear algebra and dynamical systems theory textbooks."

ThesubjectofthisbookisSemi-In?niteAlgebra,ormorespeci?cally,Semi-In?nite Homological Algebra. The term "semi-in?nite" is loosely associated with objects that can be viewed as extending in both a "positive" and a "negative" direction, withsomenaturalpositioninbetween,perhapsde?nedupto a"?nite"movement. Geometrically, this would mean an in?nite-dimensional variety with a natural class of "semi-in?nite" cycles or subvarieties, having always a ?nite codimension in each other, but in?nite dimension and codimension in the whole variety [37]. (For further instances of semi-in?nite mathematics see, e. g. , [38] and [57], and references below. ) Examples of algebraic objects of the semi-in?nite type range from certain in?nite-dimensional Lie algebras to locally compact totally disconnected topolo- cal groups to ind-schemes of ind-in?nite type to discrete valuation ?elds. From an abstract point of view, these are ind-pro-objects in various categories, often - dowed with additional structures. One contribution we make in this monograph is the demonstration of another class of algebraic objects that should be thought of as "semi-in?nite", even though they do not at ?rst glance look quite similar to the ones in the above list. These are semialgebras over coalgebras, or more generally over corings - the associative algebraic structures of semi-in?nite nature. The subject lies on the border of Homological Algebra with Representation Theory, and the introduction of semialgebras into it provides an additional link with the theory of corings [23], as the semialgebrasare the natural objects dual to corings.

Bifurcation theory studies how the structure of solutions to equations changes as parameters are varied. The nature of these changes depends both on the number of parameters and on the symmetries of the equations. Volume I discusses how singularity-theoretic techniques aid the understanding of transitions in multiparameter systems. This volume focuses on bifurcation problems with symmetry and shows how group-theoretic techniques aid the understanding of transitions in symmetric systems. Four broad topics are covered: group theory and steady-state bifurcation, equicariant singularity theory, Hopf bifurcation with symmetry, and mode interactions. The opening chapter provides an introduction to these subjects and motivates the study of systems with symmetry. Detailed case studies illustrate how group-theoretic methods can be used to analyze specific problems arising in applications.

The fundamental theorem of algebra states that any complex polynomial must have a complex root. This book examines three pairs of proofs of the theorem from three different areas of mathematics: abstract algebra, complex analysis and topology. The first proof in each pair is fairly straightforward and depends only on what could be considered elementary mathematics. However, each of these first proofs leads to more general results from which the fundamental theorem can be deduced as a direct consequence. These general results constitute the second proof in each pair. To arrive at each of the proofs, enough of the general theory of each relevant area is developed to understand the proof. In addition to the proofs and techniques themselves, many applications such as the insolvability of the quintic and the transcendence of e and pi are presented. Finally, a series of appendices give six additional proofs including a version of Gauss'original first proof. The book is intended for junior/senior level undergraduate mathematics students or first year graduate students, and would make an ideal "capstone" course in mathematics.

This book differentiates between categories of adolescent male offending and explores the behavioural and social profiles of those who become involved in violent offending and organized crime. Using self-reported and arrest data, the book examines key stages of male adolescent offending with a view to early recognition of behaviours that leave young men vulnerable to criminal exploitation and the escalation of violence. It also explains the importance of understanding crime motivations, how young men view themselves when they offend, and the emotions that they experience. Rather than looking at violent offending as a single category of behavior, the book helps readers differentiate between types of adolescent violence and to understand the underlying psychological and social causes. It offers an insight into the journey of young people who are criminally exploited and those who become involved in committing acts of serious violence and organized crime. It does so by using data from official records, self-reported offending, and the narratives of young people. Each chapter focuses on a particular stage of offending with a view to early identification, support, and diversion. Pathways to Adolescent Male Violent Offending is aimed at practitioners in youth offending services, youth work, policing, and education. It will also be useful for students of forensic and investigative psychology, criminal justice, policing, and child and adolescent mental health.

The book describes the history of Jordan algebras, and describes in full mathematical detail the recent structure theory for Jordan algebras of arbitrary dimension due to Efim Zel'manov. To keep the exposition elementary, the structure theory is developed for linear Jordan algebras (where the scalar ring contains 1/2, avoiding the nuisancy distractions of characteristic 2), though the modern quadratic methods are used throughout. Both the quadratic methods and the Zelmanov results go beyond the previous textbooks on Jordan Theory, written in the 1960's and early 1980's before the theory reached its final form. The book is written to serve either as a text for a 2nd year graduate course, or for independent reading, for students who need or wish to know a bit about Jordan algebras. It is not primaily aimed at experts or students going on to do research in the area, and no knowledge is required beyond standard first-year graduate algebra courses. General students of algebra can profit from exposure to nonassociative algebras, and students or professional mathematicians working in areas such as Lie algebras, differential geometry Äsymmetric spaces or bounded symmetric domainsÜ, functional analysis ÄJB algebras and triplesÜ, or exceptional groups and geometry Ärelated to the 27- dimensional Albert algebraÜ can also profit from acquaintance with the material. Jordan algebras crop up in many surprising settings, and find application to a variety of mathematical areas.

The notion of group is fundamental in our days, not only in mathematics, but also in classical mechanics, electromagnetism, theory of relativity, quantum mechanics, theory of elementary particles, etc. This notion has developed during a century and this development is connected with the names of great mathematicians as E. Galois, A. L. Cauchy, C. F. Gauss, W. R. Hamilton, C. Jordan, S. Lie, E. Cartan, H. Weyl, E. Wigner, and of many others. In mathematics, as in other sciences, the simple and fertile ideas make their way with difficulty and slowly; however, this long history would have been of a minor interest, had the notion of group remained connected only with rather restricted domains of mathematics, those in which it occurred at the beginning. But at present, groups have invaded almost all mathematical disciplines, mechanics, the largest part of physics, of chemistry, etc. We may say, without exaggeration, that this is the most important idea that occurred in mathematics since the invention of infinitesimal calculus; indeed, the notion of group expresses, in a precise and operational form, the vague and universal ideas of regularity and symmetry. The notion of group led to a profound understanding of the character of the laws which govern natural phenomena, permitting to formulate new laws, correcting certain inadequate formulations and providing unitary and non contradictory formulations for the investigated phenomena."

This second volume of this text covers the classical aspects of the theory of groups and their representations. It also offers a general introduction to the modern theory of representations including the representations of quivers and finite partially ordered sets and their applications to finite dimensional algebras. It reviews key recent developments in the theory of special ring classes including Frobenius, quasi-Frobenius, and others.

This is a textbook for a course (or self-instruction) in cryptography with emphasis on algebraic methods. The first half of the book is a self-contained informal introduction to areas of algebra, number theory, and computer science that are used in cryptography. Most of the material in the second half - "hidden monomial" systems, combinatorial-algebraic systems, and hyperelliptic systems - has not previously appeared in monograph form. The Appendix by Menezes, Wu, and Zuccherato gives an elementary treatment of hyperelliptic curves. This book is intended for graduate students, advanced undergraduates, and scientists working in various fields of data security.

This is a memorial volume dedicated to A. L. S. Corner, previously Professor in Oxford, who published important results on algebra, especially on the connections of modules with endomorphism algebras. The volume contains refereed contributions which are related to the work of Corner.It contains also an unpublished extended paper of Corner himself. A memorial volume with important contributions related to algebra.

This popular and successful text was originally written for a one-semester course in linear algebra at the sophomore undergraduate level. Students at this level generally have had little contact with complex numbers or abstract mathematics, so the book deals almost exclusively with real finite dimensional vector spaces, but in a setting and formulation that permits easy generalization to abstract vector spaces. The goal of the first two editions was the principal axis theorem for real symmetric linear transformation. The principal axis theorem becomes the first of two goals for this new edition, which follows a straight path to its solution. A wide selection of examples of vector spaces and linear transformation is presented to serve as a testing ground for the theory. In the second edition, a new chapter on Jordan normal form was added which reappears here in expanded form as the second goal of this new edition, along with applications to differential systems. To achieve the principal axis theorem in one semester a straight path to these two goals is followed. As compensation, there is a wide selection of examples and exercises. In addition, the author includes an introduction to invariant theory to show students that linear algebra alone is not capable of solving these canonical forms problems. The book continues to offer a compact, but mathematically clean introduction to linear algebra with particular emphasis on topics that are used in abstract algebra, the theory of differential equations, and group representation theory.

This volume is based on the presentations and discussions of a national symposium on "Couples in Conflict" that focused on family issues. A common thread throughout is that constructive conflict and negotiation are beneficial for relationships. Together, the chapters provide a foundation for thinking about creative ways in which our society can work to prevent or minimize destructive couple conflict and to enhance couples' abilities to constructively handle their differences. Divided into four parts, this book: *addresses the societal and bioevolutionary underpinnings of couple conflict; *presents the interpersonal roots of couple conflict and the consequences for individuals and couples; *discusses what effects couple conflict have on children and how individual differences in children moderate these effects; and *outlines the issue of policies and programs that address couple conflict. This book concludes with an essay that pulls these four themes together and points to new directions for research and program efforts.

There has been considerable interest recently in the subject of patterns in permutations and words, a new branch of combinatorics with its roots in the works of Rotem, Rogers, and Knuth in the 1970s. Consideration of the patterns in question has been extremely interesting from the combinatorial point of view, and it has proved to be a useful language in a variety of seemingly unrelated problems, including the theory of Kazhdan-Lusztig polynomials, singularities of Schubert varieties, interval orders, Chebyshev polynomials, models in statistical mechanics, and various sorting algorithms, including sorting stacks and sortable permutations.

The author collects the main results in the field in this up-to-date, comprehensive reference volume. He highlights significant achievements in the area, and points to research directions and open problems. The book will be of interest to researchers and graduate students in theoretical computer science and mathematics, in particular those working in algebraic combinatorics and combinatorics on words. It will also be of interest to specialists in other branches of mathematics, theoretical physics, and computational biology.

The author collects the main results in the field in this up-to-date, comprehensive reference volume. He highlights significant achievements in the area, and points to research directions and open problems. The book will be of interest to researchers and graduate students in theoretical computer science and mathematics, in particular those working in algebraic combinatorics and combinatorics on words. It will also be of interest to specialists in other branches of mathematics, theoretical physics, and computational biology.

This self-contained monograph presents matrix algorithms and their analysis. The new technique enables not only the solution of linear systems but also the approximation of matrix functions, e.g., the matrix exponential. Other applications include the solution of matrix equations, e.g., the Lyapunov or Riccati equation. The required mathematical background can be found in the appendix. The numerical treatment of fully populated large-scale matrices is usually rather costly. However, the technique of hierarchical matrices makes it possible to store matrices and to perform matrix operations approximately with almost linear cost and a controllable degree of approximation error. For important classes of matrices, the computational cost increases only logarithmically with the approximation error. The operations provided include the matrix inversion and LU decomposition. Since large-scale linear algebra problems are standard in scientific computing, the subject of hierarchical matrices is of interest to scientists in computational mathematics, physics, chemistry and engineering.

Motivated by some notorious open problems, such as the Jacobian conjecture and the tame generators problem, the subject of polynomial automorphisms has become a rapidly growing field of interest. This book, the first in the field, collects many of the results scattered throughout the literature. It introduces the reader to a fascinating subject and brings him to the forefront of research in this area. Some of the topics treated are invertibility criteria, face polynomials, the tame generators problem, the cancellation problem, exotic spaces, DNA for polynomial automorphisms, the Abhyankar-Moh theorem, stabilization methods, dynamical systems, the Markus-Yamabe conjecture, group actions, Hilbert's 14th problem, various linearization problems and the Jacobian conjecture. The work is essentially self-contained and aimed at the level of beginning graduate students. Exercises are included at the end of each section. At the end of the book there are appendices to cover used material from algebra, algebraic geometry, D-modules and GrAbner basis theory. A long list of ''strong'' examples and an extensive bibliography conclude the book.