Related papers: Numerical Polynomial Homotopy Continuation Method …
This paper proposes a novel collocation-type numerical stochastic homogenization method for prototypical stochastic homogenization problems with random coefficient fields of small correlation lengths. The presented method is based on a…
Much combinatorial optimisation problems constitute a non-polynomial (NP) hard optimisation problem, i.e., they can not be solved in polynomial time. One such problem is finding the shortest route between two nodes on a graph.…
At the leading order, M-theory admits minimal supersymmetric compactifications if the internal manifold has exceptional holonomy. Once we take into account higher order quantum correction terms in the low energy effective action, the…
Motivated by recent discussions of the string-theory landscape, we propose field-theoretic realizations of models with large numbers of vacua. These models contain multiple U(1) gauge groups, and can be interpreted as deconstructed versions…
Persistent homology (PH) is one of the most popular methods in Topological Data Analysis. Even though PH has been used in many different types of applications, the reasons behind its success remain elusive; in particular, it is not known…
We revisit the method of characteristics for shock wave solutions to nonlinear hyperbolic problems and we describe a novel numerical algorithm - the convex hull algorithm (CHA) - in order to compute, both, entropy dissipative solutions…
In order to formulate mathematical conjectures likely to be true, a number of base cases must be determined. However, many combinatorial problems are NP-hard and the computational complexity makes this research approach difficult using a…
The Worldvolume Hybrid Monte Carlo (WV-HMC) method [arXiv:2012.08468] is a reliable and versatile algorithm for addressing the numerical sign problem. It resolves the ergodicity issues commonly encountered in Lefschetz thimble-based…
Persistent Homology (PH) is a fundamental tool in computational topology, designed to uncover the intrinsic geometric and topological features of data across multiple scales. Originating within the broader framework of Topological Data…
We propose a flexible algorithm for feature detection and hypothesis testing in images with ultra low signal-to-noise ratio using cubical persistent homology. Our main application is in the identification of atomic columns and other…
In this paper we analyze the structure of supersymmetric vacua in compactifications of the heterotic string on certain manifolds with SU(3) structure. We first study the effective theories obtained from compactifications on half-flat…
The numerical sign problem remains one of the central challenges in computational physics. The Worldvolume Hybrid Monte Carlo (WV-HMC) method has recently been proposed as a reliable and computationally efficient algorithm that crucially…
We describe, study, and experiment with an algorithm for finding all solutions of systems of polynomial equations using homotopy continuation and monodromy. This algorithm follows a framework developed in previous work and can operate in…
Polynomial systems occur in many areas of science and engineering. Unlike general nonlinear systems, the algebraic structure enables to compute all solutions of a polynomial system. We describe our massive parallel predictor-corrector…
We review a systematic construction of $\cx N=1$ supersymmetric heterotic string vacua using mirror symmetry. The method provides a large class of explicit solutions for stable, holomorphic vector bundles on Calabi-Yau n-folds Z_n in terms…
We revisit the problem of certifying the correctness of approximate solution paths computed by numerical homotopy continuation methods. We propose a conceptually simple approach based on a parametric variant of the Krawczyk method from…
In the present paper we show a dichotomy theorem for the complexity of polynomial evaluation. We associate to each graph H a polynomial that encodes all graphs of a fixed size homomorphic to H. We show that this family is computable by…
This article is the author's PhD thesis. After a review of string vacua obtained through compactification (with and wothout fluxes), it presents and describes various aspects of the Landscape of string vacua. At first it gives an…
Quantum nuclear effects and anharmonicity impact a wide range of functional materials and their properties. One of the most powerful techniques to model these effects is the Stochastic Self-Consistent Harmonic Approximation (SSCHA).…
The Promise Constraint Satisfaction Problem (PCSP for short) is a generalization of the well-studied Constraint Satisfaction Problem (CSP). The PCSP has its roots in such classic problems as the Approximate Graph Coloring and the…