English
Related papers

Related papers: Cantor digraphs and abbreviations of formulas

200 papers

Given a simple digraph $D$ on $n$ vertices (with $n\ge2$), there is a natural construction of a semigroup $\langle D\rangle$ associated with $D$. For any edge $(a,b)$ of $D$, let $a\to b$ be the idempotent of defect $1$ mapping $a$ to $b$…

Group Theory · Mathematics 2019-05-31 P. J. Cameron , A. Castillo-Ramirez , M. Gadouleau , J. D. Mitchell

A partition is finitary if all its members are finite. For a set $A$, $\mathscr{B}(A)$ denotes the set of all finitary partitions of $A$. It is shown consistent with $\mathsf{ZF}$ (without the axiom of choice) that there exist an infinite…

Logic · Mathematics 2023-09-04 Guozhen Shen

It follows from a theorem of Lov\'asz that if $ D $ is a finite digraph with $ r\in V(D) $ then there is a spanning subdigraph $ E $ of $ D $ such that for every vertex $ v\neq r $ the following quantities are equal: the local connectivity…

Combinatorics · Mathematics 2019-11-07 Attila Joó

It is proved in $\mathsf{ZF}$ (without the axiom of choice) that, for all infinite sets $M$, there are no surjections from $\omega\times M$ onto $\mathscr{P}(M)$.

Logic · Mathematics 2025-09-23 Yinhe Peng , Guozhen Shen

An \textit{Italian dominating function} on a digraph $D$ with vertex set $V(D)$ is defined as a function $f : V(D) \rightarrow \{0, 1, 2\}$ such that every vertex $v \in V(D)$ with $f(v) = 0$ has at least two in-neighbors assigned $1$ under…

Discrete Mathematics · Computer Science 2020-08-25 Kijung Kim

This article could be called "theme and variations" on Cantor's celebrated diagonal argument. Given a square nxn tableau T=(a_i^j) on a finite alphabet A, let L be the set of its row-words. The permanent Perm(T) is the set of words…

Combinatorics · Mathematics 2007-05-23 Srečko Brlek , Michel Mendès France , John Michael Robson , Martin Rubey

We show that there exist $(d-1)$ - Ahlfors regular compact sets $E \subset \mathbb{R}^{d}, d\geq 2$ such that for any $t< d-1$, we have \[ \sup_T \frac{\mathcal{H}^{d-1}(E\cap T)}{w(T)^t}<\infty \] where the supremum is over all tubes $T$…

Classical Analysis and ODEs · Mathematics 2016-04-20 Changhao Chen

Fix $d\in\mathbb N$, and let $S\subseteq\mathbb R^d$ be either a real-analytic manifold or the limit set of an iterated function system (for example, $S$ could be the Cantor set or the von Koch snowflake). An $extrinsic$ Diophantine…

Number Theory · Mathematics 2015-07-30 Lior Fishman , David Simmons

Let $E, F\subset \R^d$ be two self-similar sets. Under mild conditions, we show that $F$ can be $C^1$-embedded into $E$ if and only if it can be affinely embedded into $E$; furthermore if $F$ can not be affinely embedded into $E$, then the…

Dynamical Systems · Mathematics 2014-06-23 De-Jun Feng , Wen Huang , Hui Rao

Let $\mathscr{H}$ be a family of digraphs. A digraph $D$ is \emph{$\mathscr{H}$-free} if it contains no isomorphic copy of any member of $\mathscr{H}$. For $k\geq2$, we set $C_{\leq k}=\{C_{2}, C_{3},\ldots,C_{k}\}$, where $C_{\ell}$ is a…

Combinatorics · Mathematics 2022-11-08 Bin Chen , Xinmin Hou

For a commutative quantale $\mathcal{V}$, the category $\mathcal{V}-cat$ can be perceived as a category of generalised metric spaces and non-expanding maps. We show that any type constructor $T$ (formalised as an endofunctor on sets) can be…

Category Theory · Mathematics 2023-06-22 Adriana Balan , Alexander Kurz , Jiří Velebil

Let $H$ be a subdigraph of a digraph $D$. An ear of $H$ in $D$ is a path or a cycle in $D$ whose ends lie in $H$ but whose internal vertices do not. An \emph{ear decomposition} of a strong digraph $D$ is a nested sequence $(D_0,D_1,\ldots ,…

A digraph $D$ is an oriented graph if $D$ does not have a pair of opposite arcs. The degree of a vertex $v$ of $D$ is the sum of the in-degree and out-degree of $v.$ Let $fvs(D)$ be the minimum number of vertices whose deletion from $D$…

Combinatorics · Mathematics 2025-12-02 Jiangdong Ai , Gregory Gutin , Xiangzhou Liu , Anders Yeo , Yacong Zhou

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…

General Mathematics · Mathematics 2012-01-26 Antonio Leon

For more than a century, Cantor's theory of transfinite numbers has played a pivotal role in set theory, with ramifications that extend to many areas of mathematics. This article extends earlier findings with a fresh look at the critical…

General Mathematics · Mathematics 2023-05-17 Juan A Perez

We prove that a self-similar Cantor set in $\mathbb{Z}_N \times \mathbb{Z}_N$ has a fractal uncertainty principle if and only if it does not contain a pair of orthogonal lines. The key ingredient in our proof is a quantitative form of…

Classical Analysis and ODEs · Mathematics 2025-03-05 Alex Cohen

Consider $d$ disjoint closed subintervals of the unit interval and consider an orientation preserving expanding map which maps each of these subintervals to the whole unit interval. The set of points where all iterates of this expanding map…

Dynamical Systems · Mathematics 2008-02-03 Feliks Przytycki , Folkert Tangerman

In the present paper, for a given (possibly, infinite) strongly connected digraph $\cal{D},$ we consider the class $\cal{S}_{<}({\cal D})$ of all truthly substochastic weightings of ${\cal D}$ (here, the word "truthly" means that there…

Combinatorics · Mathematics 2023-11-23 S. V. Savchenko

It is known that if a compact set $E$ in $\mathbb{R}^d$ has Hausdorff dimension greater than $(d+1)/2$, then its $n$-chain distance set $$\Delta^n(E) = \left\{\left(\left|x^1-x^2\right|,\cdots, \left|x^{n}- x^{n+1}\right|\right)\in…

Classical Analysis and ODEs · Mathematics 2025-07-11 Yeonwook Jung , Krystal Taylor

A Cantor set is a non-empty, compact set that has neither interior nor isolated points. In this paper a Cantor set $K\subseteq \mathbb{R}$ is constructed such that every set definable in $(\mathbb{R},<,+,\cdot,K)$ is Borel. In addition, we…

Logic · Mathematics 2016-05-04 Philipp Hieronymi
‹ Prev 1 2 3 10 Next ›