|
|
|
|
LEADER |
05545nam a22005655i 4500 |
001 |
978-3-319-44479-6 |
003 |
DE-He213 |
005 |
20171011030742.0 |
007 |
cr nn 008mamaa |
008 |
171011s2017 gw | s |||| 0|eng d |
020 |
|
|
|a 9783319444796
|9 978-3-319-44479-6
|
024 |
7 |
|
|a 10.1007/978-3-319-44479-6
|2 doi
|
040 |
|
|
|d GrThAP
|
050 |
|
4 |
|a QA76.9.A43
|
072 |
|
7 |
|a PBKS
|2 bicssc
|
072 |
|
7 |
|a COM051300
|2 bisacsh
|
082 |
0 |
4 |
|a 518.1
|2 23
|
245 |
1 |
2 |
|a A Journey Through Discrete Mathematics
|h [electronic resource] :
|b A Tribute to Jiří Matoušek /
|c edited by Martin Loebl, Jaroslav Nešetřil, Robin Thomas.
|
264 |
|
1 |
|a Cham :
|b Springer International Publishing :
|b Imprint: Springer,
|c 2017.
|
300 |
|
|
|a XXXIV, 810 p. 160 illus., 54 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
|
505 |
0 |
|
|a Simplex 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.
|
520 |
|
|
|a This 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.
|
650 |
|
0 |
|a Mathematics.
|
650 |
|
0 |
|a Computer science
|x Mathematics.
|
650 |
|
0 |
|a Algorithms.
|
650 |
|
0 |
|a Geometry.
|
650 |
|
0 |
|a Operations research.
|
650 |
|
0 |
|a Management science.
|
650 |
|
0 |
|a Algebraic topology.
|
650 |
|
0 |
|a Combinatorics.
|
650 |
1 |
4 |
|a Mathematics.
|
650 |
2 |
4 |
|a Algorithms.
|
650 |
2 |
4 |
|a Combinatorics.
|
650 |
2 |
4 |
|a Geometry.
|
650 |
2 |
4 |
|a Operations Research, Management Science.
|
650 |
2 |
4 |
|a Algebraic Topology.
|
650 |
2 |
4 |
|a Mathematics of Computing.
|
700 |
1 |
|
|a Loebl, Martin.
|e editor.
|
700 |
1 |
|
|a Nešetřil, Jaroslav.
|e editor.
|
700 |
1 |
|
|a Thomas, Robin.
|e editor.
|
710 |
2 |
|
|a SpringerLink (Online service)
|
773 |
0 |
|
|t Springer eBooks
|
776 |
0 |
8 |
|i Printed edition:
|z 9783319444789
|
856 |
4 |
0 |
|u http://dx.doi.org/10.1007/978-3-319-44479-6
|z Full Text via HEAL-Link
|
912 |
|
|
|a ZDB-2-SMA
|
950 |
|
|
|a Mathematics and Statistics (Springer-11649)
|