Related papers: Non-strongly Stable Orders Also Define Interesting…
Partition functions arise in statistical physics and probability theory as the normalizing constant of Gibbs measures and in combinatorics and graph theory as graph polynomials. For instance the partition functions of the hard-core model…
In this paper, by introducing a wider class of one-parameter group actions for test configurations, we have a stronger form of the definition of K-stability. This allows us to obtain some key step of my preceding work in proving that…
Stable event structures, and their duality with prime algebraic domains arising as partial orders of configurations, are a landmark of concurrency theory, providing a clear characterisation of causality in computations. They have been used…
We investigate the stability of Quantum Critical Points (QCPs) in the presence of two competing phases. These phases near QCPs are assumed to be either classical or quantum and assumed to repulsively interact via square-square interactions.…
We introduce families of classical stochastic dynamics in two and higher dimensions which stabilize order in the absence of any symmetry. Our dynamics are qualitatively distinct from Toom's rule, and have the unusual feature of being…
Dedicated to Tony Hoare. In a paper published in 1972 Hoare articulated the fundamental notions of hiding invariants and simulations. Hiding: invariants on encapsulated data representations need not be mentioned in specifications that…
Stability is a fundamental notion in dynamical systems and control theory that, traditionally understood, describes asymptotic behavior of solutions around an equilibrium point. This notion may be characterized abstractly as continuity of a…
We propose a notion of a stable partition in a coalitional game that is parametrized by the concept of a defection function. This function assigns to each partition of the grand coalition a set of different coalition arrangements for a…
Substructural logics are formal logical systems that omit familiar structural rules of classical and intuitionistic logic such as contraction, weakening, exchange (commutativity), and associativity. This leads to a resource-sensitive…
The classical theory of Kosambi-Cartan-Chern (KCC) developed in differential geometry provides a powerful method for analyzing the behaviors of dynamical systems. In the KCC theory, the properties of a dynamical system are described in…
We propose the concept of a system algebra with a parallel composition operation and an interface connection operation, and formalize composition-order invariance, which postulates that the order of composing and connecting systems is…
Discrete stability extends the classical notion of stability to random elements in discrete spaces by defining a scaling operation in a randomised way: an integer is transformed into the corresponding binomial distribution. Similarly…
We introduce the notion of symmetric covariation, which is a new measure of dependence between two components of a symmetric $\alpha$-stable random vector, where the stability parameter $\alpha$ measures the heavy-tailedness of its…
This paper is about the surprising interaction of a foundational result from model theory, about stability of theories, with algorithmic stability in learning. First, in response to gaps in existing learning models, we introduce a new…
Recent developments in data-driven control have revived interest in the behavioral approach to systems theory, where systems are defined as sets of trajectories rather than being described by a specific model or representation. However,…
The rules associated with propositional logic programs and the stable model semantics are not expressive enough to let one write concise programs. This problem is alleviated by introducing some new types of propositional rules. Together…
Well-structured systems, aka WSTSs, are computational models where the set of possible configurations is equipped with a well-quasi-ordering which is compatible with the transition relation between configurations. This structure supports…
In the stable marriage problem, a set of men and a set of women are given, each of whom has a strictly ordered preference list over the acceptable agents in the opposite class. A matching is called stable if it is not blocked by any pair of…
Recently, a classical approach to continuous structures has been proposed in [ABBMZ] and [Z] that extends the class of structures falling under the scope of [HI] or [BBHU]. These articles introduce the notion of structures with a standard…
We present a systematic approach to logical predicates based on universal coalgebra and higher-order abstract GSOS, thus making a first step towards a unifying theory of logical relations. We first observe that logical predicates are…