Related papers: Quasi-martingales with a linearly ordered index se…
In this paper, we study functional approximations where we choose the so-called radial basis function method and more specifically, quasi-interpolation. From the various available approaches to the latter, we form new quasi-Lagrange…
We give a proof of a Martingale Representation Theorem using the methods of nonstandard analysis.
A proof of the continuous martingale convergence theorem is provided. It relies on a classical martingale inequality and the almost sure convergence of a uniformly bounded non-negative super-martingale, after a truncation argument.
We constructively prove that the partially ordered set of finite permutations ordered by deletion of entries contains an infinite antichain.
The article is devoted to the integration order replacement technique for iterated Ito stochastic integrals and iterated stochastic integrals with respect to martingales. We consider the class of iterated Ito stochastic integrals, for which…
This paper has been withdrawn by the authors due to a crucial computational error. In this paper we deal with the finite case. We prove that a finite bounded ordered set can be represented as the order of principal congruences of a finite…
The semimartingale stochastic approximation procedure, namely, the Robbins-Monro type SDE is introduced which naturally includes both generalized stochastic approximation algorithms with martingale noises and recursive parameter estimation…
We built some congruences on semigroups, from where a decomposition of quasi-separative semigroups was obtained.
We introduce a framework for ordinal notation systems, present a family of strong yet simple systems, and give many examples of ordinals in these systems. While much of the material is conjectural, we include systems with conjectured…
In this note we present and briefly discuss results, which include as a particular case the theorem announced in [L. Biasco, and L. Chierchia. On the measure of Lagrangian invariant tori in nearly-integrable mechanical systems. Atti Accad.…
While the theory of labelled well-quasi-order has received significant attention in the graph setting, it has not yet been considered in the context of permutation patterns. We initiate this study here, and show how labelled well quasi…
This text investigates relations between two well-known family of algorithms, matrix factorisations and recursive linear filters, by describing a probabilistic model in which approximate inference corresponds to a matrix factorisation…
In this paper we introduce a new type of norms for semimartingales, under both linear and nonlinear expectations. Our norm is defined in the spirit of quasimartingales, and it characterizes square integrable semimartingales. This work is…
This paper studies linear classes of planar quasiregular mappings. We give a positive answer to a conjecture of K. Astala, T. Iwaniec, and G. Martin (2009) on reduced Beltrami equations. Moreover, we use it to prove a Wronsky-type theorem…
The purposes of this note are the following two; we first generalize Okada-Takeuti's well quasi ordinal diagram theory, utilizing the recent result of Dershowitz-Tzameret's version of tree embedding theorem with gap conditions. Second, we…
In this paper, we introduce the notion of system of quotients of Lie triple systems and investigate some properties which can be lifted from a Lie triple system to its systems of quotients. We relate the notion of Lie triple system of…
We study the termination problem for nondeterministic recursive probabilistic programs. First, we show that a ranking-supermartingales-based approach is both sound and complete for bounded terminiation (i.e., bounded expected termination…
In this paper we study interpretations and equivalences of propositional deductive systems by using a quantale-theoretic approach introduced by Galatos and Tsinakis. Our aim is to provide a general order-theoretic framework which is able to…
We comment on two randomized algorithms for constructing low-rank matrix decompositions. Both algorithms employ the Subsampled Randomized Hadamard Transform [14]. The first algorithm appeared recently in [9]; here, we provide a novel…
We define the analogue of linear equivalence of graph divisors for the rotor-router model, and use it to prove polynomial time computability of some problems related to rotor-routing. Using the connection between linear equivalence for…