Related papers: Shattered Iterations
The method of iterated conformal maps is developed for quasi-static fracture of brittle materials, for all modes of fracture. Previous theory, that was relevant for mode III only, is extended here to mode I and II. The latter require…
Constraints over finite sequences of variables are ubiquitous in sequencing and timetabling. Moreover, the wide variety of such constraints in practical applications led to general modelling techniques and generic propagation algorithms,…
In computer science, combinatorics, and model theory, the VC dimension is a central notion underlying far-reaching topics such as error rate for decision rules, combinatorial measurements of classes of finite structures, and neo-stability…
We look for a parallel to the notion of ``proper forcing'' among lambda-complete forcing notions not collapsing lambda^+ . We suggest such a definition and prove that it is preserved by suitable iterations.
We study the spectrum of forcing notions between the iterations of $\sigma$-closed followed by ccc forcings and the proper forcings. This includes the hierarchy of $\alpha$-proper forcings for indecomposable countable ordinals as well as…
We recall the concept of Baxterisation of an R-matrix, or of a monodromy matrix, which corresponds to build, from one point in the $ R$-matrix parameter space, the algebraic variety where the spectral parameter(s) live. We show that the…
We prove a theorem on iterated forcing that can be used for preservation of $\aleph_2$ and $\aleph_1$ in iterations with supports of size $\aleph_1$ of forcings that have amalgamation properties similar to those present in the perfect set…
Using matrix iterations of ccc posets, we prove the consistency with ZFC of some cases where the cardinals on the right hand side of Cichon's diagram take two or three arbitrary values (two regular values, the third one with uncountable…
In this paper we develop constructive invertibility conditions for the twisted convolution. Our approach is based on splitting the twisted convolution with rational parameters into a finite number of weighted convolutions, which can be…
Assume $\kappa = \kappa^{< \kappa}$ (usually $\aleph_0$ or an inaccessible). We shall deal with iterated forcings preserving ${}^{\kappa>}{\rm Ord}$ and not collapsing cardinals along a linear order $L$. A sufficient condition for this,…
Algebraic models for the reconstruction problem in X-ray computed tomography (CT) provide a flexible framework that applies to many measurement geometries. For large-scale problems we need to use iterative solvers, and we need stopping…
An iterative algorithm is adopted to construct approximate representations of matrices describing the scattering properties of arbitrary objects. The method is based on the implicit evaluation of scattering responses from iteratively…
We present a method to iterate finitely splitting lim-sup tree forcings along non-wellfounded linear orders. We apply this method to construct a forcing (without using an inaccessible or amalgamation) that makes all definable sets of reals…
The point process of vertices of an iteration infinitely divisible or more specifically of an iteration stable random tessellation in the Euclidean plane is considered. We explicitly determine its covariance measure and its pair-correlation…
We develop a framework for quantitative convergence analysis of Picard iterations of expansive set-valued fixed point mappings. There are two key components of the analysis. The first is a natural generalization of single-valued averaged…
In many iterative optimization methods, fixed-point theory enables the analysis of the convergence rate via the contraction factor associated with the linear approximation of the fixed-point operator. While this factor characterizes the…
Higher order automorphic forms have recently been introduced to study important questions in number theory and mathematical physics. We investigate the connection between these functions and Chen's iterated integrals. Then using Chen's…
We deal with countable alphabet locally compact random subshifts of finite type (the latter merely meaning that the symbol space is generated by an incidence matrix) under the absence of Big Images Property and under the absence of uniform…
We prove that if there exists a simplified $(\omega_1,2)$-morass, then there is a ccc forcing which adds an $\omega_3$-chain in P($\omega_1$) mod finite and a ccc forcing which adds a family of $\omega_3$-many strongly almost disjoint…
We completely describe a new domain for abstract interpretation of numerical programs. Fixpoint iteration in this domain is proved to converge to finite precise invariants for (at least) the class of stable linear recursive filters of any…