Related papers: Periodic codings of Bratteli-Vershik systems
We consider the vortex structure of a rapidly rotating trapped atomic Bose-Einstein condensate in the presence of a co-rotating periodic optical lattice potential. We observe a rich variety of structural phases which reflect the interplay…
Time-varying data with irregular structures can be described by finite time-vertex graph signals (FTVGS), which represent potential temporal and spatial relationships among multiple sources. While sampling and corresponding reconstruction…
Trellises are crucial graphical representations of codes. While conventional trellises are well understood, the general theory of (tail-biting) trellises is still under development. Iterative decoding concretely motivates such theory. In…
We consider contractive systems whose trajectories evolve on a compact and convex state-space. It is well-known that if the time-varying vector field of the system is periodic then the system admits a unique globally asymptotically stable…
We present a method to construct signatures of periodic-like data. Based on topological considerations, our construction encodes information about the order and values of local extrema. Its main strength is robustness to reparametrisation…
Complex periodic structures inherit spectral properties from the constituent parts of their unit cells, chiefly their spectral band gaps. Exploiting this intuitive principle, which is made precise in this work, means spectral features of…
We describe new, simple, recursive methods of construction for orientable sequences over an arbitrary finite alphabet, i.e. periodic sequences in which any sub-sequence of n consecutive elements occurs at most once in a period in either…
In this paper we study the directions of periodicity of three-dimensional subshifts of finite type (SFTs) and in particular their slopes. A configuration of a subshift has a slope of periodicity if it is periodic in exactly one direction,…
In this paper we look at symbolic substitutions and their relationship to Bratteli diagrams and their associated operator algebras. In particular, we consider the equivalence relation on substitutions induced by telescope equivalence of…
The state-of-the-art error correcting codes are based on large random constructions (random graphs, random permutations, ...) and are decoded by linear-time iterative algorithms. Because of these features, they are remarkable examples of…
Recently the Kac formula for the conditional expectation of the first recurrence time of a conditionally ergodic conditional expectation preserving system was established in the measure free setting of vector lattices (Riesz spaces). We now…
We construct a period regulator for motivic cohomology of an algebraic scheme over a subfield of the complex numbers. For the field of algebraic numbers we formulate a period conjecture for motivic cohomology by saying that this period…
The goal of this paper is to show how to produce a piece of rigorous bifurcation diagram of periodic orbits for an ODE. We study the Rossler system, one of the textbook examples of ODEs generating nontrivial dynamics, for the parameter…
This paper introduces a structured decoding framework for the Voynich Manuscript, based on mathematical rhythm, symbolic transformation, and glyph-level recursion. Rather than interpret symbols phonetically, this method decodes them by…
Decoding of convolutional codes poses a significant challenge for coding theory. Classical methods, based on e.g. Viterbi decoding, suffer from being computationally expensive and are restricted therefore to codes of small complexity. Based…
This paper is about the tiling dynamical systems approach to the study of aperiodic order. We compare and contrast four related types of systems: ordinary (one-dimensional) symbolic systems, one-dimensional tiling systems, multidimensional…
In some particular cases we give criteria for morphic sequences to be almost periodic (=uniformly recurrent). Namely, we deal with fixed points of non-erasing morphisms and with automatic sequences. In both cases a polynomial-time algorithm…
For a quantum state, or classical harmonic normal mode, of a system of spatial periodicity "R", Bloch character is encoded in a wavevector "K". One can ask whether this state has partial Bloch character "k" corresponding to a finer scale of…
We investigate spectral properties of quantum graphs in the form of a periodic chain of rings with a connecting link between each adjacent pair, assuming that wave functions at the vertices are matched through conditions manifestly…
Hypergraphs are structures that can be decomposed or described; in other words they are recursively countable. Here, we get exact and asymptotic enumeration results on hypergraphs by means of exponential generating functions. The number of…