Related papers: Newman's theorem via Carath\'eodory
We give a constructive proof of the Carath\'eodory Theorem by means of the concept of a modulus of local connectivity and the extremal distance of the separating curves of an annulus.
The Carath\'eodory theorem on the construction of a measure is generalized by replacing the outer measure with an approximation of it and generalizing the Carath\'eodory measurability. The new theorem is applied to obtain dynamically…
Communication complexity, which quantifies the minimum communication required for distributed computation, offers a natural setting for investigating the capabilities and limitations of quantum mechanics in information processing. We…
The approximate Carath\'eodory problem in general form is as follows: Given two symmetric convex bodies $P,Q \subseteq \mathbb{R}^m$, a parameter $k \in \mathbb{N}$ and $\mathbf{z} \in \textrm{conv}(X)$ with $X \subseteq P$, find…
In some scenarios there are ways of conveying information with many fewer, even exponentially fewer, qubits than possible classically. Moreover, some of these methods have a very simple structure--they involve only few message exchanges…
The Carath\'eodory's Extension Theorem is a powerful tool that allows us to generate a measure, over a sigma-algebra, from a pre-measure defined over an algebra of sets. However, although this result reduces our work to define a measure by…
The classical communication complexity of testing closeness of discrete distributions has recently been studied by Andoni, Malkin and Nosatzki (ICALP'19). In this problem, two players each receive $t$ samples from one distribution over…
Simple and shorter proofs of two Dirac-type theorems involving connectivity are presented.
In this work we present a simplifyed proof of Kantorovich's Theorem on Newton's Method. This analysis uses a technique which has already been used for obtaining new extensions of this theorem.
In this paper we provide an application to the Neumann problem of a recent three critical points theorem.
We study the weakest model of quantum nondeterminism in which a classical proof has to be checked with probability one by a quantum protocol. We show the first separation between classical nondeterministic communication complexity and this…
The communication complexity of a quantum channel is the minimal amount of classical communication required for classically simulating the process of preparation, transmission through the channel, and subsequent measurement of a quantum…
We prove a direct sum theorem for bounded round entanglement-assisted quantum communication complexity. To do so, we use the fully quantum definition for information cost and complexity that we recently introduced, and use both the fact…
Conformal Riemann mapping of the unit disk onto a simply-connected domain $W$ is a central object of study in classical Complex Analysis. The first complete proof of the Riemann Mapping Theorem given by P. Koebe in 1912 is constructive, and…
We develop a topological framework in an attempt to generalize the classical colourful Caratheodory theorem by imposing an additional constraint. For that we introduce the notion of zero-avoding complexes and covering criteria for the…
We prove a common extension of Bang's and Kadets' lemmas for contact pairs, in the spirit of the Colourful Carath\'eodory Theorem. We also formulate a generalized version of the affine plank problem and prove it under special assumptions.…
We provide a new simple and transparent proof of the version of Kummer's test given in [Tong, J. (1994). Amer. Math. Monthly. 101(5): 450--452]. Our proof is based on an application of a Hardy--Littlewood Tauberian theorem.
Noether's theorem is widely regarded as one of the most elegant results in theoretical physics. The article presents two simple examples that can be used to demonstrate the basic idea behind Noether's theorem, by deriving a relation between…
A new transparent proof of the well known good compactification theorem for the complex torus $(\Bbb C^*)^n$ is presented. This theorem provides a powerful tool in enumerative geometry for subvarieties in the complex torus. The paper also…
In this paper, we give a new proof of the classical KAM theorem on the persistence of an invariant quasi-periodic torus, whose frequency vector satisfies the Bruno-R\"ussmann condition, in real-analytic non-degenerate Hamiltonian systems…