Related papers: Cantor digraphs and abbreviations of formulas

In 1891 Cantor presented two proofs with the purpose to establish a general theorem that any set can be replaced by a set of greater power. Cantor's power set theorem can be considered to be an extension of Cantor's 1891 second proof and…

Let $\overrightarrow{G}$ be a directed graph with no component of orderless than~$3$, and let $\Gamma$ be a finite Abelian group such that $|\Gamma|\geq 4|V(\overrightarrow{G})|$ or if $|V(\overrightarrow{G})|$ is large enough with respect…

We consider undirected simple finite graphs. The sets of vertices and edges of a graph $G$ are denoted by $V(G)$ and $E(G)$, respectively. For a graph $G$, we denote by $\delta(G)$ and $\eta(G)$ the least degree of a vertex of $G$ and the…

In this paper we study the dimension spectrum of continued fractions with coefficients restricted to infinite subsets of natural numbers. We prove that if $E$ is any arithmetic progression, the set of primes, or the set of squares…

This article critically reappraises arguments in support of Cantor's theory of transfinite numbers. The following results are reported: i) Cantor's proofs of nondenumerability are refuted by analyzing the logical inconsistencies in…

A class of ultrametric Cantor sets $(C, d_{u})$ introduced recently in literature (Raut, S and Datta, D P (2009), Fractals, 17, 45-52) is shown to enjoy some novel properties. The ultrametric $d_{u}$ is defined using the concept of {\em…

Fractals equipped with intrinsic arithmetic lead to a natural definition of differentiation, integration and complex numbers. Applying the formalism to the problem of a Fourier transform on fractals we show that the resulting transform has…

The Cantor pairing polynomials are extended to larger 2D sub-domains and more complex mapping, of which the most important property is the bijectivity. If corners are involved inside (but not the borders of) domain, more than one connected…

A group $\Gamma$ is said to be finitely non-co-Hopfian, or renormalizable, if there exists a self-embedding $\varphi \colon \Gamma \to \Gamma$ whose image is a proper subgroup of finite index. Such a proper self-embedding is called a…

The fractional arboricity of a digraph $D$, denoted by $\gamma(D)$, is defined as $\gamma(D)= \max_{H \subseteq D, |V(H)| >1} \frac {|A(H)|} {|V(H)|-1}$. Frank in [Covering branching, Acta Scientiarum Mathematicarum (Szeged) 41 (1979),…

Let f be a chain mixing continuous onto mapping from the Cantor set onto itself. Let g be a homeomorphism on the Cantor set that is topologically conjugate to a subshift. Then, homeomorphisms that are topologically conjugate to g…

We prove that for any function $f$ satisfying certain mild conditions and any Cantor set $K$ with Newhouse thickness greater than $1$, there exists $x\in K$ and $t>0$ such that \[ \{x-t,x,x+f(t)\}\subset K. \] This is an extension of…

We prove an analogue of Morley's categoricity theorem where cardinality is replaced by the recursion-theoretic notion of arithmetic degree. We say that a complete arithmetically definable theory $T$ is $D$-categorical if any two…

For an $r$-graph $F$, define Sidorenko exponent $s(F)$ as $$s(F):= \sup \{s \geq 0: \exists \text{$r$-graph $H$ s.t. } t_F(H) = t_{K^{(r)}_r} (H)^s > 0\},$$ where $t_{H_1}(H_2)$ denotes the homomorphism density of $H_1$ in $H_2$. The…

Let $D$ be a digraph. Given a set of vertices $S \subseteq V(D)$, an $S$-path partition $\mathcal{P}$ of $D$ is a collection of paths of $D$ such that $\{V(P) \colon P \in \mathcal{P}\}$ is a partition of $V(D)$ and $|V(P) \cap S| = 1$ for…

A digraph $D$ with a subset $S$ of $V(D)$ is called $\boldsymbol{S}${\bf -strong} if for every pair of distinct vertices $u$ and $v$ of $S$, there is a $(u, v)$-dipath and a $(v, u)$-dipath in $D$. We define a digraph $D$ with a subset $S$…

Every element $u$ of $[0,1]$ can be written in the form $u=x^2y$, where $x,y$ are elements of the Cantor set $C$. In particular, every real number between zero and one is the product of three elements of the Cantor set. On the other hand…

We offer a new proof (and review some known proofs) of Cantor's Powerset Theorem (1891), which concerns the non-existence of a surjective function from a set onto its powerset.

Let $K$ denote the middle third Cantor set and ${\cal A}:= \{3^n : n = 0,1,2, >... \} $. Given a real, positive function $\psi$ let $ W_{\cal A}(\psi)$ denote the set of real numbers $x$ in the unit interval for which there exist infinitely…

A PV number is an algebraic integer $\alpha$ of degree $d \geq 2$ all of whose Galois conjugates other than itself have modulus less than $1$. Erd\"{o}s \cite{erdos} proved that the Fourier transform $\widehat \varphi,$ of a nonzero…