Outline and abstract
Signed-off-by: Riccardo Finotello <riccardo.finotello@gmail.com>
This commit is contained in:
		| @@ -0,0 +1,20 @@ | ||||
| In this thesis we present topics in phenomenology of string theory ranging from particle physics amplitudes and Big Bang-like singularities to the study of state-of-the-art deep learning techniques based on recent advancements in artificial intelligence for string compactifications. | ||||
|  | ||||
| In particular we show the computation of the leading contribution to amplitudes in the presence of non Abelian twist fields in intersecting D-branes scenarios in non factorised tori. | ||||
| This is a generalisation to the current literature which mainly covers factorised internal spaces. | ||||
| We also study a new method to compute amplitudes in the presence of an arbitrary number of spin fields introducing point-like defects on the string worldsheet. | ||||
| This method can then be treated as an alternative computation with respect to bosonization and older approaches based on the Reggeon vertex. | ||||
| We then present an analysis of Big Bang-like cosmological divergences in string theory on time-dependent orbifolds. | ||||
| We show that the nature of the divergences are not due to gravitational feedback but to the lack of an underlying effective field theory. | ||||
| We also introduce a new orbifold structure capable of fixing the issue and reinstate a distributional interpretation to field theory amplitudes. | ||||
|  | ||||
| We finally present a new artificial intelligence approach to algebraic geometry and string compactifications. | ||||
| We compute the Hodge numbers of Complete Intersection Calabi--Yau $3$-folds using deep learning techniques based on computer vision and object recognition techniques. | ||||
| We also include a methodological study of machine learning applied to data in string theory: as in most applications machine learning almost never relies on the blind application of algorithms to the data but it requires a careful exploratory analysis and feature engineering. | ||||
| We thus show how such an approach can help in improving results by processing the data before using it. | ||||
| We then show how deep learning can reach the highest accuracy in the task with smaller networks with less parameters. | ||||
| This is a novel approach to the task: differently from previous attempts we focus on using convolutional neural networks capable of reaching higher accuracy on the predictions and ensuring phenomenological relevance to results. | ||||
| The approach is inspired by recent advancements in computer science and inspired by Google's research in the field. | ||||
|  | ||||
|  | ||||
| % vim: ft=tex | ||||
|   | ||||
		Reference in New Issue
	
	Block a user