2 citations · 2 across the 4 of their papers we have counts for
6 papers
Finite-radius Jensen and relative-entropy formulations of the Balazard--Saias--Yor criterion
Henning Wunderlich
We give two explicit reformulations of a Balazard--Saias--Yor type criterion for the Riemann hypothesis. First, Jensen's formula is applied to after mapping the un…
A forbidden-induced-subgraph characterization of beautiful graphs
Henning Wunderlich
A graph is beautiful if each of its induced subgraphs is the intersection graph of all maximal nonempty 1-rectangles of a binary matrix, with adjacency defined by a common cell. Be…
A geometric view on planar graphs and its application to coloring
Henning Wunderlich
While planar graphs are flat from a topological viewpoint, we observe that they are not from a geometric one. We prove that every planar graph can be embedded into a surface consis…
Characterization of Fréchet Spaces and Application to Hausdorff MNC
Henning Wunderlich
In this short note, we give a characterization of Fréchet spaces via properties of their metric. This allows us to prove that the Hausdorff measure of noncompactness (MNC), defined…
On a characterization of spaces satisfying open mapping and equivalent theorems
Henning Wunderlich
For classes of topological vector spaces, we analyze under which conditions open-mapping, continuous-inverse, and closed-graph properties are equivalent. Here, closure under quotie…
A note on a problem in communication complexity
Henning Wunderlich
In this note, we prove a version of Tarui's Theorem in communication complexity, namely . Consequently, every measure for leads to a me…