Related papers: Self-stabilizing mutual exclusion on a ring, even …

Self-stabilization ensures that, after any transient fault, the system recovers in a finite time and eventually exhibits a correct behaviour. Speculation consists in guaranteeing that the system satisfies its requirements for any execution…

Self-stabilization ensures that, after any transient fault, the system recovers in a finite time and eventually exhibits. Speculation consists in guaranteeing that the system satisfies its requirements for any execution but exhibits…

The first self-stabilizing algorithm [Dij73] assumed the existence of a central daemon, that activates one processor at time to change state as a function of its own state and the state of a neighbor. Subsequent research has reconsidered…

Maintaining numerical stability in machine learning models is crucial for their reliability and performance. One approach to maintain stability of a network layer is to integrate the condition number of the weight matrix as a regularizing…

We investigate the finite-time stabilization of a tree-shaped network of strings. Transparent boundary conditions are applied at all the external nodes. At any internal node, in addition to the usual continuity conditions, a modified…

We give a new purely algebraic approach to odd unitary groups using odd form rings. Using these objects, we prove the stability theorems for odd unitary $K_1$-functor without using the corresponding result from linear $K$-theory under the…

In graph theory, an independent set is a subset of nodes where there are no two adjacent nodes. The independent set is maximal if no node outside the independent set can join it. In network applications, maximal independent sets can be used…

Let $(R,\mathfrak{m})$ be a regular local ring or a polynomial ring over a field, and let $I$ be an ideal of $R$ which we assume to be graded if $R$ is a polynomial ring. Let astab$(I)$ resp. $\overline{\rm astab}(I)$ be the smallest…

We consider the one-dimensional Schroedinger equation on a ring, with the cubic term, of either self-attractive or repulsive sign, confined to a narrow segment. This setting can be realized in optics and Bose-Einstein condensates. For the…

We present a self-stabilizing algorithm for the (asynchronous) unison problem which achieves an efficient trade-off between time, workload, and space in a weak model. Precisely, our algorithm is defined in the atomic-state model and works…

We show that a ring R has stable range one if and only if every left unit lifts modulo every left principal ideal. We also show that a left quasi-morphic ring has stable range one if and only if it is left uniquely generated. Thus we answer…

Generic inhomogeneous steady states in an asymmetric exclusion process on a ring with a pair of point bottlenecks are studied. We show that, due to an underlying universal feature, measurements of coarse-grained steady-state densities in…

We present a singular perturbation theory applicable to systems with hybrid boundary layer systems and hybrid reduced systems {with} jumps from the boundary layer manifold. First, we prove practical attractivity of an adequate attractor set…

We relate the the distinguishability of quantum states with their robustness of the entanglement, where the robustness of any resource quantifies how tolerant it is to noise. In particular, we identify upper and lower bounds on the…

We consider the problem of testing whether an unknown $n$-qubit quantum state $|\psi\rangle$ is a stabilizer state, with only single-copy access. We give an algorithm solving this problem using $O(n)$ copies, and conversely prove that…

Self-stabilization is a versatile fault-tolerance approach that characterizes the ability of a system to eventually resume a correct behavior after any finite number of transient faults. In this paper, we propose a self-stabilizing reset…

Herman's self-stabilisation algorithm allows a ring of $N$ processors having any odd number of tokens to reach a stable state where exactly one token remains. McIver and Morgan conjecture that the expected time taken for stabilisation is…

We constuct the theory of diagonalizability for matrices over Bezout rings of stable range 1 with the Kazimirsky condition. It is shown that a ring of stable range 1 with the right (left) Kazimirsky condition is an elementary divisor ring…

We show that any non-minimal bridge decomposition of a torus knot is stabilized and that $n$-bridge decompositions of a torus knot are unique for any integer $n$. This implies that a knot in a bridge position is a torus knot if and only if…

Let $k$ be a field. Then Gaussian elimination over $k$ and the Euclidean division algorithm for the univariate polynomial ring $k[x]$ allow us to write any matrix in $SL_n(k)$ or $SL_n(k[x])$, $n\geq 2$, as a product of elementary matrices.…