top

  Info

  • Utilizzare la checkbox di selezione a fianco di ciascun documento per attivare le funzionalità di stampa, invio email, download nei formati disponibili del (i) record.

  Info

  • Utilizzare questo link per rimuovere la selezione effettuata.
Symplectic manifolds with no Kähler structure / Aleksy Tralle, John Oprea
Symplectic manifolds with no Kähler structure / Aleksy Tralle, John Oprea
Autore Tralle, Aleksy
Pubbl/distr/stampa Berlin [etc.] : Springer, c1997
Descrizione fisica VIII, 207 p. ; 24 cm.
Disciplina 516.362
Altri autori (Persone) Oprea, John
Collana Lecture notes in mathematics
Soggetto topico Geometria differenziale
ISBN 3-540-63105-4
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Record Nr. UNIBAS-000012408
Tralle, Aleksy  
Berlin [etc.] : Springer, c1997
Materiale a stampa
Lo trovi qui: Univ. della Basilicata
Opac: Controlla la disponibilità qui
Symplectic techniques in physics / Victor Guillemin, Shlomo Sternberg
Symplectic techniques in physics / Victor Guillemin, Shlomo Sternberg
Autore Sternberg, Shlomo
Pubbl/distr/stampa Cambridge [Cambridgeshire] ; New York : Cambridge University Press, c1984
Descrizione fisica xi, 468 p. : ill. ; 24 cm.
Disciplina 516.362
Altri autori (Persone) Guillemin, Victorauthor
Soggetto topico Differential geometry
Mathematical physics
Transformations (Mathematics)
ISBN 0521389909
Classificazione AMS 53Z05
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Record Nr. UNISALENTO-991001407859707536
Sternberg, Shlomo  
Cambridge [Cambridgeshire] ; New York : Cambridge University Press, c1984
Materiale a stampa
Lo trovi qui: Univ. del Salento
Opac: Controlla la disponibilità qui
Séminaire de théorie spectrale et géométrie n. 13 : année 1994-1995 / [eds.] Université de Grenoble I, Institut Fourier, Laboratoire de mathématiques associé au CNRS
Séminaire de théorie spectrale et géométrie n. 13 : année 1994-1995 / [eds.] Université de Grenoble I, Institut Fourier, Laboratoire de mathématiques associé au CNRS
Pubbl/distr/stampa St Martin D'Hères : Univ. Grenoble, [1995]
Descrizione fisica 195 p. ; 30 cm.
Disciplina 516.362
Soggetto topico Geometry - Congresses
Spectral theory - Congresses
Classificazione AMS 58-06
AMS 58G25
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione fre
Record Nr. UNISALENTO-991001333359707536
St Martin D'Hères : Univ. Grenoble, [1995]
Materiale a stampa
Lo trovi qui: Univ. del Salento
Opac: Controlla la disponibilità qui
Séminaire de théorie spectrale et géométrie n. 14 : année 1995-1996 / [eds.] Université de Grenoble I, Institut Fourier, Laboratoire de mathématiques associé au CNRS
Séminaire de théorie spectrale et géométrie n. 14 : année 1995-1996 / [eds.] Université de Grenoble I, Institut Fourier, Laboratoire de mathématiques associé au CNRS
Pubbl/distr/stampa St Martin D'Hères : Univ. Grenoble, [1996]
Descrizione fisica 155 p. : ill. ; 30 cm
Disciplina 516.362
Soggetto topico Geometry - Congresses
Spectral theory - Congresses
Classificazione AMS 58-06
AMS 58G25
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione fre
Record Nr. UNISALENTO-991001333419707536
St Martin D'Hères : Univ. Grenoble, [1996]
Materiale a stampa
Lo trovi qui: Univ. del Salento
Opac: Controlla la disponibilità qui
Séminaire de théorie spectrale et géométrie n. 15 : année 1996-1997 / [eds.] Université de Grenoble I, Institut Fourier, Laboratoire de mathématiques associé au C.N.R.S. et de l'U.J.F.
Séminaire de théorie spectrale et géométrie n. 15 : année 1996-1997 / [eds.] Université de Grenoble I, Institut Fourier, Laboratoire de mathématiques associé au C.N.R.S. et de l'U.J.F.
Autore Séminaire de théorie spectrale et géométrie
Pubbl/distr/stampa St Martin D'Hères : Univ. Grenoble, [1997]
Descrizione fisica 227 p. ; 30 cm
Disciplina 516.362
Soggetto topico Geometry - Congresses
Spectral theory (Mathematics) - Congresses
Classificazione AMS 58-06
AMS 58G25
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione fre
eng
Record Nr. UNISALENTO-991003185129707536
Séminaire de théorie spectrale et géométrie  
St Martin D'Hères : Univ. Grenoble, [1997]
Materiale a stampa
Lo trovi qui: Univ. del Salento
Opac: Controlla la disponibilità qui
Teoria della misura e funzioni a variazione limitata. Tesi di laurea / laureando Gregorio Mancino ; relat. Antonio Leaci
Teoria della misura e funzioni a variazione limitata. Tesi di laurea / laureando Gregorio Mancino ; relat. Antonio Leaci
Autore Mancino, Gregorio
Pubbl/distr/stampa Lecce : Università degli studi. Facoltà di Scienze. Corso di laurea in Matematica, a.a. 1993-94
Disciplina 516.362
Altri autori (Persone) Leaci, Antonio
Soggetto topico Functions of bounded variation
Classificazione AMS 26A45
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione ita
Record Nr. UNISALENTO-991001420379707536
Mancino, Gregorio  
Lecce : Università degli studi. Facoltà di Scienze. Corso di laurea in Matematica, a.a. 1993-94
Materiale a stampa
Lo trovi qui: Univ. del Salento
Opac: Controlla la disponibilità qui
The theory of error correcting codes [[electronic resource] /] / F. J. MacWilliams, N. J. A. Sloane
The theory of error correcting codes [[electronic resource] /] / F. J. MacWilliams, N. J. A. Sloane
Autore MacWilliams F. J (Florence Jessie), <1917->
Pubbl/distr/stampa Amsterdam ; ; New York, : North-Holland Pub. Co.
Descrizione fisica 1 online resource (787 p.)
Disciplina 516.362
Altri autori (Persone) SloaneN. J. A <1939-> (Neil James Alexander)
Collana North-Holland mathematical library
Soggetto topico Error-correcting codes (Information theory)
Coding theory
Soggetto genere / forma Electronic books.
ISBN 1-282-76978-2
9786612769788
0-08-095423-5
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Front Cover; The Theory of Error-Correcting Codes; Copyright Page; Preface; Preface to the third printing; Contents; Chapter 1. Linear codes; 1. Linear codes; 2. Properties of a linear code; 3. At the receiving end; 4. More about decoding a linear code; 5. Error probability; 6. Shannon's theorem on the existence of good codes; 7. Hamming codes; 8. The dual code; 9. Construction of new codes from old (II); 10. Some general properties of a linear code; 11. Summary of Chapter 1; Notes on Chapter 1; Chapter 2. Nonlinear codes, Hadamard matrices, designs and the Golay code; 1. Nonlinear codes
2. The Plotkin bound3. Hadamard matrices and Hadamard codes; 4. Conferences matrices; 5. t-designs; 6. An introduction to the binary Golay code; 7. The Steiner system S(5, 6, 12), and nonlinear single-error correcting codes; 8. An introduction to the Nordstrom-Robinson code; 9. Construction of new codes from old (III); Notes on Chapter 2; Chapter 3. An introduction to BCH codes and finite fields; 1. Double-error-correcting BCH codes (I); 2. Construction of the field GF(16); 3. Double-error-correcting BCH codes (II); 4. Computing in a finite field; Notes on Chapter 3; Chapter 4. Finite fields
1. Introduction2. Finite fields: the basic theory; 3. Minimal polynomials; 4. How to find irreducible polynomials; 5. Tables of small fields; 6. The automorphism group of GF(pm); 7. The number of irreducible polynomials; 8. Bases of GF(pm) over GF(p); 9. Linearized polynomials and normal bases; Notes on Chapter 4; Chapter 5. Dual codes and their weight distribution; 1. Introduction; 2. Weight distribution of the dual of a binary linear code; 3. The group algebra; 4. Characters; 5. MacWilliams theorem for nonlinear codes; 6. Generalized MacWilliams theorems for linear codes
7. Properties of Krawtchouk polynomialsNotes on Chapter 5; Chapter 6. Codes. designs and perfect codes; 1. Introduction; 2. Four fundamental parameters of a code; 3. An explicit formula for the weight and distance distribution; 4. Designs from codes when s = d'; 5. The dual code also gives designs; 6. Weight distribution of translates of a code; 7.Designs from nonlinear codes when s' = d; 8. Perfect codes; 9. Codes over GF(q); 10. There are no more perfect codes; Notes on Chapter 6; Chapter 7. Cyclic codes; 1. Introduction; 2. Definition of a cyclic code; 3. Generator polynomial
4. The check polynomial5. Factors of Xn - 1; 6. t-error-correcting BCH codes; 7. Using a matrix over GF(qn) to define a code over GF(q); 8. Encoding cyclic codes; Notes on Chapter 7; Chapter 8. Cyclic codes (contd.): Idempotents and Mattson-Solomon polynomials; 1. Introduction; 2. Idempotents; 3. Minimal ideals. irreducible codes. and primitive idempotents; 4. Weight distribution of minimal codes; 5. The automorphism group of a code; 6. The Mattson-Solomon polynomial; 7. Some weight distributions; Notes on Chapter 8; Chapter 9. BCH codes; 1. Introduction
2. The true minimum distance of a BCH code
Record Nr. UNINA-9910511895303321
MacWilliams F. J (Florence Jessie), <1917->  
Amsterdam ; ; New York, : North-Holland Pub. Co.
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
The theory of error correcting codes [[electronic resource] /] / F. J. MacWilliams, N. J. A. Sloane
The theory of error correcting codes [[electronic resource] /] / F. J. MacWilliams, N. J. A. Sloane
Autore MacWilliams F. J (Florence Jessie), <1917->
Pubbl/distr/stampa Amsterdam ; ; New York, : North-Holland Pub. Co.
Descrizione fisica 1 online resource (787 p.)
Disciplina 516.362
Altri autori (Persone) SloaneN. J. A <1939-> (Neil James Alexander)
Collana North-Holland mathematical library
Soggetto topico Error-correcting codes (Information theory)
Coding theory
ISBN 1-282-76978-2
9786612769788
0-08-095423-5
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Front Cover; The Theory of Error-Correcting Codes; Copyright Page; Preface; Preface to the third printing; Contents; Chapter 1. Linear codes; 1. Linear codes; 2. Properties of a linear code; 3. At the receiving end; 4. More about decoding a linear code; 5. Error probability; 6. Shannon's theorem on the existence of good codes; 7. Hamming codes; 8. The dual code; 9. Construction of new codes from old (II); 10. Some general properties of a linear code; 11. Summary of Chapter 1; Notes on Chapter 1; Chapter 2. Nonlinear codes, Hadamard matrices, designs and the Golay code; 1. Nonlinear codes
2. The Plotkin bound3. Hadamard matrices and Hadamard codes; 4. Conferences matrices; 5. t-designs; 6. An introduction to the binary Golay code; 7. The Steiner system S(5, 6, 12), and nonlinear single-error correcting codes; 8. An introduction to the Nordstrom-Robinson code; 9. Construction of new codes from old (III); Notes on Chapter 2; Chapter 3. An introduction to BCH codes and finite fields; 1. Double-error-correcting BCH codes (I); 2. Construction of the field GF(16); 3. Double-error-correcting BCH codes (II); 4. Computing in a finite field; Notes on Chapter 3; Chapter 4. Finite fields
1. Introduction2. Finite fields: the basic theory; 3. Minimal polynomials; 4. How to find irreducible polynomials; 5. Tables of small fields; 6. The automorphism group of GF(pm); 7. The number of irreducible polynomials; 8. Bases of GF(pm) over GF(p); 9. Linearized polynomials and normal bases; Notes on Chapter 4; Chapter 5. Dual codes and their weight distribution; 1. Introduction; 2. Weight distribution of the dual of a binary linear code; 3. The group algebra; 4. Characters; 5. MacWilliams theorem for nonlinear codes; 6. Generalized MacWilliams theorems for linear codes
7. Properties of Krawtchouk polynomialsNotes on Chapter 5; Chapter 6. Codes. designs and perfect codes; 1. Introduction; 2. Four fundamental parameters of a code; 3. An explicit formula for the weight and distance distribution; 4. Designs from codes when s = d'; 5. The dual code also gives designs; 6. Weight distribution of translates of a code; 7.Designs from nonlinear codes when s' = d; 8. Perfect codes; 9. Codes over GF(q); 10. There are no more perfect codes; Notes on Chapter 6; Chapter 7. Cyclic codes; 1. Introduction; 2. Definition of a cyclic code; 3. Generator polynomial
4. The check polynomial5. Factors of Xn - 1; 6. t-error-correcting BCH codes; 7. Using a matrix over GF(qn) to define a code over GF(q); 8. Encoding cyclic codes; Notes on Chapter 7; Chapter 8. Cyclic codes (contd.): Idempotents and Mattson-Solomon polynomials; 1. Introduction; 2. Idempotents; 3. Minimal ideals. irreducible codes. and primitive idempotents; 4. Weight distribution of minimal codes; 5. The automorphism group of a code; 6. The Mattson-Solomon polynomial; 7. Some weight distributions; Notes on Chapter 8; Chapter 9. BCH codes; 1. Introduction
2. The true minimum distance of a BCH code
Record Nr. UNINA-9910781168703321
MacWilliams F. J (Florence Jessie), <1917->  
Amsterdam ; ; New York, : North-Holland Pub. Co.
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
The theory of error correcting codes / / F. J. MacWilliams, N. J. A. Sloane
The theory of error correcting codes / / F. J. MacWilliams, N. J. A. Sloane
Autore MacWilliams F. J (Florence Jessie), <1917->
Pubbl/distr/stampa Amsterdam ; ; New York, : North-Holland Pub. Co.
Descrizione fisica 1 online resource (787 p.)
Disciplina 516.362
Altri autori (Persone) SloaneN. J. A <1939-> (Neil James Alexander)
Collana North-Holland mathematical library
Soggetto topico Error-correcting codes (Information theory)
Coding theory
ISBN 1-282-76978-2
9786612769788
0-08-095423-5
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Front Cover; The Theory of Error-Correcting Codes; Copyright Page; Preface; Preface to the third printing; Contents; Chapter 1. Linear codes; 1. Linear codes; 2. Properties of a linear code; 3. At the receiving end; 4. More about decoding a linear code; 5. Error probability; 6. Shannon's theorem on the existence of good codes; 7. Hamming codes; 8. The dual code; 9. Construction of new codes from old (II); 10. Some general properties of a linear code; 11. Summary of Chapter 1; Notes on Chapter 1; Chapter 2. Nonlinear codes, Hadamard matrices, designs and the Golay code; 1. Nonlinear codes
2. The Plotkin bound3. Hadamard matrices and Hadamard codes; 4. Conferences matrices; 5. t-designs; 6. An introduction to the binary Golay code; 7. The Steiner system S(5, 6, 12), and nonlinear single-error correcting codes; 8. An introduction to the Nordstrom-Robinson code; 9. Construction of new codes from old (III); Notes on Chapter 2; Chapter 3. An introduction to BCH codes and finite fields; 1. Double-error-correcting BCH codes (I); 2. Construction of the field GF(16); 3. Double-error-correcting BCH codes (II); 4. Computing in a finite field; Notes on Chapter 3; Chapter 4. Finite fields
1. Introduction2. Finite fields: the basic theory; 3. Minimal polynomials; 4. How to find irreducible polynomials; 5. Tables of small fields; 6. The automorphism group of GF(pm); 7. The number of irreducible polynomials; 8. Bases of GF(pm) over GF(p); 9. Linearized polynomials and normal bases; Notes on Chapter 4; Chapter 5. Dual codes and their weight distribution; 1. Introduction; 2. Weight distribution of the dual of a binary linear code; 3. The group algebra; 4. Characters; 5. MacWilliams theorem for nonlinear codes; 6. Generalized MacWilliams theorems for linear codes
7. Properties of Krawtchouk polynomialsNotes on Chapter 5; Chapter 6. Codes. designs and perfect codes; 1. Introduction; 2. Four fundamental parameters of a code; 3. An explicit formula for the weight and distance distribution; 4. Designs from codes when s = d'; 5. The dual code also gives designs; 6. Weight distribution of translates of a code; 7.Designs from nonlinear codes when s' = d; 8. Perfect codes; 9. Codes over GF(q); 10. There are no more perfect codes; Notes on Chapter 6; Chapter 7. Cyclic codes; 1. Introduction; 2. Definition of a cyclic code; 3. Generator polynomial
4. The check polynomial5. Factors of Xn - 1; 6. t-error-correcting BCH codes; 7. Using a matrix over GF(qn) to define a code over GF(q); 8. Encoding cyclic codes; Notes on Chapter 7; Chapter 8. Cyclic codes (contd.): Idempotents and Mattson-Solomon polynomials; 1. Introduction; 2. Idempotents; 3. Minimal ideals. irreducible codes. and primitive idempotents; 4. Weight distribution of minimal codes; 5. The automorphism group of a code; 6. The Mattson-Solomon polynomial; 7. Some weight distributions; Notes on Chapter 8; Chapter 9. BCH codes; 1. Introduction
2. The true minimum distance of a BCH code
Record Nr. UNINA-9910818005503321
MacWilliams F. J (Florence Jessie), <1917->  
Amsterdam ; ; New York, : North-Holland Pub. Co.
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
Théorie des G-structures : le problème d'équivalence / Pierre Molino ; notes rédigées avec la collaboration de F. Toupine
Théorie des G-structures : le problème d'équivalence / Pierre Molino ; notes rédigées avec la collaboration de F. Toupine
Autore Molino, Pierre
Pubbl/distr/stampa Berlin [etc.] : Springer, 1977
Descrizione fisica 163 p. ; 25 cm.
Disciplina 516.362
Collana Lecture notes in mathematics
Soggetto topico Equazioni differenziali lineari alla derivate parziali
Geometria differenziale
ISBN 3-540-08246-8
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione fre
Record Nr. UNIBAS-000013228
Molino, Pierre  
Berlin [etc.] : Springer, 1977
Materiale a stampa
Lo trovi qui: Univ. della Basilicata
Opac: Controlla la disponibilità qui

Data di pubblicazione

Altro...