Related papers: A new version of Toom's proof
We prove that that second-order (double-loop) chaotic sigma-delta schemes are stable - within a certain parameter range, all state variables of the system are guaranteed to remain uniformly bounded. To our knowledge this is the first…
Transient stability is crucial to the reliable operation of power systems. Existing theories rely on the simplified electromechanical models, substituting the detailed electromagnetic dynamics of inductor and capacitor with their impedance…
In this paper, we will prove a very general result of stability for perturbations of linear integrable Hamiltonian systems, and we will construct an example of instability showing that both our result and our example are optimal. Moreover,…
We characterize stable T for which the model completion of T_{aut} is stable (i.e., every completion is). Then we prove that ``some completion is stable'' is different and we characterize it. Finally we show that if T is stable, T_{aut} has…
The cellular automaton is a widely known model of both reversible and irreversible computations. The family of reversible second-order cellular automata considered in this work is appropriate both for construction of logic gates and…
This paper examines the stability of the \`a trous algorithm under arbitrary iteration in the context of a more general study of shift-invariant filter banks. The main results describe sufficient conditions on the associated filters under…
Experimental manipulations perturb the neuronal activity. This phenomenon is manifested in the fMRI response. Dynamic causal model and its variants can model these neuronal responses along with the BOLD responses [1, 2, 3, 4, 5] .…
This paper revisits the classical question of the stability of the nonlinear Wonham filter. The novel contributions of this paper are two-fold: (i) definition of the stabilizability for the (control-theoretic) dual to the nonlinear filter;…
Nowadays we are witnessing a transformation of the business processes towards a more computation driven approach. The ever increasing usage of Machine Learning techniques is the clearest example of such trend. This sort of revolution is…
We show how to formulate some recent results from homological stability of algebras in Graham and Lehrer's language of cellular algebras. The aim is to begin to connect the new results from topology to well-established representation…
We present an understandable, efficient, and streamlined proof of the Holonomy Decomposition for finite transformation semigroups and automata. This constructive proof closely follows the existing computational implementation. Its novelty…
Owing to its simplicity and efficiency, the Sherman-Morrison (SM) formula has seen widespread use across various scientific and engineering applications for solving rank-one perturbed linear systems of the form $(A+uv^T)x = b$. Although the…
We describe partial semi-simplicial resolutions of moduli spaces of surfaces with tangential structure. This allows us to prove a homological stability theorem for these moduli spaces, which often improves the known stability ranges and…
We study $\varepsilon$-stability in continuous logic. We first consider stability in a model, where we obtain a definability of types result with a better approximation than that in the literature. We also prove forking symmetry for…
The stability of the Nystr\"om method for the double layer potential equation on simple closed piecewise smooth contours is studied. Necessary and sufficient conditions of the stability of the method are established. It is shown that the…
We define bigraded persistent homology modules and bigraded barcodes of a finite pseudo-metric space X using the ordinary and double homology of the moment-angle complex associated with the Vietoris-Rips filtration of X. We prove a…
We give another proof of a theorem of Fife - understood broadly as providing a finite automaton that gives a complete description of all infinite binary overlap-free words. Our proof is significantly simpler than those in the literature. As…
In this note, we prove some new stability results for plethysm coefficients. As special cases, we verify a conjecture of Wildon, and show the stability of sequences recently predicted by Bessenrodt, Bowman and Paget to be weakly increasing.
Feedback-based online optimization algorithms have gained traction in recent years because of their simple implementation, their ability to reject disturbances in real time, and their increased robustness to model mismatch. While the…
In this paper, we prove the asymptotic stability of the family of solitons of the Benjamin-Ono equation in the energy space. The proof is based on a Liouville property for solutions close to the solitons for this equation, in the spirit of…