Related papers: Newman's theorem via Carath\'eodory
We apply domino problems to give short proofs for some known theorems for the classical predicate logic and to obtain lower bounds for complexity of modal predicate logics defined by Noetherian orders as Kripke frames.
A lower bound on the probability of decoding error of quantum communication channel is presented. The strong converse to the quantum channel coding theorem is shown immediately from the lower bound. It is the same as Arimoto's method exept…
We establish that the extension complexity of the nXn correlation polytope is at least 1.5^n by a short proof that is self-contained except for using the fact that every face of a polyhedron is the intersection of all facets it is contained…
We present a method to detect lower bounds to the classical capacity of quantum communication channels by means of few local measurements (i.e. without complete process tomography), reconstruction of sets of conditional probabilities, and…
Although it is widely accepted that `no-broadcasting' -- the nonclonability of quantum information -- is a fundamental principle of quantum mechanics, an impossibility theorem for the broadcasting of general density matrices has not yet…
In this correspondence we present a new proof of Holevo's coding theorem for transmitting classical information through quantum channels, and its strong converse. The technique is largely inspired by Wolfowitz's combinatorial approach using…
We present a simple new method for proving that languages are not regular. We prove the correctness of the method, illustrate the ease of using the method on well-known examples of nonregular languages, and prove two additional theorems on…
It is discussed that Zeeman's theorem can be directly obtained from Liouville's theorem if we assume sufficient differentiability.
A theorem is proved on the uniform estimation of the residual term of the asymptotic expansion with respect to a small parameter of the solution of the initial problem for a singularly perturbed differential operator weakly nonlinear…
We present a proof-theoretic analysis of the logic NL$\lambda$ (Barker \& Shan 2014, Barker 2019). We notably introduce a novel calculus of proof nets and prove it is sound and complete with respect to the sequent calculus for the logic. We…
We prove a general lower bound on the bounded-error entanglement-assisted quantum communication complexity of Boolean functions. The bound is based on the concept that any classical or quantum protocol to evaluate a function on distributed…
We introduce an generalized action functional describing the equations of motion and the variational equations for any Lagrangian system. Using this novel scheme we are able to generalize Noether's theorem in such a way that to any…
We revisit the Kahn-Priddy theorem from the perspective of modern equivariant homotopy theory. This allows for a short proof that may be applied in other settings with sufficiently robust analogues of multiplicative norms and the Adams…
We give an explicit description, in terms of bracket, anchor, and pairing, of the standard cochain complex associated to a Courant algebroid. In this formulation, the differential satisfies a formula that is formally identical to the Cartan…
Information Theory concepts and methodologies conform the background of how communication systems are studied and understood. They are mainly focused on the source-channel-receiver problem and on the asymptotic limits of accuracy and…
The original knapsack problem is well known to be NP-complete. In a multidimensional version one have to decide whether a $p\in \N^k$ is in a sumset-sum of a set $X \subseteq \N^k$ or not. In this paper we are going to investigate a…
Based on various strategies and a new general doubling operator, we obtain several simple proofs of the celebrated Sharkovsky's cycle coexistence theorem. A simple non-directed graph proof which is especially suitable for a calculus course…
In this paper the double-sided Taylor's approximations are studied. A short proof of a well-known theorem on the double-sided Taylor's approximations is introduced. Also, two new theorems are proved regarding the monotonicity of such…
Communication games are crucial tools for investigating the limitations of physical theories. The communication complexity (CC) problem is a typical example, for which several distributed parties attempt to jointly calculate a given…
We present a short proof of Cantor's Theorem (circa 1870s): if $a_n \cos nx + b_n \sin nx \to 0$ for each $x$ in some (nonempty) open interval, where $a_n, b_n$ are sequences of complex numbers, then $a_n$ and $b_n$ converge to 0.