On the intersections of Fibonacci, Pell, and Lucas numbers

We describe how to compute the intersection of two Lucas sequences of the forms $\{U_n(P,\pm 1) \}_{n=0}^{\infty}$ or $\{V_n(P,\pm 1) \}_{n=0}^{\infty}$ with $P\in\mathbb{Z}$ that includes sequences of Fibonacci, Pell, Lucas, and Lucas-Pell numbers. We prove that such an intersection is finite except for the case $U_n(1,-1)$ and $U_n(3,1)$ and the case of two $V$-sequences when the product of their discriminants is a perfect square. Moreover, the intersection in these cases also forms a Lucas sequence. Our approach relies on solving homogeneous quadratic Diophantine equations and Thue equations. In particular, we prove that 0, 1, 2, and 5 are the only numbers that are both Fibonacci and Pell, and list similar results for many other pairs of Lucas sequences. We further extend our results to Lucas sequences with arbitrary initial terms

Transition Property For Cube-Free Words

We study cube-free words over arbitrary non-unary finite alphabets and prove the following structural property: for every pair $(u,v)$ of $d$-ary cube-free words, if $u$ can be infinitely extended to the right and $v$ can be infinitely extended to the left respecting the cube-freeness property, then there exists a "transition" word $w$ over the same alphabet such that $uwv$ is cube free. The crucial case is the case of the binary alphabet, analyzed in the central part of the paper. The obtained "transition property", together with the developed technique, allowed us to solve cube-free versions of three old open problems by Restivo and Salemi. Besides, it has some further implications for combinatorics on words; e.g., it implies the existence of infinite cube-free words of very big subword (factor) complexity.Comment: 14 pages, 5 figure

Avoidability of formulas with two variables

In combinatorics on words, a word $w$ over an alphabet $\Sigma$ is said to avoid a pattern $p$ over an alphabet $\Delta$ of variables if there is no factor $f$ of $w$ such that $f=h(p)$ where $h:\Delta^*\to\Sigma^*$ is a non-erasing morphism. A pattern $p$ is said to be $k$-avoidable if there exists an infinite word over a $k$-letter alphabet that avoids $p$. We consider the patterns such that at most two variables appear at least twice, or equivalently, the formulas with at most two variables. For each such formula, we determine whether it is $2$-avoidable, and if it is $2$-avoidable, we determine whether it is avoided by exponentially many binary words

Dense Packings of Congruent Circles in Rectangles with a Variable Aspect Ratio

We use computational experiments to find the rectangles of minimum area into which a given number n of non-overlapping congruent circles can be packed. No assumption is made on the shape of the rectangles. Most of the packings found have the usual regular square or hexagonal pattern. However, for 1495 values of n in the tested range n =< 5000, specifically, for n = 49, 61, 79, 97, 107,... 4999, we prove that the optimum cannot possibly be achieved by such regular arrangements. The evidence suggests that the limiting height-to-width ratio of rectangles containing an optimal hexagonal packing of circles tends to 2-sqrt(3) as n tends to infinity, if the limit exists.Comment: 21 pages, 13 figure

A symmetry group of a Thue-Morse quasicrystal

We present a method of coding general self-similar structures. In particular, we construct a symmetry group of a one-dimensional Thue-Morse quasicrystal, i.e., of a nonperiodic ground state of a certain translation-invariant, exponentially decaying interaction.Comment: 6 pages, Late

Unambiguous 1-Uniform Morphisms

A morphism h is unambiguous with respect to a word w if there is no other morphism g that maps w to the same image as h. In the present paper we study the question of whether, for any given word, there exists an unambiguous 1-uniform morphism, i.e., a morphism that maps every letter in the word to an image of length 1.Comment: In Proceedings WORDS 2011, arXiv:1108.341

Which game narratives do adolescents of different gameplay and sociodemographic backgrounds prefer? a mixed-methods analysis

