English
Related papers

Related papers: Newman's theorem via Carath\'eodory

200 papers

The proofs of K. Oka's Coherence Theorems are based on Weierstrass' Preparation (division) Theorem. Here we formulate and prove a Weak Coherence Theorem without using Weierstrass' Preparation Theorem, but only with power series expansions:…

Complex Variables · Mathematics 2018-07-24 Junjiro Noguchi

We give a simple proof of Kolmogorov's theorem on the persistence of a quasiperiodic invariant torus in Hamiltonian systems. The theorem is first reduced to a well-posed inversion problem (Herman's normal form) by switching the frequency…

Dynamical Systems · Mathematics 2010-07-26 Jacques Féjoz

We re-formulate the notion of a Newton-Cartan manifold and clarify the compatibility conditions of a connection with torsion with the Newton-Cartan structure.

General Relativity and Quantum Cosmology · Physics 2007-05-23 T. Dereli , S. Kocak , M. Limoncu

We show a near optimal direct-sum theorem for the two-party randomized communication complexity. Let $f\subseteq X \times Y\times Z$ be a relation, $\varepsilon> 0$ and $k$ be an integer. We show,…

Information Theory · Computer Science 2020-09-04 Rahul Jain

We propose a probabilistic two-party communication complexity scenario with a prior nonmaximally entangled state, which results in less communication than that is required with only classical random correlations. A simple all-optical…

Quantum Physics · Physics 2019-08-17 Peng Xue , Yun-Feng Huang , Yong-Sheng Zhang , Chuan-Feng Li , Guang-Can Guo

We give a constructive proof of Carpenter's Theorem due to Kadison. Unlike the original proof our approach also yields the real case of this theorem.

Functional Analysis · Mathematics 2019-08-15 Marcin Bownik , John Jasper

A strong direct product theorem (SDPT) states that solving n instances of a problem requires Omega(n) times the resources for a single instance, even to achieve success probability exp(-Omega(n)). We prove that quantum communication…

Computational Complexity · Computer Science 2010-11-23 Alexander A. Sherstov

We consider the process consisting of preparation, transmission through a quantum channel, and subsequent measurement of quantum states. The communication complexity of the channel is the minimal amount of classical communication required…

Quantum Physics · Physics 2014-11-21 Alberto Montina , Stefan Wolf

The Euclidean algorithm makes possible a simple but powerful generalization of Taylor's theorem. Instead of expanding a function in a series around a single point, one spreads out the spectrum to include any number of points with given…

Numerical Analysis · Mathematics 2007-10-02 Garret Sobczyk

A simple implementation of Noether's theorem for discrete symmetries in relativistic continuum field theories is presented. The associated conserved current is exemplified by charge conjugation and a cyclic symmetry. In addition, the…

General Physics · Physics 2026-02-09 Gerhart Seidl

Although a quantum state requires exponentially many classical bits to describe, the laws of quantum mechanics impose severe restrictions on how that state can be accessed. This paper shows in three settings that quantum messages have only…

Quantum Physics · Physics 2018-06-25 Scott Aaronson

The first section starts with the basic definitions following mainly the notations of the book written by E. Kushilevitz and N. Nisan. At the end of the first section I examine tree-balancing. In the second section I summarize the…

Computational Complexity · Computer Science 2010-07-13 Dömötör Pálvölgyi

The generalization of Shannon's theory to include messages with given autocorrelations is presented. The analytical calculation of the channel capacity is based on the transfer matrix method of the effective 1D Hamiltonian. This bridge…

Statistical Mechanics · Physics 2007-05-23 Ido Kanter , Hanan Rosemarin

A generalized approach to the quantization of a large class of maps on a torus, i.e. quantization via the von Neumann Equation, is described and a number of issues related to the quantization of model systems are discussed. The approach…

chao-dyn · Physics 2009-10-22 Joshua Wilkie , Paul Brumer

We provide a simple proof of Kamp's theorem.

Logic in Computer Science · Computer Science 2015-07-01 Alexander Rabinovich

In this expository article we provide an elegant proof of the one-sided Ingham-Karamata Tauberian theorem. As an application, we present a short deduction of the prime number theorem.

Number Theory · Mathematics 2024-03-27 Gregory Debruyne

We initiate the theory of communication complexity of individual inputs held by the agents, rather than worst-case or average-case. We consider total, partial, and partially correct protocols, one-way versus two-way, with and without help…

Computational Complexity · Computer Science 2007-05-23 Harry Buhrman , Hartmut Klauck , Nikolai Vereshchagin , Paul Vitanyi

We introduce new models and new information theoretic measures for the study of communication complexity in the natural peer-to-peer, multi-party, number-in-hand setting. We prove a number of properties of our new models and measures, and…

Computational Complexity · Computer Science 2020-10-01 Adi Rosén , Florent Urrutia

By means of the property of effective local connectivity, the computability of finding the Carath\'eodory extension of a conformal map of a Jordan domain onto the unit disk is demonstrated.

Complex Variables · Mathematics 2012-02-22 Timothy H. McNicholl

Newtonian gravity yields specific observable consequences, the most striking of which is the emergence of a $1/r^2$ force. In so far as communication can arise via such interactions between distant particles, we can ask what would be…

Quantum Physics · Physics 2015-06-19 D. Kafri , G. J. Milburn , J. M. Taylor