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

The Schwartz-Zippel Lemma states that if a low-degree multivariate polynomial with coefficients in a field is not zero everywhere in the field, then it has few roots on every finite subcube of the field. This fundamental fact about…

In this paper, we prove the following: If $n\ge3$, there is a generic extension of $L$ -- the constructible universe -- in which it is true that the Separation principle holds for both effective (lightface) classes $\varSigma^1_n$ and…

We provide proofs for the fact that certain orders have no descending chains and no antichains.

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…

It is known that Plotkin's reduction theorem is very important for his theory of universal algebraic geometry [arXiv:math. GM/0210187], [arXiv:math. GM/0210194]. It turns out that this theorem can be generalized to arbitrary categories…

Recently Peter Keevash solved asymptotically the existence question for Steiner systems by showing that $S(t,k,n)$ exists whenever the necessary divisibility conditions on the parameters are satisfied and $n$ is sufficiently large in terms…

In this work and its sister paper [5] we give a new proof of the famous Linnik theorem bounding the least prime in an arithmetic progression. Using sieve machinery in both papers, we are able to dipense with the log-free zero density bounds…

In this paper, we generalize the arithmetic Chern-Simons theory to regular flat separated schemes of finite type over rings of integers of number fields by applying the duality theorems for arithmetic schemes.

By using the properties of the uniformly distributed sequences of real numbers on $(0,1)$, a short proof of a certain version of Kolmogorov strong law of large numbers is presented which essentially differs from Kolmogorov's original proof.

The unit-derived method in coding theory is shown to be a unique optimal scheme for constructing and analysing codes. In many cases efficient and practical decoding methods are produced. Codes with efficient decoding algorithms at maximal…

In this paper, we propose a mild condition, named Condition $(**)$, for collections of sequence of integers and show that for any measure preserving system the Pinsker $\sigma$-algebra is a characteristic $\sigma$-algebra for the averages…

Myriad articles are devoted to Mertens's theorem. In yet another, we merely wish to draw attention to a proof by Hardy, which uses a Tauberian theorem of Landau that "leads to the conclusion in a direct and elegant manner". Hardy's proof is…

We give a discussion of the classical Bowen$\unicode{x2013}$Series coding and, in particular, its application to the study of zeta functions associated to geodesic flows and their zeros. In the case of compact surfaces of constant negative…

We study maps between positive definite or positive semidefinite cones of unital $C^*$-algebras. We describe surjective maps that preserve (1) the norm of the quotient or multiplication of elements; (2) the spectrum of the quotient or…

We investigate the relationship between coseparable and semisimple corings. In particular we prove that a coring over a separable algebra is coseparable if and only if it is absolutely semisimple.

We give a new proof of the fundamental theorem of algebra. It is entirely elementary, focused on using long division to its fullest extent. Further, the method quickly recovers a more general version of the theorem recently obtained by…

A recently developed theory for eliminating decoherence and design constraints in quantum computers, ``encoded recoupling and decoupling'', is shown to be fully compatible with a promising proposal for an architecture enabling scalable…

The Dense Hindman's Theorem states that, in any finite coloring of the integers, one may find a single color and a "dense" set $B_1$, for each $b_1\in B_1$ a "dense" set $B_2^{b_1}$ (depending on $b_1$), for each $b_2\in B_2^{b_1}$ a…

A path (cycle) is properly-colored if consecutive edges are of distinct colors. In 1997, Bang-Jensen and Gutin conjectured a necessary and sufficient condition for the existence of a Hamilton path in an edge-colored complete graph. This…

Based on various strategies, we obtain several simple proofs of the celebrated Sharkovsky cycle coexistence theorem.