Related papers: Numerical Polynomial Homotopy Continuation Method …
We perform a systematic search for N=1 Minkowski vacua of type II string theories on compact six-dimensional parallelizable nil- and solvmanifolds (quotients of six-dimensional nilpotent and solvable groups, respectively). Some of these…
Quantum algorithms to integrate nonlinear PDEs governing flow problems are challenging to discover but critical to enhancing the practical usefulness of quantum computing. We present here a near-optimal, robust, and end-to-end quantum…
P vs NP problem is the most important unresolved problem in the field of computational complexity. Its impact has penetrated into all aspects of algorithm design, especially in the field of cryptography. The security of cryptographic…
The hypervolume indicator is an increasingly popular set measure to compare the quality of two Pareto sets. The basic ingredient of most hypervolume indicator based optimization algorithms is the calculation of the hypervolume contribution…
Hypertree decompositions, as well as the more powerful generalized hypertree decompositions (GHDs), and the yet more general fractional hypertree decompositions (FHD) are hypergraph decomposition methods successfully used for answering…
In the Maximum Independent Set problem we are asked to find a set of pairwise nonadjacent vertices in a given graph with the maximum possible cardinality. In general graphs, this classical problem is known to be NP-hard and hard to…
In this work we present a direct comparison of three different numerical analytic continuation methods: the Maximum Entropy Method, the Backus-Gilbert method and the Schlessinger point or Resonances Via Pad\'{e} method. First, we perform a…
The Soft Happy Colouring (SHC) problem, a mathematical framework for identifying homophilic network structures, seeks to maximise the number of $\rho$-happy vertices, i.e. vertices with at least a proportion $\rho$ of neighbours that share…
Sampling logconcave functions arising in statistics and machine learning has been a subject of intensive study. Recent developments include analyses for Langevin dynamics and Hamiltonian Monte Carlo (HMC). While both approaches have…
A polyhedral method to solve a system of polynomial equations exploits its sparse structure via the Newton polytopes of the polynomials. We propose a hybrid symbolic-numeric method to compute a Puiseux series expansion for every space curve…
This text is a review of aspects of supergravity theories that are relevant in superstring cosmology. In particular, it considers the possibilities and restrictions for `uplifting terms', i.e. methods to produce de Sitter vacua. We…
We present a continuation method to compute all zeros of a harmonic mapping $f$ in the complex plane. Our method works without any prior knowledge of the number of zeros or their approximate location. We start by computing all solution of…
In a recent work [10], we have introduced a pressure-robust Hybrid High-Order method for the numerical solution of the incompressible Navier-Stokes equations on matching simplicial meshes. Pressure-robust methods are characterized by error…
Persistent homology (PH) is a rigorous mathematical theory that provides a robust descriptor of data in the form of persistence diagrams (PDs). PDs exhibit, however, complex structure and are difficult to integrate in today's machine…
The five dimensional stable de Sitter ground states in N=2 supergravity obtained by gauging SO(1,1) symmetry of the real symmetric scalar manifold (in particular a generic Jordan family manifold of the vector multiplets) simultaneously with…
${ NP}$-complete problem "Hamiltonian cycle"\ for graph $G=(V,E)$ is extended to the "Hamiltonian Complement of the Graph"\ problem of finding the minimal cardinality set $H$ containing additional edges so that graph $G=(V,E\cup H)$ is…
$ $We study the $d$-Uniform Hypergraph Matching ($d$-UHM) problem: given an $n$-vertex hypergraph $G$ where every hyperedge is of size $d$, find a maximum cardinality set of disjoint hyperedges. For $d\geq3$, the problem of finding the…
We present the Chromatic Persistence Algorithm (CPA), an event-driven method for computing persistent cohomological features of weighted graphs via graphic arrangements, a classical object in computational geometry. We establish rigorous…
Persistent homology is a mathematical tool used for studying the shape of data by extracting its topological features. It has gained popularity in network science due to its applicability in various network mining problems, including…
Motivated by Wilmshurst's conjecture, we investigate the zeros of harmonic polynomials. We utilize a certified counting approach which is a combination of two methods from numerical algebraic geometry: numerical polynomial homotopy…