相关论文: On model completion of T_{aut}

In this note we extend the concept of topological stability from homeomorphisms to group actions on compact metric spaces, and prove that if an action of a finitely generated group is expansive and has the pseudo-orbit tracing property then…

This paper shows effectiveness of X3SAT in proving P = NP. This is due to the fact that it is easy to check unsatisfiability of a particular truth assignment. A truth assignment leads to some reductions of clauses by means of "exactly-1…

We study one way in which stable phenomena can exist in an NIP theory. We start by defining a notion of 'pure instability' that we call 'distality' in which no such phenomenon occurs. O-minimal theories and the p-adics for example are…

We study topological stability of nodes in nonsymmorphic superconductors (SCs). In particular, we demonstrate that line nodes in nonsymmirphic odd-parity SCs are protected by the interplay between topology and nonsymmorphic symmetry. As an…

Let M be an o-minimal structure with elimination of imaginaries, N an unstable structure definable in M. Then there exists X, interpretable in N, such that X with all the structure induced from N is o-minimal. In particular X is linearly…

We characterize stability of graph C*-algebras by giving five conditions equivalent to their stability. We also show that if G is a graph with no sources, then C*(G) is stable if and only if each vertex in G can be reached by an infinite…

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 purpose of this paper is to give a sufficient condition for (strong) stability of non-proper smooth functions (with respect to the Whitney $C^\infty$-topology). We show that a Morse function is stable if it is end-trivial at any point…

A group is said to be stable if it is isomorphic to its automorphism group. We investigate how we can extend centerless groups to construct finite stable groups with nontrivial centers. To this end, we classify all finite stable groups…

We show that many nice properties of a theory $T$ follow from the corresponding properties of its reducts to finite subsignatures. If $\{ T_i \}_{i \in I}$ is a directed family of conservative expansions of first-order theories and each…

For any smooth projective variety $X$ of dimension $n$ over an algebraically closed field $k$ of characteristic $p>0$ with $\mu(\Omega^1_X)>0$. If ${\rm T}^{\ell}(\Omega^1_X)$ ($0<\ell<n(p-1)$) are semi-stable, then the sheaf $B^1_X$ of…

For every countable structure $M$ we construct an $\aleph_0$-stable countable structure $N$ such that $Aut(M)$ and $Aut(N)$ are topologically isomorphic. This shows that it is impossible to detect any form of stability of a countable…

We investigate how the following properties are related to each other: i)-A manifold is "transversally" exponentially stable; ii)-The "transverse" linearization along any solution in the manifold is exponentially stable; iii)-There exists a…

Mathematical models of glucose, insulin, and pancreatic $\beta$-cell mass dynamics are essential for understanding the physiological basis of type 2 diabetes. This paper investigates the Topp model's discrete-time dynamics to represent…

A discrete group is matricially stable if every function from the group to a complex unitary group that is "almost multiplicative" in the point-operator norm topology is "close" to a genuine unitary representation. It follows from a recent…

In this paper, we are interested to study the stability of the ascent of a mutually commuting n-tuple T submitted to a perturbation by an n-tuple S which commutes mutually with T. This study lead us to generalize some well known results for…

Completeness is a desirable property of test suites. Roughly, completeness guarantees that a non-equivalent implementation under test will always be identified. Several approaches proposed sufficient, and sometimes also necessary,…

The following theorem is proved: Let $G$ be a finite group and $\pi_e(G)$ be the set of element orders in $G$. If $\pi_e(G) \cap \{2\}=\emptyset$; or $\pi_e(G) \cap \{3, 4\}=\emptyset$; or $\pi_e(G) \cap \{3,5\}=\emptyset$, then $G$ is…

Transactions simplify concurrent programming by enabling computations on shared data that are isolated from other concurrent computations and are resilient to failures. Modern databases provide different consistency models for transactions…

There are several proofs now for the stability of Toom's example of a two-dimensional stable cellular automaton and its application to fault-tolerant computation. Simon and Berman simplified and strengthened Toom's original proof: the…