國立虎尾科技大學 |

Building Bridges II = Mathematics of László Lovász /

Record Type:	Language materials, printed : Monograph/item
Title/Author:	Building Bridges II/ edited by Imre Bárány, Gyula O. H. Katona, Attila Sali.
Reminder of title:	Mathematics of László Lovász /
other author:	Bárány, Imre.
Description:	XII, 614 p. 51 illus., 17 illus. in color.online resource. :
Contained By:	Springer Nature eBook
Subject:	Combinatorics. -
Online resource:	https://doi.org/10.1007/978-3-662-59204-5
ISBN:	9783662592045

Building Bridges II = Mathematics of László Lovász /
Building Bridges IIMathematics of László Lovász /[electronic resource] :edited by Imre Bárány, Gyula O. H. Katona, Attila Sali. - 1st ed. 2019. - XII, 614 p. 51 illus., 17 illus. in color.online resource. - Bolyai Society Mathematical Studies,281217-4696 ;. - Bolyai Society Mathematical Studies,27.

Introduction -- N. Alon: Lovász, Vectors, Graphs and Codes -- A. Björner: Continuous matroids revisited -- C. Borgs, J. T. Chayes, H. Cohn and L. M. Lovász: 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. Csikvári: Statistical Matching Theory -- P. Diaconis: A conversation with Laci -- U. Feige: Tighter Bounds for Bipartite Matching -- T. Jordán and A. Mihálykó: 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. Szemerédi: 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 László Lovász. 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. László Lovász 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 László Lovász'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

Standard No.: 10.1007/978-3-662-59204-5doiSubjects--Topical Terms:

669353
Combinatorics.

LC Class. No.: QA164-167.2

Dewey Class. No.: 511.6

Building Bridges II = Mathematics of László Lovász /
LDR:03643nam a22004095i 4500 001 1007890
003 DE-He213
005 20200630152001.0
007 cr nn 008mamaa
008 210106s2019 gw | s |||| 0|eng d
020 $a 9783662592045 $9 978-3-662-59204-5
024 7 $a 10.1007/978-3-662-59204-5 $2 doi
035 $a 978-3-662-59204-5
050 4 $a QA164-167.2
072 7 $a PBV $2 bicssc
072 7 $a MAT036000 $2 bisacsh
072 7 $a PBV $2 thema
082 0 4 $a 511.6 $2 23
245 1 0 $a Building Bridges II $h [electronic resource] : $b Mathematics of László Lovász / $c edited by Imre Bárány, Gyula O. H. Katona, Attila Sali.
250 $a 1st ed. 2019.
264 1 $a Berlin, Heidelberg : $b Springer Berlin Heidelberg : $b Imprint: Springer, $c 2019.
300 $a XII, 614 p. 51 illus., 17 illus. in color. $b online resource.
336 $a text $b txt $2 rdacontent
337 $a computer $b c $2 rdamedia
338 $a online resource $b cr $2 rdacarrier
347 $a text file $b PDF $2 rda
490 1 $a Bolyai Society Mathematical Studies, $x 1217-4696 ; $v 28
505 0 $a Introduction -- N. Alon: Lovász, Vectors, Graphs and Codes -- A. Björner: Continuous matroids revisited -- C. Borgs, J. T. Chayes, H. Cohn and L. M. Lovász: 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. Csikvári: Statistical Matching Theory -- P. Diaconis: A conversation with Laci -- U. Feige: Tighter Bounds for Bipartite Matching -- T. Jordán and A. Mihálykó: 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. Szemerédi: 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 László Lovász. 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. László Lovász 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 László Lovász'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.
650 0 $a Combinatorics. $3 669353
650 0 $a Computer science—Mathematics. $3 1253519
650 0 $a Computer mathematics. $3 1199796
650 2 4 $a Mathematical Applications in Computer Science. $3 815331
700 1 $a Bárány, Imre. $e editor. $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 1270979
700 1 $a Katona, Gyula O. H. $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 683351
700 1 $a Sali, Attila. $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 891182
710 2 $a SpringerLink (Online service) $3 593884
773 0 $t Springer Nature eBook
776 0 8 $i Printed edition: $z 9783662592038
776 0 8 $i Printed edition: $z 9783662592052
776 0 8 $i Printed edition: $z 9783662592069
830 0 $a Bolyai Society Mathematical Studies, $x 1217-4696 ; $v 27 $3 1281376
856 4 0 $u https://doi.org/10.1007/978-3-662-59204-5
912 $a ZDB-2-SMA
912 $a ZDB-2-SXMS
950 $a Mathematics and Statistics (SpringerNature-11649)
950 $a Mathematics and Statistics (R0) (SpringerNature-43713)