English
Related papers

Related papers: Substitutions over infinite alphabet generating (-…

200 papers

We say the sets of nonnegative integers A and B are additive complements if their sum contains all sufficiently large integers. In this paper we prove a conjecture of Chen and Fang about additive complement of a finite set.

Number Theory · Mathematics 2013-04-26 Sándor Z. Kiss , Eszter Rozgonyi , Csaba Sándor

From the works of Rauzy and Thurston, we know how to construct (multiple) tilings of some Euclidean space using the conjugates of a Pisot unit $\beta$ and the greedy $\beta$-transformation. In this paper, we consider different…

Dynamical Systems · Mathematics 2012-02-21 Charlene Kalle , Wolfgang Steiner

Let $\beta > 1$ be a real number and $(\epsilon_1(x, \beta), \epsilon_2(x, \beta), \ldots)$ be the $\beta$-expansion of a point $x \in (0, 1]$. For all $x \in (0,1]$, let $A(D(x))$ be the set of accumulation points of $\frac{-\log_\beta…

Dynamical Systems · Mathematics 2016-12-16 Lixuan Zheng , Min Wu , Bing Li

We extend the inflationary fixed-point logic, IFP, with a new kind of second-order quantifiers which have (poly-)logarithmic bounds. We prove that on ordered structures the new logic $\exists^{\log^{\omega}}\text{IFP}$ captures the limited…

Logic in Computer Science · Computer Science 2022-09-07 Kexu Wang , Xishun Zhao

We study the structure of the language of binary cube-free words. Namely, we are interested in the cube-free words that cannot be infinitely extended preserving cube-freeness. We show the existence of such words with arbitrarily long finite…

Formal Languages and Automata Theory · Computer Science 2011-08-19 Elena A. Petrova , Arseny M. Shur

We describe how previously known methods for determining the number of decimation classes of density $\delta$ binary vectors can be extended to nonnegative integer vectors, where the vectors are indexed by a finite abelian group $G$ of size…

Combinatorics · Mathematics 2025-05-27 Daniel M. Baczkowski , Dursun A. Bulutoglu

It is well-known that point-set topology (without additional structure) lacks the capacity to generalize the analytic concepts of completeness, boundedness, and other typically-metric properties. The ability of metric spaces to capture this…

General Topology · Mathematics 2010-11-18 Annie Carter , Daniel Lithio , Robert Niichel , Tristan Tager

We prove the undecidability of MSO on $\omega$-words extended with the second-order predicate $U_1(X)$ which says that the distance between consecutive positions in a set $X \subseteq \mathbb{N}$ is unbounded. This is achieved by showing…

Logic in Computer Science · Computer Science 2023-06-22 Mikołaj Bojańczyk , Laure Daviaud , Bruno Guillon , Vincent Penelle , A. V. Sreejith

Asymptotic approximations of Jacobi polynomials are given for large values of the $\beta$-parameter and of their zeros. The expansions are given in terms of Laguerre polynomials and of their zeros. The levels of accuracy of the…

Classical Analysis and ODEs · Mathematics 2018-07-18 Amparo Gil , Javier Segura , Nico M. Temme

We introduce a model-complete theory which completely axiomatizes the structure $Z_{\alpha}=(Z, +, 0, 1, f)$ where $f : x \to \lfloor{\alpha} x \rfloor $ is a unary function with $\alpha$ a fixed transcendental number. When $\alpha$ is…

Logic · Mathematics 2025-10-16 Mohsen Khani , Ali N. Valizadeh , Afshin Zarei

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

We consider a one dimensional affine switched system obtained from a formal limit of a two dimensional linear system. We show this is equivalent to minimising the average digit in beta representations with unrestricted digits. We give a…

Optimization and Control · Mathematics 2025-09-11 Carl P. Dettmann

In the several contexts such as combinatorial number theory, families of sets of positive integers closed under taking subsets have been investigated. Then it is sometimes useful to give bijections between the set of the one-sided infinite…

Combinatorics · Mathematics 2024-12-31 Shoichi Kamada

The lazy algorithm for a real base $\beta$ is generalized to the setting of Cantor bases $\boldsymbol{\beta}=(\beta_n)_{n\in \mathbb{N}}$ introduced recently by Charlier and the author. To do so, let $x_{\boldsymbol{\beta}}$ be the greatest…

Combinatorics · Mathematics 2022-02-02 Célia Cisternino

Let $1<\beta<2$. Given any $x\in[0, (\beta-1)^{-1}]$, a sequence $(a_n)\in\{0,1\}^{\mathbb{N}}$ is called a $\beta$-expansion of $x$ if $x=\sum_{n=1}^{\infty}a_n\beta^{-n}.$ For any $k\geq 1$ and any $(b_1b_2\cdots b_k)\in\{0,1\}^{k}$, if…

Dynamical Systems · Mathematics 2017-03-08 Karma Dajani , Kan Jiang

The measured $ft$-values for superallowed $0^{+} \to 0^{+}$ nuclear $\beta$-decay can be used to obtain the value of the vector coupling constant and thus to test the unitarity of the Cabibbo-Kobayashi-Maskawa matrix. An essential…

Nuclear Theory · Physics 2009-11-07 I. S. Towner , J. C. Hardy

The $\omega$-power of a finitary language L over a finite alphabet $\Sigma$ is the language of infinite words over $\Sigma$ defined by L $\infty$ := {w 0 w 1. .. $\in$ $\Sigma$ $\omega$ | $\forall$i $\in$ $\omega$ w i $\in$ L}. The…

Logic in Computer Science · Computer Science 2020-07-20 Olivier Finkel , Dominique Lecomte

Consider a non-standard numeration system like the one built over the Fibonacci sequence where nonnegative integers are represented by words over $\{0,1\}$ without two consecutive 1. Given a set $X$ of integers such that the language of…

Formal Languages and Automata Theory · Computer Science 2009-07-06 J. Bell , E. Charlier , A. S. Fraenkel , M. Rigo

In [Temme N.M., Special functions. An introduction to the classical functions of mathematical physics, A Wiley-Interscience Publication, John Wiley & Sons, Inc., New York, 1996, Section 11.3.3.1] a uniform asymptotic expansion for the…

Classical Analysis and ODEs · Mathematics 2016-10-26 Gergő Nemes , Adri B. Olde Daalhuis

Let $\Gamma $ be an infinite discrete group and $\mathsf{A}\subset \Gamma $ a nonempty finite subset. The set of permutations $\sigma $ of $\Gamma $ such that $s^{-1}\sigma (s)\in \mathsf{A}$ for every $s\in \Gamma $ can be identified with…

Dynamical Systems · Mathematics 2025-01-10 Hanfeng Li , Klaus Schmidt