Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

Vector bundles. --- D-modules. --- Fibrés vectoriels. --- D-modules, Théorie des.

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

This book is an introduction to the theory of rings and modules that goes beyond what one normally obtains in a graduate course in abstract algebra. The theme of the text is the interplay between rings and modules. At times rings are investigated by considering given sets of conditions on the modules they admit and at other times rings of a certain type are considered to see what structure is forced on their modules. Standard topics in ring and module theory such as chain conditions on rings and modules, injective and projective modules and semisimple rings are included as well as subjects like category theory and homological algebra. The text also contains presentations on topics such as flat modules and coherent rings, injective envelopes, projective covers and perfect rings, reflexive modules and quasi-Frobenius rings, and graded rings and modules. The book is a self-contained volume written in a very systematic style: all proofs are clear and easy for the reader to understand and all arguments are based on materials contained in the book. A problem sets follow each section. It is assumed that the reader is familiar with concepts such as Zorn's lemma, commutative diagrams and ordinal and cardinal numbers. It is also assumed that the reader has a basic knowledge of rings and their homomorphisms. The text is suitable for graduate and PhD students who have chosen ring theory for their research subject.

Rings (Algebra) --- Modules (Algebra) --- Homological Algebra. --- Module Theory. --- Ring Theory.

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

Drop tests. --- Parachutes. --- Abort apparatus. --- Soft landing. --- Spacecraft modules. --- Simulators. --- H-53 helicopter.

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

We're all hypocrites. Why? Hypocrisy is the natural state of the human mind. Robert Kurzban shows us that the key to understanding our behavioral inconsistencies lies in understanding the mind's design. The human mind consists of many specialized units designed by the process of evolution by natural selection. While these modules sometimes work together seamlessly, they don't always, resulting in impossibly contradictory beliefs, vacillations between patience and impulsiveness, violations of our supposed moral principles, and overinflated views of ourselves. This modular, evolutionary psychological view of the mind undermines deeply held intuitions about ourselves, as well as a range of scientific theories that require a "self" with consistent beliefs and preferences. Modularity suggests that there is no "I." Instead, each of us is a contentious "we"--a collection of discrete but interacting systems whose constant conflicts shape our interactions with one another and our experience of the world. In clear language, full of wit and rich in examples, Kurzban explains the roots and implications of our inconsistent minds, and why it is perfectly natural to believe that everyone else is a hypocrite.

Modularity (Psychology) --- Evolutionary psychology. --- Self-deception. --- Deception --- Defense mechanisms (Psychology) --- Self-perception --- Psychology --- Human evolution --- Faculty psychology --- Modules (Psychology) --- Human information processing

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

"Modular forms are tremendously important in various areas of mathematics, from number theory and algebraic geometry to combinatorics and lattices. Their Fourier coefficients, with Ramanujan's tau-function as a typical example, have deep arithmetic significance. Prior to this book, the fastest known algorithms for computing these Fourier coefficients took exponential time, except in some special cases. The case of elliptic curves (Schoof's algorithm) was at the birth of elliptic curve cryptography around 1985. This book gives an algorithm for computing coefficients of modular forms of level one in polynomial time. For example, Ramanujan's tau of a prime number P can be computed in time bounded by a fixed power of the logarithm of P. Such fast computation of Fourier coefficients is itself based on the main result of the book: the computation, in polynomial time, of Galois representations over finite fields attached to modular forms by the Langlands program. Because these Galois representations typically have a nonsolvable image, this result is a major step forward from explicit class field theory, and it could be described as the start of the explicit Langlands program. The computation of the Galois representations uses their realization, following Shimura and Deligne, in the torsion subgroup of Jacobian varieties of modular curves. The main challenge is then to perform the necessary computations in time polynomial in the dimension of these highly nonlinear algebraic varieties. Exact computations involving systems of polynomial equations in many variables take exponential time. This is avoided by numerical approximations with a precision that suffices to derive exact results from them. Bounds for the required precision--in other words, bounds for the height of the rational numbers that describe the Galois representation to be computed--are obtained from Arakelov theory. Two types of approximations are treated: one using complex uniformization and another one using geometry over finite fields. The book begins with a concise and concrete introduction that makes its accessible to readers without an extensive background in arithmetic geometry. And the book includes a chapter that describes actual computations"-- "This book represents a major step forward from explicit class field theory, and it could be described as the start of the 'explicit Langlands program'"--

Galois modules (Algebra) --- Class field theory. --- Algebraic number theory --- Galois module structure (Algebra) --- Galois's modules (Algebra) --- Modules (Algebra) --- Arakelov invariants. --- Arakelov theory. --- Fourier coefficients. --- Galois representation. --- Galois representations. --- Green functions. --- Hecke operators. --- Jacobians. --- Langlands program. --- Las Vegas algorithm. --- Lehmer. --- Peter Bruin. --- Ramanujan's tau function. --- Ramanujan's tau-function. --- Ramanujan's tau. --- Riemann surfaces. --- Schoof's algorithm. --- Turing machines. --- algorithms. --- arithmetic geometry. --- arithmetic surfaces. --- bounding heights. --- bounds. --- coefficients. --- complex roots. --- computation. --- computing algorithms. --- computing coefficients. --- cusp forms. --- cuspidal divisor. --- eigenforms. --- finite fields. --- height functions. --- inequality. --- lattices. --- minimal polynomial. --- modular curves. --- modular forms. --- modular representation. --- modular representations. --- modular symbols. --- nonvanishing conjecture. --- p-adic methods. --- plane curves. --- polynomial time algorithm. --- polynomial time algoriths. --- polynomial time. --- polynomials. --- power series. --- probabilistic polynomial time. --- random divisors. --- residual representation. --- square root. --- square-free levels. --- tale cohomology. --- torsion divisors. --- torsion.