Related papers: Divergence and unique solution of equations
Stream GSOS is a specification format for operations and calculi on infinite sequences. The notion of bisimilarity provides a canonical proof technique for equivalence of closed terms in such specifications. In this paper, we focus on open…
The compactness lemma in programming language theory states that any recursive function can be simulated by a finite unrolling of the function. One important use case it has is in the logical relations proof technique for proving properties…
Bulatov (2008) gave a dichotomy for the counting constraint satisfaction problem #CSP. A problem from #CSP is characterised by a constraint language, which is a fixed, finite set of relations over a finite domain D. An instance of the…
Let $E$ be a complete, separable metric space and $A$ be an operator on $C_b(E)$. We give an abstract definition of viscosity sub/supersolution of the resolvent equation $\lambda u-Au=h$ and show that, if the comparison principle holds,…
Formalising the pi-calculus is an illuminating test of the expressiveness of logical frameworks and mechanised metatheory systems, because of the presence of name binding, labelled transitions with name extrusion, bisimulation, and…
In sphere of research of discrete optimization algorithms efficiency the important place occupies a method of polynomial reducibility of some problems to others with use of special purpose components. In this paper a novel method of compact…
The Constraint-satisfaction problem (CSP) is fundamental in mathematics, physics, and theoretical computer science. Continuous local search (CLS) solvers, as recent advancements, can achieve highly competitive results on certain classes of…
We apply the topology of convergence on compact sets to define unpredictable functions [5, 6]. The topology is metrizable and easy for applications with integral operators. To demonstrate the effectiveness of the approach, the existence and…
We discuss the non-uniqueness of continuous solutions to differential equations with a {\it discrete } state-dependent delay and continuous initial functions. We are interested not only in the fact (conditions) of non-uniqueness, but in…
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 prove a unified and general criterion for the uniqueness of critical points of a functional in the presence of constraints such as positivity, boundedness, or fixed mass. Our method relies on convexity properties along suitable paths and…
Reversible systems exhibit both forward computations and backward computations, where the aim of the latter is to undo the effects of the former. Such systems can be compared via forward-reverse bisimilarity as well as its two components,…
Singular perturbation theory plays a central role in the approximate solution of nonlinear differential equations. However, applying these methods is a subtle art owing to the lack of globally applicable algorithms. Inspired by the fact…
In this paper, we use bifurcation method to investigate the existence and multiplicity of one-sign solutions of the $p$-Laplacian involving a linear/superlinear nonlinearity with zeros. To do this, we first establish a bifurcation theorem…
The algebraic dichotomy conjecture for Constraint Satisfaction Problems (CSPs) of reducts of (infinite) finitely bounded homogeneous structures states that such CSPs are polynomial-time tractable when the model-complete core of the template…
This article is an exposition of an elementary constructive proof of canonical resolution of singularities in characteristic zero, presented in detail in Invent. Math. 128 (1997), 207-302. We define a new local invariant and get an…
We prove the existence of solutions to the Cauchy-Dirichlet problem associated with a class of fully nonlinear anisotropic evolution equations. We prove a comparison principle and conclude the uniqueness of solutions. All results are…
We study the design of stochastic local search methods to prove unsatisfiability of a constraint satisfaction problem (CSP). For a binary CSP, such methods have been designed using the microstructure of the CSP. Here, we develop a method to…
We provide the first (non-labelled) sequent calculi for bimodal provability logics with "usual" provability predicates. In particular, we introduce calculi for the logics CS, CSM and ER. Additionally, we present non-wellfounded versions of…
Existence and uniqueness of mass-conserving classical solutions to the continuous coagulation equation with collisional breakage are investigated for an unbounded class of collision kernels and a particular case of the distribution…