Related papers: Reset thresholds of automata with two cycle length…
The problem of reconstructing a sequence from the set of its length-$k$ substrings has received considerable attention due to its various applications in genomics. We study an uncoded version of this problem where multiple random sources…
Motivated by recent results relating synchronizing DFAs and primitive sets, we tackle the synchronization process and the related longstanding \v{C}ern\'{y} conjecture by studying the primitivity phenomenon for sets of nonnegative matrices…
The appropriate selection of recurrence thresholds is a key problem in applications of recurrence quantification analysis and related methods across disciplines. Here, we discuss the distribution of pairwise distances between state vectors…
We study the fine-grained complexity of counting the number of colorings and connected spanning edge sets parameterized by the cutwidth and treewidth of the graph. While decompositions of small treewidth decompose the graph with small…
We study a random unitary quantum circuit with only reset channels, which has high feasibility for real quantum devices. In particular, we investigate the many-body statistical physics properties, "reset-induced" entanglement phase…
Traditionally, reconfiguration problems ask the question whether a given solution of an optimization problem can be transformed to a target solution in a sequence of small steps that preserve feasibility of the intermediate solutions. In…
The Colour Refinement procedure and its generalisation to higher dimensions, the Weisfeiler-Leman algorithm, are central subroutines in approaches to the graph isomorphism problem. In an iterative fashion, Colour Refinement computes a…
Quantum finite automata can be used for pattern recognition. Present implementations on actual quantum devices face decoherence issues, which compromise the quality of long strings computation. In this work, we focus on the Measure Once…
A renormalization scheme is suggested where QCD input parameters - quark mass and coupling constant - are expressed in terms of gauge invariant and infrared stable quantities. For the renormalization of coupling constant the quark anomalous…
The paper presents techniques to derive upper bounds for the mean time to recover from a single fault for self-stabilizing algorithms in the message passing model. For a new Delta+1-coloring algorithm we analytically derive a bound for the…
The purpose of this paper is to study the number of limit cycles of canard type in linear regularizations of piecewise linear systems with non-monotonic transition functions. Using the notion of slow divergence integral and elementary…
In this paper we prove that a uniformly distributed random circular automaton $\mathcal{A}_n$ of order $n$ synchronizes with high probability (whp). More precisely, we prove that $$ \mathbb{P}\left[\mathcal{A}_n \text{ synchronizes}\right]…
Systems of interacting random replicators are studied using generating functional techniques. While replica analyses of such models are limited to systems with symmetric couplings, dynamical approaches as presented here allow specifically…
The Pyragas method of feedback control has attracted much interest as a method of stabilising unstable periodic orbits in a number of situations. We show that a time-delayed feedback control similar to the Pyragas method can be used to…
We study the computational complexity of various problems related to synchronization of weakly acyclic automata, a subclass of widely studied aperiodic automata. We provide upper and lower bounds on the length of a shortest word…
The phenomenon of high-order ($p/q$) synchronization, induced by \textit{two different} frequencies in the system, is well-known and studied extensively in forced oscillators including neurons and to a lesser extent in coupled oscillators.…
The \emph{Square Colouring} of a graph $G$ refers to colouring of vertices of a graph such that any two distinct vertices which are at distance at most two receive different colours. In this paper, we initiate the study of a related…
For fixed integers $p$ and $q$, let $f(n,p,q)$ denote the minimum number of colors needed to color all of the edges of the complete graph $K_n$ such that no clique of $p$ vertices spans fewer than $q$ distinct colors. Any edge-coloring with…
Each cell of a two-dimensional lattice is painted one of k colors, arranged in a "color wheel." The colors advance (0 to k-1 mod k) either automatically or by contact with at least a threshold number of successor colors in a prescribed…
Cellular automata are synchronous discrete dynamical systems used to describe complex dynamic behaviors. The dynamic is based on local interactions between the components, these are defined by a finite graph with an initial node coloring…