Related papers: Building Cantor's Bijection

We consider bicolored maps, i.e. graphs which are drawn on surfaces, and construct a bijection between (i) oriented maps with arbitary face structure, and (ii) (weighted) non-oriented maps with exactly one face. Above, each non-oriented map…

In a constructive setting, no concrete formulation of ordinal numbers can simultaneously have all the properties one might be interested in; for example, being able to calculate limits of sequences is constructively incompatible with…

We address the issue of generating cutting planes for mixed integer programs from multiple rows of the simplex tableau with the tools of disjunctive programming. A cut from q rows of the simplex tableau is an intersection cuts from a…

The classical Cantor's intersection theorem states that in a complete metric space $X$, intersection of every decreasing sequence of nonempty closed bounded subsets, with diameter approaches zero, has exactly one point. In this article, we…

This paper examines the possibilities of extending Cantor's two arguments on the uncountable nature of the set of real numbers to one of its proper denumerable subsets: the set of rational numbers. The paper proves that, unless certain…

We develop the theory of minimal realizations and factorizations of rational functions where the coefficient space is a ring of the type introduced in our previous work, the scaled quaternions, which includes as special cases the…

Diers developed a general theory of right multi-adjoint functors leading to a purely categorical, point-set construction of spectra. Situations of multiversal properties return sets of canonical solutions rather than a unique one. In the…

For a sequence of continuous, monotone functions $f_1,\dots,f_n \colon I \to \mathbb{R}$ ($I$ is an interval) we define the mapping $M \colon I^n \to I^n$ as a Cartesian product of quasi-arithmetic means generated by $f_j$-s. It is known…

Whatever other beliefs there may remain for considering Cantor's diagonal argument as mathematically legitimate, there are three that, prima facie, lend it an illusory legitimacy; they need to be explicitly discounted appropriately. The…

The non-bijective version of Wigner's theorem states that a map which is defined on the set of self-adjoint, rank-one projections (or pure states) of a complex Hilbert space and which preserves the transition probability between any two…

Let F be a continuous injective map from an open subset of R^n to R^n. Assume that, for infinitely many k>1, F induces a bijection between the rational points of denominator k in the domain and those in the image (the denominator of…

This manuscript extends the Cantor-Kuratowski intersection theorem from the setting of metric spaces to the setting of uniformizable spaces. Complete uniformizable spaces are revisited.

We extend Bishop's one-fourth three-fourths principle for constructing peak functions belonging to a uniform algebra to a situation where the ``approximate barriers'' associated with the Bishop construction are not uniformly bounded.

We prove in constructive logic that the statement of the Cantor-Bernstein theorem implies excluded middle. This establishes that the Cantor-Bernstein theorem can only be proven assuming the full power of classical logic. The key ingredient…

This article presents unified bijective constructions for planar maps, with control on the face degrees and on the girth. Recall that the girth is the length of the smallest cycle, so that maps of girth at least $d=1,2,3$ are respectively…

Using an iterative tree construction we show that for simple computable subsets of the Cantor space Hausdorff, constructive and computable dimensions might be incomputable.

For any pair of bounded observables $A$ and $B$ with pure point spectra, we construct an associated "joint observable" which gives rise to a notion of a joint (projective) measurement of $A$ and $B$, and which conforms to the intuition that…

The concept of ``countable set'' is attributed to Georg Cantor, who set the boundary between countable and uncountable sets in 1874. The concept of ``computable set'' arose in the study of computing models in the 1930s by the founders of…

Motivated by the problem of constructing bijective maps with low differential uniformity, we introduce the notion of permutation resemblance of a function, which looks to measure the distance a given map is from being a permutation. We…

The traditional first approach to fractional calculus is via the Riemann-Liouville differintegral $_{a}D_{x}^{k}$. The intent of this paper will be to create a space $K$, pair of maps $g: C^{\omega}(\mathbb{R}) \to K$ and $g': K \to…