Related papers: Heterotic String Model Building with Monad Bundles…
We seek to automate the design of molecules based on specific chemical properties. Our primary contributions are a simpler method for generating SMILES strings guaranteed to be chemically valid, using a combination of a new context-free…
In this paper, we continue the analysis of heterotic string compactifications on half-flat mirror manifolds by including the 10-dimensional gauge fields. It is argued, that the heterotic Bianchi identity is solved by a variant of the…
Assemblies of modular subsystems are being pressed into service to perform sensing, reasoning, and decision making in high-stakes, time-critical tasks in such areas as transportation, healthcare, and industrial automation. We address the…
We present a numerical computation, based on neural network techniques, of the physical Yukawa couplings in a heterotic string theory compactification on a smooth Calabi-Yau threefold with non-standard embedding. The model belongs to a…
We construct decomposed spectral covers for bundles on elliptically fibered Calabi-Yau threefolds whose structure groups are S(U(1) x U(4)), S(U(2) x U(3)) and S(U(1) x U(1) x U(3)) in heterotic string compactifications. The decomposition…
It is well-known that heterotic string compactifications have, in spite of their conceptual simplicity and aesthetic appeal, a serious problem with precision gauge coupling unification in the perturbative regime of string theory. Using both…
Wilson line on a non-simply connected manifold is a nice way to break SU(5) unified symmetry, and to solve the doublet--triplet splitting problem. This mechanism also requires, however, that the two Higgs doublets are strictly vector-like…
Protein inverse folding-that is, predicting an amino acid sequence that will fold into the desired 3D structure-is an important problem for structure-based protein design. Machine learning based methods for inverse folding typically use…
We study the type II string theories compactified on manifolds of $G_2$ holonomy of the type $({Calabi-Yau 3-fold} \times S^1)/\bz_2$ where $CY_3$ sectors realized by the Gepner models. We construct modular invariant partition functions for…
We report on a search for $N=2$ heterotic strings that are dual candidates of type II compactifications on Calabi-Yau threefolds described as $K3$ fibrations. We find many new heterotic duals by using standard orbifold techniques. The…
Problems of segmentation, denoising, registration and 3D reconstruction are often addressed with the graph cut algorithm. However, solving an unconstrained graph cut problem is NP-hard. For tractable optimization, pairwise potentials have…
We discuss a duality of (0,2) heterotic string vacua which implies that certain pairs of (0,2) Calabi-Yau compactifications on topologically distinct target manifolds yield identical string theories. Some complex structure moduli in one…
Effective token compression remains a critical challenge for scaling models to handle increasingly complex and diverse datasets. A novel mechanism based on contextual reinforcement is introduced, dynamically adjusting token importance…
Calabi--Yau compactifications of the $E_8\times E_8$ heterotic string provide a promising route to recovering the four-dimensional particle physics described by the Standard Model. While the topology of the Calabi--Yau space determines the…
A review of orbifold geometry is given, followed by a review of the construction of four-dimensional heterotic string models by compactification on a six-dimensional Z_3 orbifold. Particular attention is given to the details of the…
In this note we derive the net number of generations of chiral fermions in heterotic string compactifications on Calabi-Yau threefolds with certain SU(n) vector bundles, for n odd, using the parabolic approach for bundles. We compare our…
Zero-shot learning methods rely on fixed visual and semantic embeddings, extracted from independent vision and language models, both pre-trained for other large-scale tasks. This is a weakness of current zero-shot learning frameworks as…
Robot control problems are often structured with a policy function that maps state values into control values, but in many dynamic problems the observed state can have a difficult to characterize relationship with useful policy actions. In…
Controlling the generative model to adapt a new domain with limited samples is a difficult challenge and it is receiving increasing attention. Recently, methods based on meta-learning have shown promising results for few-shot domain…
Despite considerable progress, ab initio protein structure prediction remains suboptimal. A crowdsourcing approach is the online puzzle video game Foldit, that provided several useful results that matched or even outperformed…