We study the prior-free zero-error private-coin external information complexity $B(f)$ of finite two-party functions, with correctness on every input. An elementary rectangle/entropy argument gives $B(\mathsf{AND})=\log_2 3$. A complete classification of Boolean $3\times3$ matrices leaves, up to input permutations and...
We present a uniform method for proving meromorphic function identities by comparing complete zero and pole multisets. A fixed annular Weierstrass normalization represents every nonzero meromorphic function uniquely as \[ q_t=e^{h_t}\frac{p_{Z_t}}{p_{P_t}},\qquad t=([h_t],Z_t,P_t),\qquad [h_t]\in\mathcal O(\mathbb C)/(...
We give two explicit reformulations of a Balazard--Saias--Yor type criterion for the Riemann hypothesis. First, Jensen's formula is applied to $u(s)=(s-1)\zeta(s)$ after mapping the unit disk onto $Re s<1/2$. For the normalization whose center corresponds to $s=-1/2$, the images $z_n=(4n-1)/(4n+3)$ of the trivial zeros...
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. Beautiful graphs were introduced as a hereditary class of Berge graphs, but a complete forbidden-induced-subgraph characterization was not obt...
Henning Wunderlich· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.