Related papers: Periodic codings of Bratteli-Vershik systems
The computation of short paths in graphs with arc lengths is a pillar of graph algorithmics and network science. In a more diverse world, however, not every short path is equally valuable. For the setting where each vertex is assigned to a…
We introduce and study dynamical systems and measures on stationary generalized Bratteli diagrams $B$ that are represented as the union of countably many classical Pascal-Bratteli diagrams. We describe all ergodic tail invariant measures on…
Subspace codes have received an increasing interest recently due to their application in error-correction for random network coding. In particular, cyclic subspace codes are possible candidates for large codes with efficient encoding and…
A shift-periodic map is a one-dimensional map from the real line to itself which is periodic up to a linear translation and allowed to have singularities. It is shown that iterative sequences $x_{n+1}=F(x_n)$ generated by such maps display…
A coloring of a graph G = (V,E) is a partition {V1, V2, . . ., Vk} of V into independent sets or color classes. A vertex v Vi is a Grundy vertex if it is adjacent to at least one vertex in each color class Vj . A coloring is a Grundy…
Finite time-vertex graph signals (FTVGS) provide an efficient representation for capturing spatio-temporal correlations across multiple data sources on irregular structures. Although sampling and reconstruction of FTVGS with known spectral…
This paper is devoted to a systematic study of a class of binary trees encoding the structure of rational numbers both from arithmetic and dynamical point of view. The paper is divided into two parts. The first one is a critical review of…
Coherent bremsstrahlung of high energy electrons moving in a three-dimensional imperfect periodic lattice consisting of a complicated system of atoms is considered. On the basis of the normalized probability density function of the…
We define an algorithm that parses multidimensional arrays sequentially into mainly unrepeated but nested multidimensional sub-arrays of increasing size, and show that the resulting sub-block pointer encoder compresses almost every…
We consider a discrete time dynamic system described by a difference equation with periodic coefficients and with additive stochastic noise. We investigate the possibility of the periodicity for the solution. In particular, we found…
An iterative decoding algorithm for convolutional codes is presented. It successively processes $N$ consecutive blocks of the received word in order to decode the first block. A bound is presented showing which error configurations can be…
We consider the 1D periodic Jacobi matrices. The spectrum of this operator is purely absolutely continuous and consists of intervals separated by gaps. We solve the inverse problem (including characterization) in terms of vertical slits on…
Interference phenomena are the source of some of the spectacular colors of animals and plants in nature. In some of these systems, the physical structure consists of an ordered array of layers with alternating high and low refractive…
In this work we provide a mathematical framework to describe the periodically time variant (PTV) linear systems. We study their frequency-domain features to estimate the output bandwidth, a necessary value to obtain a suitable digital…
We propose a novel method for fast and scalable evaluation of periodic solutions of systems of ordinary differential equations for a given set of parameter values and initial conditions. The equations governing the system dynamics are…
Periodic control systems used in spacecrafts and automotives are usually period-driven and can be decomposed into different modes with each mode representing a system state observed from outside. Such systems may also involve intensive…
In this paper, the general perturbation problem of piecewise smooth integrable differential systems with two switching planes is considered. Firstly, when the unperturbed system has a family of periodic orbits, the first order Melnikov…
A map $f{:}\,[0,1)\to [0,1)$ is a {\it piecewise contraction of $n$ intervals} ($n$-PC) if there exist $0<\lambda<1$ and a partition of $[0,1)$ into intervals $I_1,\ldots,I_n$ such that $f\vert_{I_i}$ is $\lambda$-Lipschitz for every $1\le…
In another article we associated a dynamical system to a non-properly ordered Bratteli diagram. In this article we describe how to compute the $K-$group $K_0$ of the dynamical system in terms of the Bratteli diagram. In the case of properly…
Probabilistic inference provides a language for describing how organisms may learn from and adapt to their environment. The computations needed to implement probabilistic inference often require specific representations, akin to having the…