Related papers: To Symbolic Dynamics Through The Thue-Morse Sequen…
We use parameterized Morse theory on the pages of an open book decomposition to efficiently encode the contact topology in terms of a labelled graph on a disjoint union of tori (one per binding component). This construction allows us to…
We develop a new approach to recurrence and the existence of non-constant harmonic functions on infinite weighted graphs. The approach is based on the capacity of subsets of metric boundaries with respect to intrinsic metrics. The main tool…
The sequence A000975 in OEIS can be defined by $A_1=1$, $A_{n+1}=2A_n$ if $n$ is odd, and $A_{n+1}=2A_n+1$ if $n$ is even. This sequence satisfies other recurrence relations, admits some closed formulas, and is known to enumerate several…
We provide an ergodic theory framework to study statistical properties of smooth sequences over the odd alphabet {1, 3}. The arithmetic nature of this alphabet yields a partition of the subshift of smooth sequences based on their local…
The aim of this work is to enumerate alternating sign matrices (ASM) that are quasi-invariant under a quarter-turn. The enumeration formula (conjectured by Duchon) involves, as a product of three terms, the number of unrestricted ASM's and…
The chaotic properties of some subshift maps are investigated. These subshifts are the orbit closures of certain non-periodic recurrent points of a shift map. We first provide a review of basic concepts for dynamics of continuous maps in…
Let $E$ be an elliptic curve over $\mathbb{Q}$ described by $y^2= x^3+ Kx+ L$ where $K, L \in \mathbb{Q}$. A set of rational points $(x_i,y_i) \in E(\mathbb{Q})$ for $i=1, 2, \cdots, k$, is said to be a sequence of consecutive cubes on $E$…
We introduce a new family of meta-Fibonacci sequences $(f(n))_{n\in\mathbb{N}}$, governed by the recurrence relation $$f(n)=af(n-u_{n}-1)+bf(n-u_{n}-2),$$ where $\mathbf{u}=(u_{n})_{n\in \mathbb{N}}$ is a sequence with values $0,1$. Our…
In a finite undirected simple graph, a {\it chordless cycle} is an induced subgraph which is a cycle. We propose two algorithms to enumerate all chordless cycles of such a graph. Compared to other similar algorithms, the proposed algorithms…
The answer to this question is no. In fact, in addition to the solution first obtained by Christiaan Huygens in 1658, given by the cycloid, we show that there is an infinite number of tautochrone curves. With this goal, we start by briefly…
In this paper we use the Recursion Theorem to show the existence of various infinite sequences and sets. Our main result is that there is an increasing sequence e_0, e_1, e_2 .. such that W_{e_n}={e_{n+1}} for every n. Similarly, we prove…
We consider a symbolic coding for geodesics on the family of Veech surfaces (translation surfaces rich with affine symmetries) recently discovered by Bouw and Moeller. These surfaces, as noticed by Hooper, can be realized by cutting and…
This article describes sixteen different ways to traverse d-dimensional space recursively in a way that is well-defined for any number of dimensions. Each of these traversals has distinct properties that may be beneficial for certain…
We give a partial answer to a problem of Harju by constructing an infinite ternary squarefree word $w$ with the property that for every $k \geq 3312$ there is an interior length-$k$ factor of $w$ that can be deleted while still preserving…
In this work we introduce a new notion called opacity complexity to measure the complexity of automatic sequences. We study basic properties of this notion, and exhibit an algorithm to compute it. As applications, we compute the opacity…
This thesis investigates three biologically inspired operations: prefix-suffix duplication, bounded prefix-suffix duplication, and prefix-suffix-square completion. Duplication, a common genetic mutation, involves repeating DNA sequences and…
Continued fraction expansions and Hankel determinants of automatic sequences are extensively studied during the last two decades. These studies found applications in number theory in evaluating irrationality exponents. The present paper is…
Given a finite alphabet $\mathbb{A}$ and a primitive substitution $\theta:\mathbb{A}\to\mathbb{A}^\lambda$ (of constant length $\lambda$), let $(X_\theta,S)$ denote the corresponding dynamical system, where $X_{\theta}$ is the closure of…
Let $f:\mathbb{T}\to\mathbb{R}$ be a Morse function of class $C^2$ with exactly two critical points, let $\omega\in\mathbb{T}$ be Diophantine, and let $\lambda>0$ be sufficiently large (depending on $f$ and $\omega$). For any value of the…
In 1982, Seebold showed that the only overlap-free binary words that are the fixed points of non-identity morphisms are the Thue-Morse word and its complement. We strengthen Seebold's result by showing that the same result holds if the term…