Related papers: Background construction for $\lambda$-indexed mice
We consider random arrays indexed by the leaves of an infinitary rooted tree of finite depth, with the distribution invariant under the rearrangements that preserve the tree structure. We call such arrays hierarchically exchangeable and…
A tree T is invertible if and only if T has a perfect matching. Godsil considers an invertible tree T and finds that the inverse of the adjacency matrix of T has entries in {0, 1, -1} and is the signed adjacency matrix of a graph which…
Learned index structures have been shown to achieve favorable lookup performance and space consumption compared to their traditional counterparts such as B-trees. However, most learned index studies have focused on the primary indexing…
Motivated by a recent work on a preconditioned MINRES for flipped linear systems in imaging, in this note we extend the scope of that research for including more precise boundary conditions such as reflective and anti-reflective ones. We…
The Sand Pile Model (SPM) and its generalization, the Ice Pile Model (IPM), originate from physics and have various applications in the description of the evolution of granular systems. In this article, we deal with the enumeration and the…
We consider a countable tree $T$, possibly having vertices with infinite degree, and an arbitrary stochastic nearest neighbour transition operator $P$. We provide a boundary integral representation for general eigenfunctions of $P$ with…
The $\textit{$m$-deck}$ of an $n$-vertex graph is the multiset of unlabeled induced subgraphs with $m$ vertices. Caterpillars are trees in which all nonleaf vertices lie on a single path. We prove for $n\ge48$ that any $n$-vertex…
We present necessary conditions for monotonicity, in one form or another, of fixed point iterations of mappings that violate the usual nonexpansive property. We show that most reasonable notions of linear-type monotonicity of fixed point…
A new, self-contained, proof of a coherence result for categories equipped with two symmetric monoidal structures bridged by a natural transformation is given. It is shown that this coherence result is sufficient for…
In this work we study the connection between iterated tilted algebras and m-cluster tilted algebras. We show that an iterated tilted algebra induces an m-cluster tilted algebra. This m-cluster tilted algebra can be seen as a trivial…
For a given measure space $(X,{\mathscr B},\mu)$ we construct all measure spaces $(Y,{\mathscr C},\lambda)$ in which $(X,{\mathscr B},\mu)$ is embeddable. The construction is modeled on the ultrafilter construction of the Stone--\v{C}ech…
For a labeled tree on the vertex set $\set{1,2,\ldots,n}$, the local direction of each edge $(i\,j)$ is from $i$ to $j$ if $i<j$. For a rooted tree, there is also a natural global direction of edges towards the root. The number of edges…
In this paper we prove that if we consider the standard real metric on simplicial rooted trees then the category Tower-Set of inverse sequences can be described by means of the bounded coarse geometry of the naturally associated trees.…
The modular decomposition of a symmetric map $\delta\colon X\times X \to \Upsilon$ (or, equivalently, a set of symmetric binary relations, a 2-structure, or an edge-colored undirected graph) is a natural construction to capture key features…
Let $M$ be an uniformizable Anderson t-motive and $L(M)$ its lattice. First, we prove by an explicit construction that for the non-mixed $M$ the lattice map $M\mapsto L(M)$ is not injective. Second, we show that some lattices which do not…
We extend the techniques of [CH] to build an inductive procedure for studying actions in the boundary of the Culler-Vogtmann Outer Space, the main novelty being an adaptation of he classical Rauzy-Veech induction for studying actions of…
The theme of the first two sections, is to prepare the framework of how from a ``complicated'' family of so called index models $I \in K_1$ we build many and/or complicated structures in a class $K_2$. The index models are…
Several structure-learning algorithms for staged trees, asymmetric extensions of Bayesian networks, have been proposed. However, these either do not scale efficiently as the number of variables considered increases, a priori restrict the…
We study the size properties of a general model of fractal sets that are based on a tree-indexed family of random compacts and a tree-indexed Markov chain. These fractals may be regarded as a generalization of those resulting from the…
We consider subalgebras $\mathcal{A}$ of the algebra $M_n$ of $n \times n$ complex matrices that contain all diagonal matrices, known in the literature as the structural matrix algebras (SMAs). Let $\mathcal{A} \subseteq M_n$ be an…