Related papers: On the Regularization of the Kepler Problem
We prove Lipschitz continuity results for solutions to a class of obstacle problems under standard growth conditions of $p$-type, $p \geq 2$. The main novelty is the use of a linearization technique going back to [28] in order to interpret…
In this paper we study nonlinear interpolation problems for interpolation and peak-interpolation sets of function algebras. The subject goes back to the classical Rudin-Carleson interpolation theorem. In particular, we prove the following…
We generalise the $\eta$ regularisation scheme in order to develop a framework for systematically studying regularisation of loops in quantum field theory. This allows us to "solve" a set of gauge consistency conditions for families of…
The accelerated Kepler problem is obtained by adding a constant acceleration to the classical two-body Kepler problem. This setting models the dynamics of a jet-sustaining accretion disk and its content of forming planets as the disk loses…
A regularization renormalization method ($RRM$) in quantum field theory ($QFT$) is discussed with simple rules: Once a divergent integral $I$ is encountered, we first take its derivative with respect to some mass parameter enough times,…
We propose and investigate efficient numerical methods for inverse problems related to Magnetic Resonance Imaging (MRI). Our goal is to extend the recent convergence results for the Landweber-Kaczmarz method obtained in [Haltmeier, Leitao,…
The linearized Kepler problem is considered, as obtained from the Kustaanheimo-Stiefel (K-S)transformation, both for negative and positive energies. The symmetry group for the Kepler problem turns out to be SU(2,2). For negative energies,…
We study the Kaehler metric given by the logarithm of a cubic form on its complexified index cone. Under mirror symmetry, this metric should asymptotically correspond to the Weil-Petersson metric. Using the theory of special Kaehler…
In this Master of Science Thesis I introduce geometric algebra both from the traditional geometric setting of vector spaces, and also from a more combinatorial view which simplifies common relations and operations. This view enables us to…
One can consider the Hilbert scheme as a natural compactification of the space of smooth projective curves with fixed Hilbert polynomial. Here we consider a different modular compactification, namely the functor CM parameterizing curves…
The standard approach for dealing with the ill-posedness of the training problem in machine learning and/or the reconstruction of a signal from a limited number of measurements is regularization. The method is applicable whenever the…
Cheeger-type inequalities in which the decomposability of a graph and the spectral gap of its Laplacian mutually control each other play an important role in graph theory and network analysis, in particular in the context of expander…
Noticing that the space of the solutions of a first order Hamiltonian field theory has a pre-symplectic structure, we describe a class of conserved charges on it associated to the momentum map determined by any symmetry group of…
Let G be a complex semisimple Lie group, K a maximal compact subgroup and V an irreducible representation of K. Denote by M the unique closed orbit of G in P(V) and by O its image via the moment map. For any measure on M we construct a map…
We prove solvability theorems for relaxed one-sided Lipschitz multivalued mappings in Hilbert spaces and for composed mappings in the Gelfand triple setting. From these theorems, we deduce properties of the inverses of such mappings and…
There exist certain intrinsic relations between the ultraviolet divergent graphs and the convergent ones at the same loop order in renormalizable quantum field theories. Whereupon we present a new method, the inserter regularization method,…
We describe a convex relaxation for the Gilbert-Steiner problem both in $R^d$ and on manifolds, extending the framework proposed in [9], and we discuss its sharpness by means of calibration type arguments. The minimization of the resulting…
We use convex relaxation techniques to provide a sequence of solutions to the matrix completion problem. Using the nuclear norm as a regularizer, we provide simple and very efficient algorithms for minimizing the reconstruction error…
We introduce a new method of symmetrization of mappings on the $n$-sphere ($n\geq 2$). They are applied to estimate solutions of quasilinear elliptic partial differential equations of $p$-Laplacian type, with combinations of Dirac measures…
We make explicit a larger structural phenomenon hidden behind the existence of normalizers in terms of existence of certain cartesian maps related to the kernel functor.