Matthew Just

most citedOn upper bounds for the count of elite primes

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

collaborators

Showing math.COShow all

3 papers · 1 filter

math.CO2021

Anti-palindromic compositions

George E. Andrews, Matthew Just, Greg Simay

A palindromic composition of $n$ is a composition of $n$ which can be read the same way forwards and backwards. In this paper we define an anti-palindromic composition of $n$ to be…

math.CO2021

Compositions that are palindromic modulo $m$

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…

math.CO2021

On a divisor of the central binomial coefficient

Matthew Just, Maxwell Schneider

It is well known that for all $n \geq 1$ the number $n + 1$ is a divisor of the central binomial coefficient $(n 2 n)$ . Since the $n$ th central binomial coefficient equals the n…

Anti-palindromic compositions

Compositions that are palindromic modulo m

On a divisor of the central binomial coefficient

Compositions that are palindromic modulo $m$