Work

On a Problem of Douglass and Ono for the Plane Partition Function

Year: 2024

Type: article

Abstract: It is known that the plane partition function of n denoted $$\textrm{PL}(n)$$ PL ( n ) obeys Benford’s law in any integer base $$b\ge 2$$ b ≥ 2 . We give an upper bound for the smallest positive integer n such that $$\textrm{PL}(n)$$ PL ( n ) starts with a prescribed string f of digits in base b.

Source: Annals of Combinatorics

DOI: 10.1007/s00026-024-00728-9

Author: Florian Luca

Institution: Stellenbosch University

Language: English

Topic: Benford’s Law and Fraud Detection

Subfield: Statistics and Probability

Field: Mathematics

Domain: Physical Sciences

Open Access status: hybrid

Estimated APC paid: $2,790

Funders: Magyar Tudományos Akadémia, Universiteit Stellenbosch, Debreceni Egyetem