國立高雄大學圖資館 |

語系: 繁體中文

說明(常見問題)

圖資館首頁

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Building bridges IImathematics of La...

Barany, Imre.

Building bridges IImathematics of Laszlo Lovasz /

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Building bridges IIedited by Imre Barany, Gyula O. H. Katona, Attila Sali.
其他題名:	mathematics of Laszlo Lovasz /
其他作者:	Barany, Imre.
出版者:	Berlin, Heidelberg :Springer Berlin Heidelberg :2019.
面頁冊數:	xii, 614 p. :ill., digital ;24 cm.
Contained By:	Springer eBooks
標題:	MathematicsHistory.
電子資源:	https://doi.org/10.1007/978-3-662-59204-5
ISBN:	9783662592045$q(electronic bk.)

Building bridges IImathematics of Laszlo Lovasz /
Building bridges IImathematics of Laszlo Lovasz /[electronic resource] :edited by Imre Barany, Gyula O. H. Katona, Attila Sali. - Berlin, Heidelberg :Springer Berlin Heidelberg :2019. - xii, 614 p. :ill., digital ;24 cm. - Bolyai society mathematical studies,281217-4696 ;. - Bolyai society mathematical studies ;v.27..

Introduction -- N. Alon: Lovasz, Vectors, Graphs and Codes -- A. Bjorner: 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.

This volume collects together research and survey papers written by invited speakers of a 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.

ISBN: 9783662592045$q(electronic bk.)

Standard No.: 10.1007/978-3-662-59204-5doiSubjects--Personal Names:

345339
Lovasz, Laszlo,
1948-Subjects--Topical Terms:

189740
Mathematics
--History.

LC Class. No.: QA21

Dewey Class. No.: 510.9

Building bridges IImathematics of Laszlo Lovasz /
LDR:03213nmm a2200337 a 4500 001 570873
003 DE-He213
005 20200429141729.0
006 m d
007 cr nn 008maaau
008 200902s2019 gw s 0 eng d
020 $a 9783662592045$q(electronic bk.)
020 $a 9783662592038$q(paper)
024 7 $a 10.1007/978-3-662-59204-5 $2 doi
035 $a 978-3-662-59204-5
040 $a GP $c GP
041 0 $a eng
050 4 $a QA21
072 7 $a PBV $2 bicssc
072 7 $a MAT036000 $2 bisacsh
072 7 $a PBV $2 thema
082 0 4 $a 510.9 $2 23
090 $a QA21 $b .B932 2019
245 0 0 $a Building bridges II $h [electronic resource] : $b mathematics of Laszlo Lovasz / $c edited by Imre Barany, Gyula O. H. Katona, Attila Sali.
260 $a Berlin, Heidelberg : $b Springer Berlin Heidelberg : $b Imprint: Springer, $c 2019.
300 $a xii, 614 p. : $b ill., digital ; $c 24 cm.
490 1 $a Bolyai society mathematical studies, $x 1217-4696 ; $v 28
505 0 $a Introduction -- N. Alon: Lovasz, Vectors, Graphs and Codes -- A. Bjorner: 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.
520 $a This volume collects together research and survey papers written by invited speakers of a 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.
600 1 0 $a Lovasz, Laszlo, $d 1948- $3 345339
650 0 $a Mathematics $x History. $3 189740
650 0 $a Mathematicians $v Biography. $3 435524
650 1 4 $a Combinatorics. $3 274788
650 2 4 $a Mathematical Applications in Computer Science. $3 530811
700 1 $a Barany, Imre. $3 499468
700 1 $a Katona, Gyula O. H. $3 307742
700 1 $a Sali, Attila. $3 560973
710 2 $a SpringerLink (Online service) $3 273601
773 0 $t Springer eBooks
830 0 $a Bolyai society mathematical studies ; $v v.27. $3 824944
856 4 0 $u https://doi.org/10.1007/978-3-662-59204-5
950 $a Mathematics and Statistics (Springer-11649)