David Radcliffe

David Radcliffe

Doctor of Philosophy

About

8
Publications
592
Reads
How we measure 'reads'
A 'read' is counted each time someone views a publication summary (such as the title, abstract, and list of authors), clicks on a figure, or views or downloads the full-text. Learn more
71
Citations
Citations since 2017
1 Research Item
20 Citations
2017201820192020202120222023012345
2017201820192020202120222023012345
2017201820192020202120222023012345
2017201820192020202120222023012345

Publications

Publications (8)
Article
Full-text available
We show that if a group can be represented as a graph product of finite directly indecomposable groups, then this representation is unique. Comment: Published by Algebraic and Geometric Topology at http://www.maths.warwick.ac.uk/agt/AGTVol3/agt-3-37.abs.html
Article
Full-text available
Thesis (Ph. D.)--University of Wisconsin--Milwaukee, 2001. Includes bibliographical references (leaves 46-47). Vita. Microfiche copy: University Microfilms No. 30-21683.
Article
Full-text available
Using elementary techniques, a question named after the famous Russian mathematician I. M. Gelfand is answered. This concerns the leading (i.e., most significant) digit in the decimal expansion of integers 2n , 3n , . . . , 9n . The history of this question, some of which is very recent, is reviewed.
Article
We exhibit a real function that is surjective when restricted to any nonempty open interval.
Article
Full-text available
Sometimes, all you need is a fresh set of eyes. This paper arose when one of the authors, a first-semester calculus student at UW-Milwaukee, asked another of the authors, a newly-minted UWM emeritus professor killing some time in the mathematics resource center, whether the geometric methods used to differentiate sine at the origin by considering a...
Article
Full-text available
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 \ge 1$.
Article
Full-text available
We give an elementary proof that the sum of the digits of $2^n$ in base 10 is greater than $\log_4 n$. In particular, the limit of the sum of digits of $2^n$ is infinite.
Article
Full-text available
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.

Network

Cited By

Projects

Project (1)
Archived project
Sometimes, all you need is a fresh set of eyes. This paper arose when one of the authors, a first-semester calculus student at UW-Milwaukee, asked another of the authors, a newly-minted UWM emeritus professor killing some time in the mathematics resource center, whether the geometric methods used to differentiate sine at the origin by considering areas of triangles and sectors could be brought to bear on a parabola or hyperbola. This immediately brought to mind the hyperbolic sine and cosine, and sure enough, the derivative of hyperbolic sine at the origin is 1.