Searcharxiv⌕ Search

arXiv subjects

Yang-Hui He

Publications and source records attributed to Yang-Hui He.

At least 37 records · Page 2Linked to original sources
arXiv2024

Futaki Invariants and Reflexive Polygons

Futaki invariants of the classical moduli space of 4d N=1 supersymmetric gauge theories determine whether they have a conformal fixed point in the IR. We systematically compute the Futaki invariants for a large family of 4d N=1 supersymmetric gauge theories coming from D3-branes probing Calabi-Yau 3-fold singularities whose bases are Gorenstein Fano surfaces. In particular, we focus on the toric case where the Fano surfaces are given by the 16 reflexive convex polygons and the moduli spaces are given by the corresponding toric Calabi-Yau 3-folds. We study the distribution of and conjecture new bounds on the Futaki invariants with respect to various topological and geometric quantities. These include the minimum volume of the Sasaki-Einstein base manifolds as well as the Chern and Euler numbers of the toric Fano surfaces. Even though the moduli spaces for the family of theories studied are known to be K-stable, our work sheds new light on how the topological and geometric quantities restrict the Futaki invariants for a plethora of moduli spaces.

hep-th↗
arXiv2024

Murmurations of elliptic curves

We investigate the average value of the Frobenius trace at p over elliptic curves in a fixed conductor range with given rank. Plotting this average as p varies over the primes yields a striking oscillating pattern, the details of which vary with the rank. Based on this observation, we perform various data-scientific experiments with the goal of classifying elliptic curves according to their ranks.

math.NT↗
arXiv2024

Generating Triangulations and Fibrations with Reinforcement Learning

We apply reinforcement learning (RL) to generate fine regular star triangulations of reflexive polytopes, that give rise to smooth Calabi-Yau (CY) hypersurfaces. We demonstrate that, by simple modifications to the data encoding and reward function, one can search for CYs that satisfy a set of desirable string compactification conditions. For instance, we show that our RL algorithm can generate triangulations together with holomorphic vector bundles that satisfy anomaly cancellation and poly-stability conditions in heterotic compactification. Furthermore, we show that our algorithm can be used to search for reflexive subpolytopes together with compatible triangulations that define fibration structures of the CYs.

hep-th↗
arXiv2024

A Triumvirate of AI Driven Theoretical Discovery

Recent years have seen the dramatic rise of the usage of AI algorithms in pure mathematics and fundamental sciences such as theoretical physics. This is perhaps counter-intuitive since mathematical sciences require the rigorous definitions, derivations, and proofs, in contrast to the experimental sciences which rely on the modelling of data with error-bars. In this Perspective, we categorize the approaches to mathematical discovery as "top-down", "bottom-up" and "meta-mathematics", as inspired by historical examples. We review some of the progress over the last few years, comparing and contrasting both the advances and the short-comings in each approach. We argue that while the theorist is in no way in danger of being replaced by AI in the near future, the hybrid of human expertise and AI algorithms will become an integral part of theoretical discovery.

math.HO↗
arXiv2024

Machine Learning Clifford invariants of ADE Coxeter elements

There has been recent interest in novel Clifford geometric invariants of linear transformations. This motivates the investigation of such invariants for a certain type of geometric transformation of interest in the context of root systems, reflection groups, Lie groups and Lie algebras: the Coxeter transformations. We perform exhaustive calculations of all Coxeter transformations for $A_8$, $D_8$ and $E_8$ for a choice of basis of simple roots and compute their invariants, using high-performance computing. This computational algebra paradigm generates a dataset that can then be mined using techniques from data science such as supervised and unsupervised machine learning. In this paper we focus on neural network classification and principal component analysis. Since the output -- the invariants -- is fully determined by the choice of simple roots and the permutation order of the corresponding reflections in the Coxeter element, we expect huge degeneracy in the mapping. This provides the perfect setup for machine learning, and indeed we see that the datasets can be machine learned to very high accuracy. This paper is a pump-priming study in experimental mathematics using Clifford algebras, showing that such Clifford algebraic datasets are amenable to machine learning, and shedding light on relationships between these novel and other well-known geometric invariants and also giving rise to analytic results.

cs.LG↗
arXiv2024

Prolegomena to the Bestiary

``Calabi-Yau Manifolds: a Bestiary for Physicists'' by Tristan Hubsch in 1992 was a classic that served to introduce algebraic geometry to physicists when the first string theory revolution of 1984 - 94 brought, inter alia, the subject of Calabi-Yau manifolds to the staple of high-energy theorists. We are fortunate that a substantially expanded and updated new edition of the Bestiary will shortly appear. This brief note will serve as an afterword to the much anticipated volume.

