Related papers: Topological Mixing of Random Substitutions
We consider two families of planar self-similar tilings of different nature: the tilings consisting of translated copies of the fractal sets defined by an iterated function system, and the tilings obtained as a geometrical realization of a…
Randomized higher-order computation can be seen as being captured by a lambda calculus endowed with a single algebraic operation, namely a construct for binary probabilistic choice. What matters about such computations is the probability of…
We describe a very simple method for `consistent sampling' that allows for sampling with replacement. The method extends previous approaches to consistent sampling, which assign a pseudorandom real number to each element, and sample those…
We perform certain alternating binomial summations with parameters that occur in the analysis of algorithms. A combination of integral and special function and special number representations is used. The results are sufficiently general to…
Can you decide if there is a coincidence in the numbers counting two different combinatorial objects? For example, can you decide if two regions in $\mathbb{R}^3$ have the same number of domino tilings? There are two versions of the…
In this paper we study substitutions on $A^\mathbb{Z}$ where $A$ is a finite alphabet. We precisely characterize the minimal components of substitution subshifts, give an optimal bound for their number and describe their dynamics. The…
Gibbs sampling methods are standard tools to perform posterior inference for mixture models. These have been broadly classified into two categories: marginal and conditional methods. While conditional samplers are more widely applicable…
Given a countable set X (usually taken to be the natural numbers or integers), an infinite permutation, \pi, of X is a linear ordering of X. This paper investigates the combinatorial complexity of infinite permutations on the natural…
Let A be a finite alphabet and f: A^* --> A^* be a morphism with an iterative fixed point f^\omega(\alpha), where \alpha{} is in A. Consider the subshift (X, T), where X is the shift orbit closure of f^\omega(\alpha) and T: X --> X is the…
Classification is a central problem for dynamical systems, in particular for families that arise in a wide range of topics, like substitution subshifts. It is important to be able to distinguish whether two such subshifts are isomorphic,…
A minimal system $(X,T)$ is topologically mildly mixing if all non-empty open subsets $U,V$, $\{n\in \Z: U\cap T^{-n}V\neq \emptyset\}$ is an IP$^*$-set. In this paper we show that if a minimal system is topologically mildly mixing, then it…
Using the combinatorial properties of subsets of integers, a classification of metric dynamical systems was given in [V. Bergelson and T. Downarowicz, Large sets of integers and hierarchy of mixing properties of measure-preserving systems,…
A rank one local system on the complement of a hyperplane arrangement is said to be admissible if it satisfies certain non-positivity condition at every resonant edges. It is known that the cohomology of admissible local system can be…
We establish necessary and sufficient conditions for suspension flows over certain families of shift spaces to be topologically mixing. We also show the similarities and differences between this case and the smooth measure theoretic setting…
In the context of stationary $\mathbb{Z}^d$ nearest-neighbour Gibbs measures $\mu$ satisfying strong spatial mixing, we present a new combinatorial condition (the topological strong spatial mixing property (TSSM)) on the support of $\mu$…
In this paper we study the problem of estimating the alpha-, beta- and phi-mixing coefficients between two random variables, that can either assume values in a finite set or the set of real numbers. In either case, explicit closed-form…
A particularly important substructure in modeling joint linear chance-constrained programs with random right-hand sides and finite sample space is the intersection of mixing sets with common binary variables (and possibly a knapsack…
We show that strong coincidences of a certain many choices of control points are equivalent to overlap coincidence for the suspension tiling of Pisot substitution. The result is valid for degree $\ge 2$ as well, under certain topological…
Domino tilings have been studied extensively for both their statistical properties and their dynamical properties. We construct a subshift of finite type using matching rules for several types of dominos. We combine the previous results…
Given a countable set X (usually taken to be N or Z), an infinite permutation $\pi$ of X is a linear ordering $<_\pi$ of X. This paper investigates the combinatorial complexity of infinite permutations on N associated with the image of…