Related papers: A simpler proof of Jensen's coding theorem

This paper studies the proof of Collatz conjecture for some set of sequence of odd numbers with infinite number of elements. These set generalized to the set which contains all positive odd integers. This extension assumed to be the proof…

Suppose T is a Heegaard splitting surface for a compact orientable 3-manifold M, and S is a reducing sphere for M. In 1968 Haken showed that there is then also a reducing sphere S* for the Heegaard splitting. That is, S* is a reducing…

This expository note presents a constructive proof of Wigner's theorem using only a few basic facts about Hilbert spaces, such as the existence of orthonormal bases and the Fourier decomposition of a vector. Our proof is based on a proof by…

Zeckendorf's Theorem states that any positive integer can be uniquely decomposed into a sum of distinct, non-adjacent Fibonacci numbers. There are many generalizations, including results on existence of decompositions using only even…

We describe two distinct simple, short and self contained proofs of the composition lemma.

We discuss two variations of Edwards' duality theorem. More precisely, we prove one version of the theorem for cones not necessarily containing all constant functions. In particular, we allow the functions in the cone to have a non-empty…

A group is said to be C*-simple if its reduced C*-algebra is simple. We establish an intrinsic (group-theoretic) characterization of groups with this property. Specifically, we prove that a discrete group is C*-simple if and only if it has…

We study the convergence of a family of numerical integration methods where the numerical integral is formulated as a finite matrix approximation to a multiplication operator. For bounded functions, the convergence has already been…

We give a concise proof of the fundamental theorem of smoothing theory in the special case when a smoothing exists.

This is a note of purely didactical purpose as the proof of the Jordan measure decomposition is often omitted in the related literature. Elementary proofs are provided for the existence, the uniqueness, and the minimality property of the…

Coding theory is very useful for real world applications. A notable example is digital television. Basically, coding theory is to study a way of detecting and/or correcting data that may be true or false. Moreover coding theory is an area…

We use ``iterated square sequences'' to show: There is an L-definable partition n: L-singulars --> omega such that if M is an inner model without 0#: (a) For some n, M satisfies that {alpha | n(alpha)=n} is stationary. (b) For each n there…

A Henkin-style proof of completeness of first-order classical logic is given with respect to a very small set (notably missing cut rule) of Genzten deduction rules for intuitionistic sequents. Insisting on sparing on derivation rules,…

The main motivation for this article is to explore the connections between the existence of certain combinatorial patterns (as in van der Corputs's theorem on arithmetic progressions of length $3$) with well-known tools and theorems for…

In previous papers on this project a general static logical framework for formalizing and mechanizing set theories of different strength was suggested, and the power of some predicatively acceptable theories in that framework was explored.…

We consider three notions of divisibility in the Cuntz semigroup of a C*-algebra, and show how they reflect properties of the C*-algebra. We develop methods to construct (simple and non-simple) C*-algebras with specific divisibility…

We discuss the similarity of the degeneration structure of the genetic code with a pure number theoretic -- ``divisors code.'' The most interesting thing about our observation is not that there is a connection between number theory and the…

The syndrome decoding problem is one of the NP-complete problems lying at the foundation of code-based cryptography. The variant thereof where the distance between vectors is measured with respect to the Lee metric, rather than the more…

Many proofs of the Fundamental Theorem of Algebra, including various proofs based on the theory of analytic functions of a complex variable, are known. To the best of our knowledge, this proof is different from the existing ones.

We prove various iteration theorems for forcing classes related to subproper and subcomplete forcing, introduced by Jensen. In the first part, we use revised countable support iterations, and show that 1) the class of subproper,…