math.HO↗
arXiv2024

New Calabi-Yau Manifolds from Genetic Algorithms

Calabi-Yau manifolds can be obtained as hypersurfaces in toric varieties built from reflexive polytopes. We generate reflexive polytopes in various dimensions using a genetic algorithm. As a proof of principle, we demonstrate that our algorithm reproduces the full set of reflexive polytopes in two and three dimensions, and in four dimensions with a small number of vertices and points. Motivated by this result, we construct five-dimensional reflexive polytopes with the lowest number of vertices and points. By calculating the normal form of the polytopes, we establish that many of these are not in existing datasets and therefore give rise to new Calabi-Yau four-folds. In some instances, the Hodge numbers we compute are new as well.

hep-th↗
arXiv2024

Topological data analysis on noisy quantum computers

Topological data analysis (TDA) is a powerful technique for extracting complex and valuable shape-related summaries of high-dimensional data. However, the computational demands of classical algorithms for computing TDA are exorbitant, and quickly become impractical for high-order characteristics. Quantum computers offer the potential of achieving significant speedup for certain computational problems. Indeed, TDA has been purported to be one such problem, yet, quantum computing algorithms proposed for the problem, such as the original Quantum TDA (QTDA) formulation by Lloyd, Garnerone and Zanardi, require fault-tolerance qualifications that are currently unavailable. In this study, we present NISQ-TDA, a fully implemented end-to-end quantum machine learning algorithm needing only a short circuit-depth, that is applicable to high-dimensional classical data, and with provable asymptotic speedup for certain classes of problems. The algorithm neither suffers from the data-loading problem nor does it need to store the input data on the quantum computer explicitly. The algorithm was successfully executed on quantum computing devices, as well as on noisy quantum simulators, applied to small datasets. Preliminary empirical results suggest that the algorithm is robust to noise.

quant-ph↗
arXiv2024

Cluster Algebras: Network Science and Machine Learning

Cluster algebras have recently become an important player in mathematics and physics. In this work, we investigate them through the lens of modern data science, specifically with techniques from network science and machine learning. Network analysis methods are applied to the exchange graphs for cluster algebras of varying mutation types. The analysis indicates that when the graphs are represented without identifying by permutation equivalence between clusters an elegant symmetry emerges in the quiver exchange graph embedding. The ratio between number of seeds and number of quivers associated to this symmetry is computed for finite Dynkin type algebras up to rank 5, and conjectured for higher ranks. Simple machine learning techniques successfully learn to classify cluster algebras using the data of seeds. The learning performance exceeds 0.9 accuracies between algebras of the same mutation type and between types, as well as relative to artificially generated data.

math.CO↗
arXiv2024

Machine learning Sasakian and $G_2$ topology on contact Calabi-Yau $7$-manifolds

We propose a machine learning approach to study topological quantities related to the Sasakian and $G_2$-geometries of contact Calabi-Yau $7$-manifolds. Specifically, we compute datasets for certain Sasakian Hodge numbers and for the Crowley-Nördstrom invariant of the natural $G_2$-structure of the $7$-dimensional link of a weighted projective Calabi-Yau $3$-fold hypersurface singularity, for 7549 of the 7555 possible $\mathbb{P}^4(\textbf{w})$ projective spaces. These topological quantities are then machine learnt with high performance scores, where learning the Sasakian Hodge numbers from the $\mathbb{P}^4(\textbf{w})$ weights alone, using both neural networks and a symbolic regressor which achieve $R^2$ scores of 0.969 and 0.993 respectively. Additionally, properties of the respective Gröbner bases are well-learnt, leading to a vast improvement in computation speeds which may be of independent interest. The data generation and analysis further induced novel conjectures to be raised.

math.DG↗
arXiv2023

Learning to be Simple

In this work we employ machine learning to understand structured mathematical data involving finite groups and derive a theorem about necessary properties of generators of finite simple groups. We create a database of all 2-generated subgroups of the symmetric group on n-objects and conduct a classification of finite simple groups among them using shallow feed-forward neural networks. We show that this neural network classifier can decipher the property of simplicity with varying accuracies depending on the features. Our neural network model leads to a natural conjecture concerning the generators of a finite simple group. We subsequently prove this conjecture. This new toy theorem comments on the necessary properties of generators of finite simple groups. We show this explicitly for a class of sporadic groups for which the result holds. Our work further makes the case for a machine motivated study of algebraic structures in pure mathematics and highlights the possibility of generating new conjectures and theorems in mathematics with the aid of machine learning.

