Narrow your search
Listing 1 - 10 of 163 << page
of 17
>>
Sort by

Book
Outils mathématiques pour l'informaticien : mathématiques discrètes
Author:
ISBN: 2804149633 9782804149635 Year: 2005 Volume: *3 Publisher: Bruxelles: De Boeck,

Loading...
Export citation

Choose an application

Bookmark

Abstract


Book
Ramsey Methods in Analysis
Authors: --- ---
ISBN: 9783764373603 Year: 2005 Publisher: Basel Birkhäuser Basel

Loading...
Export citation

Choose an application

Bookmark

Abstract

This book introduces graduate students and resarchers to the study of the geometry of Banach spaces using combinatorial methods. The combinatorial, and in particular the Ramsey-theoretic, approach to Banach space theory is not new, it can be traced back as early as the 1970s. Its full appreciation, however, came only during the last decade or so, after some of the most important problems in Banach space theory were solved, such as, for example, the distortion problem, the unconditional basic sequence problem, and the homogeneous space problem. The book covers most of these advances, but one of its primary purposes is to discuss some of the recent advances that are not present in survey articles of these areas. We show, for example, how to introduce a conditional structure to a given Banach space under construction that allows us to essentially prescribe the corresponding space of non-strictly singular operators. We also apply the Nash-Williams theory of fronts and barriers in the study of Cezaro summability and unconditionality present in basic sequences inside a given Banach space. We further provide a detailed exposition of the block-Ramsey theory and its recent deep adjustments relevant to the Banach space theory due to Gowers.


Book
Combinatorial Commutative Algebra
Authors: --- ---
ISBN: 9780387271033 Year: 2005 Publisher: New York NY Springer New York

Loading...
Export citation

Choose an application

Bookmark

Abstract

Combinatorial commutative algebra is an active area of research with thriving connections to other fields of pure and applied mathematics. This book provides a self-contained introduction to the subject, with an emphasis on combinatorial techniques for multigraded polynomial rings, semigroup algebras, and determinantal rings. The eighteen chapters cover a broad spectrum of topics, ranging from homological invariants of monomial ideals and their polyhedral resolutions, to hands-on tools for studying algebraic varieties with group actions, such as toric varieties, flag varieties, quiver loci, and Hilbert schemes. Over 100 figures, 250 exercises, and pointers to the literature make this book appealing to both graduate students and researchers. Ezra Miller received his doctorate in 2000 from UC Berkeley. After two years at MIT in Cambridge and one year at MSRI in Berkeley, he is currently Assistant Professor at the University of Minnesota, Twin Cities. Miller was awarded an Alfred P. Sloan Dissertation Fellowship in 1999 and an NSF Postdoctoral Fellowship in 2000. Besides his mathematical interests, which include combinatorics, algebraic geometry, homological algebra, and polyhedral geometry, Miller is fond of music theory and composition, molecular biology, and ultimate frisbee. Bernd Sturmfels received doctoral degrees in 1987 from the University of Washington, Seattle and TU Darmstadt, Germany. After two postdoc years at the IMA in Minneapolis and RISC-Linz in Austria, he taught at Cornell University before joining UC Berkeley in 1995, where he is now Professor of Mathematics and Computer Science. A leading experimentalist among mathematicians, Sturmfels has authored seven books and over 130 research articles in the areas of combinatorics, algebraic geometry, symbolic computation, and their applications, and he has mentored 16 doctoral students.


Book
Difference Equations : From Rabbits to Chaos
Authors: --- --- ---
ISBN: 9780387276458 Year: 2005 Publisher: New York NY Springer New York

Loading...
Export citation

Choose an application

Bookmark

Abstract

Difference equations are models of the world around us. From clocks to computers to chromosomes, processing discrete objects in discrete steps is a common theme. Difference equations arise naturally from such discrete descriptions and allow us to pose and answer such questions as: How much? How many? How long? Difference equations are a necessary part of the mathematical repertoire of all modern scientists and engineers. In this new text, designed for sophomores studying mathematics and computer science, the authors cover the basics of difference equations and some of their applications in computing and in population biology. Each chapter leads to techniques that can be applied by hand to small examples or programmed for larger problems. Along the way, the reader will use linear algebra and graph theory, develop formal power series, solve combinatorial problems, visit Perron Frobenius theory, discuss pseudorandom number generation and integer factorization, and apply the Fast Fourier Transform to multiply polynomials quickly. The book contains many worked examples and over 250 exercises. While these exercises are accessible to students and have been class-tested, they also suggest further problems and possible research topics. Paul Cull is a professor of Computer Science at Oregon State University. Mary Flahive is a professor of Mathematics at Oregon State University. Robby Robson is president of Eduworks, an e-learning consulting firm. None has a rabbit.


