English
Related papers

Related papers: Substitutions and Cantor real numeration systems

200 papers

Suppose that $\mathcal{C}$ is the space of all middle Cantor sets. We characterize all triples $(\alpha,~\beta,~\lambda)\in \mathcal{C}\times\mathcal{C}\times \mathbb{R}^*$ that satisfy $C_\alpha- \lambda C_\beta=[-\lambda,~1]. $ Also all…

Dynamical Systems · Mathematics 2016-08-24 M. Pourbarat

We study periodic expansions in positional number systems with a base $\beta\in\C,\ |\beta|>1$, and with coefficients in a finite set of digits $\A\subset\C.$ We are interested in determining those algebraic bases for which there exists…

Number Theory · Mathematics 2016-04-13 Simon Baker , Zuzana Masáková , Edita Pelantová , Tomáš Vávra

We prove that for a finite set of points $X$ in the projective $n$-space over any field, the Betti number $\beta_{n,n+1}$ of the coordinate ring of $X$ is non-zero if and only if $X$ lies on the union of two planes whose sum of dimension is…

Commutative Algebra · Mathematics 2024-11-12 Hailong Dao , Ben Lund , Sreehari Suresh-Babu

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…

General Mathematics · Mathematics 2014-04-28 Enrique Coiras

We prove the Pisot Conjecture for beta-substitutions: If beta is a Pisot number, the tiling dynamical system associated with the beta-substitution has pure discrete spectrum. As corollaries: (1) arithmetical coding of the hyperbolic…

Dynamical Systems · Mathematics 2016-09-28 Marcy Barge

Generalizations of numeration systems in which N is recognizable by a finite automaton are obtained by describing a lexicographically ordered infinite regular language L over a finite alphabet A. For these systems, we obtain a…

Computational Complexity · Computer Science 2007-05-23 Michel Rigo

Beta-integers (``$\beta$-integers'') are those numbers which are the counterparts of integers when real numbers are expressed in irrational basis $\beta > 1$. In quasicrystalline studies $\beta$-integers supersede the ``crystallographic''…

Mathematical Physics · Physics 2009-11-13 L. Balková , J. P. Gazeau , E. Pelantová

The well known binary and decimal representations of the integers, and other similar number systems, admit many generalisations. Here, we investigate whether still every integer could have a finite expansion on a given integer base b, when…

Number Theory · Mathematics 2008-10-03 Christiaan van de Woestijne

Let $\beta>1$ be fixed. We consider the $(\frak{b, d})$ numeration system, where the base ${\frak b}=(b_k)_{k\geq 0}$ is a sequence of positive real numbers satisfying $\lim_{k\rightarrow \infty}b_{k+1}/b_k=\beta$, and the set of digits…

Number Theory · Mathematics 2023-05-02 Nian Hong Zhou

We propose a refinement of the Betti numbers and of the homology with coefficients in a field of a compact ANR in the presence of a continuous real valued function. The refinement of Betti numbers consists of finite configurations of points…

Algebraic Topology · Mathematics 2018-03-16 Dan Burghelea

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…

Number Theory · Mathematics 2015-05-13 Zhi-Xiong Wen , Wen Wu , Jie-Meng Zhang

In this paper, we prove results on enumerations of sets of Rota-Baxter words in a finite number of generators and a finite number of unary operators. Rota-Baxter words are words formed by concatenating generators and images of words under…

Rings and Algebras · Mathematics 2013-02-05 Li Guo , William Y. Sit

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…

Formal Languages and Automata Theory · Computer Science 2025-05-05 Olivier Carton , Jean-Michel Couvreur , Martin Delacourt , Nicolas Ollinger

We say that a set is exhaustible if it admits algorithmic universal quantification for continuous predicates in finite time, and searchable if there is an algorithm that, given any continuous predicate, either selects an element for which…

Logic in Computer Science · Computer Science 2015-07-01 Martin Escardo

We consider positional numeration system with negative base $-\beta$, as introduced by Ito and Sadahiro. In particular, we focus on arithmetical properties of such systems when $\beta$ is a quadratic Pisot number. We study a class of roots…

Number Theory · Mathematics 2010-11-08 Z. Masáková , T. Vávra

Cantor's ternary function is generalized to arbitrary base-change functions in non-integer bases. Some of them share the curious properties of Cantor's function, while others behave quite differently.

Classical Analysis and ODEs · Mathematics 2016-05-06 Claudio Baiocchi , Vilmos Komornik , Paola Loreti

Using the classic two's complement notation of signed integers, the fundamental arithmetic operations of addition, subtraction, and multiplication are identical to those for unsigned binary numbers. We introduce a Fibonacci-equivalent of…

Formal Languages and Automata Theory · Computer Science 2024-02-27 Sébastien Labbé , Jana Lepšová

This article studies the expressive power of finite automata recognizing sets of real numbers encoded in positional notation. We consider Muller automata as well as the restricted class of weak deterministic automata, used as symbolic set…

Logic in Computer Science · Computer Science 2015-07-01 Bernard Boigelot , Julien Brusten , Veronique Bruyere

We study the numeration system with negative basis, introduced by Ito and Sadahiro. We focus on arithmetic operations in the set ${\rm Fin}(-\beta)$ and $\Z_{-\beta}$ of numbers having finite resp. integer $(-\beta)$-expansions. We show…

Number Theory · Mathematics 2010-12-17 Z. Masáková , E. Pelantová , T. Vávra

Let $(\alpha,\mathcal{N}_{\alpha})$ and $(\beta,\mathcal{N}_{\beta})$ be two canonical number systems for an imaginary quadratic number field $K$ such that $\alpha$ and $\beta$ are multiplicatively independent. We provide an effective lower…

Number Theory · Mathematics 2023-11-30 Divyum Sharma