Positional number systems with digits forming an arithmetic progression (Q1022360): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Sur la fonction sommatoire de la fonction 'somme des chiffres' / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mellin transforms and asymptotics: Digital sums / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Sum-of-Digits Function for Complex Bases / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4320535 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On minimal expansions in redundant number systems: Algorithms and quantitative analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximizing the number of independent subsets over trees with bounded degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4398780 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Applications of binomial measures to power sums of digital sums / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4428920 / rank
 
Normal rank

Latest revision as of 17:14, 1 July 2024

scientific article
Language Label Description Also known as
English
Positional number systems with digits forming an arithmetic progression
scientific article

    Statements

    Positional number systems with digits forming an arithmetic progression (English)
    0 references
    0 references
    0 references
    0 references
    22 June 2009
    0 references
    In this paper a number system that arises in a natural way in a graph-theoretic context is studied. It is defined by a set of positive digits forming an arithmetic progression and complete residue system modulo the base \(b\) The question how the digits are distributed among the first \(N\) integers is addressed. The authors give an explicit formula for the length of the representation and a explicit formula that gives the \(j\)th digit of the representation of \(n\). A Delange type analysis of the frequencies of digits is based upon such an explicit formula. They also study the averages and obtain asymptotic results involving periodic functions that are completely described via their Fourier coefficients. The Mellin-Perron approach is used.
    0 references
    0 references
    0 references
    number system
    0 references
    digit formulae
    0 references
    digit frequencies
    0 references
    Mellin-Perron summation formula
    0 references
    0 references