Контакты/Проезд  Доставка и Оплата Помощь/Возврат
История
  +7(495) 980-12-10
  пн-пт: 10-18 сб,вс: 11-18
  shop@logobook.ru
   
    Поиск книг                    Поиск по списку ISBN Расширенный поиск    
Найти
  Зарубежные издательства Российские издательства  
Авторы | Каталог книг | Издательства | Новинки | Учебная литература | Акции | Хиты | |
 

First course in enumerative combinatorics, Wagner, Carl G.


Варианты приобретения
Цена: 10659.00р.
Кол-во:
 о цене
Наличие: Отсутствует. 
Возможна поставка под заказ. Дата поступления на склад уточняется после оформления заказа


Добавить в корзину
в Мои желания

Автор: Wagner, Carl G.
Название:  First course in enumerative combinatorics
ISBN: 9781470459956
Издательство: Mare Nostrum (Eurospan)
Классификация:
ISBN-10: 1470459957
Обложка/Формат: Paperback
Страницы: 272
Вес: 0.52 кг.
Дата издания: 30.01.2021
Серия: Pure and applied undergraduate texts
Язык: English
Размер: 180 x 256 x 15
Ключевые слова: Combinatorics & graph theory,Discrete mathematics
Рейтинг:
Поставляется из: Англии
Описание: First Course in Enumerative Combinatorics provides an introduction to the fundamentals of enumeration for advanced undergraduates and beginning graduate students in the mathematical sciences. The book offers a careful and comprehensive account of the standard tools of enumeration—recursion, generating functions, sieve and inversion formulas, enumeration under group actions—and their application to counting problems for the fundamental structures of discrete mathematics, including sets and multisets, words and permutations, partitions of sets and integers, and graphs and trees. The author’s exposition has been strongly influenced by the work of Rota and Stanley, highlighting bijective proofs, partially ordered sets, and an emphasis on organizing the subject under various unifying themes, including the theory of incidence algebras. In addition, there are distinctive chapters on the combinatorics of finite vector spaces, a detailed account of formal power series, and combinatorial number theory.The reader is assumed to have a knowledge of basic linear algebra and some familiarity with power series. There are over 200 well-designed exercises ranging in difficulty from straightforward to challenging. There are also sixteen large-scale honors projects on special topics appearing throughout the text. The author is a distinguished combinatorialist and award-winning teacher, and he is currently Professor Emeritus of Mathematics and Adjunct Professor of Philosophy at the University of Tennessee. He has published widely in number theory, combinatorics, probability, decision theory, and formal epistemology. His Erdo?s number is 2. An instructor’s manual for this title is available electronically to those instructors who have adopted the textbook for classroom use. Please send email to textbooks@ams.org for more information.
Дополнительное описание: Discrete mathematics|Combinatorics and graph theory



Enumerative Combinatorics

