English
Related papers

Related papers: Cantor digraphs and abbreviations of formulas

200 papers

While motivated by structural problems in mathematical music theory, this article introduces a novel combinatorial framework that advances the classification of cyclic cubic bipartite graphs. We extend the classical study of Levi graphs by…

Combinatorics · Mathematics 2026-05-26 Paweł Nurowski

In this paper we consider the long-term behavior of points in ${\mathbb R}$ under iterations of continuous functions. We show that, given any Cantor set $\Lambda^*$ embedded in ${\mathbb R}$, there exists a continuous function $F^*:{\mathbb…

Dynamical Systems · Mathematics 2013-11-05 Benjamin Hoffman

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…

Number Theory · Mathematics 2021-11-11 Lu Cui , Minghui Ma

Let $\ee>0$ and $\fff$ be a family of finite subsets of the Cantor set $\ccc$. Following D. H. Fremlin, we say that $\fff$ is $\ee$-filling over $\ccc$ if $\fff$ is hereditary and for every $F\subseteq\ccc$ finite there exists $G\subseteq…

Logic · Mathematics 2019-05-01 Pandelis Dodos , Vassilis Kanellopoulos

In this paper, we completely solve the problem when a Cantor dynamical system $(X,f)$ can be embedded in $\mathbb{R}$ with vanishing derivative everywhere. For this purpose, we construct a refining sequence of marked clopen partitions of…

Dynamical Systems · Mathematics 2021-12-14 Silvère Gangloff , Piotr Oprocha

For a set-endofunctor $F$, a graph is triple $(V,E,g)$ with a structure map $g:E\rightarrow F V$. This model is a generalized coalgebra over the category of sets. In this note, we model graphs as coalgebras over $Set\times Set$ and use the…

Combinatorics · Mathematics 2016-01-19 Christian Jäkel

Let $D$ be a digraph, let $p \geq 1$ be an integer, and let $f: V(D) \to \mathbb{N}_0^p$ be a vector function with $f=(f_1,f_2,\ldots,f_p)$. We say that $D$ has an $f$-partition if there is a partition $(D_1,D_2,\ldots,D_p)$ into induced…

Combinatorics · Mathematics 2020-12-18 Jørgen Bang-Jensen , Thomas Schweser , Michael Stiebitz

We provide a counterexample to the Category Dichotomy in the framework of $\textsf{ZFC}$. That is, we prove the existence of an ideal on $\omega$ that is not Kat\v{e}tov below $\mathsf{nwd}$ and does not have restrictions above…

Logic · Mathematics 2026-01-09 Alan Dow , Raul Figueroa-Sierra , Osvaldo Guzmán , Michael Hrušák

Carpi constructed an infinite word over a 4-letter alphabet that avoids squares in all subsequences indexed by arithmetic progressions of odd difference. We show a connection between Carpi's construction and the paperfolding words. We…

Combinatorics · Mathematics 2007-05-23 Jui-Yi Kao , Narad Rampersad , Jeffrey Shallit , Manuel Silva

Let $D$ be a digraph. A subset $S$ of $V(D)$ is a stable set if every pair of vertices in $S$ is non-adjacent in $D$. A collection of disjoint paths $\mathcal{P}$ of $D$ is a path partition of $V(D)$, if every vertex in $V(D)$ is on a path…

Combinatorics · Mathematics 2023-03-01 Lucas Ismaily Bezerra Freitas , Orlando Lee

We prove two results on Fractal Uncertainty Principle (FUP) for discrete Cantor sets with large alphabets. First, we give an example of an alphabet with dimension $\delta \in (\frac12,1)$ where the FUP exponent is exponentially small as the…

Analysis of PDEs · Mathematics 2024-06-12 Alain Kangabire

In this paper, we mainly prove some results on the additivity of maps over rings under certain conditions. First, we discuss a special case of MARTINDALE III's theorem of \cite{1969M} as a bijective map $\varphi$ over a ring $R$ with a…

Rings and Algebras · Mathematics 2025-10-07 Sk Aziz , Arindam Ghosh , Om Prakash

Building on our previous work on rigid analytic uniformizations, we introduce Darmon points on Jacobians of Shimura curves attached to quaternion algebras over Q and formulate conjectures about their rationality properties. Moreover, if K…

Number Theory · Mathematics 2011-11-08 Matteo Longo , Victor Rotger , Stefano Vigni

A subgraph H= (V, F) of a graph G= (V,E) is non-separating if G-F, that is, the graph obtained from G by deleting the edges in F, is connected. Analogously we say that a subdigraph X= (V,B) of a digraph D= (V,A) is non-separating if D-B is…

Discrete Mathematics · Computer Science 2020-07-07 Joergen Bang-Jensen , Stéphane Bessy , Anders Yeo

In a series of three papers we develop an end space theory for digraphs. Here in the second paper we introduce the topological space $|D|$ formed by a digraph $D$ together with its ends and limit edges. We then characterise those digraphs…

Combinatorics · Mathematics 2020-09-08 Carl Bürger , Ruben Melcher

The sets of vertices and edges of an undirected, simple, finite, connected graph $G$ are denoted by $V(G)$ and $E(G)$, respectively. An arbitrary nonempty finite subset of consecutive integers is called an interval. An injective mapping…

Discrete Mathematics · Computer Science 2014-10-30 Narine N. Davtyan , Arpine M. Khachatryan , Rafayel R. Kamalian

Nous \'etendons aux courbes de genre arbitraire le th\'eor\`eme de rationalit\'e de Cantor, lui-m\^eme une extension de th\'eor\`emes de Borel, P\'olya, Dwork, Bertrandias et Robinson. La d\'emonstration s'effectue en deux \'etapes. La…

Number Theory · Mathematics 2023-05-30 Antoine Chambert-Loir , Camille Noûs

Let D be a division ring. We say that D is left algebraic over a (not necessarily central) subfield K of D if every x in D satisfies a polynomial equation x^n + a_{n-1}x^{n-1}+...+a_0=0 with a_0,...,a_{n-1} in K. We show that if D is a…

Rings and Algebras · Mathematics 2011-11-24 Jason P. Bell , Vesselin Drensky , Yaghoub Sharifi

We consider groups defined by non-empty balanced presentations with the property that each relator is of the form R(x,y), where x and y are distinct generators and R(.,.) is determined by some fixed cyclically reduced word R(a,b) that…

Group Theory · Mathematics 2020-01-14 Johannes Cuno , Gerald Williams

Let $D$ be a digraph. We call a subset $N$ of $V(D)$ $k$-independent if for every pair of vertices $u,v \in N$, $d(u,v) \geq k$; and we call it $\ell$-absorbent if for every vertex $u \in V(D) \setminus N$, there exists $v \in N$ such that…

Combinatorics · Mathematics 2019-12-24 Alonso Ali , Orlando Lee
‹ Prev 1 3 4 5 6 7 10 Next ›