Related papers: Background construction for $\lambda$-indexed mice

This was supposed to be an appendix to the book "Non-structure", and probably will be if it materializes. It presents relevant material, sometimes new, which was used in works which were supposed to be part of that book. In section 1 we…

We exploit a bijection between plane recursive trees and Stirling permutations; this yields the equivalence of some results previously proven separately by different methods for the two types of objects as well as some new results. We also…

Tree ensembles, such as random forest and boosted trees, are renowned for their high prediction performance, whereas their interpretability is critically limited. In this paper, we propose a post processing method that improves the model…

We show that an algorithmic construction of sequences of recursive trees leads to a direct proof of the convergence of random recursive trees in an associated Doob-Martin compactification; it also gives a representation of the limit in…

The theme of the first two sections, is to prepare the framework of how from a "complicated" family of index models I in K_1 we build many and/or complicated structures in a class K_2. The index models are characteristically linear orders,…

An iterative method is derived for image reconstruction. Among other attributes, this method allows constraints unrelated to the radiation measurements to be incorporated into the reconstructed image. A comparison is made with the widely…

Traced monoidal categories are used to model processes that can feed their outputs back to their own inputs, abstracting iteration. The category of finite dimensional Hilbert spaces with the direct sum tensor is not traced. But…

Let $U_0,U_1$ be two normal measures on $\kappa .$ We say that $U_0$ is in the Mitchell ordering less then $U_1,$ $U_0\vartriangleleft U_1,$ if $U_0 \in Ult(V,U_1) .$ The ordering is well-known to be transitive and well-founded. It has been…

The class of self-nested trees presents remarkable compression properties because of the systematic repetition of subtrees in their structure. In this paper, we provide a better combinatorial characterization of this specific family of…

If $L$ is a finite lattice, we show that there is a natural topological lattice structure on the geometric realization of its order complex $\Delta(L)$ (definition recalled). Lattice-theoretically, the resulting object is a subdirect…

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…

We propose a variant of iterated belief revision designed for settings with limited computational resources, such as mobile autonomous robots. The proposed memory architecture---called the {\em universal memory architecture}…

Self-similar Markov trees constitute a remarkable family of random compact real trees carrying a decoration function that is positive on the skeleton. As the terminology suggests, they are self-similar objects that further satisfy a Markov…

We introduce the priority lattice, a structure arising from the priority search algorithm on rooted trees and forests. We prove bijectively that its maximal chains are labeled by parking functions, and that the maximal chains of its…

Notions of guardedness serve to delineate the admissibility of cycles, e.g. in recursion, corecursion, iteration, or tracing. We introduce an abstract notion of guardedness structure on a symmetric monoidal category, along with a…

Tree-structured neural networks encode a particular tree geometry for a sentence in the network design. However, these models have at best only slightly outperformed simpler sequence-based models. We hypothesize that neural sequence models…

Let $F$ be an infinite field, and let $M_{n}(F)$ be the algebra of $n\times n$ matrices over $F$. Suppose that this algebra is equipped with an elementary grading whose neutral component coincides with the main diagonal. In this paper, we…

We produce an indexed version of the Grothendieck construction. This gives an equivalence of categories between opfibrations over a fixed base in the 2-category of 2-copresheaves and 2-copresheaves on the Grothendieck construction of the…

We introduce and study the problem of posterior inference on tree-structured graphical models in the presence of a malicious adversary who can corrupt some observed nodes. In the well-studied broadcasting on trees model, corresponding to…

By using nonstandard analysis, we prove embeddability properties of difference sets $A-B$ of sets of integers. (A set $A$ is "embeddable" into $B$ if every finite configuration of $A$ has shifted copies in $B$.) As corollaries of our main…