Book
Linear Algebraic Monoids
Authors: ---
ISBN: 9783540275565 Year: 2005 Publisher: Berlin Heidelberg Springer Berlin Heidelberg

Loading...
Export citation

Choose an application

Bookmark

Abstract

The object of this monograph is to document what is most interesting about linear monoids. We show how these results ?t together into a coherent blend of semigroup theory, groups with BN-pair, representation theory, convex - ometry and algebraicgrouptheory.The intended reader is one who is familiar with some of these topics, and is willing to learn about the others. The intention of the author is to convince the reader that reductive monoids are among the darlings of algebra. We do this by systematically assembling many of the major known results with many proofs,examples and explanations. To further entice the reader, we have included many exercises. The theory of linear algebraic monoids is quite recent, originating around 1980. Both Mohan Putcha and the author began the systematic study in- pendently. But this development would not have been possible without the pioneering work of Chevalley, Borel and Tits on algebraic groups. Also, there is the related, but more general theory of spherical embeddings, developed largely by Brion, Luna and Vust. These theories were developed somewhat independently, but it is always a good idea to interpret monoid results in the combinatorial apparatus of spherical embeddings. Each chapter of this monograph is focussed on one or more of the major themes of the subject. These are: classi?cation, orbits, geometry, represen- tions, universal constructions and combinatorics. There is an inherent div- sity and richness in the subject that usually rewards a stalwart investigation.


Book
Theory of Association Schemes
Authors: ---
ISBN: 9783540305934 Year: 2005 Publisher: Berlin Heidelberg Springer Berlin Heidelberg

Loading...
Export citation

Choose an application

Bookmark

Abstract

The present text is an introduction to the theory of association schemes. We start with the de?nition of an association scheme (or a scheme as we shall say brie?y), and in order to do so we ?x a set and call it X. We write 1 to denote the set of all pairs (x,x) with x? X. For each subset X ? r of the cartesian product X×X, we de?ne r to be the set of all pairs (y,z) with (z,y)? r.For x an element of X and r a subset of X× X, we shall denote by xr the set of all elements y in X with (x,y)? r. Let us ?x a partition S of X×X with?? / S and 1 ? S, and let us assume X ? that s ? S for each element s in S. The set S is called a scheme on X if, for any three elements p, q,and r in S, there exists a cardinal number a such pqr ? that|yp?zq| = a for any two elements y in X and z in yr. pqr The notion of a scheme generalizes naturally the notion of a group, and we shall base all our considerations on this observation. Let us, therefore, brie?y look at the relationship between groups and schemes.


Digital
Combinatorial Commutative Algebra
Authors: ---
ISBN: 9780387271033 Year: 2005 Publisher: New York, NY Springer Science+Business Media, Inc

Loading...
Export citation

Choose an application

Bookmark

Abstract


Digital
Difference Equations : From Rabbits to Chaos
Authors: --- ---
ISBN: 9780387276458 Year: 2005 Publisher: New York, NY Springer Science+Business Media, Inc

Loading...
Export citation

Choose an application

Bookmark

Abstract


Multi
Linear Algebraic Monoids
Author:
ISBN: 9783540275565 Year: 2005 Publisher: Berlin, Heidelberg Springer-Verlag Berlin Heidelberg 2005

Loading...
Export citation

Choose an application

Bookmark

Abstract

The object of this monograph is to document what is most interesting about linear monoids. We show how these results ?t together into a coherent blend of semigroup theory, groups with BN-pair, representation theory, convex - ometry and algebraicgrouptheory.The intended reader is one who is familiar with some of these topics, and is willing to learn about the others. The intention of the author is to convince the reader that reductive monoids are among the darlings of algebra. We do this by systematically assembling many of the major known results with many proofs,examples and explanations. To further entice the reader, we have included many exercises. The theory of linear algebraic monoids is quite recent, originating around 1980. Both Mohan Putcha and the author began the systematic study in- pendently. But this development would not have been possible without the pioneering work of Chevalley, Borel and Tits on algebraic groups. Also, there is the related, but more general theory of spherical embeddings, developed largely by Brion, Luna and Vust. These theories were developed somewhat independently, but it is always a good idea to interpret monoid results in the combinatorial apparatus of spherical embeddings. Each chapter of this monograph is focussed on one or more of the major themes of the subject. These are: classi?cation, orbits, geometry, represen- tions, universal constructions and combinatorics. There is an inherent div- sity and richness in the subject that usually rewards a stalwart investigation.


Digital
Theory of Association Schemes
Author:
ISBN: 9783540305934 Year: 2005 Publisher: Berlin, Heidelberg Springer-Verlag Berlin Heidelberg

Loading...
Export citation

Choose an application

Bookmark

Abstract

Listing 1 - 10 of 163 << page
of 17
>>
Sort by