8 citations · 11 across the 8 of their papers we have counts for
10 papers
Partition-theoretic model of prime distribution
Aidan Botkin, Madeline L. Dawsey, David J. Hemmer +2
We make an application of ideas from partition theory to a problem in multiplicative number theory. We propose a deterministic model of prime number distribution, from first princi…
A "supernormal" partition statistic
Madeline Locus Dawsey, Matthew Just, Robert Schneider
We study a bijective map from integer partitions to the prime factorizations of integers that we call the "supernorm" of a partition, in which the multiplicities of the parts of pa…
Partition Eisenstein series and semi-modular forms
Matthew Just, Robert Schneider
We identify a class of "semi-modular" forms invariant on special subgroups of , which includes classical modular forms together with complementary classes of funct…
Anti-palindromic compositions
George E. Andrews, Matthew Just, Greg Simay
A palindromic composition of is a composition of which can be read the same way forwards and backwards. In this paper we define an anti-palindromic composition of to be…
Numbers which are only orders of abelian or nilpotent groups
Matthew Just
Refining a result of Erdos and Mays, we give asymptotic series expansions for the functions , the count of for which every group of order is abelian (but n…
Compositions that are palindromic modulo
Matthew Just
In recent work, G. E. Andrews and G. Simay prove a surprising relation involving parity palindromic compositions, and ask whether a combinatorial proof can be found. We extend thei…
On factorizations into coprime parts
Matthew Just, Noah Lebowitz-Lockard
Let and be the number of unordered and ordered factorizations of into integers larger than one. Let and have the additional restriction that the fac…
On a divisor of the central binomial coefficient
Matthew Just, Maxwell Schneider
It is well known that for all the number is a divisor of the central binomial coefficient . Since the th central binomial coefficient equals the n…
On upper bounds for the count of elite primes
Matthew Just
We look at upper bounds for the count of certain primes related to the Fermat numbers called elite primes. We first note an oversight in a result of Krizek, Luca an…
Variations on a theme of Schinzel and Wójcik
Matthew Just, Paul Pollack
Schinzel and Wójcik have shown that if are rational numbers not or , then for infinitely many primes , where $\mathrm{ord…