相关论文: On completely multiplicative automatic sequences

We show that various aspects of k-automatic sequences -- such as having an unbordered factor of length n -- are both decidable and effectively enumerable. As a consequence it follows that many related sequences are either k-automatic or…

Let $\mathcal{A}$ and $\mathcal{B}$ be two algebras, let $\mathcal{M}$ be a $\mathcal{B}$-bimodule and let $n$ be a positive integer. A linear mapping $D_n:\mathcal{A} \rightarrow \mathcal{M}$ is called a strongly generalized derivation of…

In this work we extend our study on a link between automaticity and certain algebraic power series over finite fields. Our starting point is a family of sequences in a finite field of characteristic $2$, recently introduced by the first…

An automatic sequence is a letter-to-letter coding of a fixed point of a uniform morphism. More generally, we have morphic sequences, which are letter-to-letter codings of fixed points of arbitrary morphisms. There are many examples where…

Let $t_n = (-1)^{s_2(n)}$, where $s_2(n)$ is the sum of binary digits function. The sequence $(t_n)_{n\in \mathbb N}$ is the well-known Prouhet-Thue-Morse sequence. In this note we initiate the study of the sequence $(h_n)_{n\in \mathbb…

We show generic existence of power series a with complex coefficients a_n, such that the sequence of partial sums of a new power series where its coefficients b_n are functions of a_0, a_1, ..., a_n approximate every polynomial uniformly on…

In this paper we introduce a class of sequences connected with the $m$--ary partition function and investigate their congruence properties. In particular, we get facts about the sequences of $m$--ary partitions $(b_{m}(n))_{m\in\mathbb{N}}$…

We consider Dynkin algebras, these are the hereditary artin algebras of finite representation type. The indecomposable modules for a Dynkin algebra correspond bijectively to the positive roots of a Dynkin diagram. Given a Dynkin algebra…

Morphic sequences form a natural class of infinite sequences, extending the well-studied class of automatic sequences. Where automatic sequences are known to have several equivalent characterizations and the class of automatic sequences is…

Let $\pi$ be an irreducible, cuspidal automorphic representation of $GL_n(\mathbb{A}_\mathbb{Q})$ ($n\geq 3$), which is tempered only for $n=3$. Let $s$ be a complex number such that $\Re(s)\notin \left[1/n, 1-1/n\right]$ if $n\neq 4$;…

We study automatic sequences and automatic systems generated by general constant length (nonprimitive) substitutions. While an automatic system is typically uncountable, the set of automatic sequences is countable, implying that most…

We classify all the irreducible characters of a symmetric group such that the induced immanant function $d_{\chi}$ vanishes identically on alternate matrices with the entries in the complex field.

In this paper, we prove that a class of regular sequences can be viewed as projections of fixed points of uniform morphisms on a countable alphabet, and also can be generated by countable states automata. Moreover, we prove that the…

Given a finite alphabet $\mathbb{A}$ and a primitive substitution $\theta:\mathbb{A}\to\mathbb{A}^\lambda$ (of constant length $\lambda$), let $(X_\theta,S)$ denote the corresponding dynamical system, where $X_{\theta}$ is the closure of…

In this paper, we prove the simultaneous non-vanishing of four Dirichlet $L$-functions at any point on the critical line. More precisely, let $\chi_1,\ldots,\chi_4$ be even Dirichlet characters modulo $D_1,\ldots, D_4$ respectively, where…

A complete deterministic finite automaton in which every non-empty subset of the state set occurs as the image of the whole state set under the action of a suitable input word is called completely reachable. We characterize completely…

For each non-negative integer $n$ let $\mathcal{A}_n$ be an $n+1$ by $n+1$ Toeplitz matrix over a finite field, $F$, and suppose for each $n$ that $\mathcal{A}_n$ is embedded in the upper left corner of $\mathcal{A}_{n+1}$. We study the…

Let $A_n=(a_1,a_2,\ldots,a_n)$ and $B_n=(b_1,b_2,\ldots,b_n)$ be nonnegative integer sequences with $A_n\le B_n$. The purpose of this note is to give a good characterization such that every integer sequence $\pi=(d_1,d_2,\ldots d_n)$ with…

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…

A deterministic finite automaton in which every non-empty set of states occurs as the image of the whole state set under the action of a suitable input word is called completely reachable. It was conjectured that in each completely…