Some properties and applications of non-trivial divisor functions
Autor: | Matthew C. Lettington, S. L. Hill, Martin Neil Huxley, Karl Michael Schmidt |
---|---|
Rok vydání: | 2019 |
Předmět: |
Algebra and Number Theory
Mathematics - Number Theory Divisor Multiplicative function Divisor function Combinatorics symbols.namesake Integer FOS: Mathematics symbols Arithmetic function Number Theory (math.NT) Hypergeometric function 11A25 11A51 11M41 33C20 11B30 Binomial coefficient Dirichlet series Mathematics |
Zdroj: | The Ramanujan Journal. 51:611-628 |
ISSN: | 1572-9303 1382-4090 |
DOI: | 10.1007/s11139-018-0093-9 |
Popis: | The jth divisor function dj , which counts the ordered factorisations of a positive integer into j positive integer factors, is a very well-known multiplicative arithmetic function. However, the non-multiplicative jth non-trivial divisor function cj , which counts the ordered factorisations of a positive integer into j factors each of which is greater than or equal to 2, is rather less well studied. Additionally, we consider the associated divisor function c(r)j , for r≥0 , whose definition is motivated by the sum-over divisors recurrence for dj . We give an overview of properties of dj , cj and c(r)j , specifically regarding their Dirichlet series and generating functions as well as representations in terms of binomial coefficient sums and hypergeometric series. Noting general inequalities between the three types of divisor function, we then observe how their ratios can be expressed as binomial coefficient sums and hypergeometric series, and find explicit Dirichlet series and Euler products for some of these. As an illustrative application of the non-trivial and associated divisor functions, we show how they can be used to count principal reversible square matrices of the type considered by Ollerenshaw and Brée and so sum-and-distance systems of integers. |
Databáze: | OpenAIRE |
Externí odkaz: |