English
Related papers

Related papers: Kazdan-Warner equation on graph in the negative ca…

200 papers

In order to obtain solutions to problem $$ {{array}{c} -\Delta u=\dfrac{A+h(x)} {|x|^2}u+k(x)u^{2^*-1}, x\in {\mathbb R}^N, u>0 \hbox{in}{\mathbb R}^N, {and}u\in {\mathcal D}^{1,2}({\mathbb R}^N), {array}. $$ $h$ and $k$ must be chosen…

Analysis of PDEs · Mathematics 2007-05-23 Boumediene Abdellaoui , Veronica Felli , Ireneo Peral

We obtain a Harnack type inequality for solutions of the Liouville type equation, \begin{equation}\nonumber -\Delta u=|x|^{2\alpha}K(x)e^{\displaystyle u} \qquad\text{in} \,\,\, \Omega, \end{equation} where $\alpha\in(-1,0)$, $\Omega$ is a…

Analysis of PDEs · Mathematics 2026-01-21 Paolo Cosentino

We are mainly concerned with the nonlinear $p$-Laplace equation \begin{equation*} -\Delta_pu+\rho|u|^{p-2}u=\psi(x,u) \end{equation*} on a locally finite graph $G=(V,E)$, where $p$ belongs to $(1, +\infty)$. We obtain existence of positive…

Analysis of PDEs · Mathematics 2023-08-08 Mengqiu Shao , Yunyan Yang , Liang Zhao

We say that a graph $G$ on $n$ vertices is $\{H,F\}$-$o$-heavy if every induced subgraph of $G$ isomorphic to $H$ or $F$ contains two nonadjacent vertices with degree sum at least $n$. Generalizing earlier sufficient forbidden subgraph…

Combinatorics · Mathematics 2024-09-23 Wangyi Shang , Hajo Broersma , Shenggui Zhang , Binlong Li

A typical Dirac-type problem in extremal graph theory is to determine the minimum degree threshold for a graph $G$ to have a spanning subgraph $H$, e.g. the Dirac theorem. A natural following up problem would be to seek an $H$-factor, which…

Combinatorics · Mathematics 2025-09-30 Allan Lo

For $\mathrm{H} \in C^2(\mathbb{R}^{N \times n})$ and $u : \Omega \subseteq \mathbb{R}^n \to \mathbb{R}^N$, consider the system \[ \label{1}\mathrm{A}\_\infty u\, :=\,\Big(\mathrm{H}\_P \otimes \mathrm{H}\_P + \mathrm{H}[\mathrm{H}\_P]^\bot…

Analysis of PDEs · Mathematics 2017-07-12 Gisella Croce , Nikos Katzourakis , Giovanni Pisante

Bounds are proved for the connective constant \mu\ of an infinite, connected, \Delta-regular graph G. The main result is that \mu\ \ge \sqrt{\Delta-1} if G is vertex-transitive and simple. This inequality is proved subject to weaker…

Combinatorics · Mathematics 2013-05-02 Geoffrey R. Grimmett , Zhongyang Li

We consider the following Choquard equation $$ -\Delta_\gamma u + u = \left(d(z)^{-\mu} \ast |u|^p\right)|u|^{p-2}u, \text{ in } \mathbb{R}^N, $$ where $\Delta_\gamma$ is the Grushin operator. For a suitable range of the parameter $p$ we…

Analysis of PDEs · Mathematics 2026-03-23 Federico Bernini , Paolo Malanchini

The aim of this paper is to treat the following problem $$ (P) \left\{ \begin{array}{rcll} (-\Delta)^s_{p, \beta} u &= & f(x,u) &\mbox{ in }\Omega, u & = & 0 &\mbox{ in } \mathds{R}^N\setminus\Omega, \end{array} \right. $$ where $$…

Analysis of PDEs · Mathematics 2016-02-12 B. Abdellaoui , A. Attar , R. Bentifour

We study solutions of Hamilton--Jacobi equations of the form $$\lambda \alpha(x) u_\lambda(x) + H(x, D_x u_\lambda) = c,$$ where $\alpha$ is a nonnegative function, $\lambda$ a positive constant, $c$ a constant and $H $ a convex coercive…

Analysis of PDEs · Mathematics 2022-10-12 Maxime Zavidovique

For c in [0,1] let P_n(c) denote the set of n-vertex perfect graphs with density c and C_n(c) the set of n-vertex graphs without induced C_5 and with density c. We show that log|P_n(c)|/binom{n}{2}=log|C_n(c)|/binom{n}{2}=h(c)+o(1) with…

Combinatorics · Mathematics 2011-02-28 Julia Böttcher , Anusch Taraz , Andreas Würfl

In this paper we characterize the validity of the Hardy-type inequality \begin{equation*} \left\|\left\|\int_s^{\infty}h(z)dz\right\|_{p,u,(0,t)}\right\|_{q,w,\infty}\leq c \,\|h\|_{1,v,\infty} \end{equation*} where $0<p< \infty$, $0<q\leq…

Classical Analysis and ODEs · Mathematics 2013-02-15 Amiran Gogatishvili , Rza Chingiz Mustafayev , Lars-Erik Persson

We consider equations of the form $-L_\mu u +f(u)=0$ in a smooth domain $\Omega$, where $L_\mu=\Delta + \mu\delta^{-2}$ and $\delta(x)$ denotes the distance of the point $x$ to the boundary of the domain. The nonlinear term $f$ is positive,…

Analysis of PDEs · Mathematics 2020-06-05 Moshe Marcus

In this paper, we study the following nonlinear Dirac equations (NLDE) on noncompact metric graph $\mathcal{G}$ with localized nonlinearities \begin{equation} \mathcal{D} u - \omega u= a\chi_{\mathcal{K}}|u|^{p-2}u, \end{equation} where…

Analysis of PDEs · Mathematics 2025-05-22 Zhentao He , Chao Ji

We prove that $\alpha$-dissipative solutions to the Cauchy problem of the Hunter-Saxton equation, where $\alpha \in W^{1, \infty}(\mathbb{R}, [0, 1))$, can be computed numerically with order $\mathcal{O}(\Delta x^{{1}/{8}}+\Delta…

Numerical Analysis · Mathematics 2025-10-16 Thomas Christiansen , Katrin Grunert

The paper addresses an open problem raised in [Bartsch, Molle, Rizzi, Verzini: Normalized solutions of mass supercritical Schr\"odinger equations with potential, Comm. Part. Diff. Equ. 46 (2021), 1729-1756] on the existence of normalized…

Analysis of PDEs · Mathematics 2023-06-14 Thomas Bartsch , Shijie Qi , Wenming Zou

Let $G=(V,E)$ be a locally finite connected weighted graph, and $\Omega$ be an unbounded subset of $V$. Using Rothe's method, we study the existence of solutions for the semilinear heat equation $\partial_tu+|u|^{p-1}\cdot u=\Delta…

Analysis of PDEs · Mathematics 2021-08-31 Yong Lin , Yuanyuan Xie

For $s \in [1/2, 1)$, let $u$ solve $(\partial_t - \Delta)^s u = Vu$ in $\mathbb R^{n} \times [-T, 0]$ for some $T>0$ where $||V||_{ C^2(\mathbb R^n \times [-T, 0])} < \infty$. We show that if for some $0< c< T$ and $\epsilon>0$…

Analysis of PDEs · Mathematics 2023-07-21 Agnid Banerjee , Abhishek Ghosh

We consider the problem \[-\Delta u + W(x)u = ((1/{|x|^{\alpha}} * |u|^{p}) |u|^{p-2}u, u \in H_{0}^{1}(\Omega)\], where $\Omega$ is an exterior domain in $\mathbb{R}^{N}$, $N\geq3,$ $\alpha \in(0,N)$, $p\in[2,(2N-\alpha)/(N-2)$, $W$ is…

Analysis of PDEs · Mathematics 2012-11-27 Mónica Clapp , Dora Salazar

The graph homomorphism problem (HOM) asks whether the vertices of a given $n$-vertex graph $G$ can be mapped to the vertices of a given $h$-vertex graph $H$ such that each edge of $G$ is mapped to an edge of $H$. The problem generalizes the…

Data Structures and Algorithms · Computer Science 2015-02-20 Fedor V. Fomin , Alexander Golovnev , Alexander S. Kulikov , Ivan Mihajlin