Piacentini cattaneo (37 risultati)

Condizione: New.

Softcover. Condizione: Sehr gut. Berlin, Springer (2008). gr,8°. XVI, 522 p. Pbck. Universitext.- With exercises and solutions for selected exercises.- Small ownership inscription verso cover and on title, otherwise in very good condition.

XVI, 518 p. Softcover. Versand aus Deutschland / We dispatch from Germany via Air Mail. Einband bestoßen, daher Mängelexemplar gestempelt, sonst sehr guter Zustand. Imperfect copy due to slightly bumped cover, apart from this in very good condition. Stamped. UNITEXT / la Matematica per Il 3+2 Ser. Sprache: Italienisch. …

Condizione: As New. Unread book in perfect condition.

Condizione: New. In English.

Condizione: New.

Taschenbuch. Condizione: Neu. Druck auf Anfrage Neuware - Printed after ordering - In this volume one finds basic techniques from algebra and number theory (e.g. congruences, unique factorization domains, finite fields, quadratic residues, primality tests, continued fractions, etc.) which in recent years have proven to be extremely useful for applications to cryptography and coding theory. Both cryptography and codes have crucial applications in our daily lives, and they are described here, while the complexity problems that arise in implementing the related numerical algorithms are also taken into due account. Cryptography has been developed in great detail, both in its classical and more recent aspects. In particular public key cryptography is extensively discussed, the use of algebraic geometry, specifically of elliptic curves over finite fields, is illustrated, and a final chapter is devoted to quantum cryptography, which is the new frontier of the field. Coding theory is not discussed in full; however a chapter, sufficient for a good introduction to the subject, has been devoted to linear codes. Each chapter ends with several complements and with an extensive list of exercises, the solutions to most of which are included in the last chapter. Though the book contains advanced material, such as cryptography on elliptic curves, Goppa codes using algebraic curves over finite fields, and the recent AKS polynomial primality test, the authors' objective has been to keep the exposition as self-contained and elementary as possible. Therefore the book will be useful to students and researchers, both in theoretical (e.g. mathematicians) and in applied sciences (e.g. physicists, engineers, computer scientists, etc.) seeking a friendly introduction to the important subjects treated here. The book will also be useful for teachers who intend to give courses on these topics.…

Condizione: New.

Condizione: New. In English.

Condizione: New.

Gebunden. Condizione: New.

Condizione: New. In English.

Condizione: New. In English.

Taschenbuch. Condizione: Neu. Topics in Computational Algebra | G. M. Piacentini Cattaneo (u. a.) | Taschenbuch | v | Englisch | 2012 | Springer | EAN 9789401055147 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu. …

Taschenbuch. Condizione: Neu. Druck auf Anfrage Neuware - Printed after ordering - The main purpose of these lectures is first to briefly survey the fundamental con nection between the representation theory of the symmetric group Sn and the theory of symmetric functions and second to show how combinatorial methods that arise naturally in the theory of symmetric functions lead to efficient algorithms to express various prod ucts of representations of Sn in terms of sums of irreducible representations. That is, there is a basic isometry which maps the center of the group algebra of Sn, Z(Sn), to the space of homogeneous symmetric functions of degree n, An. This basic isometry is known as the Frobenius map, F. The Frobenius map allows us to reduce calculations involving characters of the symmetric group to calculations involving Schur functions. Now there is a very rich and beautiful theory of the combinatorics of symmetric functions that has been developed in recent years. The combinatorics of symmetric functions, then leads to a number of very efficient algorithms for expanding various products of Schur functions into a sum of Schur functions. Such expansions of products of Schur functions correspond via the Frobenius map to decomposing various products of irreducible representations of Sn into their irreducible components. In addition, the Schur functions are also the characters of the irreducible polynomial representations of the general linear group over the complex numbers GLn(C).…

Buch. Condizione: Neu. Druck auf Anfrage Neuware - Printed after ordering - The main purpose of these lectures is first to briefly survey the fundamental con nection between the representation theory of the symmetric group Sn and the theory of symmetric functions and second to show how combinatorial methods that arise naturally in the theory of symmetric functions lead to efficient algorithms to express various prod ucts of representations of Sn in terms of sums of irreducible representations. That is, there is a basic isometry which maps the center of the group algebra of Sn, Z(Sn), to the space of homogeneous symmetric functions of degree n, An. This basic isometry is known as the Frobenius map, F. The Frobenius map allows us to reduce calculations involving characters of the symmetric group to calculations involving Schur functions. Now there is a very rich and beautiful theory of the combinatorics of symmetric functions that has been developed in recent years. The combinatorics of symmetric functions, then leads to a number of very efficient algorithms for expanding various products of Schur functions into a sum of Schur functions. Such expansions of products of Schur functions correspond via the Frobenius map to decomposing various products of irreducible representations of Sn into their irreducible components. In addition, the Schur functions are also the characters of the irreducible polynomial representations of the general linear group over the complex numbers GLn(C).…

Hardcover. Condizione: gut. 1991. Topics in Computational Algebra In englischer Sprache. pages.

Condizione: New. pp. v + 261.

Condizione: New. pp. 272.

Paperback. Condizione: Brand New. 1990 edition. 261 pages. 9.25x6.10x0.61 inches. In Stock.

