Related papers: The Continuum is Countable: Infinity is Unique
We prove a conjecture that classifies exceptional numbers. This conjecture arises in two different ways, from cryptography and from coding theory. An odd integer $t\geq 3$ is said to be exceptional if $f(x)=x^t$ is APN (Almost Perfect…
Let n>1 be a number. Let Gn be the hypergraph of all rectangles in an n-dimensional Euclidean space. It is consistent that ZF+DC holds, the chromatic number of Gn is countable, yet the chromatic number of Gn+1 is uncountable.
As far as algebraic properties are concerned, the usual addition on the class of ordinal numbers is not really well behaved; for example, it is not commutative, nor left cancellative etc. In a few cases, the natural Hessemberg sum is a…
A refinement of the classic equivalence relation among Cauchy sequences yields a useful infinitesimal-enriched number system. Such an approach can be seen as formalizing Cauchy's sentiment that a null sequence "becomes" an infinitesimal. We…
A. V. Arhangel'ski\u{i} introduced in 2012, when he was visiting the department of Mathematics at King Abduaziz University, new weaker versions of normality, called \it $C$-normality, \rm and \it countable normality. \rm The purpose of this…
If we assume the axiom of choice, then every two cardinal numbers are comparable. In the absence of the axiom of choice, this is no longer so. For a few cardinalities related to an arbitrary infinite set, we will give all the possible…
We review and compare five ways of assigning totally ordered sizes to subsets of the natural numbers: cardinality, infinite lottery logic with mirror cardinalities, natural density, generalised density, and $\alpha$-numerosity. Generalised…
The additivity spectrum ADD(I) of an ideal I is the set of all regular cardinals kappa such that there is an increasing chain {A_alpha:alpha<kappa\} in the ideal I such that the union of the chain is not in I. We investigate which set A of…
The topic of this paper is the subtle interplay between countability and representations. In particular, we establish that the definition of countability of a certain set $X$ crucially hinges on the associated equivalence relation $=_{X}$.…
In the absence of the axiom of choice, new results concerning sequential, Fr\'echet-Urysohn, $k$-spaces, very $k$-spaces, Loeb and Cantor completely metrizable spaces are shown. New choice principles are introduced. Among many other…
In 1984, Kurt Mahler posed the following fundamental question: How well can irrationals in the Cantor set be approximated by rationals in the Cantor set? Towards development of such a theory, we prove a Dirichlet-type theorem for this…
This paper introduces the concept of a generic finite set, and points out that a consistent and significant interpretation of the grossone notation of Yarolslav D. Sergeyev is that of a generic natural number. This means that the grossone…
Counters that hold natural numbers are ubiquitous in modeling and verifying software systems; for example, they model dynamic creation and use of resources in concurrent programs. Unfortunately, such discrete counters often lead to…
Let $T$ be a complete theory of fields, possibly with extra structure. Suppose that model-theoretic algebraic closure agrees with field-theoretic algebraic closure, or more generally that model-theoretic algebraic closure has the exchange…
We discuss two main ways in comparing and evaluating the size of sets: the "Cantorian" way, grounded on the so called Hume principle (two sets have equal size if they are equipotent), and the "Euclidean" way, maintaining Euclid's principle…
Erd\H{o}s \cite{MR168482} proved that the Continuum Hypothesis (CH) is equivalent to the existence of an uncountable family $\mathcal{F}$ of (real or complex) analytic functions, such that $\big\{ f(x) \ : \ f \in \mathcal{F} \big\}$ is…
Three types of Cantor sets are studied.For any integer $m\ge 4$, we show that every real number in $[0,k]$ is the sum of at most $k$ $m$-th powers of elements in the Cantor ternary set $C$ for some positive integer $k$, and the smallest…
Alan Turing is considered as a founder of current computer science together with Kurt Godel, Alonzo Church and John von Neumann. In this paper multiple new research results are presented. It is demonstrated that there would not be Alan…
For integers $N\geq 3$ and $g\geq 1$, we study bounds on the cardinality of the set of points of order dividing $N$ lying on a hyperelliptic curve of genus $g$ embedded in its jacobian using a Weierstrass point as base point. This leads us…
In this paper, we present a second partial solution for the problem of cardinality calculation of the set of fractals for its subcategory of the random virtual ones. Consistent with the deterministic case, we show that for the given…