English
Related papers

Related papers: Divergence and unique solution of equations

200 papers

Bisimulation up-to enhances the coinductive proof method for bisimilarity, providing efficient proof techniques for checking properties of different kinds of systems. We prove the soundness of such techniques in a fibrational setting,…

Logic in Computer Science · Computer Science 2014-05-16 Filippo Bonchi , Daniela Petrisan , Damien Pous , Jurriaan Rot

It is an open question whether the search and decision versions of promise CSPs are equivalent. Most known algorithms for PCSPs solve only their \emph{decision} variant, and it is unknown whether they can be adapted to solve \emph{search}…

Computational Complexity · Computer Science 2026-05-26 Alberto Larrauri

We show that a version of the desingularization theorem of Hironaka holds for certain classes of infinitely differentiable functions (essentially, for subrings that exclude flat functions and are closed under differentiation and the…

Complex Variables · Mathematics 2007-05-23 Edward Bierstone , Pierre D. Milman

We obtain sufficient conditions for the uniqueness of solutions to the Cauchy problem for the continuity equation in classes of measures that need not be absolutely continuous.

Analysis of PDEs · Mathematics 2018-06-18 V. I. Bogachev , G. Da Prato , M. Röckner , S. V. Shaposhnikov

We discuss alternative iteration methods for differential equations. We provide a convergence proof for exactly solvable examples and show more convenient formulas for nontrivial problems.

Mathematical Physics · Physics 2007-05-23 Paolo Amore , Hakan Ciftci , Francisco M. Fernandez

A binary matrix satisfies the consecutive ones property (COP) if its columns can be permuted such that the ones in each row of the resulting matrix are consecutive. Equivalently, a family of sets F = {Q_1,..,Q_m}, where Q_i is subset of R…

Data Structures and Algorithms · Computer Science 2015-03-18 Giovanni Battaglia , Roberto Grossi , Noemi Scutellà

We show how up-to techniques for (bi-)similarity can be used in the setting of weighted systems. The problems we consider are language equivalence, language inclusion and the threshold problem (also known as universality problem) for…

Formal Languages and Automata Theory · Computer Science 2017-01-24 Filippo Bonchi , Barbara König , Sebastian Küpper

We consider inverse boundary value problems for the Navier-Stokes equations and the isotropic Lam\'e system in two dimensions. The uniqueness without any smallness assumptions on unknown coefficients, which is called global uniqueness, was…

Analysis of PDEs · Mathematics 2013-09-09 O. Yu. Imanuvilov , M. Yamamoto

A method is suggested for treating those complicated physical problems for which exact solutions are not known but a few approximation terms of a calculational algorithm can be derived. The method permits one to answer the following rather…

High Energy Physics - Phenomenology · Physics 2009-10-31 V. I. Yukalov , E. P. Yukalova

In a recent paper [3], Bakalov and Milanov proved that the total descendant potential of a simple singularity satisfies the W-constraints, which come from the W-algebra of the lattice vertex algebra associated to the root lattice of this…

Quantum Algebra · Mathematics 2015-06-15 Si-Qi Liu , Di Yang , Youjin Zhang

A system of singular integral equations with monotone and concave nonlinearity in the subcritical case is investigated. The specified system and its scalar analog have direct applications in various areas of physics and biology. In…

Functional Analysis · Mathematics 2024-10-28 A. Kh. Khachatryan , Kh. A. Khachatryan , H. S. Petrosyan

We consider the problem of hypothesis testing in the situation where the first hypothesis is simple and the second one is local one-sided composite. We describe the choice of the thresholds and the power functions of different tests when…

Statistics Theory · Mathematics 2015-02-25 Serguei Dachian , Yury Kutoyants , Lin Yang

We show that if a numerical method is posed as a sequence of operators acting on data and depending on a parameter, typically a measure of the size of discretization, then consistency, convergence and stability can be related by a…

Numerical Analysis · Mathematics 2007-09-27 John Jossey , Anil N. Hirani

In this thesis, a unified approach to prove the boundedness of gradients of solutions to degenerate and singular elliptic and parabolic phi-Laplacian systems is presented. At first, a Cacciopoli-type energy inequality with an additional…

Analysis of PDEs · Mathematics 2016-03-16 Toni Scharle

We study constraint satisfaction problems (CSPs) where the constraint languages are defined by finite automata, giving rise to automata-based CSPs. The key notion is the concept of Automatic Constraint Satisfaction Problem ($AutCSP$), where…

Logic in Computer Science · Computer Science 2026-04-22 Andrei Bulatov , Xiaoyang Gong , Bakh Khoussainov , Xinyao Wang

We study uniqueness properties of solutions of Schr\"odinger equations. The aim is to obtain sufficient conditions on the decay behavior of the difference of two solution $u_1-u_2$ of the equation at two different times $t_0=0$ and $t_1=1$…

Analysis of PDEs · Mathematics 2016-09-07 L. Escauriaza , C. E. Kenig , G. Ponce , L. Vega

In the classical literature on infinite series there are various tests to determine if a given infinite series converges, diverges, or oscillates. But unfortunately, for very many infinite series all the existing tests can fail to provide…

Statistics Theory · Mathematics 2018-04-13 Sucharita Roy , Sourabh Bhattacharya

We define and study a statistical mechanics ensemble that characterizes connected solutions in constraint satisfaction problems (CSPs). Built around a well-known local entropy bias, it allows us to better identify hardness transitions in…

Disordered Systems and Neural Networks · Physics 2026-04-17 Damien Barbier

We consider Dirichlet problems for linear elliptic equations of second order in divergence form on a bounded or exterior smooth domain $\Omega$ in $\mathbb{R}^n$, $n \ge 3$, with drifts $\mathbf{b}$ in the critical weak $L^n$-space…

Analysis of PDEs · Mathematics 2018-11-09 Hyunseok Kim , Tai-Peng Tsai

This is a study of S. Kripke's notion of fulfilment. Motivated by Paris-Harrington statement, Kripke was looking for a proof of G\"odel's Incompleteness Theorem which was model-theoretic, natural (without self-reference), and easy.…

Logic · Mathematics 2019-04-25 J. E. Quinsey