Related papers: On completely multiplicative automatic sequences

Let $\chi$ be a primitive Dirichlet character modulo $q$ and $L(s,\chi)$ be the Dirichlet L-function associated to $\chi$. Using a new two-piece mollifier we show that $L(\tfrac{1}{2},\chi)\ne0$ for at least 34% of the characters in the…

In this paper, we study a class of generalized intersection matrix Lie algebras $\gim(M_n)$, and prove that its every finite-dimensional semi-simple quotient is of type $M(n,{\bf a}, {\bf c},{\bf d})$. Particularly, any finite dimensional…

Automatic sequences have many properties that other sequences (in particular, non-uniformly morphic sequences) do not necessarily share. In this paper we survey a number of different methods that can be used to prove that a given sequence…

A real sequence $(b_k)_{k=0}^\infty$ is called totally positive if all minors of the infinite matrix $ \left\| b_{j-i} \right\|_{i, j =0}^\infty$ are nonnegative (here $b_k=0$ for $k<0$). In this paper, we investigate the problem of…

In some particular cases we give criteria for morphic sequences to be almost periodic (=uniformly recurrent). Namely, we deal with fixed points of non-erasing morphisms and with automatic sequences. In both cases a polynomial-time algorithm…

We completely characterize perfect, permutative, irreducible representations of an ultragraph Leavitt path algebra. For this we extend to ultragraph Leavitt path algebras Chen's construction of irreducible representations of Leavitt path…

We prove that the Dirichlet $L$-functions associated with Dirichlet characters in $\mathbb{F}_{q}[x]$ are universal. That is, given a modulus of high enough degree, $L$-functions with characters to this modulus can be found that approximate…

Fix a finite set $S \subset {GL}(k,\mathbb{Z})$. Denote by $a_n$ the number of products of matrices in $S$ of length $n$ that are equal to 1. We show that the sequence $\{a_n\}$ is not always P-recursive. This answers a question of…

In this paper, the construction of finite-length binary sequences whose nonlinear complexity is not less than half of the length is investigated. By characterizing the structure of the sequences, an algorithm is proposed to generate all…

A set is called recurrent if its minimal automaton is strongly connected and birecurrent if it is recurrent as well as its reversal. We prove a series of results concerning birecurrent sets. It is already known that any birecurrent set is…

We prove that deciding whether a given input word contains as subsequence every possible permutation of integers $\{1,2,\ldots,n\}$ is coNP-complete. The coNP-completeness holds even when given the guarantee that the input word contains as…

The distinguishing result of this paper is a $\mathbf{P}$-time enumerable partition of all the potential perfect matchings in a bipartite graph. This partition is a set of equivalence classes induced by the missing edges in the potential…

Turyn-type sequences, TT(n), are quadruples of {+,-1}-sequences (A;B;C;D), with lengths n,n,n,n-1 respectively, where the sum of the nonperiodic autocorrelation functions of A,B and twice that of C,D is a delta-function (i.e., vanishes…

The $N$th linear complexity of a sequence is a measure of predictability. Any unpredictable sequence must have large $N$th linear complexity. However, in this paper we show that for $q$-automatic sequences over $\mathbb{F}_q$ the converse…

We discuss the use of negative bases in automatic sequences. Recently the theorem-prover Walnut has been extended to allow the use of base (-k) to express variables, thus permitting quantification over Z instead of N. This enables us to…

We prove that certain quotients of entire functions are characteristic functions. Under some conditions, the probability measure corresponding to a characteristic function of that type has a density which can be expressed as a generalized…

Let $k\ge 2$. We prove that the characteristic sequence of a regular language over a $k$-letter alphabet is $k$-automatic. More generally, if $t\ge 2$ and $t,k$ are multiplicatively dependent, we show that the characteristic sequence of a…

B\"uchi's problem asks whether there exists a positive integer $M$ such that any sequence $(x_n)$ of at least $M$ integers, whose second difference of squares is the constant sequence $(2)$, satisifies $x_n^2=(x+n)^2$ for some $x\in\Z$. A…

In this article, we characterize completely alternating functions on an abelian semigroup $S$ in terms of completely monotone functions on the product semigroup $S\times \mathbb Z_+$. We also discuss completely alternating sequences induced…

It is well-known that for any non-constant polynomial $P$ with integer coefficients the sequence $(P(n))_{ n\in \mathbb N}$ has the property that there are infinitely many prime numbers dividing at least one term of this sequence.…