Related papers: Divergence and unique solution of equations
The Constraint Satisfaction Problem (CSP) framework offers a simple and sound basis for representing and solving simple decision problems, without uncertainty. This paper is devoted to an extension of the CSP framework enabling us to deal…
It is shown that a singular equivalence induced by tensoring with a suitable complex of bimodules defines a singular equivalence of Morita type with level, in the sense of Wang. This result is applied to homological ideals and idempotents…
We prove a general congruence result for bisimilarity in higher-order languages, which generalises previous work to languages specified by a labelled transition system in which programs may occur as labels, and which may rely on operations…
We extend the generalized gradient-flow framework of Peletier, Rossi, Savar\'e, and Tse to singular jump processes on abstract metric spaces, moving beyond the translation-invariant kernels considered in $\mathbb{R}^d$ and $\mathbb{T}^d$ in…
The computational singular perturbation (CSP) method is an algorithm which iteratively approximates slow manifolds and fast fibers in multiple-timescale dynamical systems. Since its inception due to Lam and Goussis, the convergence of the…
This paper establishes the existence of infinitely many solutions for nonlinear problems without any symmetry, achieving three major advances. First, in the setting of semilinear elliptic PDEs, we introduce a refined variational truncation…
Linearizability and progress properties are key correctness notions for concurrent objects. However, model checking linearizability has suffered from the PSPACE-hardness of the trace inclusion problem. This paper proposes to exploit…
Locks are a classic data structure for concurrent programming. We introduce a type system to ensure that names of the asynchronous pi-calculus are used as locks. Our calculus also features a construct to deallocate a lock once we know that…
In this work we propose a new method for investigating connection problems for the class of nonlinear second-order differential equations known as the Painlev{\'e} equations. Such problems can be characterized by the question as to how the…
We prove pathwise nonuniqueness in the stochastic partial differential equations (SPDEs) for some one-dimensional super-Brownian motions with immigration. In contrast to a closely related case investigated by Mueller, Mytnik and Perkins…
In the first paper of this two part communication, we solved in a unified framework a variety of two terminal source coding problems with noncooperative encoders, thereby consolidating works of Shannon, Slepian-Wolf, Wyner,…
Let $X$ be a complex, irreducible, quasi-projective variety, and $\pi:\widetilde X\to X$ a resolution of singularities of $X$. Assume that the singular locus ${\text{Sing}}(X)$ of $X$ is smooth, that the induced map…
We study constraint satisfaction problems (CSPs) in the presence of counting quantifiers $\exists^{\geq j}$, asserting the existence of $j$ distinct witnesses for the variable in question. As a continuation of our previous (CSR 2012) paper,…
In this paper, we investigate the anisotropic Calder{\'o}n problem on cylindrical Riemannian manifolds with boundary having two ends and equipped with singular metrics of (simple or double) warped product type, that is whose warping factors…
Despite the recent progress of automated program verification techniques, fully automated verification of programs manipulating recursive data structures remains a challenge. We introduce solvable tuple patterns (STPs) and conjunctive STPs…
We establish a framework that allows us to transfer results between some constraint satisfaction problems with infinite templates and promise constraint satisfaction problems. On the one hand, we obtain new algebraic results for…
The Promise Constraint Satisfaction Problem (PCSP for short) is a generalization of the well-studied Constraint Satisfaction Problem (CSP). The PCSP has its roots in such classic problems as the Approximate Graph Coloring and the…
It is known that uniqueness of mild solutions to the incompressible Navier-Stokes equations holds in the critical class $C([0,T);L^n(\mathbb{R}^n))$ for $n \geqslant 3$. In this paper, we prove that this result is sharp in the sense that…
We develop the novel machinery of smooth approximations, and apply it to confirm the CSP dichotomy conjecture for first-order reducts of the random tournament, various homogeneous graphs including the random graph, and for expansions of the…
This note considers the notion of divergence-preserving branching bisimilarity. It briefly surveys results pertaining to the notion that have been obtained in the past one-and-a-half decade, discusses its role in the study of expressiveness…