Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

Ramsey theory is a fast-growing area of combinatorics with deep connections to other fields of mathematics such as topological dynamics, ergodic theory, mathematical logic, and algebra. The area of Ramsey theory dealing with Ramsey-type phenomena in higher dimensions is particularly useful. Introduction to Ramsey Spaces presents in a systematic way a method for building higher-dimensional Ramsey spaces from basic one-dimensional principles. It is the first book-length treatment of this area of Ramsey theory, and emphasizes applications for related and surrounding fields of mathematics, such as set theory, combinatorics, real and functional analysis, and topology. In order to facilitate accessibility, the book gives the method in its axiomatic form with examples that cover many important parts of Ramsey theory both finite and infinite. An exciting new direction for combinatorics, this book will interest graduate students and researchers working in mathematical subdisciplines requiring the mastery and practice of high-dimensional Ramsey theory.

Algebraic spaces. --- Ramsey theory. --- Ramsey theory --- Algebraic spaces --- Mathematics --- Algebra --- Physical Sciences & Mathematics --- Spaces, Algebraic --- Geometry, Algebraic --- Combinatorial analysis --- Graph theory --- Analytic set. --- Axiom of choice. --- Baire category theorem. --- Baire space. --- Banach space. --- Bijection. --- Binary relation. --- Boolean prime ideal theorem. --- Borel equivalence relation. --- Borel measure. --- Borel set. --- C0. --- Cantor cube. --- Cantor set. --- Cantor space. --- Cardinality. --- Characteristic function (probability theory). --- Characterization (mathematics). --- Combinatorics. --- Compact space. --- Compactification (mathematics). --- Complete metric space. --- Completely metrizable space. --- Constructible universe. --- Continuous function (set theory). --- Continuous function. --- Corollary. --- Countable set. --- Counterexample. --- Decision problem. --- Dense set. --- Diagonalization. --- Dimension (vector space). --- Dimension. --- Discrete space. --- Disjoint sets. --- Dual space. --- Embedding. --- Equation. --- Equivalence relation. --- Existential quantification. --- Family of sets. --- Forcing (mathematics). --- Forcing (recursion theory). --- Gap theorem. --- Geometry. --- Ideal (ring theory). --- Infinite product. --- Lebesgue measure. --- Limit point. --- Lipschitz continuity. --- Mathematical induction. --- Mathematical problem. --- Mathematics. --- Metric space. --- Metrization theorem. --- Monotonic function. --- Natural number. --- Natural topology. --- Neighbourhood (mathematics). --- Null set. --- Open set. --- Order type. --- Partial function. --- Partially ordered set. --- Peano axioms. --- Point at infinity. --- Pointwise. --- Polish space. --- Probability measure. --- Product measure. --- Product topology. --- Property of Baire. --- Ramsey's theorem. --- Right inverse. --- Scalar multiplication. --- Schauder basis. --- Semigroup. --- Sequence. --- Sequential space. --- Set (mathematics). --- Set theory. --- Sperner family. --- Subsequence. --- Subset. --- Subspace topology. --- Support function. --- Symmetric difference. --- Theorem. --- Topological dynamics. --- Topological group. --- Topological space. --- Topology. --- Tree (data structure). --- Unit interval. --- Unit sphere. --- Variable (mathematics). --- Well-order. --- Zorn's lemma.

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

From cell phones to Web portals, advances in information and communications technology have thrust society into an information age that is far-reaching, fast-moving, increasingly complex, and yet essential to modern life. Now, renowned scholar and author David Luenberger has produced Information Science, a text that distills and explains the most important concepts and insights at the core of this ongoing revolution. The book represents the material used in a widely acclaimed course offered at Stanford University. Drawing concepts from each of the constituent subfields that collectively comprise information science, Luenberger builds his book around the five "E's" of information: Entropy, Economics, Encryption, Extraction, and Emission. Each area directly impacts modern information products, services, and technology--everything from word processors to digital cash, database systems to decision making, marketing strategy to spread spectrum communication. To study these principles is to learn how English text, music, and pictures can be compressed, how it is possible to construct a digital signature that cannot simply be copied, how beautiful photographs can be sent from distant planets with a tiny battery, how communication networks expand, and how producers of information products can make a profit under difficult market conditions. The book contains vivid examples, illustrations, exercises, and points of historic interest, all of which bring to life the analytic methods presented: Presents a unified approach to the field of information science Emphasizes basic principles Includes a wide range of examples and applications Helps students develop important new skills Suggests exercises with solutions in an instructor's manual

Information science. --- Information theory. --- Addition. --- Algorithm. --- Alice and Bob. --- Amplitude. --- Approximation. --- Bandwidth (signal processing). --- Bibliography. --- Binary code. --- Binary number. --- Binary search tree. --- Binary tree. --- Bit. --- Block code. --- Bubble sort. --- Caesar cipher. --- Calculation. --- Channel capacity. --- Cipher. --- Ciphertext. --- Comma code. --- Commodity. --- Common knowledge (logic). --- Competition. --- Computation. --- Computer. --- Conditional entropy. --- Conditional probability. --- Consideration. --- Consumer. --- Cryptanalysis. --- Cryptogram. --- Cryptography. --- Customer. --- Data mining. --- Data structure. --- Database. --- Demand curve. --- Digital signature. --- Discounts and allowances. --- Economic surplus. --- Encryption. --- Estimation. --- Expected value. --- Fourier series. --- Fourier transform. --- Frequency analysis. --- Functional dependency. --- Heapsort. --- Huffman coding. --- Hyperplane. --- Information retrieval. --- Insertion sort. --- Instance (computer science). --- Integer. --- Inverted index. --- Key size. --- Letter frequency. --- Logarithm. --- Marginal cost. --- Measurement. --- Modulation. --- Notation. --- Nyquist–Shannon sampling theorem. --- One-time pad. --- Parity bit. --- Percentage. --- Pricing. --- Probability. --- Public-key cryptography. --- Quantity. --- Quicksort. --- Radio wave. --- Random variable. --- Ranking (information retrieval). --- Requirement. --- Result. --- Run-length encoding. --- Shift register. --- Sine wave. --- Sorting algorithm. --- Special case. --- Spectral density. --- Spreadsheet. --- Standard deviation. --- Subset. --- Substitution cipher. --- Summation. --- Technology. --- Theorem. --- Theory. --- Time complexity. --- Transmitter. --- Transposition cipher. --- Tree (data structure). --- Tuple. --- Uncertainty. --- Value (economics). --- Word (computer architecture).