A. Hildebrand

activity

20032022

most citedLongest increasing subsequences in pattern-restricted permutations

43 citations · 53 across the 9 of their papers we have counts for

collaborators

Showing 2018Show all

3 papers · 1 filter

math.NT2018★ 1 cited

A local Benford Law for a class of arithmetic sequences

Zhaodong Cai, A. J. Hildebrand, Junxian Li

It is well-known that sequences such as the Fibonacci numbers and the factorials satisfy Benford's Law, that is, leading digits in these sequences occur with frequencies given by $…

math.NT2018

Almost Beatty Partitions

A. J. Hildebrand, Junxian Li, Xiaomin Li +1

Given $0 < α < 1$ , the Beatty sequence of density $α$ is the sequence $B_{α} = (⌊ n / α ⌋)_{n \in N}$ . Beatty's theorem states that if $α, β$ are irrational numbers with $α+…

math.NT2018★ 2 cited

Complexity of Leading Digit Sequences

Xinwei He, A. J. Hildebrand, Yuchen Li +1

Let $S_{a, b}$ denote the sequence of leading digits of $a^{n}$ in base $b$ . It is well known that if $a$ is not a rational power of $b$ , then the sequence $S_{a, b}$ satisfies Benford…