Wyniki wyszukiwania:

This book deals with several topics in algebra useful for computer science applications and the symbolic treatment of algebraic problems, pointing out and discussing their algorithmic nature. The topics covered range from classical results such as the Euclidean algorithm, the Chinese remainder theorem, and polynomial interpolation, to p-adic expansions of rational and algebraic numbers and rational functions, to reach the problem of the polynomial factorisation, especially via Berlekamp's method, and the discrete Fourier transform. Basic algebra concepts are revised in a form suited for...

Groups are a means of classification, via the group action on a set, but also the object of a classification. How many groups of a given type are there, and how can they be described? Holder's program for attacking this problem in the case of finite groups is a sort of leitmotiv throughout the text. Infinite groups are also considered, with particular attention to logical and decision problems. Abelian, nilpotent and solvable groups are studied both in the finite and infinite case. Permutation groups and are treated in detail; their relationship with Galois theory is often taken into...

Nato dai corsi universitari di Teoria dei Gruppi tenuti per vari anni dall'autore, questo libro affronta gli argomenti fondamentali della teoria: gruppi abeliani, nilpotenti e risolubili, gruppi liberi, permutazioni, rappresentazioni e coomologia. Dopo le prime nozioni, viene esposto il programma di Holder per la classificazione dei gruppi finiti. Un lungo capitolo e dedicato all'azione di un gruppo su un insieme e alle permutazioni, sia sotto l'aspetto algebrico che combinatorio, con richiami alla teoria delle equazioni. Si considerano anche alcune questioni di carattere logico, come la...