Related papers: Self-stabilizing mutual exclusion on a ring, even …
For a regular ring R and an affine monoid M the homotheties of M act nilpotently on the Milnor unstable groups of R[M]. This strengthens the K_2 part of the main result of [G5] in two ways: the coefficient field of characteristic 0 is…
In 1994, the second author and W. van der Kallen showed that the injective stabilization bound for K_1 of general linear group is d+1 over a regular affine algebra over a perfect C_1-field, where d is the krull dimension of the base ring…
Let $R$ be a regular ring of dimension $d$ and $L$ be a $c$-divisible monoid. If ${K}_1{Sp}(R)$ is trivial and $k \geq d+2,$ then we prove that the symplectic group ${Sp}_{2k}(R[L])$ is generated by elementary symplectic matrices over…
Multistability cannot be derived from any theoretical model that is based on a monostable master equation. On the other hand, multistability is experimentally-observed in a variety of quantum systems. A master equation having a nonlinear…
This paper deals with stability of discrete-time switched linear systems whose all subsystems are unstable and the set of admissible switching signals obeys pre-specified restrictions on switches between the subsystems and dwell times on…
The apparent stability of population oscillations in ecological systems is a long-standing puzzle. A generic solution for this problem is suggested here. The stabilizing mechanism involves the combined effect of spatial migration,…
Self-stabilization is a general paradigm to provide forward recovery capabilities to distributed systems and networks. Intuitively, a protocol is self-stabilizing if it is able to recover without external intervention from any catastrophic…
We propose a self-stabilizing algorithm for computing a maximal matching in an anonymous network. The complexity is $O(n^3)$ moves with high probability, under the adversarial distributed daemon. In this algorithm, each node can determine…
We fully characterize self-stabilizing functions in population protocols for complete interaction graphs. In particular, we investigate self-stabilization in systems of $n$ finite state agents in which a malicious scheduler selects an…
Motivated by the idea of using simple macroscopic examples to illustrate the physics of complex systems, we modify a historic experimental setup in which interacting floating magnets spontaneously self-assemble into ordered clusters. By…
A commutative ring $R$ is J-stable provided that for any $a\not\in J(R)$, $R/aR$ has stable range one. A ring $R$ is called an elementary divisor ring if every $m\times n$ matrix over $R$ admits diagonal reduction. We prove that a J-stabe…
We study the dissipative stabilization of entangled states in arrays of quantum systems. Specifically, we are interested in the states of qubits (spin-1/2) which may or may not interact with one or more cavities (bosonic modes). In all…
Static topologically-nontrivial configurations in sigma-models, for spatial dimension D \geq 2, are unstable. The question addressed here is whether such sigma-model solitons can be stabilized by steady rotation in internal space; that is,…
We prove a general reduction theorem for stabilizer absolutely maximally entangled states in composite local dimension. If a stabilizer $\mathrm{AME}(n,D)$ state exists and $D=\prod_{i=1}^m q_i$ is the prime-power factorization of $D$, then…
This paper deals with input/output-to-state stability (IOSS) of switched nonlinear systems in the discrete-time setting. We present an algorithm to construct periodic switching signals that obey pre-specified restrictions on admissible…
We present a novel classical algorithm designed to learn the stabilizer group -- namely the group of Pauli strings for which a state is a $\pm 1$ eigenvector -- of a given Matrix Product State (MPS). The algorithm is based on a clever and…
Entanglement types of pure states of 3 qubits are classified by means of their stabilisers in the group of local unitary operations. It is shown that the stabiliser is generically discrete, and that a larger stabiliser indicates a…
We study single-copy stabilizer learning, the problem of identifying a stabilizer group of dimension $n-t$ from an $n$-qubit quantum state $\rho$. We obtain two complementary results. First, in the average case, logarithmic-depth local…
We develop a representation theoretic technique for detecting closed orbits that is applicable in all characteristics. Our technique is based on Kempf's theory of optimal subgroups and we make some improvements and simplify the theory from…
The standard stabilizer formalism provides a setting to show that quantum computation restricted to operations within the Clifford group are classically efficiently simulable: this is the content of the well-known Gottesman-Knill theorem.…