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.
The Admissible Dual of GL(N) via Compact Open Subgroups. (AM-129), Volume 129 / / C. Bushnell, P. C. Kutzko
| The Admissible Dual of GL(N) via Compact Open Subgroups. (AM-129), Volume 129 / / C. Bushnell, P. C. Kutzko |
| Autore | Bushnell C. |
| Pubbl/distr/stampa | Princeton, NJ : , : Princeton University Press, , [2016] |
| Descrizione fisica | 1 online resource (327 pages) : illustrations |
| Disciplina | 512/.2 |
| Collana | Annals of Mathematics Studies |
| Soggetto topico |
Representations of groups
Nonstandard mathematical analysis |
| Soggetto non controllato |
Abelian group
Abuse of notation Additive group Affine Hecke algebra Algebra homomorphism Approximation Automorphism Bijection Block matrix Calculation Cardinality Classical group Computation Conjecture Conjugacy class Contradiction Corollary Coset Critical exponent Diagonal matrix Dimension (vector space) Dimension Discrete series representation Discrete valuation ring Divisor Eigenvalues and eigenvectors Equivalence class Exact sequence Exactness Existential quantification Explicit formula Explicit formulae (L-function) Field extension Finite group Functor Gauss sum General linear group Group theory Haar measure Harmonic analysis Hecke algebra Homomorphism Identity matrix Induced representation Integer Irreducible representation Isomorphism class Iwahori subgroup Jordan normal form Levi decomposition Local Langlands conjectures Local field Locally compact group Mathematics Matrix coefficient Maximal compact subgroup Maximal ideal Multiset Normal subgroup P-adic number Permutation matrix Polynomial Profinite group Quantity Rational number Reductive group Representation theory Requirement Residue field Ring (mathematics) Scientific notation Simple module Special case Sub"ient Subgroup Subset Support (mathematics) Symmetric group Tensor product Terminology Theorem Topological group Topology Vector space Weil group Weyl group |
| ISBN | 1-4008-8249-4 |
| Classificazione | SK 340 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Frontmatter -- Contents -- Introduction -- Comments for the reader -- 1. Exactness and intertwining -- 2. The structure of simple strata -- 3. The simple characters of a simple stratum -- 4. Interlude with Hecke algebra -- 5. Simple types -- 6. Maximal types -- 7. Typical representations -- 8. Atypical representations -- References -- Index of notation and terminology |
| Record Nr. | UNINA-9910154750803321 |
Bushnell C.
|
||
| Princeton, NJ : , : Princeton University Press, , [2016] | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Contributions to the Theory of Games (AM-28), Volume II / / Albert William Tucker, Harold William Kuhn
| Contributions to the Theory of Games (AM-28), Volume II / / Albert William Tucker, Harold William Kuhn |
| Pubbl/distr/stampa | Princeton, NJ : , : Princeton University Press, , [2016] |
| Descrizione fisica | 1 online resource (409 pages) : illustrations |
| Disciplina | 519.3 |
| Collana | Annals of Mathematics Studies |
| Soggetto topico | Game theory |
| Soggetto non controllato |
A priori probability
Accuracy and precision Addition Assignment problem Basic solution (linear programming) Big O notation Bilinear form Binary game Boolean algebra (structure) Brouwer fixed-point theorem Calculation Cartesian product Cauchy sequence Characteristic function (probability theory) Coefficient Combination Commutative property Computation Conditional probability distribution Continuous function Continuous game Convex set Cooperative game Counterexample Determinacy Diagram (category theory) Dimension (vector space) Disjoint union Duality (mathematics) Eigenfunction Equilibrium point Equivalence class Euclidean space Existence theorem Existential quantification Expected value Function (mathematics) Hyperplane Idealization Imputation (statistics) Inequality (mathematics) Infimum and supremum Integral equation Intersection (set theory) Interval (mathematics) Kakutani fixed-point theorem Limit of a sequence Limit point Linear differential equation Linear inequality Matching Pennies Mathematical induction Mathematical optimization Mathematics Matrix (mathematics) Measure (mathematics) Minimax theorem Monotonic function Mutual exclusivity Neumann series Numerical analysis Open problem Open set Outcome (probability) Partial derivative Partially ordered set Permutation matrix Permutation Polynomial Positional notation Preference (economics) Probability distribution Probability measure Probability Property B. Proportionality (mathematics) Quantity Ranking (information retrieval) Ring of sets Saddle point Scientific notation Sign (mathematics) Solution set Special case Statistical hypothesis testing Step function Strategy (game theory) Subset Summation Symmetrization Theorem Theory of Games and Economic Behavior Theory Three-dimensional space (mathematics) Topology Transcendental number Transformation matrix Unit interval Units of measurement Variable (mathematics) |
| ISBN | 1-4008-8197-8 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Frontmatter -- Preface / Kuhn, H. W. / Tucker, A. W. -- Contents -- Part I. Finite Zero-Sum Two-Persons Games -- 1. A Certain Zero-sum Two-person Game Equivalent to the Optimal Assignment Problem / Neumann, John von -- 2. Two Variants of Poker / Gillies, D. B. / Mayberry, J. P. / Neumann, J. von -- 3. The Double Description Method / Motzkin, T. S. / Raiffa, H. / Thompson, G. L. / Thrall, R. M. -- 4. Solutions of Convex Games as Fixed-points / Dresher, M. / Karlin, S. -- 5. Admissible Points of Convex Sets / Arrow, K. J. / Barankin, E. W. / Blackwell, D. -- Part II. Infinite Zero-Sum Two-Persons Games -- 6. Games of Timing / Shiffman, Max -- 7. Reduction of Certain Classes of Games to Integral Equations / Karlin, Samuel -- 8. On a Class of Games / Karlin, Samuel -- 9. Notes on Games over the Square / Glicksberg, I. / Gross, O. -- 10. On Randomization in Statistical Games with k Terminal Actions / Blackwell, David -- Part III. Games in Extensive Form -- 11. Extensive Games and the Problem of Information / Kuhn, H. W. -- 12. Equivalence of Information Patterns and Essentially Determinate Games / Dalkey, Norman -- 13. Infinite Games with Perfect Information / Gale, David / Stewart, F. M. -- 14. Signaling Strategies in n-Person Games / Thompson, G. L. -- 15. Bridge and Signaling / Thompson, G. L. -- 16. Sums of Positional Games / Milnor, John -- Part IV. General n-Person Games -- 17. A Value for n-Person Games / Shapley, L. S. -- 18. Symmetric Solutions to Majority Games / Bott, Raoul -- 19. Discriminatory and Bargaining Solutions to a Class of Symmetric n-Person Games / Gillies, D. B. -- 20. Quota Solutions of n-Person Games / Shapley, L. S. -- 21. Arbitration Schemes for Generalized Two-person Games / Raiffa, Howard -- Bibliography -- Backmatter |
| Record Nr. | UNINA-9910154750503321 |
| Princeton, NJ : , : Princeton University Press, , [2016] | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Distributed control of robotic networks [[electronic resource] ] : a mathematical approach to motion coordination algorithms / / Francesco Bullo, Jorge Cortés, Sonia Martínez
| Distributed control of robotic networks [[electronic resource] ] : a mathematical approach to motion coordination algorithms / / Francesco Bullo, Jorge Cortés, Sonia Martínez |
| Autore | Bullo Francesco |
| Edizione | [Course Book] |
| Pubbl/distr/stampa | Princeton, NJ, : Princeton University Press, 2009 |
| Descrizione fisica | 1 online resource (333 p.) |
| Disciplina | 629.8/9246 |
| Altri autori (Persone) |
CortésJorge <1974->
MartínezSonia <1974-> |
| Collana | Princeton series in applied mathematics |
| Soggetto topico |
Robotics
Computer algorithms Robots - Control systems |
| Soggetto non controllato |
1-center problem
Adjacency matrix Aggregate function Algebraic connectivity Algebraic topology (object) Algorithm Analysis of algorithms Approximation algorithm Asynchronous system Bellman–Ford algorithm Bifurcation theory Bounded set (topological vector space) Calculation Cartesian product Centroid Chebyshev center Circulant matrix Circumscribed circle Cluster analysis Combinatorial optimization Combinatorics Communication complexity Computation Computational complexity theory Computational geometry Computational model Computer simulation Computer vision Connected component (graph theory) Connectivity (graph theory) Consensus (computer science) Control function (econometrics) Differentiable function Dijkstra's algorithm Dimensional analysis Directed acyclic graph Directed graph Discrete time and continuous time Disk (mathematics) Distributed algorithm Doubly stochastic matrix Dynamical system Eigenvalues and eigenvectors Estimation Euclidean space Function composition Hybrid system Information theory Initial condition Instance (computer science) Invariance principle (linguistics) Invertible matrix Iteration Iterative method Kinematics Laplacian matrix Leader election Linear dynamical system Linear interpolation Linear programming Lipschitz continuity Lyapunov function Markov chain Mathematical induction Mathematical optimization Mobile robot Motion planning Multi-agent system Network model Network topology Norm (mathematics) Numerical integration Optimal control Optimization problem Parameter (computer programming) Partition of a set Percolation theory Permutation matrix Polytope Proportionality (mathematics) Quantifier (logic) Quantization (signal processing) Robustness (computer science) Scientific notation Sensor Set (mathematics) Simply connected space Simulation Simultaneous equations State space State variable Stochastic matrix Stochastic Strongly connected component Synchronous network Theorem Time complexity Topology Variable (mathematics) Vector field |
| ISBN |
1-68015-897-X
1-282-45820-5 1-282-93575-5 9786612458200 9786612935756 1-4008-3147-4 0-691-14195-9 |
| Classificazione | SK 880 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Frontmatter -- Contents -- Preface -- Chapter One. An introduction to distributed algorithms -- Chapter Two. Geometric models and optimization -- Chapter Three. Robotic network models and complexity notions -- Chapter Four. Connectivity maintenance and rendezvous -- Chapter Five. Deployment -- Chapter Six. Boundary estimation and tracking -- Bibliography -- Algorithm Index -- Subject Index -- Symbol Index |
| Record Nr. | UNINA-9910781069103321 |
|
Bullo Francesco
|
||
| Princeton, NJ, : Princeton University Press, 2009 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Graph theoretic methods in multiagent networks / / Mehran Mesbahi and Magnus Egerstedt
| Graph theoretic methods in multiagent networks / / Mehran Mesbahi and Magnus Egerstedt |
| Autore | Mesbahi Mehran |
| Edizione | [STU student edition] |
| Pubbl/distr/stampa | Princeton : , : Princeton University Press, , [2010] |
| Descrizione fisica | 1 online resource (424 pages) |
| Disciplina | 006.3 |
| Collana | Princeton series in applied mathematics |
| Soggetto topico |
Network analysis (Planning) - Graphic methods
Multiagent systems - Mathematical models |
| Soggetto non controllato |
Addition
Adjacency matrix Algebraic graph theory Algorithm Automorphism Bipartite graph Cardinality Cartesian product Circulant graph Combinatorics Complete graph Computation Connectivity (graph theory) Controllability Convex combination Corollary Cycle graph (algebra) Cycle space Degree (graph theory) Degree matrix Diagonal matrix Diameter Differentiable function Dimension Directed graph Division by zero Dynamical system Eigenvalues and eigenvectors Equilibrium point Estimation Estimator Existential quantification Extremal graph theory Graph (discrete mathematics) Graph theory Identity matrix Incidence matrix Information exchange Initial condition Interconnection Iteration Kalman filter Kronecker product LTI system theory LaSalle's invariance principle Laplacian matrix Least squares Line graph Linear map Lipschitz continuity Lyapunov function Lyapunov stability Markov chain Mathematical optimization Matrix exponential Measurement Multi-agent system Nash equilibrium Natural number Network topology Nonnegative matrix Notation Observability Optimal control Optimization problem Pairwise Parameter Path graph Permutation matrix Permutation Positive semidefinite Positive-definite matrix Probability Quantity Random graph Random variable Rate of convergence Requirement Result Robotics Scientific notation Sensor Sign (mathematics) Simplicial complex Special case Spectral graph theory Stochastic matrix Strongly connected component Subset Summation Supergraph Symmetric matrix Systems theory Theorem Theory Unit interval Upper and lower bounds Variable (mathematics) Vector space Without loss of generality |
| ISBN |
9781400835355 (electronic book)
1-282-97910-8 9786612979101 1-4008-3535-6 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Front matter -- Contents -- Preface -- Notation -- PART 1. FOUNDATIONS -- Chapter 1. Introduction -- Chapter 2. Graph Theory -- Chapter 3. The Agreement Protocol: Part I-The Static Case -- Chapter 4. The Agreement Protocol: Part II-Lyapunov and LaSalle -- Chapter 5. Probabilistic Analysis of Networks and Protocols -- PART 2. MULTIAGENT NETWORKS -- Chapter 6. Formation Control -- Chapter 7. Mobile Robots -- Chapter 8. Distributed Estimation -- Chapter 9. Social Networks, Epidemics, and Games -- PART 3. NETWORKS AS SYSTEMS -- Chapter 10. Agreement with Inputs and Outputs -- Chapter 11. Synthesis of Networks -- Chapter 12. Dynamic Graph Processes -- Chapter 13. Higher-order Networks -- Appendix A. -- Bibliography -- Index |
| Record Nr. | UNINA-9910785659103321 |
|
Mesbahi Mehran
|
||
| Princeton : , : Princeton University Press, , [2010] | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Graph theoretic methods in multiagent networks / / Mehran Mesbahi and Magnus Egerstedt
| Graph theoretic methods in multiagent networks / / Mehran Mesbahi and Magnus Egerstedt |
| Autore | Mesbahi Mehran |
| Edizione | [STU student edition] |
| Pubbl/distr/stampa | Princeton : , : Princeton University Press, , [2010] |
| Descrizione fisica | 1 online resource (424 pages) |
| Disciplina | 006.3 |
| Collana | Princeton series in applied mathematics |
| Soggetto topico |
Network analysis (Planning) - Graphic methods
Multiagent systems - Mathematical models |
| Soggetto non controllato |
Addition
Adjacency matrix Algebraic graph theory Algorithm Automorphism Bipartite graph Cardinality Cartesian product Circulant graph Combinatorics Complete graph Computation Connectivity (graph theory) Controllability Convex combination Corollary Cycle graph (algebra) Cycle space Degree (graph theory) Degree matrix Diagonal matrix Diameter Differentiable function Dimension Directed graph Division by zero Dynamical system Eigenvalues and eigenvectors Equilibrium point Estimation Estimator Existential quantification Extremal graph theory Graph (discrete mathematics) Graph theory Identity matrix Incidence matrix Information exchange Initial condition Interconnection Iteration Kalman filter Kronecker product LTI system theory LaSalle's invariance principle Laplacian matrix Least squares Line graph Linear map Lipschitz continuity Lyapunov function Lyapunov stability Markov chain Mathematical optimization Matrix exponential Measurement Multi-agent system Nash equilibrium Natural number Network topology Nonnegative matrix Notation Observability Optimal control Optimization problem Pairwise Parameter Path graph Permutation matrix Permutation Positive semidefinite Positive-definite matrix Probability Quantity Random graph Random variable Rate of convergence Requirement Result Robotics Scientific notation Sensor Sign (mathematics) Simplicial complex Special case Spectral graph theory Stochastic matrix Strongly connected component Subset Summation Supergraph Symmetric matrix Systems theory Theorem Theory Unit interval Upper and lower bounds Variable (mathematics) Vector space Without loss of generality |
| ISBN |
9781400835355 (electronic book)
1-282-97910-8 9786612979101 1-4008-3535-6 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Front matter -- Contents -- Preface -- Notation -- PART 1. FOUNDATIONS -- Chapter 1. Introduction -- Chapter 2. Graph Theory -- Chapter 3. The Agreement Protocol: Part I-The Static Case -- Chapter 4. The Agreement Protocol: Part II-Lyapunov and LaSalle -- Chapter 5. Probabilistic Analysis of Networks and Protocols -- PART 2. MULTIAGENT NETWORKS -- Chapter 6. Formation Control -- Chapter 7. Mobile Robots -- Chapter 8. Distributed Estimation -- Chapter 9. Social Networks, Epidemics, and Games -- PART 3. NETWORKS AS SYSTEMS -- Chapter 10. Agreement with Inputs and Outputs -- Chapter 11. Synthesis of Networks -- Chapter 12. Dynamic Graph Processes -- Chapter 13. Higher-order Networks -- Appendix A. -- Bibliography -- Index |
| Record Nr. | UNINA-9910816716403321 |
|
Mesbahi Mehran
|
||
| Princeton : , : Princeton University Press, , [2010] | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Linear Inequalities and Related Systems. (AM-38), Volume 38 / / Harold William Kuhn, Albert William Tucker
| Linear Inequalities and Related Systems. (AM-38), Volume 38 / / Harold William Kuhn, Albert William Tucker |
| Autore | Kuhn Harold William |
| Pubbl/distr/stampa | Princeton, NJ : , : Princeton University Press, , [2016] |
| Descrizione fisica | 1 online resource (353 pages) : illustrations, tables |
| Disciplina | 512.89 |
| Collana | Annals of Mathematics Studies |
| Soggetto topico |
Linear programming
Matrices Game theory |
| Soggetto non controllato |
Banach space
Basic solution (linear programming) Big O notation Bilinear form Boundary (topology) Brouwer fixed-point theorem Characterization (mathematics) Coefficient Combination Computation Computational problem Convex combination Convex cone Convex hull Convex set Corollary Correlation and dependence Cramer's rule Cyclic permutation Dedekind cut Degeneracy (mathematics) Determinant Diagram (category theory) Dilworth's theorem Dimension (vector space) Directional derivative Disjoint sets Doubly stochastic matrix Dual space Duality (mathematics) Duality (optimization) Eigenvalues and eigenvectors Elementary proof Equation solving Equation Equivalence class Euclidean space Existence theorem Existential quantification Extreme point Fixed-point theorem Functional analysis Fundamental theorem General equilibrium theory Hall's theorem Hilbert space Incidence matrix Inequality (mathematics) Infimum and supremum Invertible matrix Kakutani fixed-point theorem Lagrange multiplier Linear equation Linear inequality Linear map Linear programming Linear space (geometry) Linear subspace Loss function Main diagonal Mathematical induction Mathematical optimization Mathematical problem Max-flow min-cut theorem Maxima and minima Maximal set Maximum flow problem Menger's theorem Minor (linear algebra) Monotonic function N-vector Nonlinear programming Nonnegative matrix Parity (mathematics) Partially ordered set Permutation matrix Permutation Polyhedron Quantity Representation theorem Row and column vectors Scientific notation Sensitivity analysis Set notation Sign (mathematics) Simplex algorithm Simultaneous equations Solution set Special case Subset Summation System of linear equations Theorem Transpose Unit sphere Unit vector Upper and lower bounds Variable (mathematics) Vector space Von Neumann's theorem |
| ISBN | 1-4008-8198-6 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Frontmatter -- Preface -- Contents -- 1 . Dual Systems of Homogeneous Linear Relations / Tucker, A. W. -- 2. Polyhedral Convex Cones / Goldman, A. J. / Tucker, A. W. -- 3 . Resolution and Separation Theorems for Polyhedral Convex Sets / Goldman, A. J. -- 4. Theory of Linear Programming / Goldman, A. J. / Tucker, A. W. -- 5. On Systems of Linear Inequalities / Pan, Ky -- 6. Infinite Programs / Duffin, R . J . -- 7* A Primal-Dual Algorithm for Linear Programs / Dantzig, G. B. / Ford, L. R. / Fulkerson, D. R. -- 8. Marginal Values of Matrix Games and Linear Programs / Mills, Harlan D. -- 9 . Determinateness of Polyhedral Games / Wolfe, Philip -- 10. On Systems of Distinct Representatives / Hoffman, A. J. / Kuhn, H. W. -- 11. Dilworth's Theorem on Partially Ordered Sets / Dantzig, G. B. / Hoffman, A. J. -- 12. On the Max-Flow Min-Cut Theorem of Networks / Dantzig, G. B. / Fulkerson, D. R. -- 13. Integral Boundary Points of Convex Polyhedra / Hoffman, A. J. / Kruskal, J. B. -- 14 . An Extension of a Theorem of Dantzig's / Heller, I. / Tompkins, C. B. -- 15. Neighboring Vertices on a Convex Polyhedron / Gale, David -- 16. On a Theorem of Wald / Kuhn, H. W. -- 17. On the Solution of a Game-Theoretic Problem / Thompson, Gerald L. -- 18. The Closed Linear Model of Production / Gale, David -- Bibliography -- Backmatter |
| Record Nr. | UNINA-9910154749603321 |
|
Kuhn Harold William
|
||
| Princeton, NJ : , : Princeton University Press, , [2016] | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||