Related papers: Background construction for $\lambda$-indexed mice
A cardinal $\lambda$ satisfies a property P robustly if, whenever $\mathbb{Q}$ is a forcing poset and $|\mathbb{Q}|^+ < \lambda$, $\lambda$ satisfies P in $V^{\mathbb{Q}}$. We study the extent to which certain reflection properties of large…
A construction of the bi-Hamiltonian structures for integrable systems on regular time scales is presented. The trace functional on an algebra of $\delta$-pseudo-differential operators, valid on an arbitrary regular time scale, is…
We consider uniform random permutations drawn from a family enumerated through generating trees. We develop a new general technique to establish a central limit theorem for the number of consecutive occurrences of a fixed pattern in such…
C. Greene introduced the shuffle lattice as an idealized model for DNA mutation and discovered remarkable combinatorial and enumerative properties of this structure. We attempt an explanation of these properties from a lattice-theoretic…
We investigate whether every computable member of a given class of structures admits a fully primitive recursive (also known as punctual) or fully P-TIME copy. A class with this property is referred to as punctually robust or P-TIME robust,…
Reverse search is a convenient method for enumerating structured objects, that can be used both to address theoretical issues and to solve data mining problems. This method has already been successfully developed to handle unordered trees.…
We introduce a simple lattice model in which percolation is constructed on top of critical percolation clusters, and show that it can be repeated recursively any number $n$ of generations. In two dimensions, we determine the percolation…
We show that many countable support iterations of proper forcings preserve Souslin trees. We establish sufficient conditions in terms of games and we draw connections to other preservation properties. We present a proof of preservation…
In this paper we study a class of embeddings of tent inverse limit spaces. We introduce techniques relying on the Milnor-Thurston kneading theory and use them to study sets of accessible points and prime ends of given embeddings. We…
We construct a generative network for Monte-Carlo sampling in lattice field theories and beyond, for which the learning of layerwise propagation is done and optimised independently on each layer. The architecture uses physics-informed…
The Aldous diffusion is a conjectured Markov process on the space of real trees that is the continuum analogue of discrete Markov chains on binary trees. We construct this conjectured process via a consistent system of stationary evolutions…
We first show that increasing trees are in bijection with set compositions, extending simultaneously a recent result on trees due to Tonks and a classical result on increasing binary trees. We then consider algebraic structures on the…
In this paper, we study uniform rooted plane trees with given degree sequence. We show, under some natural hypotheses on the degree sequence, that these trees converge toward the so-called Inhomogeneous Continuum Random Tree after…
An L-shaped embedding of a tree in a point set is a planar drawing of the tree where the vertices are mapped to distinct points and every edge is drawn as a sequence of two axis-aligned line segments. There has been considerable work on…
We introduce more properties of forcing notions which imply that their lambda-support iterations are lambda-proper, where lambda is an inaccessible cardinal. This paper is a direct continuation of section A.2 of math.LO/0210205. As an…
We inductively construct an explicit (common) orthogonal eigenbasis for the elements of the Bose-Mesner algebra of the Grassmann scheme. The main step is a constructive, linear algebraic interpretation of the Goldman-Rota recurrence for the…
Answering a question which was around for some while we prove that if \pi : V -> M is such that M is transitive and closed under \omega-sequences then the core model of M is an iterate of the core model of V.
Consider the Aldous Markov chain on the space of rooted binary trees with $n$ labeled leaves in which at each transition a uniform random leaf is deleted and reattached to a uniform random edge. Now, fix $1\le k < n$ and project the leaf…
We present a bijective algorithm with which an arbitrary permutation decomposes canonically into elementary blocks which we call families, which are sets with a specified number of ascents and descents. We show that families, arranged in an…
This paper introduces a new combinatorial framework for modeling the growth of binary trees through a discrete evolution process that incorporates a growing rule and an extinction rule. Building upon the theory of increasingly labeled…