Related papers: A note on stability and NIP in one variable
We describe the notion of stability of coherent systems as a framework to deal with redundancy. We define stable coherent systems and show how this notion can help the design of reliable systems. We demonstrate that the reliability of…
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.
In this short note we show that if we add predicate for a dense complete indiscernible sequence in a dependent theory then the result is still dependent. This answers a question of Baldwin and Benedikt and implies that every unstable…
Theory of stable models is the mathematical basis of answer set programming. Several results in that theory refer to the concept of the positive dependency graph of a logic program. We describe a modification of that concept and show that…
A ring element $\,a\in R\,$ is said to be of {\it right stable range one\/} if, for any $\,t\in R$, $\,aR+tR=R\,$ implies that $\,a+t\,b\,$ is a unit in $\,R\,$ for some $\,b\in R$. Similarly, $\,a\in R\,$ is said to be of {\it left stable…
The microscopic explanation of entropy has been challenged from both experimental and theoretical point of view. The expression of entropy is derived from the first law of thermodynamics indicating that entropy or the second law of…
The aim of this paper is to prove that the parametric fundamental equation of information is hyperstable on its open as well as on its closed domain, assuming that the parameter is negative. As a corollary of the main result, it is also…
We present two linked theorems on passivity: the passive behavior theorem, parts 1 and 2. Part 1 provides necessary and sufficient conditions for a general linear system, described by a set of high order differential equations, to be…
The problem of characterizing which automatic sets of integers are stable is here solved. Given a positive integer $d$ and a subset $A\subseteq \mathbb{Z}$ whose set of representations base $d$ is recognized by a finite automaton, a…
This paper deals with several related notions of output stability with respect to inputs. The inputs may be thought of as disturbances; when there are no inputs, one obtains generalizations of the classical concepts of partial stability.…
In a "structured system" of equations, each equation depends on a specified subset of the variables. In this article, we explore properties common to "almost every" system with a fixed structure and how the properties can be read from the…
Monadically stable and monadically NIP classes of structures were initially studied in the context of model theory and defined in logical terms. They have recently attracted attention in the area of structural graph theory, as they…
We consider a rational system of first order difference equations in the plane with four parameters such that all fractions have a common denominator. We study, for the different values of the parameters, the global and local properties of…
We introduce a combinatorial criterion for verifying whether a formula is not the conjunction of an equation and a co-equation. Using this, we give a proof for the nonequationality of the free group. Furthermore, we generalize the latter…
Solutions of bilevel optimization problems tend to suffer from instability under changes to problem data. In the optimistic setting, we construct a lifted formulation that exhibits desirable stability properties under mild assumptions that…
A 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. Equationality…
A first-order theory has the Schroder-Bernstein property if any two of its models that are elementarily bi-embeddable are isomorphic. We prove that if a countable theory T has the Schroder-Bernstein property then it is classifiable (it is…
We study theories of spaces of random variables: first, we consider random variables with values in the interval $[0,1]$, then with values in an arbitrary metric structure, generalising Keisler's randomisation of classical structures. We…
We study the parameters range for the fixed point of a class of complex dynamics with the rational fractional function as $R_{n,a,c}(z)=z^n+\frac{a}{z^n}+c$, where $n=1,2,3,4$ is specified, $a$ and $c$ are two complex parameters. The…
We study stable matchings that are robust to preference changes in the two-sided stable matching setting of Gale and Shapley [GS62]. Given two instances $A$ and $B$ on the same set of agents, a matching is said to be robust if it is stable…