Proofs from THE BOOK

From MaRDI portal
Publication:5902174

DOI10.1007/978-3-642-00856-6zbMath1185.00001OpenAlexW4231710040WikidataQ56228603 ScholiaQ56228603MaRDI QIDQ5902174

Günter M. Ziegler, Martin Aigner

Publication date: 29 October 2009

Full work available at URL: https://doi.org/10.1007/978-3-642-00856-6




Related Items

Uniform and Completely Nonequilibrium Invariant States for Weak Coupling Limit Type Quantum Markov Semigroups Associated with Eulerian CyclesOn the number of Hadamard matrices via anti-concentrationOn the nonexistence of \(k\)-reptile simplices in \(\mathbb R^3\) and \(\mathbb R^4\)The ins and outs of mathematical explanationBeautiful formalizations in Isabelle/NaprocheA visit to mutual exclusion in seven datesOn model flexibility of the Jessen orthogonal icosahedronA view from the bridge spanning combinatorics and probabilityAxiomatic Thinking, Identity of Proofs and the Quest for an Intensional Proof-Theoretic SemanticsUnnamed ItemKernelization of edge perfect code and its variantsFast Cluster Detection in Networks by First Order OptimizationAn improved planar graph product structure theoremStructural and numerical studies of some topological properties for Alexandroff spacesTwo-Sided, Unbiased Version of Hall’s Marriage TheoremA Short Proof of Cayley's Tree FormulaAsynchronous rumor spreading on random graphsOn \(k\)-diametral point configurations in Minkowski spacesBisecting and \(D\)-secting families for set systemsThe local weak limit of 𝑘-dimensional hypertreesOn some topological properties in the class of Alexandroff spacesA note on eigenvalue bounds for independence numbers of non-regular graphsCauchy-Binet for pseudo-determinantsGenerating series and asymptotics of classical spin networksA post-quantum associative memoryUnnamed ItemExtremal edge polytopesProving quadratic reciprocity: explanation, disagreement, transparency and depthIrrational ThoughtsProlegomena to virtue-theoretic studies in the philosophy of mathematicsOn time-lock cryptographic assumptions in abelian hidden-order groupsA new simple proof of Cayley's formula and its relationship with the Kirkwood-Salzburg equationsGraph product structure for non-minor-closed classesImproved Bounds for Wireless LocalizationTotally non-negativity of a family of change-of-basis matricesNon-crossing Tree Realizations of Ordered Degree SequencesPyramids Over Regular 3-ToriUnnamed ItemHamiltonian Cycles and Subsets of Discounted Occupational MeasuresConvex hull of face vectors of colored complexesA fresh approach to classical Eisenstein series and the newer Hilbert–Eisenstein seriesUnnamed ItemPartitions of graphs into small and large setsAn Appreciation of the First Book of SphericsOn the exponential generating function of labelled treesCardinality estimation of support of the global minimizer for the interaction energy with mildly repulsive potentialsProofs (not) from The BookNew definite integrals and a two-term dilogarithm identityIlluminating spindle convex bodies and minimizing the volume of spherical sets of constant widthThe Green-Tao theorem: an expositionFinding temporal paths under waiting time constraintsEfficient FFT-based upscaling of the permeability of porous media discretized on uniform grids with estimation of RVE sizeThe complexity landscape of decompositional parameters for ILP: programs with few global variables and constraintsA recursive algorithm for trees and forestsA bijective proof of the Shor recurrenceUnnamed ItemThe \(p\)-restricted edge-connectivity of Kneser graphsApplications of dimensionality reduction and exponential sums to graph automorphismA graph theoretic method for determining generating sets of prime ideals in quantum matricesCERES in higher-order logicA new proof of the Hansen-Mullen irreducibility conjectureTwo trees enumerating the positive rationalsThe magnitude of odd balls via Hankel determinants of reverse Bessel polynomialsOn the geometry of real or complex supersolvable line arrangementsOn the stability of interval decomposable persistence modulesOn the sets of \(n\) points forming \(n+1\) directionsCutting planes for families implying Frankl’s conjectureThe illumination conjecture for spindle convex bodiesNo more than \(2^{d+1}-2\) nearly neighbourly simplices in \({\mathbb{R}}^d\)The (u,v)-Calkin–Wilf forestA survey of graphs with known or bounded crossing numbersA variant of the Hadwiger-Debrunner \((p,q)\)-problem in the planeFinding equal-diameter triangulations in polygonsStrict Sign-Central MatricesLinking and cutting spanning treesElection in fully anonymous shared memory systems: tight space bounds and algorithmsOn a system of equations with primesDeterministic single exponential time algorithms for connectivity problems parameterized by treewidthExpression for the Number of Spanning Trees of Line Graphs of Arbitrary Connected Graphs