English
Related papers

Related papers: Remarks on Cantor's diagonalization proof of 1891

200 papers

Based on the structure of Fibonacci sequence, we give a new proof for the irrationality exponents of the Fibonacci real numbers. Moreover, we obtain all the irrationality exponents of the real numbers corresponding to the differences of…

Number Theory · Mathematics 2016-02-02 Ying-jun Guo , Zhi-xiong Wen , Jie-meng Zhang

A 1910 theorem of Brouwer characterizes the Cantor set as the unique totally disconnected, compact metric space without isolated points. A 1920 theorem of Sierpinski characterizes the rationals as the unique countable metric space without…

General Topology · Mathematics 2012-10-04 Michael Francis

We consider the fragment F of first order arithmetic in which quantification is restricted to ''for all but finitely many.'' We show that the integers form an F-elementary substructure of the real numbers. Consequently, the F-theory of…

Logic · Mathematics 2007-05-23 David Marker , Theodore A. Slaman

In 1999, Neil Calkin and Herbert Wilf wrote "Recounting the rationals" which gave an explicit bijection between the positive integers and the positive rationals. We find several different (some new) ways to construct this enumeration and…

Number Theory · Mathematics 2019-05-28 Sam Northshield

Descriptive set theory is mainly concerned with studying subsets of the space of all countable binary sequences. In this paper we study the generalization where countable is replaced by uncountable. We explore properties of generalized…

Logic · Mathematics 2025-11-25 Sy-David Friedman , Tapani Hyttinen , Vadim Kulikov

A new construction of the real number system, that is built directly upon the additive group of integers and has its roots in the definition due to Henri Poincar\'e of the rotation number of an orientation preserving homeomorphism of the…

General Topology · Mathematics 2007-05-23 Norbert A'Campo

A set of integers is $S$-recognizable in an abstract numeration system $S$ if the language made up of the representations of its elements is accepted by a finite automaton. For abstract numeration systems built over bounded languages with…

Discrete Mathematics · Computer Science 2008-09-16 Emilie Charlier , Michel Rigo , Wolfgang Steiner

We generalize the classical theorem by Jarnik and Besicovitch on the irrationality exponents of real numbers and Hausdorff dimension. Let a be any real number greater than or equal to 2 and let b be any non-negative real less than or equal…

Number Theory · Mathematics 2017-09-07 Verónica Becher , Jan Reimann , Theodore A. Slaman

Given a computable probability measure P over natural numbers or infinite binary sequences, there is no computable, randomized method that can produce an arbitrarily large sample such that none of its members are outliers of P.

Computational Complexity · Computer Science 2022-07-28 Samuel Epstein

In general, some of the well known results of measure theory dealing with the convergence of sequences of functions such as the Dominated Convergence Theorem or the Monotone Convergence Theorem are not true when we consider arbitrary nets…

Functional Analysis · Mathematics 2023-07-19 Daniel L. Rodríguez-Vidanes

A set $A$ of integers is called total if there is an algorithm which, given an enumeration of $A$, enumerates the complement of $A$, and called cototal if there is an algorithm which, given an enumeration of the complement of $A$,…

Logic · Mathematics 2017-02-10 Takayuki Kihara

In this paper, we show that any proof of the Collatz 3n+1 Conjecture must have an infinite number of lines; therefore, no formal proof is possible.

General Mathematics · Mathematics 2012-08-13 Craig Alan Feinstein

Let $S \subseteq \mathbb{N}$ have the property that for each $k \in S$ the set $(S - k) \cap \mathbb{N} \setminus S$ has asymptotic density $0$. We prove that there exists a basic sequence $Q$ where the set of numbers $Q$-normal of all…

Number Theory · Mathematics 2017-10-11 Dylan Airey , Bill Mance

We lay the combinatorial foundations for [ShSt:340] by setting up and proving the essential properties of the coding apparatus for singular cardinals. We also prove another result concerning the coding apparatus for inaccessible cardinals.

Logic · Mathematics 2016-09-06 Saharon Shelah , Lee Stanley

We consider Cantor real numeration system as a frame in which every non-negative real number has a positional representation. The system is defined using a bi-infinite sequence $\Beta=(\beta_n)_{n\in\Z}$ of real numbers greater than one. We…

Combinatorics · Mathematics 2023-12-22 Emilie Charlier , Célia Cisternino , Zuzana Masáková , Edita Pelantová

A method to construct and count all the linear codes (of arbitrary length) in $\mathbb{F}_{4}$ that are invariant under reverse permutation and that contain the repetition code is presented. These codes are suitable for constructing DNA…

Information Theory · Computer Science 2025-06-25 E. J. García-Claro

A differential calculus is set up on a deformation of the oscillator algebra. It is uniquely determined by the requirement of invariance under a seven-dimensional quantum group. The quantum space and its associated differential calculus are…

q-alg · Mathematics 2009-10-30 J. Bertrand , M. Irac-Astaud

How many permutations of the natural numbers are needed so that every conditionally convergent series of real numbers can be rearranged to no longer converge to the same sum? We define the \emph{rearrangement number}, a new cardinal…

According to mathematical constructivism, a mathematical object can exist only if there is a way to compute (or "construct") it; so, what is non-computable is non-constructive. In the example of the quantum model, whose Fock states are…

Quantum Physics · Physics 2016-05-11 Arkady Bolotin

The present article is devoted to representations of rational numbers in terms sign-variable Cantor expansions. The main attention is given to one of the discussions given by J. Galambos in [4].

Number Theory · Mathematics 2022-12-25 Symon Serbenyuk