Related papers: On the SPA Convention and Project
We discuss the ways of constructing the exact superpotential for N=1 supersymmetric theories and propose a new approach. As a consequence, a new structure of the superpotential is found.
In this paper, we develop a parameterized proximal point algorithm (P-PPA) for solving a class of separable convex programming problems subject to linear and convex constraints. The proposed algorithm is provable to be globally convergent…
The renormalization of the Minimal Supersymmetric Standard Model is discussed. In particular we focus on the soft-supersymmetry breaking sector of the MSSM and comment on non-renormalization theorems.
A method is described to probe high-scale physics in lower-energy experiments by employing sum rules in terms of renormalisation group invariants. The method is worked out in detail for the study of supersymmetry-breaking mechanisms in the…
Constraint Satisfaction Problems (CSPs) play a central role in many applications in Artificial Intelligence and Operations Research. In general, solving CSPs is NP-complete. The structure of CSPs is best described by hypergraphs. Therefore,…
The successive projection algorithm (SPA) has been known to work well for separable nonnegative matrix factorization (NMF) problems arising in applications, such as topic extraction from documents and endmember detection in hyperspectral…
A fairly elementary introduction to supersymmetric field theories in general and the minimal supersymmetric Standard Model (MSSM) in particular is given. Topics covered include the cancellation of quadratic divergencies, the construction of…
Here I briefly discuss why supersymmetry is considered a leading candidate of physics beyond the standard model. I also highlight the salient features of different supersymmetry breaking models. A few other symmetries, broken or intact,…
This PhD thesis aims at combining the framework of noncommutative geometry and supersymmetry. A particular class of non-commutative geometries called almost-commutative geometries can be used to describe particle theories. This thesis…
Supersymmetry might be broken, in the real world, by anomalies that affect composite operators, while leaving the action supersymmetric. New constraint equations that govern the composite operators and their anomalies are examined. It is…
We provide first the functional analysis background required for reduced order modeling and present the underlying concepts of reduced basis model reduction. The projection-based model reduction framework under affinity assumptions,…
The partition function by means of the static path approximation (SPA) plus the random-phase approximation (RPA) treatment can be written as a contour integral form without solving the RPA equations for a separable interaction. This method…
Surgical procedures are often not "standardised" (i.e., defined in a unique and unambiguous way), but rather exist as implicit knowledge in the minds of the surgeon and the surgical team. This reliance extends to pre-surgery planning and…
We introduce a new parameter to investigate replica symmetry breaking transitions using finite-size scaling methods. Based on exact equalities initially derived by F. Guerra this parameter is a direct check of the self-averaging character…
The structure of the MSSM is reviewed. We first motivate the particle content of the theory by examining the quantum numbers of the known standard model particles and by the requirement of anomaly cancellation. Once the particle content is…
We discuss the A-model as a gauge fixing of the Poisson Sigma Model with target a symplectic structure. We complete the discussion in [arXiv:0706.3164], where a gauge fixing defined by a compatible complex structure was introduced, by…
We generalize the exact field theoretic correspondence proposed in arXiv:1103.5726 and embed it into the context of refined topological string. The correspondence originally proposed from the common integrable structures in different field…
Subgraph reconfiguration is a family of problems focusing on the reachability of the solution space in which feasible solutions are subgraphs, represented either as sets of vertices or sets of edges, satisfying a prescribed graph structure…
The SUSY Les Houches Accord (SLHA) 2 extended the first SLHA to include various generalisations of the Minimal Supersymmetric Standard Model (MSSM) as well as its simplest next-to-minimal version. Here, we propose further extensions to it,…
Sparse principal component analysis (sparse PCA) is a widely used technique for dimensionality reduction in multivariate analysis, addressing two key limitations of standard PCA. First, sparse PCA can be implemented in high-dimensional low…