David G. Radcliffe

activity

19992025

most citedRigidity of graph products of groups

25 citations · 41 across the 6 of their papers we have counts for

collaborators

6 papers

math.NT2025

Elementary Bounds on Digital Sums of Powers, Factorials, and LCMs

David G. Radcliffe

We prove logarithmic lower bounds on digital sums of powers, multiples of powers, factorials, and the least common multiple of ${1, \dots, n}$ , using only elementary number theor…

math.NT2016

A product rule for triangular numbers

David G. Radcliffe

We prove that there are exactly five sequences, including the triangular numbers, that satisfy the product rule $T (mn) = T (m) T (n) + T (m - 1) T (n - 1)$ for all $m, n \geq 1$ .

math.NT2016

The growth of digital sums of powers of 2

David G. Radcliffe

We give an elementary proof that the sum of the digits of $2^{n}$ in base 10 is greater than $lo g_{4} n$ . In particular, the limit of the sum of digits of $2^{n}$ is infinite.

math.GR2010

Hyperreflection groups

David G. Radcliffe

We introduce the concept of hyperreflection groups, which are a generalization of Coxeter groups. We prove the Deletion and Exchange Conditions for hyperreflection groups, and we d…

math.GR2002★ 25 cited

Rigidity of graph products of groups

David G. Radcliffe

We show that if a group can be represented as a graph product of finite directly indecomposable groups, then this representation is unique.

math.GR1999★ 16 cited

Rigidity of Right-Angled Coxeter Groups

David G. Radcliffe

If S and S' are two finite sets of Coxeter generators for a right-angled Coxeter group W, then the Coxeter systems (W,S) and (W,S') are equivalent.