Related papers: Predicting the orbifold origin of the MSSM
Boosted trees is a dominant ML model, exhibiting high accuracy. However, boosted trees are hardly intelligible, and this is a problem whenever they are used in safety-critical applications. Indeed, in such a context, rigorous explanations…
Beginning with a review of the arguments leading to the so-called c=1 barrier in the continuum formulation of noncritical string theory, the pathology is then exhibited in a discretized version of the theory, formulated through dynamical…
Protein structure prediction remains to be an open problem in bioinformatics. There are two main categories of methods for protein structure prediction: Free Modeling (FM) and Template Based Modeling (TBM). Protein threading, belonging to…
Topologically constrained genome-like polymers often double-fold into tree-like configurations, which can be modelled on the level of folded (ring) polymers or on the level of the underlying random trees. For both descriptions, we have…
Probability estimation is one of the fundamental tasks in statistics and machine learning. However, standard methods for probability estimation on discrete objects do not handle object structure in a satisfactory manner. In this paper, we…
Machine learning (ML) has emerged as a powerful tool for tackling complex regression and classification tasks, yet its success often hinges on the quality of training data. This study introduces an ML paradigm inspired by domain knowledge…
Machine learning models can be used to predict physical quantities like homogenized elasticity stiffness tensors, which must always be symmetric positive definite (SPD) based on conservation arguments. Two datasets of homogenized elasticity…
A way to break supersymmetry in perturbative superstring theory is the string version of the Scherk-Schwarz mechanism. There, the fermions and bosons have mass splitting due to different compactification boundary conditions. We consider the…
It is shown that the twisted sector spectrum, as well as the associated Chern-Simons interactions, can be determined on M-theory orbifold fixed planes that do not admit gravitational anomalies. This is demonstrated for the seven-planes…
A three-generation Pati-Salam model is constructed by compactifying the heterotic string on a particular T^6/Z_6 Abelian symmetric orbifold with two discrete Wilson lines. The compactified space is taken to be the Lie algebra lattice…
We discuss the phenomenology of a three-family supersymmetric Standard-like Model derived from the orientifold construction, in which the ordinary chiral states are localized at the intersection of branes at angles. In addition to the…
We investigate the physics of the E-string theory and its compactifications as well as their applications to four-dimensional topology. In particular, we compute the partition function of the topologically twisted theory on $M_4\times T^2$,…
We generalize the definition of orbifold elliptic genus, and introduce orbifold genera of chromatic level h, using h-tuples rather than pairs of commuting elements. We show that our genera are in fact orbifold invariants, and we prove…
These lectures discuss some of the general issues in developing a phenomenology for Superstring Theory/M Theory. The focus is on the question: how might one obtain robust, generic predictions. For example, does the theory predict low energy…
In the past three years our views on how the standard model of particle physics could be embedded into string theory have dramatically changed. The heterotic string is no longer the only possibility for such an embedding and other…
In this talk, I present a family unification in $Z_3$ orbifolded $E_8\times E_8^\prime$ heterotic strings. It is argued that trinification is a plausible candidate toward supersymmetric standard model at low energy.
An analysis of a special class of type II string theory compactifications is presented. We focus on recent work in one particular orientifold background of intersecting brane models and the resulting four dimensional gauge group and matter…
There are numerous randomized algorithms to generate spanning trees in a given ambient graph; several target the uniform distribution on trees (UST), while in practice the fastest and most frequently used draw random weights on the edges…
We discuss the application of a class of machine learning algorithms known as decision trees to the process of galactic classification. In particular, we explore the application of oblique decision trees induced with different impurity…
We investigate orbifold and smooth Calabi-Yau compactifications of the non-supersymmetric heterotic SO(16)xSO(16) string. We focus on such Calabi-Yau backgrounds in order to recycle commonly employed techniques, like index theorems and…