Kevin G. Hare
University of Waterloo
Network
Latest external collaboration on country level. Dive into details by clicking on the dots.
Publication
Featured researches published by Kevin G. Hare.
Mathematics of Computation | 2002
Peter Borwein; Kevin G. Hare
Properties of Pisot numbers have long been of interest. One line of questioning, initiated by Erdos. Joo and Komornik in 1990. is the determination of l(q) for Pisot numbers q, where l(q) = inf(|y|:y = e0 + e1q1 + ...+ enqn, ei ∈ {±1,0}, y ≠ 0.) Although the quantity l(q) is known for some Pisot numbers q, there has been no general method for computing l(q). This paper gives such an algorithm. With this algorithm, some properties of l(q) and its generalizations are investigated.A related question concerns the analogy of l(q), denoted a(q), where the coefficients are restricted to ±1; in particular, for which non-Pisot numbers is a(q) nonzero? This paper finds an infinite class of Salem numbers where a(q) ≠ 0.
Mathematics of Computation | 2007
Jean-Paul Allouche; Christiane Frougny; Kevin G. Hare
We study Pisot numbers
Mathematics of Computation | 2007
Kevin G. Hare
\beta \in (1, 2)
Bulletin of The Australian Mathematical Society | 2014
Jason P. Bell; Michael Coons; Kevin G. Hare
which are univoque, i.e., such that there exists only one representation of
Mathematics of Computation | 2004
Kevin G. Hare
1
arXiv: Number Theory | 2011
Kevin G. Hare; Shanta Laishram; Thomas Stoll
as
Proceedings of the Waterloo Workshop | 2007
Kevin G. Hare
1 = \sum_{n \geq 1} s_n\beta^{-n}
Rocky Mountain Journal of Mathematics | 2014
Kevin G. Hare; Michael J. Mossinghoff
, with
Lms Journal of Computation and Mathematics | 2010
Kevin G. Hare; Nikita Sidorov
s_n \in \{0, 1\}
Bulletin of The London Mathematical Society | 2003
Peter Borwein; Kevin G. Hare
. We prove in particular that there exists a smallest univoque Pisot number, which has degree