scientific article
From MaRDI portal
zbMath0078.00114MaRDI QIDQ3243222
Otto Toeplitz, Hans Rademacher
Publication date: 1957
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Introductory exposition (textbooks, tutorial papers, etc.) pertaining to mathematics in general (00-01) Recreational mathematics (00A08)
Related Items
Configuration spaces of plane polygons and a sub-Riemannian approach to the equitangent problem, A doubly monotone flow for constant width bodies in ℝ³, Curves of constant diameter and inscribed polygons, The maximum size of a convex polygon in a restricted set of points in the plane, Unnamed Item, A geometric characterization of the ball and the Bochner-Martinelli kernel, Hardy spaces for a class of singular domains, The Cauchy kernel, the Szegö kernel, and the Riemann mapping function, A comparison among methods for proving stability, Unnamed Item, Cutting cakes and kissing circles, On finite sets in \(E^ k \)in which the diameter is frequently achieved, The generalized wave equation revisited, Opaque sets, Stability of Pexider equations on semigroup with no neutral element, New relaxation-based algorithms for the optimal solution of the continuous and discrete \(p\)-center problems, A recursive algorithm for finding the minimum covering sphere of a polytope and the minimum covering concentric spheres of several polytopes, Stability of a simple Levi-Civitá functional equation on non-unital commutative semigroups, Inequalities for inert primes and their applications, Sharp lower bounds for solutions of nonlinear differential inequalities, How to use CAS (Maple) to help students learn number theory, Special issue on Locational analysis, Location of rectilinear center trajectories, On the product of continuous prime numbers, Brief Communications, The geometry of Minkowski spaces -- a survey. II., Unnamed Item, Graphs, friends and acquaintances, The multi-facility min-max Weber problem, Reinventing the wheel: Non-circular wheels, A deep cut ellipsoid algorithm for convex programming: Theory and applications, Numerical conformal mapping via the Szegö kernel
