Related papers: A Simple Proof of a Martingale Representation Theo…
We show that, if PA has no non-standard models, then P=/=NP. We then give an elementary proof that PA has no non-standard models.
In this paper we explore the fundamentals of the Martingale Representation Theorem (MRT) and a closely related result, the Clark-Ocone formula. We also investigate how far these theorems can be taken, notably beyond the regular Sobolev…
A Central Limit Theorem for non-commutative random variables is proved using the Lindeberg method. The theorem is a generalization of the Central Limit Theorem for free random variables proved by Voiculescu. The Central Limit Theorem in…
Using nonstandard analysis, a very short and elementary proof of the Doob-Meyer decomposition and the Dol{\'e}ans Dade theorems is provided.
In this paper, we provide an easy proof of the Four-colour Theorem in a special case indeed.
In this letter, we consider the proof of non-stationary channel polarization theory. First we construct a multi-channel stochastic process for the non-stationary channel polarization operation. Then based on this stochastic process, we…
A Lagrange multiplier theorem is derived for the case of an imprecise objective function and a precise constraint. The proof uses methods of analysis which deal in a direct, algebraic way with imprecisions. They include imprecise…
Using the theory of representations of the symmetric group, we propose an algorithm to compute the invariant ring of a permutation group. Our approach have the goal to reduce the amount of linear algebra computations and exploit a thinner…
In this paper, nonstandard multistep methods are considered. It is shown that under some (sufficient and necessary) conditions, these methods attain the same order as their standard counterparts - to prove this statement, a nonstandard…
This article extends the work on stochastic constrained heat equation in \cite{brzezniak2020global}. We will show the existence of Martingale solutions to the stochastic-constrained heat equations. The proof is based on compactness,…
A new technique for proving uniqueness of martingale problems is introduced. The method is illustrated in the context of elliptic diffusions in $R^d$.
A simple proof for the Shannon coding theorem, using only the Markov inequality, is presented. The technique is useful for didactic purposes, since it does not require many preliminaries and the information density and mutual information…
We prove a.s. (almost sure) unisolvency of interpolation by continuous random sampling with respect to any given density, in spaces of multivariate a.e. (almost everywhere) analytic functions. Examples are given concerning polynomial and…
A very simple and short proof of the polynomial matrix spectral factorization theorem (on the unit circle as well as on the real line) is presented, which relies on elementary complex analysis and linear algebra.
In this paper, a new method of detection of election fraud is proposed. This method is based on the calculation of the ratio of two standard normal random variables; estimation of parameters of obtained sample and comparison of these…
We give a new proof of the sharp symmetrized form of Talagrand's transport-entropy inequality. Compared to stochastic proofs of other Gaussian functional inequalities, the new idea here is a certain coupling induced by time-reversed…
Representation theory provides a suitable framework to count and classify invariants in tensor models. We show that there are two natural ways of counting invariants, one for arbitrary rank of the gauge group and a second, which is only…
We formulate and solve the martingale problem in a nonlinear expectation space. Unlike the classical work of Stroock and Varadhan (1969) where the linear operator in the associated PDE is naturally defined from the corresponding diffusion…
The purpose of the paper is twofold. Firstly, we want to present a Meta Theorem to show the existence of a martingale solution for coupled systems of non-linear stochastic differential equations. The idea is first to split the system by…
We give a counting based proof of the Graham Pollak Theorem