Related papers: On multiplicative automatic sequences

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…

The Dixmier-Moeglin Equivalence (for short, the DM-equivalence) is the equivalence of three distinguishing properties of prime ideals in a non-commutative algebra A. These properties are of (i) being primitive, (ii) being rational, and…

We introduce the notion of isoclinism between central extensions in the category of algebras with bracket. We provide several equivalent conditions under which algebras with bracket are isoclinic. We also study the connection between…

In this article we study in depth the Dirichlet theorem, which states that if a, b are relative prime integers, the sequence p = an + b contains infinite prime numbers, we simplify and generalize this theorem, we enunciate some special…

We study Dirichlet series arising as linear functionals on an inner product space of meromorphic functions and establish a relation between the discontinuities of the former on the boundary and the poles and zeros of the latter on the…

It is a classic result that two number fields have equal Dedekind zeta functions if and only if the arithmetic type of a prime $p$ is the same in both fields for almost all prime $p$. Here, almost all means with the possible exception of a…

We study logarithmically averaged binary correlations of bounded multiplicative functions $g_1$ and $g_2$. A breakthrough on these correlations was made by Tao, who showed that the correlation average is negligibly small whenever $g_1$ or…

We study the distribution of prime numbers under the unlikely assumption that Siegel zeros exist. In particular we prove for \[ \sum_{n \leq X} \Lambda(n) \Lambda(\pm n+h) \] an asymptotic formula which holds uniformly for $h = O(X)$. Such…

A sequence in an additively written abelian group is called zero-free if each of its nonempty subsequences has sum different from the zero element of the group. The article determines the structure of the zero-free sequences with lengths…

In a recent paper, Jason P. Bell and Jeffrey Shallit introduced the notion of {\em Lie complexity} and proved that the Lie complexity function of an automatic sequence is automatic. In this note, we give more facts concerning Lie complexity…

We show that an asymptotic property of the determinants of certain matrices whose entries are finite sums of cotangents with rational arguments is equivalent to the GRH for odd Dirichlet characters. This is then connected to the existence…

Recently it has been shown that any regular simple symmetric operator with deficiency indices (1,1) is unitarily equivalent to the operator of multiplication in a reproducing kernel Hilbert space of functions on the real line with the…

We extend a result of Bump et al. to show that a large family of Sheffer sequences has their zeros - up to perhaps a finite number of exceptions - on a vertical line. We connect a particular such sequence to the Riemann zeta function via a…

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…

We show that the symbol of a bounded composition operator on the Wiener algebra of Dirichlet series does not need to belong to this algebra. Our example even gives an absolutely summing (hence compact) composition operator.

Let $X$, $B$ and $Y$ be three Dirichlet, Bernoulli and beta independent random variables such that $X\sim \mathcal{D}(a_0,...,a_d),$ such that $\Pr(B=(0,...,0,1,0,...,0))=a_i/a$ with $a=\sum_{i=0}^da_i$ and such that $Y\sim \beta(1,a).$ We…

Proving a conjecture of Miller, we show that as $n$ tends to infinity almost all entries in the character table of $S_n$ are divisible by any given prime power. This extends our earlier work which treated divisibility by primes.

The main question of this paper is the following: how much cancellation can the partial sums restricted to the $k$-free integers up to $x$ of a $\pm 1$ multiplicative function $f$ be in terms of $x$? Building upon the recent paper by Q.…

We introduce a class of iterated logarithmic Lipschitz spaces $\mathcal{L}^{(k)}$, $k\in\mathbb{N}$, on an infinite tree which arise naturally in the context of operator theory. We characterize boundedness and compactness of the…

Let L be an infinite regular language on a totally ordered alphabet (A,<). Feeding a finite deterministic automaton (with output) with the words of L enumerated lexicographically with respect to < leads to an infinite sequence over the…