Related papers: MS4: a BPHZ killer
Boltzmann Machines (BMs) are graphical models with interconnected binary units, employed for the unsupervised modeling of data distributions. When trained on real data, BMs show the tendency to behave like critical systems, displaying a…
In this paper, we extend the unsplit staggered mesh scheme (USM) for 2D magnetohydrodynamics (MHD) (Lee and Deane, 2009) to a full 3D MHD scheme. The scheme is a finite-volume Godunov method consisting of a constrained transport (CT) method…
We present a finite-volume, genuinely 4th-order accurate numerical method for solving the equations of resistive relativistic magnetohydrodynamics (Res-RMHD) in Cartesian coordinates. In our formulation, the magnetic field is evolved in…
We modify an existing magnetohydrodynamics algorithm to make it more compatible with a dimensionally-split (DS) framework. It is based on the standard reconstruct-solve-average strategy (using a Riemann solver), and relies on constrained…
A century ago, Wigner's SU(4) symmetry was introduced to explain the properties of atomic nuclei. Despite recent revived interest, its impact on nuclear structure, transitions, and reactions has not been fully explored. Here, we show that a…
We give a construction of general holomorphic quarter BPS operators in $ \mathcal{N}=4$ SYM at weak coupling with $U(N)$ gauge group at finite $N$. The construction employs the M\"obius inversion formula for set partitions, applied to…
We present a new inner-outer iterative algorithm for edge enhancement in imaging problems. At each outer iteration, we formulate a Tikhonov-regularized problem where the penalization is expressed in the 2-norm and involves a regularization…
We consider compact finite-difference schemes of the 4th approximation order for an initial-boundary value problem (IBVP) for the $n$-dimensional non-homogeneous wave equation, $n\geq 1$. Their construction is accomplished by both the…
Gr\"obner bases are an important tool in computational algebra and, especially in cryptography, often serve as a boilerplate for solving systems of polynomial equations. Research regarding (efficient) algorithms for computing Gr\"obner…
In this paper we propose an extension of the generalized Lagrangian multiplier method (GLM) of Munz et al. (JCP 2000, JCP 2002), which was originally conceived for the numerical solution of the Maxwell and MHD equations with divergence-type…
We give a spectral algorithm for decomposing overcomplete order-4 tensors, so long as their components satisfy an algebraic non-degeneracy condition that holds for nearly all (all but an algebraic set of measure $0$) tensors over…
There is a conjecture that renormalizable higher-derivative gravity has a finite classical potential at the origin. In this work we show clearly that the scale-invariant gravity (SIG) satisfies the conjecture. This gravity produces the…
A method is presented to obtain an inner-approximation of the backward reachable set (BRS) of a given target tube, along with an admissible controller that maintains trajectories inside this tube. The proposed optimization algorithms are…
Renormalization Group (RG) theory provides the theoretical framework to define Effective Theories (ETs), i.e. systematic low-resolution approximations of arbitrary microscopic models. Markov State Models (MSMs) are shown to be rigorous ETs…
Implicit Regularization is a 4-dimensional regularization initially conceived to treat ultraviolet divergences. It has been successfully tested in several instances in the literature, more specifically in those where Dimensional…
Pushdown systems (PDSs) and recursive state machines (RSMs), which are linearly equivalent, are standard models for interprocedural analysis. Yet RSMs are more convenient as they (a) explicitly model function calls and returns, and (b)…
The integral image, an intermediate image representation, has found extensive use in multi-scale local feature detection algorithms, such as Speeded-Up Robust Features (SURF), allowing fast computation of rectangular features at constant…
It is well-known that by adding integrality constraints to the semidefinite programming (SDP) relaxation of the max-cut problem, the resulting integer semidefinite program is an exact formulation of the problem. In this paper we show…
Iterative majorize-minimize (MM) (also called optimization transfer) algorithms solve challenging numerical optimization problems by solving a series of "easier" optimization problems that are constructed to guarantee monotonic descent of…
The $2n$ dimensional manifold with two mutually commutative operators of differentiation is introduced. Nontrivial multidimensional integrable systems connected with arbitrary graded (semisimple) algebras are constructed. The general…