most citedArithmetic of idempotents in

2 citations · 5 across the 5 of their papers we have counts for

collaborators

6 papers

math.NT2021

Binary Signed-Digit Integers and the Stern Polynomial

Laura Monroe

The binary signed-digit representation of integers is used for efficient computation in various settings. The Stern polynomial is a polynomial extension of the well-studied Stern d…

cs.DM20211 cited

A Class of Trees Having Near-Best Balance

Laura Monroe

Full binary trees naturally represent commutative non-associative products. There are many important examples of these products: finite-precision floating-point addition and NAND g…

math.NT20212 cited

Binary Signed-Digit Integers and the Stern Diatomic Sequence

Laura Monroe

Stern's diatomic sequence is a well-studied and simply defined sequence with many fascinating characteristics. The binary signed-digit representation of integers is an alternative…

math.NT2021

Binary Signed-Digit Integers, the Stern Diatomic Sequence and Stern Polynomials

Laura Monroe

Stern's diatomic sequence is a well-studied and simply defined sequence with many fascinating characteristics. The binary signed-digit (BSD) representation of integers is used wide…

math.RA20202 cited

Arithmetic of idempotents in

Kelly Isham, Laura Monroe

Idempotent elements are a well-studied part of ring theory, with several identities of the idempotents in already known. Although the idempotents are not c…

math.CO2020

On structures induced by the power sequences of \mathbb{Z}/ m\mathbb{Z}

Kelly Isham, Laura Monroe

In this paper, we explore the structure of in terms of its orbits under modular exponentiation, illustrating this with a sequential power graph that is na…