Surveys in Combinatorics 2017

· · · ·
· London Mathematical Society Lecture Note Series 第 440 冊 · Cambridge University Press
電子書
448
頁數
評分和評論未經驗證 瞭解詳情

關於這本電子書

This volume contains nine survey articles which provide expanded accounts of plenary seminars given at the British Combinatorial Conference at the University of Strathclyde in July 2017. This biennial conference is a well-established international event attracting speakers from around the world. Written by internationally recognised experts in the field, these articles represent a timely snapshot of the state of the art in the different areas of combinatorics. Topics covered include the robustness of graph properties, the spt-function of Andrews, switching techniques for edge decompositions of graphs, monotone cellular automata, and applications of relative entropy in additive combinatorics. The book will be useful to researchers and advanced graduate students, primarily in mathematics but also in computer science and statistics.

關於作者

Anders Claesson is a Professor of Mathematics at the University of Iceland, Reykjavik. He is a well-established researcher whose main research interests are in enumerative combinatorics, with a focus on permutation patterns.

Mark Dukes is a Lecturer in Mathematics at University College Dublin and an Honorary Senior Lecturer at the University of Strathclyde. His research focuses on discrete and combinatorial mathematics, and their applications to complex systems.

Sergey Kitaev is a Reader in Combinatorics and the Director of Research in the Department of Computer and Information Sciences at the University of Strathclyde. He is the author of numerous publications, including Patterns in Permutations and Words (2011) and Words and Graphs (2015). His research focuses on combinatorics and graph theory.

David Manlove is a Senior Lecturer in Computing Science at the University of Glasgow. He is interested in designing algorithms for problems involving matching agents to commodities (for example, junior doctors to hospitals, kidney patients to donors) in the presence of ordinal preferences or cardinal utilities. His publications include Algorithmics of Matching under Preferences (2013). He has collaborated with the National Health Service and is Vice-Chair of the ENCKEP COST Action (European Network for Collaboration on Kidney Exchange Programmes).

Kitty Meeks is a Research Fellow in Computing Science at the University of Glasgow, where she currently holds a Royal Society of Edinburgh Personal Research Fellowship, funded by the Scottish Government. Her research focuses on the computational complexity of combinatorial problems, with a particular emphasis on parameterised complexity and the application of graph-theoretic methods to real-world problems.

為這本電子書評分

請分享你的寶貴意見。

閱讀資訊

智能手機和平板電腦
請安裝 Android 版iPad/iPhone 版「Google Play 圖書」應用程式。這個應用程式會自動與你的帳戶保持同步,讓你隨時隨地上網或離線閱讀。
手提電腦和電腦
你可以使用電腦的網絡瀏覽器聆聽在 Google Play 上購買的有聲書。
電子書閱讀器及其他裝置
如要在 Kobo 等電子墨水裝置上閱覽書籍,你需要下載檔案並傳輸到你的裝置。請按照說明中心的詳細指示,將檔案傳輸到支援的電子書閱讀器。