Related papers: A combinatorial problem about binary necklaces and…
We present new applications of parity inversion and time-reversal to the emergence of complex behavior from simple dynamical rules in stochastic discrete models. Our parity-based encoding of causal relationships and time-reversal…
We establish a bijective correspondence between Smirnov words with balanced letter multiplicities and Hamiltonian paths in complete $m$-partite graphs $K_{n,n,\ldots,n}$. This bijection allows us to derive closed inclusion-exclusion…
In this note we present a characterisation of all unary and binary patterns that do not only contain variables, but also reversals of their instances. These types of variables were studied recently in either more general or particular…
Universal Cycles, or U-cycles, as originally defined by de Bruijn, are an efficient method to exhibit a large class of combinatorial objects in a compressed fashion, and with no repeats. de Bruijn's theorem states that U-cycles for $n$…
We are interested in the relationships between the number fixed points in a Boolean network $f:\{0,1\}^n\to\{0,1\}^n$ and its interaction graph, which is the arc-signed digraph $G$ on $\{1,\dots,n\}$ that describes the positive and negative…
A family of periodic perturbations of an attracting robust heteroclinic cycle defined on the two-sphere is studied by reducing the analysis to that of a one-parameter family of maps on a circle. The set of zeros of the family forms a…
Boolean networks have been widely used in many areas of science and engineering to represent various dynamical behaviour. In systems biology, they became useful tools to study the dynamical characteristics of large-scale biomolecular…
A square lattice distribution of coupled oscillators that have heteroclinic cycle attractors is studied. In this system, we find a novel type of patterns that is spatially disordered and periodic in time. These patterns are limit cycle…
We study collective dynamics of complex networks of stochastic excitable elements, active rotators. In the thermodynamic limit of infinite number of elements, we apply a mean-field theory for the network and then use a Gaussian…
We give recurrence relations for the enumeration of symmetric elements within four classes of arc diagrams corresponding to certain involutions and set partitions whose blocks contain no consecutive integers. These arc diagrams are…
Deviations from the average can provide valuable insights about the organization of natural systems. This article extends this important principle to the more systematic identification and analysis of singular local connectivity patterns in…
In this paper we define a new descriptional complexity measure for Deterministic Finite Automata, BC-complexity, as an alternative to the state complexity. We prove that for two DFAs with the same number of states BC-complexity can differ…
A one-parameter family of time-reversible systems on $\mathbb{T}^3$ is considered. It is shown that the dynamics is not conservative, namely the attractor and repeller intersect but not coincide. We explain this as the manifestation of the…
Revised version: some minor errors and typos fixed; exposition watered. Abstract: To a trajectory of a billiard in parallelogram we assign its symbolic trajectory - the sequence of numbers of coordinate plane, to which the faces met by the…
We investigate the parametric evolution of riddled basins related to synchronization of chaos in two coupled piecewise-linear Lorenz maps. Riddling means that the basin of the synchronized attractor is shown to be riddled with holes…
We investigate the impact of bistability in the emergence of synchronization in networks of chaotic maps with delayed coupling. The existence of a single finite attractor of the uncoupled map is found to be responsible for the emergence of…
Nonautonomous driving of an oscillator has been shown to enlarge the Arnold tongue in parameter space, but little is known about the analogous effect for a network of oscillators. To test the hypothesis that deterministic nonautonomous…
We study the dynamical states that emerge in a small-world network of recurrently coupled excitable neurons through both numerical and analytical methods. These dynamics depend in large part on the fraction of long-range connections or…
Throughout the literature on Neural Cellular Automata (NCAs), it is often taken for granted that the systems learn attractors. This is shown through evolving the system for many timesteps and noting visual similarity to the goal state.…
Tandem duplication is an evolutionary process whereby a segment of DNA is replicated and proximally inserted. The different configurations that can arise from this process give rise to some interesting combinatorial questions. Firstly, we…