Related papers: Periodic codings of Bratteli-Vershik systems
We show that the directed labelled Cayley graphs coincide with the rooted deterministic vertex-transitive simple graphs. The Cayley graphs are also the strongly connected deterministic simple graphs of which all vertices have the same cycle…
Periodic eigendecomposition, to be formulated in this paper, is a numerical method to compute Floquet spectrum and Floquet vectors along periodic orbits in a dynamical system. It is rooted in numerical algorithms advances in computation of…
Periodicity analysis of sequences generated by a deterministic system is a long-standing challenge in both theoretical research and engineering applications. To overcome the inevitable degradation of the Logistic map on a finite-precision…
Petri nets are a mathematical language for modeling and reasoning about distributed systems. In this paper we propose an approach to Petri nets for embedding reversibility, i.e., the ability of reversing an executed sequence of operations…
A graph is periodic if it can be obtained by joining identical pieces in a cyclic fashion. It is shown that the limit crossing number of a periodic graph is computable. This answers a question of Benny Pinontoan and Bruce Richter (2004).
Labeled transition systems can be a great way to visualize the complex behavior of parallel and communicating systems. However, if, during a particular timeframe, no synchronization or communication between processes occurs, then multiple…
Fundamental problems of periodicity and transient process to periodicity of chaotic trajectories in computer realization with finite computation precision is investigated by taking single and coupled Logistic maps as examples. Empirical…
We construct 1-parameter families of non-periodic embedded minimal surfaces of infinite genus in $T \times \mathbb{R}$, where $T$ denotes a flat 2-tori. Each of our families converges to a foliation of $T \times \mathbb{R}$ by $T$. These…
This short note proposes a symbolic approach for representing and reasoning about quantum circuits using complex, vector or matrix-valued Boolean expressions. A major benefit of this approach is that it allows us to directly borrow the…
Polar codes are recursive general concatenated codes. This property motivates a recursive formalization of the known decoding algorithms: Successive Cancellation, Successive Cancellation with Lists and Belief Propagation. Using such…
We encode/decode Prolog terms as unique natural numbers. Our encodings have the following properties: a) are bijective b) natural numbers always decode to syntactically valid terms c) they work in low polynomial time in the bitsize of the…
In [LT16], Kathryn Lindsey and the second author constructed a translation surface from a bi-infinite Bratteli diagram. We continue an investigation into these surfaces. The construction given in [LT16] was essentially combinatorial. Here,…
The notion of almost periodicity nontrivially generalizes the notion of periodicity. Strongly almost periodic sequences (=uniformly recurrent infinite words) first appeared in the field of symbolic dynamics, but then turned out to be…
A number system coding for the permutations generated by cyclic shift is described. The system allows to find the rank of a permutation given how it has been generated, and to determine a permutation given its rank. It defines a code…
In this paper, we present a coding-theoretic framework for message transmission over packet-switched networks. Network is modeled as a channel which can induce packet errors, deletions, insertions, and out of order delivery of packets. The…
We define a period map for classical Campedelli surfaces, using a covering trick as in the case of Enriques surfaces: the period map is shown to come from a family of Enriques surfaces, obtained as quotients of the Campedelli surface by an…
In this paper we discuss a coding and the associated symbolic dynamics for the geodesic flow on Hecke triangle surfaces. We construct an explicit cross section for which the first return map factors through a simple (explicit) map given in…
We construct geometric realizations for the infimax family of substitutions by generalizing the Rauzy-Canterini-Siegel method for a single substitution to the S-adic case. The composition of each countably infinite subcollection of…
A linear recurrence sequence in a cyclotomic field produces a sequence of the generating fields of each term. We show that the later sequence is periodic after removing the first finite terms, and give a bound of its period. This can be…
Vortex arrays in type-II superconductors admit the translational symmetry of an infinite system. There are cases, however, like ultra-cold trapped Fermi gases and the crust of neutron stars, where finite-size effects make it quite more…