6 papers
Normal Frequency method for finding the existence of maximum clique of the clique-complex
Youngik Lee
Determining the existence of -clique in the arbitrary graph is one of the NP problems. We suggest a novel way to determine the existence of -clique in the clique complex …
Unfolded Adinkra Properties of Supermultiplets (I)
Aleksander J. Cianciara, S. James Gates, Youngik +4
Adinkra networks arise in the Carroll limit of supersymmetric QFT. Extensions of adinkras that are infinite dimensional graphs have never previously been discussed in the literatur…
=2 SUSY and the Hexipentisteriruncicantitruncated 7-Simplex
Aleksander J. Cianciara, Zachary Coleman, S. James Gates +2
We study algorithms for recursively creating arbitrary N-extended `supermultiplets' given minimal matrix representations of off-shell, N = 1 supermultiplet matrices. We observe con…
Numerical Approach for Fermat's last theorem
Youngik Lee
This research focuses on the Numerical approach for Fermat's Last theorem. We can induce an Alternative form of Fermat's last theorem by using particular geometric mapping $\mathca…
Multi-Gaussian fitting Algorithm to determine multi-band photometry and photometric redshifts of LABOCA and Herschel sources in proto-cluster environments
Youngik Lee
This research focuses on identifying high redshift galaxies from LABOCA(LArge APEX BOlometer CAmera) and SPIRE(The Spectral and Photometric Imaging Receiver) maps towards proto-clu…
Verifying the surjective relation between symmetric potential function and its Scattering Matrix in 1D
Youngik Lee
This research focuses on the possibility of the surjective relation between symmetric potential function and its scattering matrix in 1-dimension. The theory bases on the property…