Open Access. Powered by Scholars. Published by Universities.®
Discrete Mathematics and Combinatorics Commons™
Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 2 of 2
Full-Text Articles in Discrete Mathematics and Combinatorics
Efficiently Representing The Integer Factorization Problem Using Binary Decision Diagrams, David Skidmore
Efficiently Representing The Integer Factorization Problem Using Binary Decision Diagrams, David Skidmore
All Graduate Plan B and other Reports, Spring 1920 to Spring 2023
Let p be a prime positive integer and let α be a positive integer greater than 1. A method is given to reduce the problem of finding a nontrivial factorization of α to the problem of finding a solution to a system of modulo p polynomial congruences where each variable in the system is constrained to the set {0,...,p − 1}. In the case that p = 2 it is shown that each polynomial in the system can be represented by an ordered binary decision diagram with size less than 20.25log2(α)3 + 16.5log2(α)2 + …
Classifying The Jacobian Groups Of Adinkras, Aaron R. Bagheri
Classifying The Jacobian Groups Of Adinkras, Aaron R. Bagheri
HMC Senior Theses
Supersymmetry is a theoretical model of particle physics that posits a symmetry between bosons and fermions. Supersymmetry proposes the existence of particles that we have not yet observed and through them, offers a more unified view of the universe. In the same way Feynman Diagrams represent Feynman Integrals describing subatomic particle behaviour, supersymmetry algebras can be represented by graphs called adinkras. In addition to being motivated by physics, these graphs are highly structured and mathematically interesting. No one has looked at the Jacobians of these graphs before, so we attempt to characterize them in this thesis. We compute Jacobians through …