Related papers: Background construction for $\lambda$-indexed mice
We develop the theory of the forcing with trees and creatures for an inaccessible lambda continuing Ros{\l}anowski and Shelah math.LO/9807172, math.LO/9909115. To make a real use of these forcing notions (that is to iterate them without…
Rooted, weighted continuum random trees are used to describe limits of sequences of random discrete trees. Formally, they are random quadruples $(\mathcal{T},d,r,p)$, where $(\mathcal{T},d)$ is a tree-like metric space, $r\in\mathcal{T}$ is…
In this paper we present an efficient iterative method of order six for the inclusion of the inverse of a given regular matrix. To provide the upper error bound of the outer matrix for the inverse matrix, we combine point and interval…
The paper presents an iterative version of join-tree clustering that applies the message passing of join-tree clustering algorithm to join-graphs rather than to join-trees, iteratively. It is inspired by the success of Pearl's belief…
Combinatorial spiders are a model for the invariant space of the tensor product of representations. The basic objects, webs, are certain directed planar graphs with boundary; algebraic operations on representations correspond to…
The lace expansion is a powerful perturbative technique to analyze the critical behavior of random spatial processes such as the self-avoiding walk, percolation and lattice trees and animals. The non-backtracking lace expansion (NoBLE) is a…
We develop a framework for nonstandard analysis that gives foundations to the interplay between external and internal iterations of the star map, and we present a few examples to show the strength and flexibility of such a nonstandard…
We explore the possibilities for elementary embeddings $j : M \to N$, where $M$ and $N$ are models of ZFC with the same ordinals, $M \subseteq N$, and $N$ has access to large pieces of $j$. We construct commuting systems of such maps…
Phylogenetic trees constitute an interesting class of objects for stochastic processes due to the non-standard nature of the space they inhabit. In particular, many statistical applications require the construction of Markov processes on…
The in-order traversal provides a natural correspondence between binary trees with a decreasing vertex labeling and endofunctions on a finite set. By suitably restricting the vertex labeling we arrive at a class of trees that we call…
We present a machine learning method for the reconstruction of the undistorted images of background sources in strongly lensed systems. This method treats the source as a pixelated image and utilizes the Recurrent Inference Machine (RIM) to…
A reconfigurable microwave reflectarray metasurface (MS) is investigated for beamforming applications. The reflected beam direction is changed by applying external dc voltages, which create a reflection phase gradient on the structure. The…
We establish a novel bijective encoding that represents permutations as forests of decorated (or enriched) trees. This allows us to prove local convergence of uniform random permutations from substitution-closed classes satisfying a…
Fix $n\in\mathbb{N}$. Let $\mathbf{T}_n$ be the set of rooted trees $(T,o)$ whose vertices are labeled by elements of $\{1,...,n\}$. Let $\nu$ be a strongly connected multi-type Galton-Watson measure. We give necessary and sufficient…
Let $\mathcal{R}$ be a unital ring with involution. The notions of 1MP-inverse and MP1-inverse are extended from $M_{m,n}(\mathbb{C)}$, the set of all $m\times n $ matrices over $\mathbb{C}$, to the set $\mathcal{R}% ^{\dagger}$ of all…
We prove that the basis and the generating function of a geometric grid class of permutations Geom$(M)$ are computable from the matrix $M$, as well as some variations on this result. Our main tool is monadic second-order logic on…
In analogy to other concepts of a similar nature, we define the inducibility of a rooted binary tree. Given a fixed rooted binary tree $B$ with $k$ leaves, we let $\gamma(B,T)$ be the proportion of all subsets of $k$ leaves in $T$ that…
A recursive construction is presented for the projective cubature formulas of index $p$ on the unit spheres $S(m,K)\subset K^m$ where $K$ is $R$ or $C$, or $H$. This yields a lot of new upper bounds for the minimal number of nodes…
We present a nonparametric prior over reversible Markov chains. We use completely random measures, specifically gamma processes, to construct a countably infinite graph with weighted edges. By enforcing symmetry to make the edges undirected…
We describe a natural structure of an abelian intertwining algebra (in the sense of Dong and Lepowsky) on the direct sum of the untwisted vertex operator algebra constructed {}from the Leech lattice and its (unique) irreducible twisted…