Related papers: Periodic codings of Bratteli-Vershik systems
A novel class of graphs, here named quasiperiodic, are constructed via application of the Horizontal Visibility algorithm to the time series generated along the quasiperiodic route to chaos. We show how the hierarchy of mode-locked regions…
Droplets moving in a microfluidic loop device exhibit both periodic and chaotic behaviors based on the inlet droplet spacing. We propose that the periodic behavior is an outcome of a dispersed phase conservation principle. This conservation…
This paper explores the connection between semantic equivalences and preorders for concrete sequential processes, represented by means of labelled transition systems, and formats of transition system specifications using Plotkin's…
We investigate the generation of fractional-period states in continuum periodic systems. As an example, we consider a Bose-Einstein condensate confined in an optical-lattice potential. We show that when the potential is turned on…
We construct meta-intransitive systems of independent random variables of any finite order from basic tuple of random variables which generalize intransitive dice. Under this construction, the equality of some linear functional is…
A Kirchhoff graph is a vector graph with orthogonal cycles and vertex cuts. An algorithm has been developed that constructs all the Kirchhoff graphs up to a fixed edge multiplicity. This algorithm is used to explore the structure of prime…
The objective of this paper is to derive the essential invariance and contraction properties for the geometric periodic systems, which can be formulated as a category of differential inclusions, and primarily rendered in the phase…
Color coding is an algorithmic technique used in parameterized complexity theory to detect "small" structures inside graphs. The idea is to derandomize algorithms that first randomly color a graph and then search for an easily-detectable,…
In this article we study conditions to be a continuous or a measurable eigenvalue of finite rank minimal Cantor systems, that is, systems given by an ordered Bratteli diagram with a bounded number of vertices per level. We prove that…
A general technique for the periodic orbit quantization of systems with near-integrable to mixed regular-chaotic dynamics is introduced. A small set of periodic orbits is sufficient for the construction of the semiclassical recurrence…
This paper addresses a system identification for linear periodically time-varying plants in the discrete-time setting. A system identification algorithm for linear, periodically time-varying plants is introduced based on a cyclic…
We characterize the structure of the periods of a neuronal recurrence equation. Firstly, we give a characterization of k-chains in 0-1 periodic sequences. Secondly, we characterize the periods of all cycles of some neuronal recurrence…
It is known that problems like Vertex Cover, Feedback Vertex Set and Odd Cycle Transversal are polynomial time solvable in the class of chordal graphs. We consider these problems in a graph that has at most $k$ vertices whose deletion…
Topological drawings are natural representations of graphs in the plane, where vertices are represented by points, and edges by curves connecting the points. Topological drawings of complete graphs and of complete bipartite graphs have been…
Periodic structures are ubiquitous in quantum many-body systems and quantum field theories, ranging from lattice models, compact spaces, to topological phenomena. However, previous bootstrap studies encountered technical challenges even for…
Vertex splitting is a graph modification operation in which a vertex is replaced by multiple vertices such that the union of their neighborhoods equals the neighborhood of the original vertex. We introduce and study vertex splitting as a…
Algorithmicists are well-aware that fast dynamic programming algorithms are very often the correct choice when computing on compositional (or even recursive) graphs. Here we initiate the study of how to generalize this folklore intuition to…
In this paper, we introduce concepts of pathwise random almost periodic and almost automorphic solutions for dynamical systems generated by non-autonomous stochastic equations. These solutions are pathwise stochastic analogues of…
Light curves of astrophysical objects frequently contain strictly periodic signals. In those cases we can use that property to aid the detrending algorithm to fully disentangle an unknown periodic signal and an unknown baseline signal with…
Multidimensional continued fractions generalize classical continued fractions with the aim of providing periodic representations of algebraic irrationalities by means of integer sequences. However, there does not exist any algorithm that…