Related papers: Domain closure conditions and definability preserv…
Let $A$ be an integral domain. We study new conditions on families of integral ideals of $A$ in order to get that $A$ is of $t$-finite character (i.e., each nonzero element of $A$ is contained in finitely many $t$-maximal ideals). We also…
We characterize the behavior of the solutions of linear evolution partial differential equations on the half line in the presence of discontinuous initial conditions or discontinuous boundary conditions, as well as the behavior of the…
Value-based static analysis techniques express computed program invariants as logical formula over program variables. Researchers and practitioners use these invariants to aid in software engineering and verification tasks. When selecting…
Artificial Intelligence (AI) systems, trained in controlled environments, often struggle in real-world complexities. We propose a general framework for estimating domain complexity across diverse environments, like open-world learning and…
Sufficient conditions are given for the computation of accessing arcs and arcs that links boundary components of multiply connected domains. The existence of a not-computably-accessible but computable point on a computably compact arc is…
Some basic features of confinement are reviewed, in particular the symmetry patterns of the dual dynamics. Open problems and possible directions of progress are discussed.
This paper presents a theory of systemic undecidability, reframing incomputability as a structural property of systems rather than a localized feature of specific functions or problems. We define a notion of causal embedding and prove a…
The notion of maximal non valuative domain is introduced and characterized. An integral domain R is called a maximal non valuative domain if R is not a valuative domain but every proper overring of R is a valuative domain. Maximal non…
We investigate indeterminate points in discrete integrable system. They appear in singularity confinement phenomenon naturally. We develop a method to analyse indeterminate points of dynamical maps and using this method we clarify behaviour…
We give blow-up analysis for a Brezis-Merle's problem on the boundary. Also we give a proof of a compactness result with Lipschitz condition and weaker assumption on the regularity of the domain (smooth domain or $ C^{2,\alpha} $ domain).
We present knowledge continuity, a novel definition inspired by Lipschitz continuity which aims to certify the robustness of neural networks across input domains (such as continuous and discrete domains in vision and language,…
Anonymity has become a significant issue in security field by recent advances in information technology and internet. The main objective of anonymity is hiding and concealing entities privacy inside a system. Many methods and protocols have…
We provide bounds on the size of operators obtained by algorithms for executing D-finite closure properties. For operators of small order, we give bounds on the degree and on the height (bit-size). For higher order operators, we give degree…
We study weak solutions for a class of free boundary problems which includes as a special case the classical problem of traveling waves on water of finite depth. We show that such problems are equivalent to problems in fixed domains and…
The goal of this work is to improve images of traffic scenes that are degraded by natural causes such as fog, rain and limited visibility during the night. For these applications, it is next to impossible to get pixel perfect pairs of the…
In this paper, we aim to solve for unsupervised domain adaptation of classifiers where we have access to label information for the source domain while these are not available for a target domain. While various methods have been proposed for…
The behavior of a class of mappings of a domain of Euclidean space is studied. It is established that the indicated class is equicontinuous both at the inner and at the boundary points of the domain if the mappings contained in it satisfy…
We study the stability of John domains in Banach spaces under removal of a countable set of points. In particular, we prove that the class of John domains is stable in the sense that removing a certain type of closed countable set from the…
We examine verification of concurrent programs under the total store ordering (TSO) semantics used by the x86 architecture. In our model, threads manipulate variables over infinite domains and they can check whether variables are related…
We introduce conservative curved systems over multiply connected domains and study relationships of such systems with related notions of functional model, characteristic function, and transfer function. In contrast to standard theory for…