Related papers: On model completion of T_{aut}

We use simple spectral perturbation theory to show that the positive partial transpose property is stable under bounded perturbations of the Hamiltonian, for equilibrium states in infinite dimensions. The result holds provided the…

This paper focuses on using curvature and torsion to describe the stability of linear time-invariant system. We prove that for a two-dimensional system $\dot{r}(t)= Ar(t)$, (i) if there exists an initial value, such that zero is not the…

We show that if $G$ is a discrete Abelian group and $A \subset G$ has $\|1_A\|_{B(G)} \leq M$ then $A$ is $O(\exp(\pi M))$-stable in the sense of Terry and Wolf.

We observe that a simple condition suffices to describes non-forking independence over models in a stable theory. Under mild assumptions, this description can be extended to non-forking independence over algebraically closed subsets,…

In this paper, we study combinatorial properties of stable curves. To the dual graph of any nodal curve, it is naturally associated a group, which is the group of components of the N\'eron model of the generalized Jacobian of the curve. We…

We exhibit a connection between geometric stability theory and the classification of unstable structures at the level of simplicity and the $\mathrm{NSOP}_{1}$-$\mathrm{SOP}_{3}$ gap. Particularly, we introduce generic expansions $T^{R}$ of…

We apply the recently developed technology of cofinality spectrum problems to prove a range of theorems in model theory. First, we prove that any model of Peano arithmetic is $\lambda$-saturated iff it has cofinality $\geq \lambda$ and the…

Let C/K: F = 0 be a smooth plane quartic over a complete discrete valuation field K. In a previous paper the authors togetehr with Q. Liu give various characterizations of the reduction (i.e. non-hyperelliptic genus 3 curve, hyperelliptic…

Discrete-time models of non-uniformly sampled nonlinear systems under zero-order hold relate the next state sample to the current state sample, (constant) input value, and sampling interval. The exact discrete-time model, that is, the…

In much discussed work Artemov has recently shown that, for $\mathrm{PA}$, the consistency schema admits a form of uniform verification via selector proofs, despite the unprovability of the corresponding uniform consistency sentence…

In this paper we formulate and prove a general theorem of stability of exactness properties under the pro-completion, which unifies several such theorems in the literature and gives many more. The theorem depends on a formal approach to…

We investigate relations between the pseudo-orbit-tracing property, topological stability and openness for tree-shifts. We prove that a tree-shift is of finite type if and only if it has the pseudo-orbit-tracing property which implies that…

This paper explores conditions of existence of different types of consistent tests. New links of these types of consistency are also established. The existence of discernible (strong consistent) tests follows from the existence of pointwise…

We prove that any type in an NIP theory can be decomposed into a stable part (a generically stable partial type) and a distal-like quotient.

By definition, transverse intersections are stable under infinitesimal perturbations. Using persistent homology, we extend this notion to a measure. Given a space of perturbations, we assign to each homology class of the intersection its…

Several countries successfully use centralized matching schemes for school or higher education assignment, or for entry-level labour markets. In this paper we explore the computational aspects of a possible similar scheme for assigning…

We study the differentiability properties of the topological equivalence between a uniformly asymptotically stable linear nonautonomous system and a perturbed system with suitable nonlinearities. For this purpose, we construct a uniformly…

We study deviations by a group of agents in the three main types of matching markets: the house allocation, the marriage, and the roommates models. For a given instance, we call a matching $k$-stable if no other matching exists that is more…

Persistent homology and persistent entropy have recently become useful tools for patter recognition. In this paper, we find requirements under which persistent entropy is stable to small perturbations in the input data and scale invariant.…

The existence of instabilities, for example in the form of adversarial examples, has given rise to a highly active area of research concerning itself with understanding and enhancing the stability of neural networks. We focus on a popular…