Автор: Stanley
Название: Enumerative Combinatorics
ISBN: 1107602629 ISBN-13(EAN): 9781107602625
Издательство: Cambridge Academ
Рейтинг:
Цена: 5988.00 р. 8554.00 -30%
Наличие на складе: Есть (1 шт.)
Описание: Richard Stanley`s two-volume basic introduction to enumerative combinatorics has become the standard guide to the topic for students and experts alike. This thoroughly revised second edition of Volume 1 includes more than 300 new exercises, many with solutions, updated and expanded chapter bibliographies and substantial new material on permutation statistics.

Notes on Counting: An Introduction to Enumerative Combinator

Автор: Cameron Peter J
Название: Notes on Counting: An Introduction to Enumerative Combinator
ISBN: 1108404952 ISBN-13(EAN): 9781108404952
Издательство: Cambridge Academ
Рейтинг:
Цена: 5702.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: Enumerative combinatorics, in its algebraic and analytic forms, is vital to many areas of mathematics, from model theory to statistical mechanics. This book, drawn from many years of teaching, invites students into the subject and prepares them for more advanced texts. It is suitable as a class text or for individual study.

Lessons in Enumerative Combinatorics

Автор: Eğecioğlu Цmer, Garsia Adriano M.
Название: Lessons in Enumerative Combinatorics
ISBN: 3030712524 ISBN-13(EAN): 9783030712525
Издательство: Springer
Рейтинг:
Цена: 6986.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: This textbook introduces enumerative combinatorics through the framework of formal languages and bijections. Connections to linear algebra emerge in chapters studying Cayley trees, determinantal formulas, and the combinatorics that lie behind the classical Cayley-Hamilton theorem.

A Course in Mathematical Cryptography

Автор: Gilbert Baumslag,Benjamin Fine,Martin Kreuzer,Gerh
Название: A Course in Mathematical Cryptography
ISBN: 3110372762 ISBN-13(EAN): 9783110372762
Издательство: Walter de Gruyter
Цена: 9288.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: Cryptography has become essential as bank transactions, credit card infor-mation, contracts, and sensitive medical information are sent through inse-cure channels. This book is concerned with the mathematical, especially algebraic, aspects of cryptography. It grew out of many courses presented by the authors over the past twenty years at various universities and covers a wide range of topics in mathematical cryptography. It is primarily geared towards graduate students and advanced undergraduates in mathematics and computer science, but may also be of interest to researchers in the area. Besides the classical methods of symmetric and private key encryption, the book treats the mathematics of cryptographic protocols and several unique topics such as Group-Based Cryptography Grobner Basis Methods in Cryptography Lattice-Based Cryptography

A Course in Cryptography

Автор: Heiko Knospe
Название: A Course in Cryptography
ISBN: 1470450550 ISBN-13(EAN): 9781470450557
Издательство: Mare Nostrum (Eurospan)
Рейтинг:
Цена: 11161.00 р.
Наличие на складе: Нет в наличии.

Описание: This book provides a compact course in modern cryptography. The mathematical foundations in algebra, number theory and probability are presented with a focus on their cryptographic applications. The text provides rigorous definitions and follows the provable security approach. The most relevant cryptographic schemes are covered, including block ciphers, stream ciphers, hash functions, message authentication codes, public-key encryption, key establishment, digital signatures and elliptic curves. The current developments in post-quantum cryptography are also explored, with separate chapters on quantum computing, lattice-based and code-based cryptosystems.Many examples, figures and exercises, as well as SageMath (Python) computer code, help the reader to understand the concepts and applications of modern cryptography. A special focus is on algebraic structures, which are used in many cryptographic constructions and also in post-quantum systems. The essential mathematics and the modern approach to cryptography and security prepare the reader for more advanced studies.The text requires only a first-year course in mathematics (calculus and linear algebra) and is also accessible to computer scientists and engineers. This book is suitable as a textbook for undergraduate and graduate courses in cryptography as well as for self-study.

Combinatoire enumerative

Автор: Gilbert Labelle; Pierre Leroux
Название: Combinatoire enumerative
ISBN: 3540172076 ISBN-13(EAN): 9783540172079
Издательство: Springer
Рейтинг:
Цена: 5583.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Lessons in Enumerative Combinatorics

Автор: Eğecioğlu Цmer, Garsia Adriano M.
Название: Lessons in Enumerative Combinatorics
ISBN: 3030712494 ISBN-13(EAN): 9783030712495
Издательство: Springer
Цена: 6986.00 р.
Наличие на складе: Поставка под заказ.

Описание: This textbook introduces enumerative combinatorics through the framework of formal languages and bijections. Connections to linear algebra emerge in chapters studying Cayley trees, determinantal formulas, and the combinatorics that lie behind the classical Cayley-Hamilton theorem.


ООО "Логосфера " Тел:+7(495) 980-12-10 www.logobook.ru
   В Контакте     В Контакте Мед  Мобильная версия