Condizione: As New. Unread book in perfect condition.

Condizione: NEW.

Taschenbuch. Condizione: Neu. Druck auf Anfrage Neuware - Printed after ordering - Si sviluppano le tecniche di base di algebra e di teoria dei numeri utili in recenti applicazioni alla crittografia e ai codici, con l intento di essere elementari e autosufficienti. Viene posto l accento su problemi di natura computazionale. Questa parte del volume può essere utile quale libro di testo per un primo corso di algebra per matematici, informatici o ignegneri. Vengono poi illustrate importanti applicazioni dell algebra e della geometria alla crittografia e ai codici. Entrambi, crittografia e codici hanno notevoli applicazioni nella vita quotidiana che vengono qui illustrate. La crittografia è sviluppata in dettaglio in gran parte dei suoi aspetti classici e attuali, e viene sviluppata sia la crittografia a chiave privata che quella a chiave pubblica. Viene anche illustrata la crittografia con l uso di curve ellittiche sui campi finiti. Ai codici lineari è dedicato un capitolo di introduzione all argomento. Questa parte del libro può essere utile per un corso della laurea triennale o specialistica per matematici, fisici, informatici o ingegneri. Il libro è ricco di complementi ed esercizi, in buona parte svolti. Vengono indicate le parti e gli esercizi di maggiore o minore difficoltà.…

Condizione: New.

4to. 522 pp. Firma. Encuadernación editorial. Muy buen estado.

Kartoniert / Broschiert. Condizione: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Nice, elementary introduction to number theory on two of its real-world applicationsNice, elementary introduction to number theory on two of its real-world applicationsIncludes supplementary material: sn.pub/extrasIn this volume one.…

Condizione: new. Questo è un articolo print on demand.

Taschenbuch. Condizione: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -Si sviluppano le tecniche di base di algebra e di teoria dei numeri utili in recenti applicazioni alla crittografia e ai codici, con l intento di essere elementari e autosufficienti. Viene posto l accento su problemi di natura computazionale. Questa parte del volume può essere utile quale libro di testo per un primo corso di algebra per matematici, informatici o ignegneri. Vengono poi illustrate importanti applicazioni dell algebra e della geometria alla crittografia e ai codici. Entrambi, crittografia e codici hanno notevoli applicazioni nella vita quotidiana che vengono qui illustrate. La crittografia è sviluppata in dettaglio in gran parte dei suoi aspetti classici e attuali, e viene sviluppata sia la crittografia a chiave privata che quella a chiave pubblica. Viene anche illustrata la crittografia con l uso di curve ellittiche sui campi finiti. Ai codici lineari è dedicato un capitolo di introduzione all argomento. Questa parte del libro può essere utile per un corso della laurea triennale o specialistica per matematici, fisici, informatici o ingegneri. Il libro è ricco di complementi ed esercizi, in buona parte svolti. Vengono indicate le parti e gli esercizi di maggiore o minore difficoltà. 540 pp. Italienisch.…

Taschenbuch. Condizione: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -The main purpose of these lectures is first to briefly survey the fundamental con nection between the representation theory of the symmetric group Sn and the theory of symmetric functions and second to show how combinatorial methods that arise naturally in the theory of symmetric functions lead to efficient algorithms to express various prod ucts of representations of Sn in terms of sums of irreducible representations. That is, there is a basic isometry which maps the center of the group algebra of Sn, Z(Sn), to the space of homogeneous symmetric functions of degree n, An. This basic isometry is known as the Frobenius map, F. The Frobenius map allows us to reduce calculations involving characters of the symmetric group to calculations involving Schur functions. Now there is a very rich and beautiful theory of the combinatorics of symmetric functions that has been developed in recent years. The combinatorics of symmetric functions, then leads to a number of very efficient algorithms for expanding various products of Schur functions into a sum of Schur functions. Such expansions of products of Schur functions correspond via the Frobenius map to decomposing various products of irreducible representations of Sn into their irreducible components. In addition, the Schur functions are also the characters of the irreducible polynomial representations of the general linear group over the complex numbers GLn(C). 268 pp. Englisch.…

Buch. Condizione: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -The main purpose of these lectures is first to briefly survey the fundamental con nection between the representation theory of the symmetric group Sn and the theory of symmetric functions and second to show how combinatorial methods that arise naturally in the theory of symmetric functions lead to efficient algorithms to express various prod ucts of representations of Sn in terms of sums of irreducible representations. That is, there is a basic isometry which maps the center of the group algebra of Sn, Z(Sn), to the space of homogeneous symmetric functions of degree n, An. This basic isometry is known as the Frobenius map, F. The Frobenius map allows us to reduce calculations involving characters of the symmetric group to calculations involving Schur functions. Now there is a very rich and beautiful theory of the combinatorics of symmetric functions that has been developed in recent years. The combinatorics of symmetric functions, then leads to a number of very efficient algorithms for expanding various products of Schur functions into a sum of Schur functions. Such expansions of products of Schur functions correspond via the Frobenius map to decomposing various products of irreducible representations of Sn into their irreducible components. In addition, the Schur functions are also the characters of the irreducible polynomial representations of the general linear group over the complex numbers GLn(C). 270 pp. Englisch.…