Related papers: Two random constructions inside lacunary sets

In a paper entitled Binary lambda calculus and combinatory logic, John Tromp presents a simple way of encoding lambda calculus terms as binary sequences. In what follows, we study the numbers of binary strings of a given size that represent…

For any measure preserving system $(X,\mathcal{X},\mu,T)$ and $A\in\mathcal{X}$ with $\mu(A)>0$, we show that there exist infinitely many primes $p$ such that $\mu\bigl(A\cap T^{-(p-1)}A\cap T^{-2(p-1)}A\bigr) > 0$ (the same holds with…

We construct finitely generated simple algebras with prescribed growth types, which can be arbitrarily taken from a large variety of (super-polynomial) growth types. This (partially) answers a question raised by the author in a recent…

The exponential growth rate of non polynomially growing subgroups of $GL_d$ is conjectured to admit a uniform lower bound. This is known for non-amenable subgroups, while for amenable subgroups it is known to imply the Lehmer conjecture…

By a classical principle of analysis, sufficiently thin subsequences of general sequences of functions behave like sequences of independent random variables. This observation not only explains the remarkable properties of lacunary…

We study the growth of typical groups from the family of $p$-groups of intermediate growth constructed by the second author. We find that, in the sense of category, a generic group exhibits oscillating growth with no universal upper bound.…

A discrete stochastic process involving random amplification with additive noise is studied analytically. If the non-negative random amplification factor $b$ is such that $<b^{\beta}>=1$ where $\beta$ is any positive non-integer, then the…

A natural number N is said to be palindromic if its binary representation reads the same forwards and backwards. In this paper we study the quotients of two palindromic numbers and answer some basic questions about the resulting sets of…

For every $k\in \mathbb{N}$, we produce a set of integers which is $k$-recurrent but not $(k+1)$-recurrent. This extends a result of Furstenberg who produced a 1-recurrent set which is not 2-recurrent. We discuss a similar result for…

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…

We study the structure of the asymptotic expansion of the probability that a combinatorial object is connected. We show that the coefficients appearing in those asymptotics are integers and can be interpreted as the counting sequences of…

We study the compositions of an integer n whose part sizes do not exceed a fixed integer k. We use the methods of analytic combinatorics to obtain precise asymptotic formulas for the number of such compositions, the total number of parts…

A permutation $\pi$ contains a permutation $\sigma$ as a pattern if it contains a subsequence of length $|\sigma|$ whose elements are in the same relative order as in the permutation $\sigma$. This notion plays a major role in enumerative…

We consider the set of all 2-step recurrences (difference equations) that are given by linear fractional maps. These give birational maps of the plane. We determine the degree growth of these birational maps. We find the all the maps in…

We consider long-range percolation on $\mathbb{Z}^d$, where the probability that two vertices at distance $r$ are connected by an edge is given by $p(r)=1-\exp[-\lambda(r)]\in(0,1)$ and the presence or absence of different edges are…

We investigate random compact sets with random functions defined thereon, such as polynomials, rational functions, the pluricomplex Green function and the Siciak extremal function. One surprising consequence of our study is that randomness…

We consider complex polynomials $f(z) = z^\ell+c_1$ for $\ell \in 2\N$ and $c_1 \in \R$, and find some combinatorial types and values of $\ell$ such that there is no invariant probability measure equivalent to conformal measure on the Julia…

The paper addresses the calculation of correlation functions of permanental polynomials of matrices with random entries. By exploiting a convenient contour integral representation of the matrix permanent some explicit results are provided…

We consider a general class of Markovian models describing the growth in a randomly fluctuating environment of a clonal biological population having several phenotypes related by stochastic switching. Phenotypes differ e.g. by the level of…

Representation theory of the symmetric group $\mathfrak{S}_n$ has a very distinctive combinatorial flavor. The conjugacy classes as well as the irreducible characters are indexed by integer partitions $\lambda \vdash n$. We introduce class…