Multidimensional extension of the Morse--Hedlund theorem

A celebrated result of Morse and Hedlund, stated in 1938, asserts that a sequence $x$ over a finite alphabet is ultimately periodic if and only if, for some $n$, the number of different factors of length $n$ appearing in $x$ is less than $n+1$. Attempts to extend this fundamental result, for example, to higher dimensions, have been considered during the last fifteen years. Let $d\ge 2$. A legitimate extension to a multidimensional setting of the notion of periodicity is to consider sets of \ZZ^d definable by a first order formula in the Presburger arithmetic . With this latter notion and using a powerful criterion due to Muchnik, we exhibit a complete extension of the Morse--Hedlund theorem to an arbitrary dimension $d$ and characterize sets of $\ZZ^d$ definable in in terms of some functions counting recurrent blocks, that is, blocks occurring infinitely often

Asymptotic properties of free monoid morphisms

Motivated by applications in the theory of numeration systems and recognizable sets of integers, this paper deals with morphic words when erasing morphisms are taken into account. Cobham showed that if an infinite word $w =g(f^\omega(a))$ is the image of a fixed point of a morphism $f$ under another morphism $g$, then there exist a non-erasing morphism $\sigma$ and a coding $\tau$ such that $w =\tau(\sigma^\omega(b))$. Based on the Perron theorem about asymptotic properties of powers of non-negative matrices, our main contribution is an in-depth study of the growth type of iterated morphisms when one replaces erasing morphisms with non-erasing ones. We also explicitly provide an algorithm computing $\sigma$ and $\tau$ from $f$ and $g$.Comment: 25 page

Limit theorems for a class of identically distributed random variables

A new type of stochastic dependence for a sequence of random variables is introduced and studied. Precisely, (X_n)_{n\geq 1} is said to be conditionally identically distributed (c.i.d.), with respect to a filtration (G_n)_{n\geq 0}, if it is adapted to (G_n)_{n\geq 0} and, for each n\geq 0, (X_k)_{k>n} is identically distributed given the past G_n. In case G_0={\varnothing,\Omega} and G_n=\sigma(X_1,...,X_n), a result of Kallenberg implies that (X_n)_{n\geq 1} is exchangeable if and only if it is stationary and c.i.d. After giving some natural examples of nonexchangeable c.i.d. sequences, it is shown that (X_n)_{n\geq 1} is exchangeable if and only if (X_{\tau(n)})_{n\geq 1} is c.i.d. for any finite permutation \tau of {1,2,...}, and that the distribution of a c.i.d. sequence agrees with an exchangeable law on a certain sub-\sigma-field. Moreover, (1/n)\sum_{k=1}^nX_k converges a.s. and in L^1 whenever (X_n)_{n\geq 1} is (real-valued) c.i.d. and E[| X_1| ]<\infty. As to the CLT, three types of random centering are considered. One such centering, significant in Bayesian prediction and discrete time filtering, is E[X_{n+1}| G_n]. For each centering, convergence in distribution of the corresponding empirical process is analyzed under uniform distance.Comment: Published by the Institute of Mathematical Statistics (http://www.imstat.org) in the Annals of Probability (http://www.imstat.org/aop/) at http://dx.doi.org/10.1214/00911790400000067

Abstract numeration systems on bounded languages and multiplication by a constant

A set of integers is $S$-recognizable in an abstract numeration system $S$ if the language made up of the representations of its elements is accepted by a finite automaton. For abstract numeration systems built over bounded languages with at least three letters, we show that multiplication by an integer $\lambda\ge2$ does not preserve $S$-recognizability, meaning that there always exists a $S$-recognizable set $X$ such that $\lambda X$ is not $S$-recognizable. The main tool is a bijection between the representation of an integer over a bounded language and its decomposition as a sum of binomial coefficients with certain properties, the so-called combinatorial numeration system

Connectivity of Natura 2000 forest sites in Europe

Background/Purpose: In the context of the European Biodiversity policy, the Green Infrastructure Strategy is one supporting tool to mitigate fragmentation, inter-alia to increase the spatial and functional connectivity between protected and unprotected areas. The Joint Research Centre has developed an integrated model to provide a macro-scale set of indices to evaluate the connectivity of the Natura 2000 network, which forms the backbone of a Green Infrastructure for Europe. The model allows a wide assessment and comparison to be performed across countries in terms of structural (spatially connected or isolated sites) and functional connectivity (least-cost distances between sites influenced by distribution, distance and land cover). Main conclusion: The Natura 2000 network in Europe shows differences among countries in terms of the sizes and numbers of sites, their distribution as well as distances between sites. Connectivity has been assessed on the basis of a 500 m average inter-site distance, roads and intensive land use as barrier effects as well as the presence of "green" corridors. In all countries the Natura 2000 network is mostly made of sites which are not physically connected. Highest functional connectivity values are found for Spain, Slovakia, Romania and Bulgaria. The more natural landscape in Sweden and Finland does not result in high inter-site network connectivity due to large inter-site distances. The distribution of subnets with respect to roads explains the higher share of isolated subnets in Portugal than in Belgium.Comment: 9 pages, from a poster published in F1000Posters 2014, 5: 48