On the entropy and letter frequencies of ternary square-free words

We enumerate all ternary length-1 square-free words, which are words avoiding squares of words up to length 1, for 1<=24. We analyse the singular behaviour of the corresponding generating functions. This leads to new upper entropy bounds for ternary square-free words. We then consider ternary square-free words with fixed letter densities, thereby proving exponential growth for certain ensembles with various letter densities. We derive consequences for the free energy and entropy of ternary square-free words

Billiards with polynomial mixing rates

While many dynamical systems of mechanical origin, in particular billiards, are strongly chaotic -- enjoy exponential mixing, the rates of mixing in many other models are slow (algebraic, or polynomial). The dynamics in the latter are intermittent between regular and chaotic, which makes them particularly interesting in physical studies. However, mathematical methods for the analysis of systems with slow mixing rates were developed just recently and are still difficult to apply to realistic models. Here we reduce those methods to a practical scheme that allows us to obtain a nearly optimal bound on mixing rates. We demonstrate how the method works by applying it to several classes of chaotic billiards with slow mixing as well as discuss a few examples where the method, in its present form, fails.Comment: 39pages, 11 figue

Some open problems on permutation patterns

This is a brief survey of some open problems on permutation patterns, with an emphasis on subjects not covered in the recent book by Kitaev, \emph{Patterns in Permutations and words}. I first survey recent developments on the enumeration and asymptotics of the pattern 1324, the last pattern of length 4 whose asymptotic growth is unknown, and related issues such as upper bounds for the number of avoiders of any pattern of length $k$ for any given $k$. Other subjects treated are the M\"obius function, topological properties and other algebraic aspects of the poset of permutations, ordered by containment, and also the study of growth rates of permutation classes, which are containment closed subsets of this poset.Comment: 20 pages. Related to upcoming talk at the British Combinatorial Conference 2013. To appear in London Mathematical Society Lecture Note Serie

Local Complexity of Delone Sets and Crystallinity

This paper characterizes when a Delone set X is an ideal crystal in terms of restrictions on the number of its local patches of a given size or on the hetereogeneity of their distribution. Let N(T) count the number of translation-inequivalent patches of radius T in X and let M(T) be the minimum radius such that every closed ball of radius M(T) contains the center of a patch of every one of these kinds. We show that for each of these functions there is a `gap in the spectrum' of possible growth rates between being bounded and having linear growth, and that having linear growth is equivalent to X being an ideal crystal. Explicitly, for N(T), if R is the covering radius of X then either N(T) is bounded or N(T) >= T/2R for all T>0. The constant 1/2R in this bound is best possible in all dimensions. For M(T), either M(T) is bounded or M(T) >= T/3 for all T>0. Examples show that the constant 1/3 in this bound cannot be replaced by any number exceeding 1/2. We also show that every aperiodic Delone set X has M(T) >= c(n)T for all T>0, for a certain constant c(n) which depends on the dimension n of X and is greater than 1/3 when n > 1.Comment: 26 pages. Uses latexsym and amsfonts package