Related papers: Integer Cantor Sets: Arithmetic Combinatorial Prop…
An existing dialogue between number theory and dynamical systems is advanced. A combinatorial device gives necessary and sufficient conditions for a sequence of non-negative integers to count the periodic points in a dynamical system. This…
Let $C$ be the classical middle third Cantor set. It is well known that $C+C = [0,2]$ (Steinhaus, 1917). (Here $+$ denotes the Minkowski sum.) Let $U$ be the set of $z \in [0,2]$ which have a unique representation as $z = x + y$ with $x, y…
We explore various combinatorial problems mostly borrowed from physics, that share the property of being continuously or discretely integrable, a feature that guarantees the existence of conservation laws that often make the problems…
Let C be a Cantor set. For a real number t let C+t be the translate of C by t, We say two real numbers s,t are equivalent if the intersection of C and C+s is a translate of the intersection of C and C+t. We consider a class of Cantor sets…
In this short note, we discuss the topology of Diophantine numbers, giving simple explicit examples of Diophantine isolated numbers (among those with same Diophantine constatnts), showing that, Diophantine sets are not always Cantor sets.…
Cantor's ordinal numbers, a powerful extension of the natural numbers, are a cornerstone of set theory. They can be used to reason about the termination of processes, prove the consistency of logical systems, and justify some of the core…
Below, by space we mean a separable metrizable zero-dimensional space. It is studied when the space can be embedded in a Cantor set while maintaining the algebraic structure. Main results of the work: every space is an open retract of a…
Some basic properties of the ring of integers $\mathbb{Z}$ are extended to entire rings. In particular, arithmetic in entire principal rings is very similar than arithmetic in the ring of integers $\mathbb{Z}$. These arithmetic properties…
The combinatorial theory for the set of parity alternating permutations is expounded. In view of the numbers of ascents and inversions, several enumerative aspects of the set are investigated. In particular, it is shown that signed Eulerian…
Our main result is a construction of four families C_1,C_2,B_1,B_2 which are equipollent with the power set of the real line R and satisfy the following properties. (i) The members of the families are proper subfields of R whose algebraic…
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…
Schmidt games and the Cantor winning property give alternative notions of largeness, similar to the more standard notions of measure and category. Being intuitive, flexible, and applicable to recent research made them an active object of…
Cameron introduced a bijection between the set of sum-free sets and the set of all zero-one sequences. In this paper, we study the sum-free sets of natural numbers corresponding to certain zero-one sequences which contain the Cantor-like…
We define and study the combinatorial properties of compositional Bernoulli numbers and polynomials within the framework of rational combinatorics.
We study four (families of) sets of algebraic integers of degree less than or equal to three. Apart from being simply defined, we show that they share two distinctive characteristics: almost uniformity and arithmetical independence. Here,…
We provide the first examples of finitely generated simple groups that are amenable (and infinite). This follows from a general existence result on invariant states for piecewise-translations of the integers. The states are obtained by…
We construct "large" Cantor sets whose complements resemble the unit disk arbitrarily well from the point of view of the squeezing function, and we construct "large" Cantor sets whose complements do not resemble the unit disk from the point…
We consider some properties of the intersection of deleted digits Cantor sets with their translates. We investigate conditions on the set of digits such that, for any t between zero and the dimension of the deleted digits Cantor set itself,…
We lay the combinatorial foundations for [ShSt:340] by setting up and proving the essential properties of the coding apparatus for singular cardinals. We also prove another result concerning the coding apparatus for inaccessible cardinals.
In this paper we study a class of random Cantor sets. We determine their almost sure Hausdorff, packing, box, and Assouad dimensions. From a topological point of view, we also compute their typical dimensions in the sense of Baire category.…