Related papers: Splittings and disjunctions in Reverse Mathematics
In this paper, we establish the irrationality of some open problems in mathematics based on using a recursive formula that generate the complete sequence of numbers. see [1] But before getting into that we begin with some Ramanujan notable…
Inverse problems are pervasive mathematical methods in inferring knowledge from observational and experimental data by leveraging simulations and models. Unlike direct inference methods, inverse problem approaches typically require many…
We determine the processes obtained from a large class of reflected Brownian motions (RBMs) in the nonnegative orthant by means of time reversal. The class of RBMs we deal with includes, but is not limited to, RBMs in the so-called…
Ramsey theory is the study of conditions under which mathematical objects show order when partitioned. Ramsey theory on the integers concerns itself with partitions of $[1,n]$ into $r$ subsets and asks the question whether one (or more) of…
The inverse problem of special geometry (Seiberg-Witten geometry of 4d N=2 SCFT) asks for a recursive construction of all such geometries in rank $r$ by assembling together known lower-rank ``strata''. This leads to a program to…
We explore a novel link between two seemingly disparate mathematical concepts: Egyptian fractions and fractals. By examining the decomposition of rationals into sums of distinct unit fractions, a practice rooted in ancient Egyptian…
This overview is devoted to splitting methods, a class of numerical integrators intended for differential equations that can be subdivided into different problems easier to solve than the original system. Closely connected with this class…
We investigate characteristics of random split trees introduced by Devroye; split trees include for example binary search trees, $m$-ary search trees, quadtrees, median of $(2k+1)$-trees, simplex trees, tries and digital search trees. More…
The distribution of reversible programs tends to a limit as their size increases. For problems with a Hamming distance fitness function the limiting distribution is binomial with an exponentially small chance (but non~zero) chance of…
Residual minimization is a widely used technique for solving Partial Differential Equations in variational form. It minimizes the dual norm of the residual, which naturally yields a saddle-point (min-max) problem over the so-called trial…
We present a novel form of relativistic quantum mechanics and demonstrate how to solve it using a recently derived unitary perturbation theory, within partial wave analysis. The theory is tested on a relativistic problem, with two spinless,…
Riemann sums, a classical method for approximating the definite integral of a function, have been extensively studied in the past. However, their monotonic properties, while still of great importance, particularly in approximation theory…
The split Bregman (SB) method [T. Goldstein and S. Osher, SIAM J. Imaging Sci., 2 (2009), pp. 323-43] is a fast splitting-based algorithm that solves image reconstruction problems with general l1, e.g., total-variation (TV) and compressed…
The Adomian Decomposition Method (ADM) is a very effective approach for solving broad classes of nonlinear partial and ordinary differential equations, with important applications in different fields of applied mathematics, engineering,…
This book deals with functions allowing to express the dissimilarity (discrepancy) between two data fields or ''divergence functions'' with the aim of applications to linear inverse problems. Most of the divergences found in the litterature…
An odd deformation of a super Riemann surface $\mathcal S$ is a deformation of $\mathcal S$ by variables of odd parity. In this article we study the obstruction theory of these odd deformations $\mathcal X$ of $\mathcal S$. We view…
The Jordan decomposition theorem states that every function $f \colon [0,1] \to \mathbb{R}$ of bounded variation can be written as the difference of two non-decreasing functions. Combining this fact with a result of Lebesgue, every function…
Reversibility is a key issue in the interface between computation and physics, and of growing importance as miniaturization progresses towards its physical limits. Most foundational work on reversible computing to date has focussed on…
Intersection numbers are rational scalar products among functions that admit suitable integral representations, such as Feynman integrals. Using these scalar products, the decomposition of Feynman integrals into a basis of linearly…
In his book \emph{Topics in Analytic Number Theory}, Hans Rademacher conjectured that the limits of certain sequences of coefficients that arise in the ordinary partial fraction decomposition of the generating function for partitions of…