Category Archives: OJDM

Author: Shiv Gupta ABSTRACT The polynomial x4+1 is irreducible in Ζ[x] but is locally reducible, that is, it factors modulo p for all primes p. In this paper we investigate this phenomenon and prove that for any composite natural number … Continue reading →

Author: Talal Al-Hawary ABSTRACT In this paper, we prove an analogous to a result of Erdös and Rényi and of Kelly and Oxley. We also show that there are several properties of k-balanced matroids for which there exists a threshold … Continue reading →

Author(s): Nathan Hamlin ABSTRACT With the challenge of quantum computing ahead, an analysis of number and representation adequate to the task is needed. Some clarifications on the combinatorial nature of representation are presented here; this is related to the foundations … Continue reading →