OBJECTIVE: The aim of this study was to investigate which narrative elements of digital game narratives are preferred by the general adolescent population, and to examine associations with gender, socioeconomic status (SES), and gameplay frequency. Further, the study aims to discuss how results can be translated to serious digital games. MATERIALS AND METHODS: Adolescents were recruited through school to complete a survey on narrative preferences in digital games. The survey included questions on sociodemographic information, frequency of gameplay, and an open-ended question on what could be an appealing narrative for them. Data were analyzed in a mixed-methods approach, using thematic analysis and chi-square analyses to determine narrative preferences and the associations between game narrative elements and player characteristics (gender, SES, and frequency of gameplay). RESULTS: The sample consisted of 446 adolescents (12-15 years old) who described 30 narrative subthemes. Preferences included human characters as protagonists; nonhuman characters only as antagonists; realistic settings, such as public places or cities; and a strong conflict surrounding crime, catastrophe, or war. Girls more often than boys defined characters by their age, included avatars, located the narrative in private places, developed profession-related skills, and included a positive atmosphere. Adolescents of nonacademic education more often than adolescents of academic education defined characters by criminal actions. Infrequent players more often included human characters defined by their age than frequent players. After performing a Bonferroni correction, narrative preferences for several gender differences remained. CONCLUSION: Different narrative elements related to subgroups of adolescents by gender, SES, and frequency of gameplay. Customization of narratives in serious digital health games should be warranted for boys and girls; yet, further research is needed to specify how to address girls in particular

Geometrical Frustration and Static Correlations in Hard-Sphere Glass Formers

We analytically and numerically characterize the structure of hard-sphere fluids in order to review various geometrical frustration scenarios of the glass transition. We find generalized polytetrahedral order to be correlated with increasing fluid packing fraction, but to become increasingly irrelevant with increasing dimension. We also find the growth in structural correlations to be modest in the dynamical regime accessible to computer simulations.Comment: 21 pages; part of the "Special Topic Issue on the Glass Transition

Jamming II: Edwards' statistical mechanics of random packings of hard spheres

The problem of finding the most efficient way to pack spheres has an illustrious history, dating back to the crystalline arrays conjectured by Kepler and the random geometries explored by Bernal in the 60's. This problem finds applications spanning from the mathematician's pencil, the processing of granular materials, the jamming and glass transitions, all the way to fruit packing in every grocery. There are presently numerous experiments showing that the loosest way to pack spheres gives a density of ~55% (RLP) while filling all the loose voids results in a maximum density of ~63-64% (RCP). While those values seem robustly true, to this date there is no physical explanation or theoretical prediction for them. Here we show that random packings of monodisperse hard spheres in 3d can pack between the densities 4/(4 + 2 \sqrt 3) or 53.6% and 6/(6 + 2 \sqrt 3) or 63.4%, defining RLP and RCP, respectively. The reason for these limits arises from a statistical picture of jammed states in which the RCP can be interpreted as the ground state of the ensemble of jammed matter with zero compactivity, while the RLP arises in the infinite compactivity limit. We combine an extended statistical mechanics approach 'a la Edwards' (where the role traditionally played by the energy and temperature in thermal systems is substituted by the volume and compactivity) with a constraint on mechanical stability imposed by the isostatic condition. Ultimately, our results lead to a phase diagram that provides a unifying view of the disordered hard sphere packing problem.Comment: 55 pages, 19 figures, C. Song, P. Wang, H. A. Makse, A phase diagram for jammed matter, Nature 453, 629-632 (2008

On the maximal number of cubic subwords in a string

We investigate the problem of the maximum number of cubic subwords (of the form $www$) in a given word. We also consider square subwords (of the form $ww$). The problem of the maximum number of squares in a word is not well understood. Several new results related to this problem are produced in the paper. We consider two simple problems related to the maximum number of subwords which are squares or which are highly repetitive; then we provide a nontrivial estimation for the number of cubes. We show that the maximum number of squares $xx$ such that $x$ is not a primitive word (nonprimitive squares) in a word of length $n$ is exactly $\lfloor \frac{n}{2}\rfloor - 1$, and the maximum number of subwords of the form $x^k$, for $k\ge 3$, is exactly $n-2$. In particular, the maximum number of cubes in a word is not greater than $n-2$ either. Using very technical properties of occurrences of cubes, we improve this bound significantly. We show that the maximum number of cubes in a word of length $n$ is between $(1/2)n$ and $(4/5)n$. (In particular, we improve the lower bound from the conference version of the paper.)Comment: 14 page