Building Bridges II : mathematics of László Lovász
著者
書誌事項
Building Bridges II : mathematics of László Lovász
(Bolyai Society mathematical studies, 28)
Springer, c2019
大学図書館所蔵 全4件
  青森
  岩手
  宮城
  秋田
  山形
  福島
  茨城
  栃木
  群馬
  埼玉
  千葉
  東京
  神奈川
  新潟
  富山
  石川
  福井
  山梨
  長野
  岐阜
  静岡
  愛知
  三重
  滋賀
  京都
  大阪
  兵庫
  奈良
  和歌山
  鳥取
  島根
  岡山
  広島
  山口
  徳島
  香川
  愛媛
  高知
  福岡
  佐賀
  長崎
  熊本
  大分
  宮崎
  鹿児島
  沖縄
  韓国
  中国
  タイ
  イギリス
  ドイツ
  スイス
  フランス
  ベルギー
  オランダ
  スウェーデン
  ノルウェー
  アメリカ
注記
Includes bibliographical references
"Publications of László Lovász": p. 595-611
Description based on print version record
内容説明・目次
内容説明
This volume collects together research and survey papers written by invited speakers of the conference celebrating the 70th birthday of Laszlo Lovasz.
The topics covered include classical subjects such as extremal graph theory, coding theory, design theory, applications of linear algebra and combinatorial optimization, as well as recent trends such as extensions of graph limits, online or statistical versions of classical combinatorial problems, and new methods of derandomization.
Laszlo Lovasz is one of the pioneers in the interplay between discrete and continuous mathematics, and is a master at establishing unexpected connections, "building bridges" between seemingly distant fields. His invariably elegant and powerful ideas have produced new subfields in many areas, and his outstanding scientific work has defined and shaped many research directions in the last 50 years.
The 14 contributions presented in this volume, all of which are connected to Laszlo Lovasz's areas of research, offer an excellent overview of the state of the art of combinatorics and related topics and will be of interest to experienced specialists as well as young researchers.
目次
Introduction.- N. Alon: Lovasz, Vectors, Graphs and Codes.- A. Bjoerner: Continuous matroids revisited.- C. Borgs, J. T. Chayes, H. Cohn and L. M. Lovasz: Identifiability for Graphexes and the Weak Kernel Metric.- D. Conlon, J. Fox, A. Grinshpun and Xiaoyu He: Online Ramsey Numbers and the Subraph Query Problem.- P. Csikvari: Statistical Matching Theory.- P. Diaconis: A conversation with Laci.- U. Feige: Tighter Bounds for Bipartite Matching.- T. Jordan and A. Mihalyko: Minimum Cost Globally Rigid Subgraphs.- P. Keevash: Colored and Directed Designs.- Jin Tat Lee, A. Sidford and S. S. Vempala: Efficient Convex Optimization with Oracles.- J. Nesetril and P. Osona de Mendes: Approximations of Mappings.- O. E. Raz and A. Wigderson: Derandomization Through Submodular Optimization.- A. Schrijver: Finding k Partially Disjoint Paths in a Directed Planar Graph.- M. Simonovits and E. Szemeredi: Embedding graphs into larger graphs, results, methods and problems.
「Nielsen BookData」 より