Related papers: Stable $\A^1$-connectedness
We prove that in a theory $T$ stable over a predicate $P$, for any $\lambda > |T|$, there is a $\lambda$-prime model over any complete set A with a $\lambda$-saturated $P$-part.
The problem of tracking an arbitrary curve in the state space is considered for underactuated driftless control-affine systems. This problem is formulated as the stabilization of a time-varying family of sets associated with a neighborhood…
Let X be a coherent configuration associated with a transitive group G. In terms of the intersection numbers of X, a necessary condition for the point stabilizer of G to be a TI-subgroup, is established. Furthermore, under this condition, X…
Super-stability and strong stability are properties of a matching in the stable matching problem with ties. In this paper, we introduce a common generalization of super-stability and strong stability, which we call non-uniform stability.…
Let A be the category of modules over a complex, finite-dimensional algebra. We show that the space of stability conditions on A parametrises an isomonodromic family of irregular connections on P^1 with values in the Hall algebra of A. The…
Peixoto's structural stability and density theorems represent milestones in the modern theory of dynamical systems and their applications. Despite the importance of these theorems, they are often treated rather superficially, if at all, in…
We give a detailed proof of the following fundamental result: the singularity category of a ring is triangle equivalent to the stabilization of its stable module category. The result yields singular equivalences between rings of different…
Randomly-assembled dynamical systems are theoretically predicted to be unstable upon crossing a critical threshold of complexity, as first shown by May. Yet, empirical complex systems exhibit remarkable stability, indicating the presence of…
By varying a parameter of a one-dimensional piecewise smooth map, stable periodic orbits are observed. In this paper, complete analytic characterization of these stable periodic orbits is obtained. An interesting relationship between the…
Robustness of network of networks (NON) has been studied only for dependency coupling (J.X. Gao et. al., Nature Physics, 2012) and only for connectivity coupling (E.A. Leicht and R.M. D Souza, arxiv:0907.0894). The case of network of n…
We present a solution of Exercise 1.2.1 of [2] which yields a short new proof of a key step in one of proofs of Brouwer's fixed point theorem, 1910. A few people asked the author about the details of the solution and they might be…
The steady states of dynamical processes can exhibit stable nontrivial phases, which can also serve as fault-tolerant classical or quantum memories. For Markovian quantum (classical) dynamics, these steady states are extremal eigenvectors…
This paper analyses the stability of cycles within a heteroclinic network lying in a three-dimensional manifold formed by six cycles, for a one-parameter model developed in the context of game theory. We show the asymptotic stability of the…
The notion of 'slope rational connectedness' is introduced in the context of smooth orbifold pairs. The main result parallels the characterization of the rational connectedness of projective manifolds in terms of either the non-existence of…
A complete first-order theory is equational if every definable set is a Boolean combination of instances of equations, that is, of formulae such that the family of finite intersections of instances has the descending chain condition.…
The concept of additive basis has been investigated in the literature for several mathematicians which works with number theorem. Recently, the concept of finitely stable additive basis was introduced. In this note we provide a…
We study connected graphs with a fixed degree sequence, in the sparse setting where the number of edges grows linearly in the number of vertices. Using the relation to the configuration model, we identify the number of such connected graphs…
We provide a simple proof for the union-closed sets conjecture, a long-standing open problem in set theory with immediate applications to graph theory, number theory, and order-theory.
We analyze the stability of the network's giant connected component under impact of adverse events, which we model through the link percolation. Specifically, we quantify the extent to which the largest connected component of a network…
A conjecture of Morel asserts that the sheaf of A^1-connected components of a simplicial sheaf X is A^1-invariant. A conjecture of Asok-Morel asserts that A^1-connected components of smooth k-schemes coincide with their A^1-chain-connected…