Related papers: Computing Expansions in Infinitely Many Cantor Rea…
We prove dimension formulas for arihmetic sums of regular Cantor sets, and, more generally, for images of cartesian products of regular Cantor sets by differentiable real maps.
In this article, we consider a simple representation for real numbers and propose top-down procedures to approximate various algebraic and transcendental operations with arbitrary precision. Detailed algorithms and proofs are provided to…
In this paper we discuss several variations and generalizations of the Cantor set and study some of their properties. Also for each of those generalizations a Cantor-like function can be constructed from the set. We will discuss briefly the…
The ternary Cantor set $\mathcal{C}$, constructed by George Cantor in 1883, is the best known example of a perfect nowhere-dense set in the real line. The present article we study the basic properties $\mathcal{C}$ and also study in detail…
We explore a general method based on trees of elementary submodels in order to present highly simplified proofs to numerous results in infinite combinatorics. While countable elementary submodels have been employed in such settings already,…
Given any numeration system, we call carry propagation at a number $N$ the number of digits that are changed when going from the representation of $N$ to the one of $N+1$, and amortized carry propagation the limit of the mean of the carry…
A 1910 theorem of Brouwer characterizes the Cantor set as the unique totally disconnected, compact metric space without isolated points. A 1920 theorem of Sierpinski characterizes the rationals as the unique countable metric space without…
Cellular automata are investigated towards their ability to compute transductions, that is, to transform inputs into outputs. The families of transductions computed are classified with regard to the time allowed to process the input and to…
Expansion is an operation on typings (i.e., pairs of typing environments and result types) defined originally in type systems for the lambda-calculus with intersection types in order to obtain principal (i.e., most informative, strongest)…
Recently, Bagno, Garber and Mansour studied a kind of excedance number on the complex reflection groups and computed its multidistribution with the number of fixed points on the set of involutions in these groups. In this note, we consider…
We consider digits-deleted sets or Cantor-type sets with $\beta$-expansions. We calculate the Hausdorff dimension $d$ of these sets and show that $d$ is continuous with respect to $\beta$. The $d$-dimentional Hausdorff measure of these sets…
This thesis concentrates on the development and application of rewriting and Groebner basis methods to a range of combinatorial problems. Chapter Two contains the most important result, which is the application of Knuth-Bendix procedures to…
We generalize the greedy and lazy $\beta$-transformations for a real base $\beta$ to the setting of alternate bases $\boldsymbol{\beta}=(\beta_0,\ldots,\beta_{p-1})$, which were recently introduced by the first and second authors as a…
We tackle the issue of representing infinite sets of real- valued vectors. This paper introduces an operator for combining integer and real sets. Using this operator, we decompose three well-known logics extending Presburger with reals. Our…
In this paper we use the additive thermodynamic formalism to obtain new bounds of the Hausdorff and box-counting dimension of certain non conformal hyperbolic repellers defined by $C^r$, $r > 1$ piecewise expanding maps on a $d$-dimensional…
Multipolar expansions are a foundational tool for describing basis functions in quantum mechanics, many-body polarization, and other distributions on the unit sphere. Progress on these topics is often held back by complicated and competing…
We investigate the connections between computability theory and Nonstandard Analysis. In particular, we investigate the two following topics and show that they are intimately related. (T.1) A basic property of Cantor space $2^{\mathbb{N}}$…
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.
Bobkov (J. Theoret. Probab. 18(2) (2005) 399-412) investigated an approximate de Finetti representation for probability measures, on product measurable spaces, which are symmetric under permutations of coordinates. One of the main results…
Abstract numeration systems encode natural numbers using radix ordered words of an infinite regular language and linear recurrence sequences play a key role in their valuation. Sequence automata, which are deterministic finite automata with…