LEADER 06477nam 22007095 450 001 9910254287203321 005 20240419215719.0 010 $a3-319-44479-4 024 7 $a10.1007/978-3-319-44479-6 035 $a(CKB)4100000000881605 035 $a(DE-He213)978-3-319-44479-6 035 $a(MiAaPQ)EBC5100585 035 $a(PPN)220127263 035 $a(EXLCZ)994100000000881605 100 $a20171011d2017 u| 0 101 0 $aeng 135 $aurnn#008mamaa 181 $ctxt$2rdacontent 182 $cc$2rdamedia 183 $acr$2rdacarrier 200 12$aA Journey Through Discrete Mathematics$b[electronic resource] $eA Tribute to Ji?í Matou?ek /$fedited by Martin Loebl, Jaroslav Ne?et?il, Robin Thomas 205 $a1st ed. 2017. 210 1$aCham :$cSpringer International Publishing :$cImprint: Springer,$d2017. 215 $a1 online resource (XXXIV, 810 p. 160 illus., 54 illus. in color.) 311 $a3-319-44478-6 320 $aIncludes bibliographical references at the end of each chapters. 327 $aSimplex Range Searching and Its Variants: A Review: Pankaj K. Agarwal.- Fair Representation by Independent Sets: Ron Aharoni, Noga Alon, Eli Berger, Maria Chudnovsky, Dani Kotlar, Martin Loebl, and Ran Ziv.- Computing Heegaard Genus Is NP-Hard: David Bachman, Ryan Derby-Talbot, and Eric Sedgwick.- Approximation-Friendly Discrepancy Rounding: Nikhil Bansal and Viswanath Nagarajan.- A Tverberg Type Theorem for Matroids: Imre Barany, Gil Kalai, Roy Meshulam.- Gershgorin Disks for Multiple Eigenvalues of Non-Negative Matrices: Imre Bárány and József Solymosi.- Computing the Partition Function of a Polynomial on the Boolean Cube: Alexander Barvinok -- Siegel's Lemma Is Sharp: József Beck.- On Codimension One Embedding of Simplicial Complexes: Anders Björner and Afshin Goodarzi -- Around Brouwer's Fixed Point Theorem: Anders Björner, Jiri Matousek, and Günter M. Ziegler.- Beyond the Borsuk-Ulam Theorem: The Topological Tverberg Story: Pavle V. M. Blagojevic and Günter M. Ziegler.- One-Sided Epsilon-Approximants: Boris Bukh and Gabriel Nivasch.- A Note on Induced Ramsey Numbers: David Conlon, Domingos Dellamonica Jr., Steven La Fleur, Vojtech Rödl, and Mathias Schacht.- ARRIVAL: A Zero-Player Graph Game in NP \ coNP: Jerome Dohrau, Bernd Gärtner, Manuel Kohler, Jiri Matousek, and Emo Welzl.- Constant-Factor Approximation for TSP with Disks: Adrian Dumitrescu, and Csaba D. Toth.- Transport-Entropy Inequalities and Curvature in Discrete-State Markov Chains: Ronen Eldan, James R. Lee, and Joseph Lehec.- Bounding Helly Numbers Via Betti Numbers: Xavier Goaoc, Pavel Patak, Zuzana Patakova, Martin Tancer, and Uli Wagner.- Ruled Surface Theory and Incidence Geometry: Larry Guth.- Approximating the k-Level in Three-Dimensional Plane Arrangements: Sariel Har-Peled, Haim Kaplan, and Micha Sharir.- Schrijver Graphs and Projective Quadrangulations: Tomas Kaiser and Matej Stehlik.- Near-Optimal Lower Bounds for nets for Halfspaces and Low Complexity Set Systems: Andrey Kupavskii, Nabil H. Mustafa, and Janos Pach.- Random Simplicial Complexes - Around the Phase Transition: Nathan Linial and Yuval Peled.- Nullspace Embeddings for Outerplanar Graphs: Laszlo Lovasz and Alexander Schrijver.- Homology of Spaces of Directed Paths in Euclidean Pattern Spaces: Roy Meshulam and Martin Raussen.- Sperner's Colorings and Optimal Partitioning of the Simplex: Maryam Mirzakhani and Jan Vondrak.- Teaching and Compressing for Low VC-Dimension: Shay Moran, Amir Shpilka, Avi Wigderson, and Amir Yehudayo.- Restricted Invertibility Revisited: Assaf Naor and Pierre Youssef.- Rational Polygons: Odd Compression Ratio and Odd Plane Coverings: Rom Pinchasi and Yuri Rabinovich.- First Order Probabilities for Galton{Watson Trees:  Moumanti Podder and Joel Spencer.- Crossing-Free Perfect Matchings in Wheel Point Sets: Andres J. Ruiz-Vargas and Emo Welzl.- Network Essence: Page Rank Completion and Centrality-Conforming Markov Chains: Shang-Hua Teng.- Anti-Concentration Inequalities for Polynomials: Van Vu. 330 $aThis collection of high-quality articles in the field of combinatorics, geometry, algebraic topology and theoretical computer science is a tribute to Ji?í Matou?ek, who passed away prematurely in March 2015. It is a collaborative effort by his colleagues and friends, who have paid particular attention to clarity of exposition ? something Jirka would have approved of. The original research articles, surveys and expository articles, written by leading experts in their respective fields, map Ji?í Matou?ek?s numerous areas of mathematical interest. 606 $aAlgorithms 606 $aCombinatorics 606 $aGeometry 606 $aOperations research 606 $aManagement science 606 $aAlgebraic topology 606 $aComputer science?Mathematics 606 $aAlgorithms$3https://scigraph.springernature.com/ontologies/product-market-codes/M14018 606 $aCombinatorics$3https://scigraph.springernature.com/ontologies/product-market-codes/M29010 606 $aGeometry$3https://scigraph.springernature.com/ontologies/product-market-codes/M21006 606 $aOperations Research, Management Science$3https://scigraph.springernature.com/ontologies/product-market-codes/M26024 606 $aAlgebraic Topology$3https://scigraph.springernature.com/ontologies/product-market-codes/M28019 606 $aMathematics of Computing$3https://scigraph.springernature.com/ontologies/product-market-codes/I17001 615 0$aAlgorithms. 615 0$aCombinatorics. 615 0$aGeometry. 615 0$aOperations research. 615 0$aManagement science. 615 0$aAlgebraic topology. 615 0$aComputer science?Mathematics. 615 14$aAlgorithms. 615 24$aCombinatorics. 615 24$aGeometry. 615 24$aOperations Research, Management Science. 615 24$aAlgebraic Topology. 615 24$aMathematics of Computing. 676 $a518.1 702 $aLoebl$b Martin$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aNe?et?il$b Jaroslav$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aThomas$b Robin$f1962-$4edt$4http://id.loc.gov/vocabulary/relators/edt 906 $aBOOK 912 $a9910254287203321 996 $aA Journey Through Discrete Mathematics$92272612 997 $aUNINA