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

We give a new completion for the quasi-uniform spaces. We call the whole procedure {\it $\tau$-completion} and the new space {\it $\tau$-complement of the given}. The basic result is that every $T_{_0}$ quasi-uniform space has a…

We derive the precise stability criterion for smooth solitary waves in the b-family of Camassa-Holm equations. The smooth solitary waves exist on the constant background. In the integrable cases b = 2 and b = 3, we show analytically that…

We prove that there are energetically stable bimetric theories. These theories satisfies a positive energy theorem. We construct a model example.

This paper provides a model theoretic semantics to feature terms augmented with set descriptions. We provide constraints to specify HPSG style set descriptions, fixed cardinality set descriptions, set-membership constraints, restricted…

We study and characterize stability, NIP and NSOP in terms of topological and measure theoretical properties of classes of functions. We study a measure theoretic property, `Talagrand's stability', and explain the relationship between this…

We show that, in the most general $N$-component theory with symmetry O(n_1)+O(n_2), N=n_1+n_2\geq 3, the O(N)-symmetric fixed point has (at least) three unstable directions: the temperature, the quadratic anisotropy, and the spin-4 quartic…

The complexity class $NP$ can be logically characterized both through existential second order logic $SO\exists$, as proven by Fagin, and through simulating a Turing machine via the satisfiability problem of propositional logic SAT, as…

Causal consistency is one of the most adopted consistency criteria for distributed implementations of data structures. It ensures that operations are executed at all sites according to their causal precedence. We address the issue of…

This paper presents the first step of a wider research effort to apply tree automata completion to the static analysis of functional programs. Tree Automata Completion is a family of techniques for computing or approximating the set of…

A noncommutative polynomial is stable if it is nonsingular on all tuples of matrices whose imaginary parts are positive definite. In this paper a characterization of stable polynomials is given in terms of strongly stable linear matrix…

We give a novel characterization of the centered model in regularity structures which persists for rough drivers even as a mollification fades away. We present our result for a class of quasilinear equations driven by noise, however we…

Reliable pattern recognition systems should exhibit consistent behavior across similar inputs, and their explanations should remain stable. However, most Explainable AI evaluations remain instance centric and do not explicitly quantify…

This note relates the calibration of models to the consistent loss functions for the target functional of the model. We demonstrate that a model is calibrated if and only if there is a parameter value that is optimal under all consistent…

We show that if a universal theory is not monadically NIP, then this is witnessed by a canonical configuration defined by an existential formula. As a consequence, we show that a hereditary class of relational structures is NIP (resp.…

We construct a tensor network representation of the 3d toric code ground state that is stable to a generating set of uniform local tensor perturbations, including those that do not map to local operators on the physical Hilbert space. The…

A map which is non-orientable or has non-empty boundary has a canonical double cover which is orientable and has empty boundary. The map is called stable if every automorphism of this cover is a lift of an automorphism of the map. This note…

Let C_n(M) be the configuration space of n distinct ordered points in M. We prove that if M is any connected orientable manifold (closed or open), the homology groups H_i(C_n(M); Q) are representation stable in the sense of [Church-Farb].…

We present Euler Characteristic Surfaces as a multiscale spatiotemporal topological summary of time series data encapsulating the topology of the system at different time instants and length scales. Euler Characteristic Surfaces with an…

This work primarily focuses on an operator inference methodology aimed at constructing low-dimensional dynamical models based on a priori hypotheses about their structure, often informed by established physics or expert insights. Stability…

A novel model-based approach to verify dynamic networks is proposed; the approach consists in formally describing the network topology and dynamic link parameters. A many sorted first order logic formula is constructed to check the model…