Multiplicative generalised polynomial sequences

2024/03/26 by Jakub Konieczny, Konieczny, Jakub
Mathematics · Physics and Astronomy · #37A44 #Advanced Mathematical Theories #Advanced Mathematical Theories and Applications #Combinatorics (math.CO) #FOS: Mathematics #Number Theory (math.NT) #Primary: 11J54. Secondary: 11N64

paper · pdf · doi:10.48550/arxiv.2403.17590

openalex publication_date 2024/03/26 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

We fully classify completely multiplicative sequences which are given by generalised polynomial formulae, and obtain a similar result for (not necessarily completely) multiplicative sequences under the additional restriction that the sequence is not zero almost everywhere.

Related

• On completely multiplicative automatic sequences
• Multiplicative automatic sequences
• Pisot numbers, Salem numbers, and generalised polynomials
• (non)-automaticity of completely multiplicative sequences having negligible many non-trivial prime factors
• Factors of generalised polynomials and automatic sequences