Related papers: Characterization of circular D0L systems

Based on our studies done on two-dimensional autonomous systems, forced non-autonomous systems and time-delayed systems, we propose a unified methodology - that uses renormalization group theory - for finding out existence of periodic…

We study the topology of circularly ordered sets. While the algebraic notion is classical, the general topological theory has received comparatively little attention. In this work we provide a self-contained topological exposition and…

In this paper we provide examples of topological dynamical systems having either finite or countable scrambled sets. In particular we study conditions for the existence of Li-Yorke, asymptotic and distal pairs in constant--length…

We study chain-recurrence and chain-transitivity in compact dynamical systems without any regularity assumptions on the map. We prove that every compact system has a chain-recurrent point and a closed, invariant, chain-transitive subsystem.…

We consider dynamical systems arising from substitutions over a finite alphabet. We prove that such a system is linearly repetitive if and only if it is minimal. Based on this characterization we extend various results from primitive…

Consider n unit intervals, say [1,2], [3,4], ..., [2n-1,2n]. Identify their endpoints in pairs at random, with all (2n-1)!! = (2n-1) (2n-3) ... 3 1 pairings being equally likely. The result is a collection of cycles of various lengths, and…

A cyclic proof system allows us to perform inductive reasoning without explicit inductions. We propose a cyclic proof system for HFLN, which is a higher-order predicate logic with natural numbers and alternating fixed-points. Ours is the…

This paper answers open questions about the correctness and the completeness of Dart-Zobel algorithm for testing the inclusion relation between two regular types. We show that the algorithm is incorrect for regular types. We also prove that…

For each integer $t\ge 5$, we give a polynomial-time algorithm to test whether a graph contains an induced cycle with length at least $t$ and odd.

One of the cornerstones of the distributed complexity theory is the derandomization result by Chang, Kopelowitz, and Pettie [FOCS 2016]: any randomized LOCAL algorithm that solves a locally checkable labeling problem (LCL) can be…

For each odd $m \geq 3$ we completely solve the problem of when an $m$-cycle system of order $u$ can be embedded in an $m$-cycle system of order $v$, barring a finite number of possible exceptions. In cases where $u$ is large compared to…

This paper formalize the existence's proof of first-integrals for any second order ODE, allowing to discriminate periodic orbits. Up to the author's knowledge, such a powerful result is not available in the literature providing a tool to…

We prove a general theorem that gives a linear recurrence for tuples of paths in every cylindrical network. This can be seen as a cylindrical analog of the Lindstr\"om-Gessel-Viennot theorem. We illustrate the result by applying it to Schur…

Peter Doyle conjectured that locally univalent circle packings on the hexagonal lattice only consist of regular hexagonal packings and Doyle spirals, which is called the Doyle conjecture. In this paper, we prove a rigidity theorem for Doyle…

In this paper, we study rotation numbers of random dynamical systems on the circle. We prove the existence of rotation numbers and the continuous dependence of rotation numbers on the systems. As an application, we prove a theorem on…

Robin Milner (1984) gave a sound proof system for bisimilarity of regular expressions interpreted as processes: Basic Process Algebra with unary Kleene star iteration, deadlock 0, successful termination 1, and a fixed-point rule. He asked…

We propose a new efficient algorithm for detecting if a cycle in a timed automaton can be iterated infinitely often. Existing methods for this problem have a complexity which is exponential in the number of clocks. Our method is polynomial:…

Biological and physical systems that can be classified as oscillatory media give rise to interesting phenomena like target patterns and spiral waves. The existence of these structures has been proven in the case of systems with local…

We consider random dynamical systems such as groups of conformal transformations with a probability measure, or transversaly conformal foliations with a Laplace operator along the leaves, in which case we consider the holonomy pseudo-group.…

We use character sums to confirm several recent conjectures of V. I. Arnold on the uniformity of distribution properties of a certain dynamical system in a finite field. On the other hand, we show that some conjectures are wrong. We also…