Related papers: Measurable events indexed by words

Let $m$ be a positive integer larger than $1$, let $w$ be a finite word over $\left\{0,1,...,m-1\right\}$ and let $a_{m;w}(n)$ be the number of occurrences of the word $w$ in the $m$-expansion of $n$ mod $p$ for any non-negative integer…

Applying a method to reconstruct a phylogenetic tree from random data provides a way to detect whether that method has an inherent bias towards certain tree `shapes'. For maximum parsimony, applied to a sequence of random 2-state data, each…

We show that for every positive integer $k$, any tournament can be partitioned into at most $2^{ck}$ $k$-th powers of paths. This result is tight up to the exponential constant. Moreover, we prove that for every $\varepsilon>0$ and every…

We define a sequence of positive integers recursively, where each term is determined as follows: starting with a given positive integer, if the term is odd, the next is the sum of its positive divisors; if the term is even, the subsequent…

We consider a random tree and introduce a metric in the space of trees to define the ``mean tree'' as the tree minimizing the average distance to the random tree. When the resulting metric space is compact we have laws of large numbers and…

We consider a sequence $\mathbf{T} = (\mathcal{T}_n : n \in \mathbb{N}^+)$ of trees $\mathcal{T}_n$ where, for some $\Delta \in \mathbb{N}^+$ every $\mathcal{T}_n$ has height at most $\Delta$ and as $n \to \infty$ the minimal number of…

The Calkin-Wilf tree is an infinite binary tree whose vertices are the positive rational numbers. Each number occurs in the tree exactly once and in the form $a/b$, where are $a$ and $b$ are relatively prime positive integers. In this…

We prime-encode the natural numbers via recursive factorisation, iterated to the exponents, generating a corpus of planar rooted trees equivalently represented as Dyck words. This forms a deterministic text endowed with internal rules.…

We study here the so called subsequence pattern matching also known as hidden pattern matching in which one searches for a given pattern $w$ of length $m$ as a subsequence in a random text of length $n$. The quantity of interest is the…

We present here a new and universal approach for the study of random and/or trees, unifying in one framework many different models, including some novel ones not yet understood in the literature. An and/or tree is a Boolean expression…

Let $F=\{\mathbf{p}_0,\ldots,\mathbf{p}_n\}$ be a collection of points in $\mathbb{R}^d.$ The set $F$ naturally gives rise to a family of iterated function systems consisting of contractions of the form $$S_i(\mathbf{x})=\lambda \mathbf{x}…

Let $\{A_n\}_{n=1}^{\infty}$ be a sequence of events on a probability space $(\Omega,\mathcal{F},\mathbf{P})$. We show that if $\lim_{m\to\infty}\sum_{n=1}^{m}w_n\mathbf{P}(A_n)=\infty$ where each $w_n\in\mathbb{R}$, then…

Given two sets of positive integers $A$ and $B$, let $AB := \{ab : a \in A,\, b \in B\}$ be their product set and put $A^k := A \cdots A$ ($k$ times $A$) for any positive integer $k$. Moreover, for every positive integer $n$ and every…

We study random trees which are invariant in law under the operation of contracting each edge independently with probability $p\in(0,1)$. We show that all such trees can be constructed through Poissonian sampling from a certain class of…

We show that for every integer $m > 0$, there is an ordinary abelian variety over ${\mathbb F}_2$ that has exactly $m$ rational points.

We show that (i) the standard fine structural properties for premice follow from normal iterability (whereas the classical proof relies on iterability for stacks of normal trees), and (ii) every mouse which is finitely generated above its…

Let $a$ and $b$ be two positive integers such that $a, b < n$. We denote the inclusion $\Sigma \mathbb{C}P^a\rightarrow SU(n)$ by $\varepsilon_{a,n}$. Also, let $m$ and $n$ be two positive integers such that $m < n$. This article has two…

This paper introduces a convenient strategy for coding and predicting sequences of independent, identically distributed random variables generated from a large alphabet of size $m$. In particular, the size of the sample is allowed to be…

The complexity function of an infinite word $w$ on a finite alphabet $A$ is the sequence counting, for each non-negative $n$, the number of words of length $n$ on the alphabet $A$ that are factors of the infinite word $w$. The goal of this…

Let $s$ denote West's stack-sorting map. For all positive integers $m$ and all integers $n\geq 2m-2$, we give a simple characterization of the set $s^{n-m}(S_n)$; as a consequence, we find that $|s^{n-m}(S_n)|$ is the $m^\text{th}$ Bell…