cs.LG↗
arXiv2023

Numerical spectra of the Laplacian for line bundles on Calabi-Yau hypersurfaces

We give the first numerical calculation of the spectrum of the Laplacian acting on bundle-valued forms on a Calabi-Yau three-fold. Specifically, we show how to compute the approximate eigenvalues and eigenmodes of the Dolbeault Laplacian acting on bundle-valued $(p,q)$-forms on Kähler manifolds. We restrict our attention to line bundles over complex projective space and Calabi-Yau hypersurfaces therein. We give three examples. For two of these, $\mathbb{P}^3$ and a Calabi-Yau one-fold (a torus), we compare our numerics with exact results available in the literature and find complete agreement. For the third example, the Fermat quintic three-fold, there are no known analytic results, so our numerical calculations are the first of their kind. The resulting spectra pass a number of non-trivial checks that arise from Serre duality and the Hodge decomposition. The outputs of our algorithm include all the ingredients one needs to compute physical Yukawa couplings in string compactifications.

hep-th↗
arXiv2023

Machine Learning in Physics and Geometry

We survey some recent applications of machine learning to problems in geometry and theoretical physics. Pure mathematical data has been compiled over the last few decades by the community and experiments in supervised, semi-supervised and unsupervised machine learning have found surprising success. We thus advocate the programme of machine learning mathematical structures, and formulating conjectures via pattern recognition, in other words using artificial intelligence to help one do mathematics. This is an invited chapter contribution to Elsevier's Handbook of Statistics, Volume 49: Artificial Intelligence edited by S.~G.~Krantz, A.~S.~R.~Srinivasa Rao, and C.~R.~Rao.

hep-th↗
arXiv2022

Mahler Measuring the Genetic Code of Amoebae

Amoebae from tropical geometry and the Mahler measure from number theory play important roles in quiver gauge theories and dimer models. Their dependencies on the coefficients of the Newton polynomial closely resemble each other, and they are connected via the Ronkin function. Genetic symbolic regression methods are employed to extract the numerical relationships between the 2d and 3d amoebae components and the Mahler measure. We find that the volume of the bounded complement of a d-dimensional amoeba is related to the gas phase contribution to the Mahler measure by a degree-d polynomial, with d = 2 and 3. These methods are then further extended to numerical analyses of the non-reflexive Mahler measure. Furthermore, machine learning methods are used to directly learn the topology of 3d amoebae, with strong performance. Additionally, analytic expressions for boundaries of certain amoebae are given.

hep-th↗
arXiv2022

Flowers of immortality

There has been a recent surge of interest in what causes aging. This has been matched by unprecedented research investment in the field from tech companies. But, despite considerable effort from a broad range of researchers, we do not have a rigorous mathematical theory of programmed aging. To address this, we recently derived a mortality equation that governs the transition matrix of an evolving population with a given maximum age. Here, we characterize the spectrum of eigenvalues of the solution to this equation. The eigenvalues fall into two classes. The complex and negative real eigenvalues, which we call the flower, are always contained in the unit circle in the complex plane. They play a negligible role in controlling the dynamics of an aging population. The positive real eigenvalues, which we call the stem, are the only eigenvalues which can exceed the unit circle. They control the most important properties of the dynamics. In particular, the spectral radius increases with the maximum allowed age. This suggests that programmed aging confers no advantage in a constant environment. However, the spectral gap, which governs the rate of convergence to equilibrium, decreases with the maximum allowed age. This opens the door to an evolutionary advantage in a changing environment.

q-bio.PE↗
arXiv2022

Brain Webs for Brane Webs

We propose a new technique for classifying 5d Superconformal Field Theories arising from brane webs in Type IIB String Theory, using technology from Machine Learning to identify different webs giving rise to the same theory. We concentrate on webs with three external legs, for which the problem is analogous to that of classifying sets of 7-branes. Training a Siamese Neural Network to determine equivalence between any two brane webs shows an improved performance when webs are considered equivalent under a weaker set of conditions. Thus, Machine Learning teaches us that the conjectured classification of 7-brane sets is not complete, which we confirm with explicit examples.

hep-th↗
arXiv2022

Machine Learning Class Numbers of Real Quadratic Fields

We implement and interpret various supervised learning experiments involving real quadratic fields with class numbers 1, 2 and 3. We quantify the relative difficulties in separating class numbers of matching/different parity from a data-scientific perspective, apply the methodology of feature analysis and principal component analysis, and use symbolic classification to develop machine-learned formulas for class numbers 1, 2 and 3 that apply to our dataset.

math.NT↗