Related papers: No exceptional words for Bernoulli percolation
We study the properties of the sequence of words $(B_i)$, where $B_1 = 101$ and $B_{i+1} = B_i C_i$ for $i \geq 1$, where $C_i$ is $B_i$ with the first $i$ symbols removed, and the infinite binary sequence ${\bf b} = 10101101011011101…
We investigate a limit theorem on traversable length inside semi-cylinder in the 2-dimensional supercritical Bernoulli bond percolation, which gives an extension of Theorem 2 in Grimmett(1981). This type of limit theorems was originally…
By Zeckendorf's Theorem, every positive integer is uniquely written as a sum of distinct non-adjacent Fibonacci terms. In this paper, we investigate the asymptotic formula of the number of binary expansions $<x$ that have no adjacent terms,…
We consider the Bernoulli percolation model in a finite box and we introduce an automatic control of the percolation probability, which is a function of the percolation configuration. For a suitable choice of this automatic control, the…
We introduce the notion of unavoidable (complete) sets of word patterns, which is a refinement for that of words, and study certain numerical characteristics for unavoidable sets of patterns. In some cases we employ the graph of pattern…
We provide a new proof of the sharpness of the phase transition for nearest-neighbour Bernoulli percolation. More precisely, we show that - for $p<p_c$, the probability that the origin is connected by an open path to distance $n$ decays…
We provide a new proof of the near-critical scaling relation $\beta=\xi_1\nu$ for Bernoulli percolation on the square lattice already proved by Kesten in 1987. We rely on a novel approach that does not invoke Russo's formula, but rather…
We consider a family of percolation models in which geometry and connectivity are defined by two independent random processes. Such models merge characteristics of discrete and continuous percolation. We develop an algorithm allowing…
In the confetti percolation model, or two-coloured dead leaves model, radius one disks arrive on the plane according to a space-time Poisson process. Each disk is coloured black with probability $p$ and white with probability $1-p$. In this…
We consider Bernoulli bond percolation on the product graph of a regular tree and a line. Schonmann showed that there are a.s. infinitely many infinite clusters at $p=p_u$ by using a certain function $\alpha(p)$. The function $\alpha(p)$ is…
Generalized pseudostandard words have been introduced by de Luca and De Luca in 2006. In comparison to the palindromic and pseudopalindromic closure, only little is known about the generalized pseudopalindromic closure and the associated…
The Bernoulli numbers are fascinating and ubiquitous numbers, they occur in several domains of Mathematics like Number theory (FLT), Group theory, Calculus and even in Physics. Since Bernoulli's work, they are yet studied to understand…
We consider the problem of embedding one i.i.d.\ collection of Bernoulli random variables indexed by $\mathbb{Z}^d$ into an independent copy in an injective $M$-Lipschitz manner. For the case $d=1$, it was shown by Basu and Sly (PTRF, 2014)…
We present a method for the enumeration of restricted words over a finite alphabet. Restrictions are described through the inclusion or exclusion of suitable building blocks used to construct the words by concatenation. Our approach, which…
Equip each point $x$ of a homogeneous Poisson process $\mathcal{P}$ on $\mathbb{R}$ with $D_x$ edge stubs, where the $D_x$ are i.i.d. positive integer-valued random variables with distribution given by $\mu$. Following the stable…
Mignosi, Restivo, and Salemi (1998) proved that for all $\epsilon > 0$ there exists an integer $N$ such that all prefixes of the Fibonacci word of length $\geq N$ contain a suffix of exponent $\alpha^2-\epsilon$, where $\alpha =…
Let $ \mathbb{L}^{d} = ( \mathbb{Z}^{d},\mathbb{E}^{d} ) $ be the $ d $-dimensional hypercubic lattice. We consider a model of inhomogeneous Bernoulli percolation on $ \mathbb{L}^{d} $ in which every edge inside the $ s $-dimensional…
We view sequential design as a model selection problem to determine which new observation is expected to be the most informative, given the existing set of observations. For estimating a probability distribution on a bounded interval, we…
Rich words are characterized by containing the maximum possible number of distinct palindromes. Several characteristic properties of rich words have been studied; yet the analysis of repetitions in rich words still involves some interesting…
The notion of a two-dimensional word arises naturally in the study of combinatorics on words, while the iterative construction of pedal triangles results in a rich dynamical system in the study of geometry. At first, these two classes of…