相关论文: Tap Complexity, the Cavity Method and Supersymmetr…
We study the complexity of approximating Wassertein barycenter of $m$ discrete measures, or histograms of size $n$ by contrasting two alternative approaches, both using entropic regularization. The first approach is based on the Iterative…
Theoretical complexity is a vital subfield of computer science that enables us to mathematically investigate computation and answer many interesting queries about the nature of computational problems. It provides theoretical tools to assess…
In the context of two illustrative examples from supersymmetric quantum mechanics we show that the semi-classical analysis of the path integral requires complexification of the configuration space and action, and the inclusion of complex…
Summarizing the results of arXiv:0707.1038, we discuss the four-dimensional effective approach to type II N=1 supersymmetric flux compactifications with general SU(3)x SU(3)-structure. In particular, we study the effect of a non-trivial…
There is a natural solution to the strong CP problem in the Minimal Supersymmetric Standard Model if it arises from a parity symmetric theory which is spontaneously broken to MSSM at Planck, GUT or intermediate scales. The strong CP phase…
Quantum Hamilton-Jacobi Theory and supersymmetric quantum mechanics (SUSYQM) are two parallel methods to determine the spectra of a quantum mechanical systems without solving the Schr\"odinger equation. It was recently shown that the shape…
We propose a measure based upon the fundamental theoretical concept in algorithmic information theory that provides a natural approach to the problem of evaluating $n$-dimensional complexity by using an $n$-dimensional deterministic Turing…
Effective field theories consistent with quantum gravity obey surprising finiteness constraints, appearing in several distinct but interconnected forms. In this work we develop a framework that unifies these observations by proposing that…
Direct searches and the hints for the Higgs at ~125 GeV put increasing pressure on simple models of SUSY breaking, in particular (but not exclusively) on those that automatically solve the flavour problem, such as gauge mediation.…
We construct a pseudoclassical particle model associated to the twisted N=2 SUSY algebra in four dimensions. The particle model has four kappa symmetries. Three of them can be used to reduce the model to the vector supersymmetry particle…
With the development of low order scaling methods for performing Kohn-Sham Density Functional Theory, it is now possible to perform fully quantum mechanical calculations of systems containing tens of thousands of atoms. However, with an…
Two new methods for investigation of two-dimensional quantum systems, whose Hamiltonians are not amenable to separation of variables, are proposed. 1)The first one - $SUSY-$ separation of variables - is based on the intertwining relations…
Let ${\boldsymbol A}\in{\mathbb R}^{n\times n}$ be a symmetric random matrix with independent and identically distributed Gaussian entries above the diagonal. We consider the problem of maximizing $\langle{\boldsymbol \sigma},{\boldsymbol…
Polynomial optimization problems are infinite-dimensional, nonconvex, NP-hard, and are often handled in practice with the moment-sums of squares hierarchy of semidefinite programming bounds. We consider problems where the objective function…
MAP is the problem of finding a most probable instantiation of a set of variables in a Bayesian network, given evidence. Unlike computing marginals, posteriors, and MPE (a special case of MAP), the time and space complexity of MAP is not…
In the light of new experimental results on $B \to K\pi$ decays, we study the decay processes $B \to K \pi$ in the framework of both R-parity conserving (SUGRA) and R-parity violating supersymmetric models. We find that any possible…
We construct a $SU(3)^3$ supersymmetric gauge theory with a common gauge coupling g. Spontaneous breaking of this gauge group at a scale $M_X=1.3\times10^{16} $GeV gives naturally rise exactly to the Minimal Supersymmetric Standard Model…
The multi-index matching problem (MIMP) generalizes the well known matching problem by going from pairs to d-uplets. We use the cavity method from statistical physics to analyze its properties when the costs of the d-uplets are random. At…
Parameterized Inapproximability Hypothesis (PIH) is a central question in the field of parameterized complexity. PIH asserts that given as input a 2-CSP on $k$ variables and alphabet size $n$, it is W[1]-hard parameterized by $k$ to…
We consider supersymmetric theories on a space with compact space-like slices. One can count BPS representations weighted by (-1)^F, or, equivalently, study supersymmetric partition functions by compactifying the time direction. A special…