Related papers: Periodic codings of Bratteli-Vershik systems
For a non-arithmetic Veech surface, it is known that the set points having finite orbit under the Veech group, called the set of periodic points, is finite. However, few examples of these periodic point sets have been computed. In what…
We define an algorithm which begins with an sequence of sequences, and produces a single sequence, with following property: If at least one of the original sequences has a tail that is periodic, then the output sequence has a periodic tail,…
The present paper explores substitution minimal systems and their relation to stationary Bratteli diagrams and stationary dimension groups. The constructions involved are algorithmic and explicit, and render an effective method to compute…
We classify the sets of natural numbers $n$ for which certain dynamical systems $(X,f)$ on a compact metric space $X$ have a periodic point of (least) period $n$. Interest in this question dates back to Sharkovskii's theorem for continuous…
The $n$th term of an automatic sequence is the output of a deterministic finite automaton fed with the representation of $n$ in a suitable numeration system. In this paper, instead of considering automatic sequences built on a numeration…
This paper describes new, simple, recursive methods of construction for orientable sequences, i.e. periodic binary sequences in which any n-tuple occurs at most once in a period in either direction. As has been previously described, such…
Quasi-cyclic codes form an important class of algebraic codes that includes cyclic codes as a special subclass. This chapter focuses on the algebraic structure of quasi-cyclic codes, first. Based on these structural properties, some…
Observable convolutional codes defined over Zpr with the Predictable Degree Property admit minimal input/state/output representations that preserve structural properties under scalar restriction. We make use of this fact to present…
This article presents a complete scheme for the development of Critical Embedded Systems with Multiple Real-Time Constraints. The system is programmed with a language that extends the synchronous approach with high-level real-time…
Minimal Cantor systems of finite topological rank (that can be represented by a Bratteli-Vershik diagram with a uniformly bounded number of vertices per level) are known to have dynamical rigidity properties. We establish that such systems,…
Generalizations of linear numeration systems in which the set of natural numbers is recognizable by finite automata are obtained by describing an arbitrary infinite regular language following the lexicographic ordering. For these systems of…
The finite element computation of structures such as waveguides can lead to heavy computations when the length of the structure is large compared to the wavelength. Such waveguides can in fact be seen as one-dimensional periodic structures.…
This paper presents a general and systematic discussion of various symbolic representations of iterated maps through subshifts. We give a unified model for all continuous maps on a metric space, by representing a map through a general…
We address the problem of analytically extracting a countable infinity of flat, non-dispersive bands in a periodic array of cells that comprise branching Vicsek geometries of higher and higher generations. Through a geometric construction,…
We introduce a new variation of Tree Encoding with Nested Intervals, find connections with Materialized Path, and suggest a method for moving parts of the hierarchy.
Difference schemes are considered for dynamical systems $ \dot x = f (x) $ with a quadratic right-hand side, which have $t$-symmetry and are reversible. Reversibility is interpreted in the sense that the Cremona transformation is performed…
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…
We present the theory of analytical Hartree-Fock gradients for periodic systems as implemented in the code CRYSTAL. We demonstrate how derivatives of the integrals can be computed with the McMurchie-Davidson algorithm. Highly accurate…
For a class of Fibonacci-like unimodal maps, the restriction to the $\omega$-limit set of the unique turning point defines a minimal Cantor system. We construct these Cantor sets geometrically using a nested sequence of finite covers with a…
(Abbr.) We consider a direct representation of a periodic time-function by means of its zero-crossings. The use of the zero-crossings as the describing parameters is made possible by a singular model of a strongly nonlinear electrical…