<commit_before># ******************************************************************************
#
# Name:    Outer Product calculation
# Author:  <NAME>
# Email:   Vadim.Korotkikh
# Date:    November 2016
# Version: 1.3
#
# Description:
#
# ******************************************************************************


# ******************************************************************************
# Begin Imports
import math
import sys
import numpy as np
import numpy.matlib
import itertools
from numpy import array

def main():
	pass

# ******************************************************************************
# Main() function.
# def illuminator_of_elles():
def illuminator_of_elfes():

	""" These are the alpha and beta matrices multiplied by 2i
		alpha and beta are results of outerproducts inbetween
		Pauli matrices and Identity matrix They are defined in equtions (4.5)
		in Isaac Chappell II, <NAME>, Jr - 2012
	"""

	alpha1i = np.matrix([[0, 0, 0, 2], [0, 0, 2, 0], [0, -2, 0, 0], [-2, 0, 0, 0]])
	alpha2i = np.matrix([[0, 2, 0, 0], [-2, 0, 0, 0], [0, 0, 0, 2], [0, 0, -2, 0]])
	alpha3i = np.matrix([[0, 0, 2, 0], [0, 0, 0, -2], [-2, 0, 0, 0], [0, 2, 0, 0]])

	# Betas
	beta1i = np.matrix([[0, 0, 0, 2], [0, 0, -2, 0], [0, 2, 0, 0], [-2, 0, 0, 0]])
	beta2i = np.matrix([[0, 0, 2, 0], [0, 0, 0, 2], [-2, 0, 0, 0], [0, -2, 0, 0]])
	beta3i = np.matrix([[0, 2, 0, 0], [-2, 0, 0, 0], [0, 0, 0, -2], [0, 0, 2, 0]])

	# print("alpha 1")
	# print(alpha1i)
	# print("")
	# print("alpha 2")
	# print(alpha2i)
	# print("")
	# print("alpha 3")
	# print(alpha3i)
	# print("")
	# print("beta 1")
	# print(beta1i)
	# print("")
	# print("beta 2")
	# print(beta2i)
	# print("")
	# print("beta 3")
	# print(beta3i)
	# print("")

	abperm_comb = [alpha1i, alpha2i, alpha3i, beta1i, beta2i, beta3i]
	return abperm_comb
	

# ******************************************************************************
# Calculate all the possible +1 and -1 l coefficient combinations
def sign_combimutations():
	combo_l = []

	lsigns = [1,1,1,1,1,1]
	for signs in itertools.product([-1,1], repeat=len(lsigns)):
		temp = np.array([a*sign for a,sign in zip(lsigns,signs)])
		combo_l.append(temp)
		# print(temp)
	# print(len(combo_l))
	return combo_l
<commit_msg>Starting major overhaul of paper code<commit_after># ******************************************************************************
# Name:    Hardcoded Alpha & Beta matrices - times 2i
# Author:  <NAME>
# Email:   Vadim.Korotkikh
# Date:    November 2016
# Version: 1.3
#
# Description:
#
# ******************************************************************************


# ******************************************************************************
# Begin Imports
import sys, math, itertools
import numpy as np
import numpy.matlib
from numpy import array

def main():
	pass

# ******************************************************************************
# Main() function.
# def illuminator_of_elles():
def illuminator_of_elfes():

	""" These are the alpha and beta matrices multiplied by 2i
		alpha and beta are results of outerproducts inbetween
		Pauli matrices and Identity matrix They are defined in equtions (4.5)
		in <NAME>, <NAME>, Jr - 2012
	"""

	alpha1i = np.matrix([[0, 0, 0, 2], [0, 0, 2, 0], [0, -2, 0, 0], [-2, 0, 0, 0]])
	alpha2i = np.matrix([[0, 2, 0, 0], [-2, 0, 0, 0], [0, 0, 0, 2], [0, 0, -2, 0]])
	alpha3i = np.matrix([[0, 0, 2, 0], [0, 0, 0, -2], [-2, 0, 0, 0], [0, 2, 0, 0]])

	# Betas
	beta1i = np.matrix([[0, 0, 0, 2], [0, 0, -2, 0], [0, 2, 0, 0], [-2, 0, 0, 0]])
	beta2i = np.matrix([[0, 0, 2, 0], [0, 0, 0, 2], [-2, 0, 0, 0], [0, -2, 0, 0]])
	beta3i = np.matrix([[0, 2, 0, 0], [-2, 0, 0, 0], [0, 0, 0, -2], [0, 0, 2, 0]])

	# print("alpha 1")
	# print(alpha1i)
	# print("")
	# print("alpha 2")
	# print(alpha2i)
	# print("")
	# print("alpha 3")
	# print(alpha3i)
	# print("")
	# print("beta 1")
	# print(beta1i)
	# print("")
	# print("beta 2")
	# print(beta2i)
	# print("")
	# print("beta 3")
	# print(beta3i)
	# print("")

	abperm_comb = [alpha1i, alpha2i, alpha3i, beta1i, beta2i, beta3i]
	return abperm_comb


# ******************************************************************************
# Calculate all the possible +1 and -1 l coefficient combinations
def sign_combimutations():
	combo_l = []

	lsigns = [1,1,1,1,1,1]
	for signs in itertools.product([-1,1], repeat=len(lsigns)):
		temp = np.array([a*sign for a,sign in zip(lsigns,signs)])
		combo_l.append(temp)
		# print(temp)
	# print(len(combo_l))
	return combo_l

{'fraction_non_alphanumeric': 0.3432438429110273, 'fraction_numerical': 0.06367872198801863, 'mean_word_length': 4.593052109181142, 'pattern_counts': {'":': 0, '<': 8, '<?xml version=': 0, '>': 8, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
{'dir': 'git-commits-cleaned', 'id': '6227271', 'n_tokens_mistral': 1882, 'n_tokens_neox': 1654, 'n_words': 494}