相关论文: A simpler proof of Jensen's coding theorem
In this paper we study a particular class of polynomials. We study the distribution of their zeros, including the zeros of their derivatives as well as the interaction between this two. We prove a weak variant of the sendov conjecture in…
Shannon separation theorem lays the foundation for traditional image compression and transmission schemes, which consist of JPEG type image compression methods and the usual channel coding schemes such as Turbo and LDPC codes. One of the…
The possibility of a fundamental consistency between the basic quantum principles and reduction (so-called wave function reduction) is reexamined. The mathematical description of an organized macroscopic device is constructed explicitly as…
In this note, we present a construction of new nonbinary quantum codes with good parameters. These codes are obtained by applying the Calderbank-Shor-Steane (CSS) construction. In order to do this, we show the existence of (classical)…
Codes which attain the sphere packing bound are called perfect codes. The most important metrics in coding theory on which perfect codes are defined are the Hamming metric and the Johnson metric. While for the Hamming metric all perfect…
We prove a semisimplicity criterion for a large class of algebras by a new method. This can be applied to Brauer, BMW, and $q$-Brauer algebras.
The well-known Steinberg's conjecture asserts that any planar graph without 4- and 5-cycles is 3 colorable. In this note we have given a short algorithmic proof of this conjecture based on the spiral chains of planar graphs proposed in the…
G\"odel's second incompleteness theorem is proved for Herbrand consistency of some arithmetical theories with bounded induction, by using a technique of logarithmic shrinking the witnesses of bounded formulas, due to Z. Adamowicz [Herbrand…
In this short note, we give a localized version of the basic triangle theorem, first published in 2011 (see [4]) in order to prove the independence of hyperlogarithms over various function fields. This version provides direct access to…
We prove a uniqueness theorem and give a characterization of simplicity for Steinberg algebras associated to non-Hausdorff ample groupoids. We also prove a uniqueness theorem and give a characterization of simplicity for the C*-algebra…
Recently Conlon, Fox, and the author gave a new proof of a relative Szemer\'edi theorem, which was the main novel ingredient in the proof of the celebrated Green-Tao theorem that the primes contain arbitrarily long arithmetic progressions.…
Case split is a core proof rule in current decision procedures for the theory of string constraints. Its use is the primary cause of the state space explosion in string constraint solving, since it is the only rule that creates branches in…
Generalising Solomon's theorem, C. Gordon and F. Rodriguez-Villegas have proven recently that, in any group, the number of solutions to a system of coefficient-free equations is divisible by the order of this group whenever the rank of the…
The CSS code construction is a powerful framework used to express features of a quantum code in terms of a pair of underlying classical codes. Its subsystem extension allows for similar expressions, but the general case has not been fully…
A countable group is C*-simple if its reduced C*-algebra is simple. It is well known that C*-simplicity implies that the amenable radical of the group must be trivial. We show that the converse does not hold by constructing explicit…
We present a very simple example of a theorem with constructive and non-constructive proofs: the equation c^2 x^2 - (c^2 + c)x + c = 0 has a solution.
In the splitting model, information theoretic authentication codes allow non-deterministic encoding, that is, several messages can be used to communicate a particular plaintext. Certain applications require that the aspect of secrecy should…
Steve Gull, in unpublished work available on his Cambridge University homepage, has outlined a proof of Bell's theorem using Fourier theory. Gull's philosophy is that Bell's theorem (or perhaps a key lemma in its proof) can be seen as a…
Let $S \subseteq \mathbb{R}^n$ be a compact semialgebraic set and let $f$ be a polynomial nonnegative on $S$. Schm\"udgen's Positivstellensatz then states that for any $\eta > 0$, the nonnegativity of $f + \eta$ on $S$ can be certified by…
In this paper we examine the reverse mathematical strength of a variation of Hindman's Theorem HT constructed by essentially combining HT with the Thin Set Theorem TS to obtain a principle which we call thin-HT. thin-HT says that every…