Related papers: Cantor digraphs and abbreviations of formulas

We show that the CAR algebra admits a Cantor spectrum C*-diagonal that is not conjugate to the standard AF diagonal. We obtain this by classification theory of C*-algebras, and the diagonal arises by realising the CAR algebra as the crossed…

Let $p$ be a prime, $e$ a positive integer, $q = p^e$, and let $\mathbb{F}_q$ denote the finite field of $q$ elements. Let $f_i : \mathbb{F}_q^2\to\mathbb{F}_q$ be arbitrary functions, where $1\le i\le l$, $i$ and $l$ are integers. The…

Let $\gamma\in(0;\frac{1}{2}),\tau\geq 1$ and define the "$\gamma,\tau$ Diophantine set" as: $$D_{\gamma,\tau}:=\{\alpha\in (0;1): ||q\alpha||\geq\frac{\gamma}{q^{\tau}}\quad\forall q\in\Bbb{N}\},\qquad||x||:=\inf_{p\in\Bbb{Z}}|x-p|. $$ In…

Let $ D $ be a finite digraph, and let $ V_0,\dots,V_{k-1} $ be nonempty subsets of $ V(D) $. The (strong form of) Edmonds' branching theorem states thatthere are pairwise edge-disjoint spanning branchings $ \mathcal{B}_0,\dots,…

Let $D$ be a digraph of order $p\geq5$ with minimum degree at least $p-1$ and with minimum semi-degree at least $p/2-1$. In his excellent and renowned paper, ``Long Cycles in Digraphs" (Proc. London Mathematical Society (3), 42 (1981),…

Cantor sets are constructed from iteratively removing sections of intervals. This process yields a cumulative distribution function (CDF), constructed from the invariant measure associated with their iterated function systems. Under…

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$,…

We discuss counting problems linked to finite versions of Cantor's diagonal of infinite tableaux. We extend previous results of [2] by refining an equivalence relation that reduces significantly the exhaustive generation. New enumerative…

This paper provides some counterexamples to Cantor's contributions to the foundations of Set Theory. The first counterexample forces Cantor's Diagonal Method (DM) to yield one of the numbers in the target list. To study this anomaly, and…

Let $k$ be an integer with $k\geq 2$. A $k$-king in a digraph $D$ is a vertex which can reach every other vertex by a directed path of length at most $k$ and a non-king is a vertex which is not a 3-king. A subset $K$ is $k$-independent if…

We obtain results on the limiting distribution of the six-length of a random functional graph, also called a functional digraph or random mapping, with given in-degree sequence. The six-length of a vertex $v\in V$ is defined from the…

A graph is apex if it can be made planar by deleting a vertex, that is, $\exists v$ such that $G-v$ is planar. We define the related notions of edge apex, $\exists e$ such that $G-e$ is planar, and contraction apex, $\exists e$ such that…

For a function $f\colon [0,1]\to\mathbb R$, we consider the set $E(f)$ of points at which $f$ cuts the real axis. Given $f\colon [0,1]\to\mathbb R$ and a Cantor set $D\subset [0,1]$ with $\{0,1\}\subset D$, we obtain conditions equivalent…

To each finite frame $\varphi$ in an inner product space $\mathcal{H}$ we associate a simple graph $G(\varphi)$, called {\it frame graph}, with the vectors of the frame as vertices and there is an edge between vertices $f$ and $g$ provided…

We prove a Khintchine type theorem for approximation of elements in the Cantor set, as a subset of the formal Laurent series over $\mathbb{F}_3$, by rational functions of a specific type. Furthermore we construct elements in the Cantor set…

Free words are elements of a free monoid, generated over an alphabet via the binary operation of concatenation. Casually speaking, a free word is a finite string of letters. Henceforth, we simply refer to them as words. Motivated by recent…

In 1984, K. Mahler asked how well elements in the Cantor middle third set can be approximated by rational numbers from that set, and by rational numbers outside of that set. We consider more general missing digit sets $C$ and construct…

Let $D$ be a digraph on $p\geq 5$ vertices with minimum degree at least $p-1$ and with minimum semi-degree at least $p/2-1$. For $D$ (unless some extremal cases) we present a detailed proof of the following results [12]: (i) $D$ contains…

A classical theorem of Alexandroff states that every $n$-dimensional compactum $X$ contains an $n$-dimensional Cantor manifold. This theorem has a number of generalizations obtained by various authors. We consider extension-dimensional and…

We show that for all Cantor set $K_1$ on ${\mathbb R}^d$, it is always possible to find another Cantor set $K_2$ so that the sum $g(K_1)+ K_2$ (where $g$ is a $C^1$ local diffeomorphism) has non-empty interior, and the existence of the…