English
Related papers

Related papers: On completely multiplicative automatic sequences

200 papers

We make a start on one of George McNulty's Dozen Easy Problems: "Which finite automatic algebras are dualizable?" We give some necessary and some sufficient conditions for dualizability. For example, we prove that a finite automatic algebra…

Rings and Algebras · Mathematics 2012-10-05 Wolfram Bentz , Brian A. Davey , Jane G. Pitkethly , Ross Willard

A metric space $\mathbf{X}$ is called densely complete if there exists a dense set $D$ in $\mathbf{X}$ such that every Cauchy sequence of points of $D $ converges in $\mathbf{X}$. One of the main aims of this work is to prove that the…

General Topology · Mathematics 2019-01-28 Kyriakos Keremedis , Eliza Wajch

Completely antipersistent binary time series are sequences in which every time that an $N$-bit string $\mu$ appears, the sequence is continued with a different bit than at the last occurrence of $\mu$. This dynamics is phrased in terms of a…

Disordered Systems and Neural Networks · Physics 2009-11-07 Richard Metzler

The principal permanent rank characteristic sequence is a binary sequence $r_0 r_1 \ldots r_n$ where $r_k = 1$ if there exists a principal square submatrix of size $k$ with nonzero permanent and $r_k = 0$ otherwise, and $r_0 = 1$ if there…

For a nonzero integer n, a set of m distinct nonzero integers {a_1,a_2,...,a_m} such that a_i a_j + n is a perfect square for all 1 <= i < j <= m, is called a D(n)-m-tuple. In this paper, by using properties of so-called regular Diophantine…

Number Theory · Mathematics 2020-10-12 Andrej Dujella , Vinko Petričević

In this paper, harkening back to ideas of Hardy and Ramanujan, Mahler and de Bruijn, with the addition of more recent results on the Fibonacci Dirichlet series, we determine the asymptotic number of ways $p_F(n)$ to write an integer as the…

Number Theory · Mathematics 2025-03-12 Michael Coons , Simon Kristensen , Mathias L. Laursen

We define the arithmetic self-similarity (AS) of a one-sided infinite sequence sigma to be the set of arithmetic progressions through sigma which are a vertical shift of sigma. We study the AS of several famlies of sequences, viz.…

Combinatorics · Mathematics 2012-05-22 Dimitri Hendriks , Frits G. W. Dannenberg , Joerg Endrullis , Mark Dow , Jan Willem Klop

A superpermutation is a sequence that contains every permutation of $n$ distinct symbols as a contiguous substring. For instance, a valid example for three symbols is a sequence that contains all six permutations. This paper introduces a…

Discrete Mathematics · Computer Science 2025-05-19 Dhruv Ajmera

Let $M$ be a complete Riemannian manifold, $N\in \NN$ and $p\ge 1$. We prove that almost everywhere on $x=(x_1,...,x_N)\in M^N$ for Lebesgue measure in $M^N$, the measure $\di \mu(x)=\f1N\sum_{k=1}^N\d_{x_k}$ has a unique $p$-mean $e_p(x)$.…

Probability · Mathematics 2012-07-16 Marc Arnaudon , Laurent Miclo

In this paper we give a new characterization of simple sets of polynomials B with the property that the set of B-multiplier sequences contains all Q-multiplier sequence for every simple set Q. We characterize sequences of real numbers which…

Complex Variables · Mathematics 2013-10-18 Tamás Forgács , James Tipton , Benjamin Wright

We study the factor complexity and closure properties of automatic sequences based on Parry or Bertrand numeration systems. These automatic sequences can be viewed as generalizations of the more typical $k$-automatic sequences and…

Formal Languages and Automata Theory · Computer Science 2018-10-29 Adeline Massuir , Jarkko Peltomäki , Michel Rigo

We study the notion of an asymptotically automatic sequence, which generalises the notion of an automatic sequence. While $k$-automatic sequences are characterised by finiteness of $k$-kernels, the $k$-kernels of asymptotically…

Number Theory · Mathematics 2024-04-12 Jakub Konieczny

For any $n$ and $k$, we provide an explicit (that is, computable in polynomial time) example of integer $B_k$-sequence of size $n$ consisting of elements bounded by $n^{k+o(k)}$.

Combinatorics · Mathematics 2023-04-11 Igor S. Sergeev

Let $b$ be an algebraic number with $|b|>1$ and $\mathcal{H}$ a finite set of algebraic numbers. We study the transcendence of numbers of the form $\sum_{n=0}^\infty \frac{a_n}{b^n}$ where $a_n \in \mathcal{H}$ for all $n\in\mathbb{N}$. We…

Number Theory · Mathematics 2022-06-13 Florian Luca , Joël Ouaknine , James Worrell

We introduce the notion of an asymptotically equicontinuous sequence of linear operators, and use it to prove the following result. If $X,Y$ are topological vector spaces, if $T_n,T:X\to Y$ are continuous linear maps, and if $D$ is a dense…

Functional Analysis · Mathematics 2023-02-15 Javad Mashreghi , Thomas Ransford

Let $f(n)$ be a multiplicative function satisfying $|f(n)|\leq 1$, $q$ $(\leq N^2)$ be a prime number and $a$ be an integer with $(a,\,q)=1$, $\chi$ be a non-principal Dirichlet character modulo $q$. In this paper, we shall prove that $$…

Number Theory · Mathematics 2014-07-04 Ke Gong , Chaohua Jia

We develop a theory of linear Mahler systems in several variables from the perspective of transcendence and algebraic independence, which also includes the possibility of dealing with several systems associated with sufficiently independent…

Number Theory · Mathematics 2020-12-16 Boris Adamczewski , Colin Faverjon

Let $F$ be an entire function represented by absolutely convergent for all $z\in\mathbb{C}$ Dirichlet series of the form $ F(z) = \sum\nolimits_{n=0}^{+\infty} a_{n}e^{z\lambda_{n}},$\ where a sequence $(\lambda_n)$ such that…

Complex Variables · Mathematics 2015-12-29 S. I. Panchuk , T. M. Salo , O. B. Skaskiv

Parikh-collinear morphisms have the property that all the Parikh vectors of the images of letters are collinear, i.e., the associated adjacency matrix has rank 1. In the conference DLT-WORDS 2023 we showed that fixed points of…

Discrete Mathematics · Computer Science 2024-05-29 Michel Rigo , Manon Stipulanti , Markus A. Whiteland

This paper investigates the class of finitely presented monoids defined by homogeneous (length-preserving) relations from a computational perspective. The properties of admitting a finite complete rewriting system, having finite derivation…

Group Theory · Mathematics 2017-05-16 Alan J. Cain , Robert Gray , António Malheiro