| |
|
|
|
|
|
|
|
|
1. |
Record Nr. |
UNINA9910451434203321 |
|
|
Autore |
Kowalski Emmanuel <1969-> |
|
|
Titolo |
The large sieve and its applications : arithmetic geometry, random walks and discrete groups / / E. Kowalski [[electronic resource]] |
|
|
|
|
|
|
|
Pubbl/distr/stampa |
|
|
Cambridge : , : Cambridge University Press, , 2008 |
|
|
|
|
|
|
|
ISBN |
|
1-107-18739-7 |
1-281-38384-8 |
9786611383848 |
0-511-39806-9 |
0-511-39729-1 |
0-511-40091-8 |
0-511-39656-2 |
0-511-54294-1 |
0-511-39887-5 |
|
|
|
|
|
|
|
|
Descrizione fisica |
|
1 online resource (xxi, 293 pages) : digital, PDF file(s) |
|
|
|
|
|
|
Collana |
|
Cambridge tracts in mathematics ; ; 175 |
|
|
|
|
|
|
Disciplina |
|
|
|
|
|
|
Soggetti |
|
Sieves (Mathematics) |
Arithmetical algebraic geometry |
Random walks (Mathematics) |
Discrete groups |
|
|
|
|
|
|
|
|
Lingua di pubblicazione |
|
|
|
|
|
|
Formato |
Materiale a stampa |
|
|
|
|
|
Livello bibliografico |
Monografia |
|
|
|
|
|
Note generali |
|
Title from publisher's bibliographic system (viewed on 05 Oct 2015). |
|
|
|
|
|
|
Nota di bibliografia |
|
Includes bibliographical references and index. |
|
|
|
|
|
|
Nota di contenuto |
|
; 1. Introduction -- ; 2. The principle of the large sieve -- ; 3. Group and conjugacy sieves -- ; 4. Elementary and classical examples -- ; 5. Degrees of representations of finite groups -- ; 6. Probabilistic sieves -- ; 7. Sieving in discrete groups -- ; 8. Sieving for Frobenius over finite fields -- ; App. A. Small sieves -- ; App. B. Local density computations over finite fields -- ; App. C. Representation theory -- ; App. D. Property (T) and Property ([tau]) -- ; App. E. Linear algebraic groups -- ; App. F. Probability theory and random walks -- ; App. G. Sums of multiplicative functions -- ; App. H. Topology. |
|
|
|
|
|
|
|
|
Sommario/riassunto |
|
Among the modern methods used to study prime numbers, the 'sieve' has been one of the most efficient. Originally conceived by Linnik in |
|
|
|
|
|
|
|
|
|
|
|
|
|
1941, the 'large sieve' has developed extensively since the 1960s, with a recent realisation that the underlying principles were capable of applications going well beyond prime number theory. This book develops a general form of sieve inequality, and describes its varied applications, including the study of families of zeta functions of algebraic curves over finite fields; arithmetic properties of characteristic polynomials of random unimodular matrices; homological properties of random 3-manifolds; and the average number of primes dividing the denominators of rational points on elliptic curves. Also covered in detail are the tools of harmonic analysis used to implement the forms of the large sieve inequality, including the Riemann Hypothesis over finite fields, and Property (T) or Property (tau) for discrete groups. |
|
|
|
|
|
|
2. |
Record Nr. |
UNINA9910790425703321 |
|
|
Autore |
De Rosa Aurelio |
|
|
Titolo |
Instant jQuery selectors / / Aurelio de Rosa |
|
|
|
|
|
Pubbl/distr/stampa |
|
|
Birmingham, England : , : Packt Publishing, , 2013 |
|
|
|
|
|
|
|
ISBN |
|
|
|
|
|
|
Edizione |
[1st edition] |
|
|
|
|
|
Descrizione fisica |
|
1 online resource (70 p.) |
|
|
|
|
|
|
Disciplina |
|
|
|
|
|
|
Soggetti |
|
Query languages (Computer science) |
Electronic data processing |
|
|
|
|
|
|
|
|
Lingua di pubblicazione |
|
|
|
|
|
|
Formato |
Materiale a stampa |
|
|
|
|
|
Livello bibliografico |
Monografia |
|
|
|
|
|
Note generali |
|
Description based upon print version of record. |
|
|
|
|
|
|
Nota di contenuto |
|
Cover; Copyright; Credits; About the Author; About the Reviewer; www.PacktPub.com; Table of Contents; Preface; Instant jQuery Selectors; Setting up jQuery (Must know); The All selector (Must know); Selecting by ID (Must know); Selecting by class (Must know); Selecting by tag (Must know); Multiple selectors at once (Should know); Selecting by hierarchy (Must know); Selecting by attributes (Should know); Selecting by position using filters (Should know); Selecting form elements using filters (Should know); Child filters (Should know); Other filters (Become an expert) |
Custom filters (Become an expert)Context matters (Should know); |
|
|
|
|
|
|
|
|
|
|
|
Improving performance reusing selected elements (Become an expert); Methods to filter collections (Become an expert); Traversing DOM SubTrees (Become an expert); How to have efficient selectors (Become an expert) |
|
|
|
|
|
|
Sommario/riassunto |
|
Filled with practical, step-by-step instructions and clear explanations for the most important and useful tasks. Instant jQuery Selectors follows a simple how-to format with recipes aimed at making you well versed with the wide range of selectors that jQuery has to offer through a myriad of examples.Instant jQuery Selectors is for web developers who want to delve into jQuery from its very starting point: selectors. Even if you're already familiar with the framework and its selectors, you could find several tips and tricks that you aren't aware of, especially about performance and how jQuery ac |
|
|
|
|
|
|
|
| |