Related papers: Shattered Iterations
We provide a generalization of Theorem 1 in Bartkiewicz, Jakubowski, Mikosch and Wintenberger (2011) in the sense that we give sufficient conditions for weak convergence of finite dimensional distributions of the partial sum processes of a…
The construction of modified equations is an important step in the backward error analysis of symplectic integrator for Hamiltonian systems. In the context of partial differential equations, the standard construction leads to modified…
A set $A$ of integers is called total if there is an algorithm which, given an enumeration of $A$, enumerates the complement of $A$, and called cototal if there is an algorithm which, given an enumeration of the complement of $A$,…
Using the Carleman linearization technique the continuous iteration of a mapping is studied. Based on the detailed analysis of the Carleman embedding matrix the precise mathematical meaning is given to such notion. The ordinary differential…
A chopped ideal is obtained from a homogeneous ideal by considering only the generators of a fixed degree. We investigate cases in which the chopped ideal defines the same finite set of points as the original one-dimensional ideal. The…
Let $G=\mathop{A\ast B}\limits_C$ be an amalgamated product of finite rank free groups $A$, $B$ and $C$. We introduce atomic measures and corresponding asymptotic densities on a set of normal forms of elements in $G$. We also define two…
Motivated by partition regularity problems of homogeneous quadratic equations, we prove multiple recurrence and convergence results for multiplicative measure preserving actions with iterates given by rational sequences involving…
We give an exposition of an iteration theorem for iterating $(<\lambda)$-closed stationary $\lambda^+$-cc forcing with supports of size $<\lambda$ and preserving these two properties. We discuss the relation of this theorem with other…
A strictly truncated (weak-coupling) perturbation theory is applied to the attractive Holstein and Hubbard models in infinite dimensions. These results are qualified by comparison with essentially exact Monte Carlo results. The second order…
Developing a system of parallel non-linear iterations, we establish the consistency of $\mathfrak{b}<\mathfrak{s}<\mathfrak{d}<\mathfrak{c}$ where $\mathfrak{b}, \mathfrak{d}, \mathfrak{c}$ are arbitrary subject to the known ZFC…
We introduce a duality for Affine Iterated Function Systems (AIFS) which is naturally motivated by group duality in the context of traditional harmonic analysis. Our affine systems yield fractals defined by iteration of contractive affine…
We prove various iteration theorems for forcing classes related to subproper and subcomplete forcing, introduced by Jensen. In the first part, we use revised countable support iterations, and show that 1) the class of subproper,…
A theoretical development is carried to establish fundamental results about rank-initial embeddings and automorphisms of countable non-standard models of set theory, with a keen eye for their sets of fixed points. These results are then…
Completely random measures (CRMs) and their normalizations are a rich source of Bayesian nonparametric priors. Examples include the beta, gamma, and Dirichlet processes. In this paper we detail two major classes of sequential CRM…
We apply methods of the fixed point theory to a Lambda policy iteration with a randomization algorithm for weak contractions mappings. This type of mappings covers a broader range than the strong contractions typically considered in the…
We study concentration inequalities for structured weighted sums of random data, including (i) tensor inner products and (ii) sequential matrix sums. We are interested in tail bounds and concentration inequalities for those structured…
The alternate row and column scaling algorithm applied to a positive $n\times n$ matrix $A$ converges to a doubly stochastic matrix $S(A)$, sometimes called the \emph{Sinkhorn limit} of $A$. For every positive integer $n$, a two parameter…
A generic method for combinatorial constructions of intrinsic geometrical spaces is presented. It is based on the well known inverse sequences of finite graphs that determine (in the limit) topological spaces. If a pattern of the…
The problem of iterated partial summations is solved for some discrete distributions defined on discrete supports. The power method, usually used as a computational approach to finding matrix eigenvalues and eigenvectors, is in some cases…
Regression in supervised learning often requires the enforcement of constraints to ensure that the trained models are consistent with the underlying structures of the input and output data. This paper presents an iterative procedure to…