Joel A. Henningsen

activity

20202025

most citedCounting the parts divisible by k in all the partitions of n whose parts have multiplicity less than k

1 citations · 1 across the 4 of their papers we have counts for

collaborators

4 papers

math.NA2025

Polynomial Approximation to the Inverse of a Large Matrix

Mark Embree, Joel A. Henningsen, Jordan Jackson +1

The inverse of a large matrix can often be accurately approximated by a polynomial of degree significantly lower than the order of the matrix. The iteration polynomial generated by…

math.NT2021

Generalized Lucas congruences and linear $p$ -schemes

Joel A. Henningsen, Armin Straub

We observe that a sequence satisfies Lucas congruences modulo $p$ if and only if its values modulo $p$ can be described by a linear $p$ -scheme, as introduced by Rowland and Zeilber…

math.CO2021

Partitions With Designated Summands Not Divisible by $2^{l}$ , $2$ , and $3^{l}$ Modulo $2$ , $4$ , and $3$

Daniel Herden, Mark R. Sepanski, Jonathan Stanfill +4

Numerous congruences for partitions with designated summands have been proven since first being introduced and studied by Andrews, Lewis, and Lovejoy. This paper explicitly charact…

math.CO2020★ 1 cited

Counting the parts divisible by k in all the partitions of n whose parts have multiplicity less than k

Daniel Herden, Mark R. Sepanski, Jonathan Stanfill +7

Recent results by Andrews and Merca on the number of even parts in all partitions of n into distinct parts, a(n), were derived via generating functions. This paper extends these re…

Polynomial Approximation to the Inverse of a Large Matrix

Generalized Lucas congruences and linear p-schemes

Partitions With Designated Summands Not Divisible by 2l, 2, and 3l Modulo 2, 4, and 3

Counting the parts divisible by k in all the partitions of n whose parts have multiplicity less than k

Generalized Lucas congruences and linear $p$ -schemes

Partitions With Designated Summands Not Divisible by $2^{l}$ , $2$ , and $3^{l}$ Modulo $2$ , $4$ , and $3$