Related papers: Divergence and unique solution of equations
We give an account of the results about limit cycle's uniqueness for Li\'enard equations, from Levinson-Smith's one to the most recent ones. We present a new uniqueness theorem in the line of Sansone-Massera's geometrical approach.
Pattern-Based Constraint Satisfaction and Logic Puzzles develops a pure logic, pattern-based perspective of solving the finite Constraint Satisfaction Problem (CSP), with emphasis on finding the "simplest" solution. Different ways of…
A fundamental fact for the algebraic theory of constraint satisfaction problems (CSPs) over a fixed template is that pp-interpretations between at most countable \omega-categorical relational structures have two algebraic counterparts for…
The conformal thin sandwich (CTS) equations are a set of four of the Einstein equations, which generalize the Laplace-Poisson equation of Newton's theory. We examine numerically solutions of the CTS equations describing perturbed Minkowski…
We consider a class of weighted harmonic functions in the open upper half-plane known as $\alpha$-harmonic functions. Of particular interest is the uniqueness problem for such functions subject to a vanishing Dirichlet boundary value on the…
The algebraic approach to the Constraint Satisfaction Problem (CSP) uses high order symmetries of relational structures -- polymorphisms -- to study the complexity of the CSP. In this paper we further develop one of the methods the…
A constraint satisfaction problem (CSP) is a computational problem where the input consists of a finite set of variables and a finite set of constraints, and where the task is to decide whether there exists a satisfying assignment of values…
This work unifies the analysis of various randomized methods for solving linear and nonlinear inverse problems by framing the problem in a stochastic optimization setting. By doing so, we show that many randomized methods are variants of a…
We use optimal transportation techniques to show uniqueness of the compactly supported weak solutions of the relativistic Vlasov-Darwin system. Our proof extends the method used by Loeper in J. Math. Pures Appl. 86, 68-79 (2006) to obtain…
The paper presents an algebraic framework for optimization problems expressible as Valued Constraint Satisfaction Problems. Our results generalize the algebraic framework for the decision version (CSPs) provided by Bulatov et al. [SICOMP…
We determine the computational complexity of approximately counting the total weight of variable assignments for every complex-weighted Boolean constraint satisfaction problem (or CSP) with any number of additional unary (i.e., arity 1)…
Statistical data by their very nature are indeterminate in the sense that if one repeats the process of collecting the data the new data set will be different from the original. But two data sets generated in the same way should ``tell the…
The logic MMSNP is a restricted fragment of existential second-order logic which allows to express many interesting queries in graph theory and finite model theory. The logic was introduced by Feder and Vardi who showed that every MMSNP…
We consider the problem of characterizing solutions in $(x, y)$ to the equation ${x \choose y}={{x-a} \choose {y+b}}$ in terms of $a$ and $b$. We obtain one simple result which allows the determination of a ratio in terms of $a$ and $b$…
We introduce a notion of duality solution for a single or a system of transport equations in spaces of probability measures reminiscent of the viscosity solution notion for nonlinear parabolic equations. Our notion of solution by duality…
We prove a result related to Bressan's mixing problem. We establish an inequality for the change of Bianchini semi-norms of characteristic functions under the flow generated by a divergence free time dependent vector field. The approach…
We first give an abstract framework to show the uniqueness of Ground State Solutions (GSS) for a large class of PDEs. To the best of our knowledge, all the existing results in the literature only addressed particular cases. Moreover, our…
In this note, we prove that if $g$ is uniformly continuous in $z$, uniformly with respect to $(\oo,t)$ and independent of $y$, the solution to the backward stochastic differential equation (BSDE) with generator $g$ is unique.
We introduce techniques of Suslin, Voevodsky, and others into the study of singular varieties. Our approach is modeled after Goresky-MacPherson intersection homology. We provide a formulation of perversity cycle spaces leading to perversity…
The Bodirsky-Pinsker conjecture asserts a P vs. NP-complete dichotomy for the computational complexity of Constraint Satisfaction Problems (CSPs) of first-order reducts of finitely bounded homogeneous structures. Prominently, two structures…