Related papers: Divergence and unique solution of equations
We show global uniqueness of the solution to a class of constrained variational problems, using scaling properties. This is used to establish the essential uniqueness of solutions of a large deviations problem in multiple dimensions. The…
We develop a behavioral theory for the untyped call-by-value lambda calculus extended with the delimited-control operators shift and reset. For this calculus, we discuss the possible observable behaviors and we define an applicative…
We study singular solutions to the fractional Laplace equation and, more generally, to nonlocal linear equations with measurable kernels. We establish B\^ocher type results that characterize the behavior of singular solutions near the…
We consider a variational problem with boundary singularity and Dirichlet condition. We give a blow-up analysis for sequences of solutions of an equation with exponential nonlinearity. Also, we derive a compactness criterion under some…
We deal with the Cauchy problem for multi-dimensional scalar conservation laws, where the fluxes and the source terms can be discontinuous functions of the unknown. The main novelty of the paper is the introduction of a~kinetic formulation…
We introduce a problem class we call Polynomial Constraint Satisfaction Problems, or PCSP. Where the usual CSPs from computer science and optimization have real-valued score functions, and partition functions from physics have monomials,…
It is well known that we can use structural proof theory to refine, or generalize, existing paradigmatic computational primitives, or to discover new ones. Under such a point of view we keep developing a programme whose goal is establishing…
We prove that joint uniqueness in law and the existence of a strong solution imply pathwise uniqueness for variational solutions to stochastic partial differential equations of the form \begin{align*}…
We prove weak-strong uniqueness results for the isentropic compressible Navier-Stokes system on the torus. In other words, we give conditions on a strong solution so that it is unique in a class of weak solutions. Known weak-strong…
We prove that the relation of bisimilarity between countable labelled transition systems is $\Sigma_1^1$-complete (hence not Borel), by reducing the set of non-wellorders over the natural numbers continuously to it. This has an impact on…
In this paper, we extend our previous result from [16]. We prove that transport equations with rough coefficients do possess a uniqueness property. Our method relies strongly on duality and bears a strong resemblance with the well-known…
The well-known process algebras, such as CCS, ACP and $\pi$-calculus, capture the interleaving concurrency based on bisimilarity semantics. We did some work on truly concurrent process algebras, such as CTC, APTC and $\pi_{tc}$, capture the…
We develop a new theory of strong subalgebras and linear congruences that are defined globally. Using this theory we provide a new proof of the correctness of Zhuk's algorithm for all tractable CSPs on a finite domain, and therefore a new…
To refine formal methods for concurrent systems, there are several ways of enriching classical operational semantics of process calculi. One can enable the auditing and undoing of past synchronisations thanks to communication keys, thus…
The constraint satisfaction problem (CSP) can be formulated as a homomorphism problem between relational structures: given a structure $\mathcal{A}$, for any structure $\mathcal{X}$, whether there exists a homomorphism from $\mathcal{X}$ to…
Let $Y$ be a complex projective variety of dimension $n$ with isolated singularities, $\pi:X\to Y$ a resolution of singularities, $G:=\pi^{-1}\left(\rm{Sing}(Y)\right)$ the exceptional locus. From the Decomposition Theorem one knows that…
A $p$-Laplacian elliptic problem in the presence of both strongly singular and $(p-1)$-superlinear nonlinearities is considered. We employ bifurcation theory, approximation techniques and sub-supersolution method to establish the existence…
We investigate the Constraint Satisfaction Problem (CSP) over templates with a group structure, and algorithms solving CSP that are equivariant, i.e. invariant under a natural group action induced by a template. Our main result is a method…
We consider a unique continuation problem where the Dirichlet trace of the solution is known to have finite dimension. We prove Lipschitz stability of the unique continuation problem and design a finite element method that exploits the…
We prove a complexity dichotomy theorem for all non-negative weighted counting Constraint Satisfaction Problems (CSP). This caps a long series of important results on counting problems including unweighted and weighted graph homomorphisms…