相关论文: Synchronizing automatic sequences along Piatetski-…
We study Piatetski-Shapiro sequences $(\lfloor n^c\rfloor)_n$ modulo m, for non-integer $c >1$ and positive $m$, and we are particularly interested in subword occurrences in those sequences. We prove that each block $\in\{0,1\}^k$ of length…
Integer sequences of the form $\lfloor n^c\rfloor$, where $1<c<2$, can be locally approximated by sequences of the form $\lfloor n\alpha+\beta\rfloor$ in a very good way. Following this approach, we are led to an estimate of the difference…
Exponential sums with monomials are highly related to many interesting problems in number theory and well studied by many literatures. In this paper, we consider the exponential sums with polynomials and prove a new upper bound. As an…
The Piatetski-Shapiro sequences are of the form $\mathcal{N}_{c} := (\lfloor n^{c} \rfloor)_{n=1}^\infty$, where $\lfloor \cdot \rfloor$ is the integer part. It is expected that there are infinitely many primes in a Piatetski-Shapiro…
The sequence $$ \mathbb{P}^{(c)}=(\lfloor p^c \rfloor)_{p\in \mathbb{P}}\quad (c>0,c\notin \mathbb{N}), $$ is an important subsequence of the well-known Piatetski-Shapiro sequence, where $\mathbb{P}$ is the set of prime numbers and $\lfloor…
We study extremal and algorithmic questions of subset and careful synchronization in monotonic automata. We show that several synchronization problems that are hard in general automata can be solved in polynomial time in monotonic automata,…
The Piatetski-Shapiro sequences are of the form ${\mathcal{N}}^{(c)} := (\lfloor n^c \rfloor)_{n=1}^\infty$ with $c > 1, c \not\in \mathbb{N}$. In this paper, we study the distribution of pairs $(p, p^{\#})$ of consecutive primes such that…
For a non-integral real number $c>1$, let $\mathbb{N}_{(c)}:=\{\lfloor n^c\rfloor ~|~ n\in\mathbb{N}\}$. We show that $\mathbb{N}_{(c)}$ contains thin subbases of every order $h\geq 5$ when $1<c<2$, and $h\geq (\lfloor 2c\rfloor+1)(\lfloor…
Zielonka's theorem shows that each regular set of Mazurkiewicz traces can be implemented as a system of synchronized processes with a distributed control structure called asynchronous automaton. This paper gives a polynomial algorithm for…
We show that the subword complexity function p_x(n), which counts the number of distinct factors of length n of a sequence x, is k-synchronized in the sense of Carpi if x is k-automatic. As an application, we generalize recent results of…
In this paper we develop a method to transfer density results for primitive automatic sequences to logarithmic-density results for general automatic sequences. As an application we show that the logarithmic densities of any automatic…
We consider various arithmetic questions for the Piatetski-Shapiro sequences $\fl{n^c}$ ($n=1,2,3,...$) with $c>1$, $c\not\in\N$. We exhibit a positive function $\theta(c)$ with the property that the largest prime factor of $\fl{n^c}$…
This article consists to give a necessary and sufficient condition of the meromorphic continuity of Dirichlet series defined as $\sum_{x\in \mathbf{N}^n} \frac{a_{x}}{P(x)^s}$, Where $a_{x}$ is a $q$-automatic sequence of $n$ parameters and…
Let $\alpha$ and $\beta$ belong to the same quadratic field. We show that the inhomogeneous Beatty sequence $(\lfloor n \alpha + \beta \rfloor)_{n \geq 1}$ is synchronized, in the sense that there is a finite automaton that takes as input…
Let $\alpha,\beta$ be real numbers such that $\alpha>1$ is irrational and of finite type, and let $c$ be a real number in the range $1<c<\frac{14}{13}$. In this paper, it is shown that there are infinitely many Piatetski-Shapiro primes $p =…
We prove that the property of being closed (resp., palindromic, rich, privileged trapezoidal, balanced) is expressible in first-order logic for automatic (and some related) sequences. It therefore follows that the characteristic function of…
By using the work of Frantzikinakis and Wierdl, we can see that for all $d\in\mathbb{N}$, $\alpha\in(d,d+1)$, and integers $k\ge d+2$ and $r\ge1$, there exist infinitely many $n\in\mathbb{N}$ such that the sequence…
Automatic sequences are not suitable sequences for cryptographic applications since both their subword complexity and their expansion complexity are small, and their correlation measure of order 2 is large. These sequences are highly…
Denote by p_k the k-th power sum symmetric polynomial n variables. The interpretation of the q-analogue of the binomial coefficient as Hilbert function leads us to discover that n consecutive power sums in n variables form a regular…
The $n$th term of an automatic sequence is the output of a deterministic finite automaton fed with the representation of $n$ in a suitable numeration system. In this paper, instead of considering automatic sequences built on a numeration…