arXiv subjects
Publications and source records attributed to Dong Ye.
We consider the polyharmonic equation $(-Δ)^m u=e^u$ in $\mathbb{R}^N$ with $m \geq 3$ and $N > 2m$. We prove the existence of many entire stable solutions. This answer some questions raised by Farina and Ferrero.
Let $(G,w)$ be a weighted graph with a weight-function $w: E(G)\to \mathbb R\backslash\{0\}$. A weighted graph $(G,w)$ is invertible to a new weighted graph if its adjacency matrix is invertible. A graph inverse has combinatorial interest and can be applied to bound median eigenvalues of a graph such as have physical meanings in Quatumn Chemistry. In this paper, we characterize the inverse of a weighted graph based on its Sachs subgraphs that are spanning subgraphs with only $K_2$ or cycles (or loops) as components. The characterization can be used to find the inverse of a weighted graph based on its structures instead of its adjacency matrix. If a graph has its spectra split about the origin, i.e., half of eigenvalues are positive and half of them are negative, then its median eigenvalues can be bounded by estimating the largest and smallest eigenvalues of its inverse. We characterize graphs with a unique Sachs subgraph and prove that these graphs has their spectra split about the origin if they have a perfect matching. As applications, we show that the median eigenvalues of stellated graphs of trees and corona graphs belong to different halves of the interval $[-1,1]$.
We study the polyharmonic problem $Δ^m u = \pm e^u$ in ${\mathbb R}^{2m}$, with $m \geq 2$. In particular, we prove that {\sl for any} $V > 0$, there exist radial solutions of $Δ^m u = -e^u$ such that $$\int_{{\mathbb R}^{2m}} e^u dx = V.$$ It implies that for $m$ odd, given arbitrary volume $V > 0$, there exist conformal metrics $g$ on ${\mathbb R}^{2m}$ with positive constant $Q$-curvature and vol$(g) =V$. This answers some open questions in Martinazzi's work.
In 1996, Tarjan and Matheson proved that if $G$ is a plane triangulated disc with $n$ vertices, $γ(G)\le n/3$, where $γ(G)$ denotes the domination number of $G$. Furthermore, they conjectured that the constant $1/3$ could be improved to $1/4$ for sufficiently large $n$. Their conjecture remains unsettled. In the present paper, it is proved that if $G$ is a hamiltonian plane triangulation with $|V(G)|=n$ vertices and minimum degree at least 4, then $γ(G)\le\max\{\lceil 2n/7\rceil, \lfloor 5n/16\rfloor\}$. It follows immediately that if $G$ is a 4-connected plane triangulation with $n$ vertices, then $γ(G)\le\max\{\lceil 2n/7\rceil, \lfloor 5n/16\rfloor\} $. It then follows that if $n\ge 26$, then $γ(G)\le \lfloor 5n/16\rfloor$.
We are interested in entire solutions for the semilinear biharmonic equation $Δ^{2}u=f(u)$ in $\R^N$, where $f(u)=e^{u}$ or $-u^{-p}\ (p>0)$. For the exponential case, we prove that any classical entire solution verifies $-Δu>0$ without any restriction, which completes the results in \cite{Dupaigne, xu-wei} and yields a nonexistence result in $\R^2$ ; we obtain also a refined asymptotic expansion of radial separatrix solution for $N=3$, which answers a question in \cite{Berchio}. For the negative power case, we show the nonexistence of the classical entire solution for any $0<p\leq1$.
A graph $G$ is Pfaffian if it has an orientation such that each central cycle $C$ (i.e. $C$ is even and $G-V(C)$ has a perfect matching) has an odd number of edges directed in either direction of the cycle. The number of perfect matchings of Pfaffian graphs can be computed in polynomial time. In this paper, by applying the characterization of Pfaffian braces due to Robertson, Seymour and Thomas [Ann. Math. 150 (1999) 929-975], and independently McCuaig [Electorn. J. Combin. 11 (2004) #R79], we show that every embedding of a Pfaffian brace on a surface with positive genus has face-width at most 3. For a Pfaffian cubic brace, we obtain further structure properties which are useful in characterizing Pfaffian polyhex graphs. Combining with polyhex graphs with face-width 2, we show that a bipartite polyhex graph is Pfaffian if and only if it is isomorphic to the cube, the Heawood graph or $C_k\times K_2$ for even integers $k\ge 6$, and all non-bipartite polyhex graphs are Pfaffian.
We prove the nonexistence of smooth stable solution to the biharmonic problem $Δ^2 u= u^p$, $u>0$ in $\R^N$ for $1 < p < \infty$ and $N < 2(1 + x_0)$, where $x_0$ is the largest root of the following equation: $$x^4 - \frac{32p(p+1)}{(p-1)^2}x^2 + \frac{32p(p+1)(p+3)}{(p-1)^3}x -\frac{64p(p+1)^2}{(p-1)^4} = 0.$$ In particular, as $x_0 > 5$ when $p > 1$, we obtain the nonexistence of smooth stable solution for any $N \leq 12$ and $p > 1$. Moreover, we consider also the corresponding problem in the half space $\R^N_+$, or the elliptic problem $Δ^2 u= ł(u+1)^p$ on a bounded smooth domain $Ø$ with the Navier boundary conditions. We will prove the regularity of the extremal solution in lower dimensions. Our results improve the previous works.
We consider the following Toda system Δu_i + \D \sum_{j = 1}^n a_{ij}e^{u_j} = 4πγ_{i}δ_{0} \text{in}\mathbb R^2, \int_{\mathbb R^2}e^{u_i} dx < \infty, \forall 1\leq i \leq n, where $γ_{i} > -1$, $δ_0$ is Dirac measure at 0, and the coefficients $a_{ij}$ form the standard tri-diagonal Cartan matrix. In this paper, (i) we completely classify the solutions and obtain the quantization result: $$\sum_{j=1}^n a_{ij}\int_{\R^2}e^{u_j} dx = 4π(2+γ_i+γ_{n+1-i}), \;\;\forall\; 1\leq i \leq n.$$ This generalizes the classification result by Jost and Wang for $γ_i=0$, $\forall \;1\leq i\leq n$. (ii) We prove that if $γ_i+γ_{i+1}+...+γ_j \notin \mathbb Z$ for all $1\leq i\leq j\leq n$, then any solution $u_i$ is \textit{radially symmetric} w.r.t. 0. (iii) We prove that the linearized equation at any solution is \textit{non-degenerate}. These are fundamental results in order to understand the bubbling behavior of the Toda system.
In this note, we investigate the regularity of extremal solution $u^*$ for semilinear elliptic equation $-\triangle u+c(x)\cdot\nabla u=λf(u)$ on a bounded smooth domain of $\mathbb{R}^n$ with Dirichlet boundary condition. Here $f$ is a positive nondecreasing convex function, exploding at a finite value $a\in (0, \infty)$. We show that the extremal solution is regular in low dimensional case. In particular, we prove that for the radial case, all extremal solution is regular in dimension two.
Let $H$ be a cubic graph admitting a 3-edge-coloring $c: E(H)\to \mathbb Z_3$ such that the edges colored by 0 and $μ\in\{1,2\}$ induce a Hamilton circuit of $H$ and the edges colored by 1 and 2 induce a 2-factor $F$. The graph $H$ is semi-Kotzig if switching colors of edges in any even subgraph of $F$ yields a new 3-edge-coloring of $H$ having the same property as $c$. A spanning subgraph $H$ of a cubic graph $G$ is called a {\em semi-Kotzig frame} if the contracted graph $G/H$ is even and every non-circuit component of $H$ is a subdivision of a semi-Kotzig graph. In this paper, we show that a cubic graph $G$ has a circuit double cover if it has a semi-Kotzig frame with at most one non-circuit component. Our result generalizes some results of Goddyn (1988), and Häggkvist and Markström [J. Combin. Theory Ser. B (2006)].
In this paper we obtain an inequality on the unit disc $B$ in the plane, which improves the classical Moser-Trudinger inequality and the classical Hardy inequality at the same time. Namely, there exists a constant $C_0>0$ such that \[ \int_B e^{\frac {4πu^2}{H(u)}} dx \le C_0 < \infty, \quad \forall\; u\in C^\infty_0(B),\] where $$H(u) := \int_B |\n u|^2 dx - \int_B \frac {u^2}{(1-|x|^2)^2} dx.$$ This inequality is a two dimensional analog of the Hardy-Sobolev-Maz'ya inequality in higher dimensions, which was recently intensively studied. We also prove that the supremum is achieved in a suitable function space, which is an analog of the celebrated result of Carleson-Chang for the Moser-Trudinger inequality.
A fullerene graph $F$ is a 3-connected plane cubic graph with exactly 12 pentagons and the remaining hexagons. Let $M$ be a perfect matching of $F$. A cycle $C$ of $F$ is $M$-alternating if the edges of $C$ appear alternately in and off $M$. A set $\mathcal H$ of disjoint hexagons of $F$ is called a resonant pattern (or sextet pattern) if $F$ has a perfect matching $M$ such that all hexagons in $\mathcal H$ are $M$-alternating. A fullerene graph $F$ is $k$-resonant if any $i$ ($0\leq i \leq k$) disjoint hexagons of $F$ form a resonant pattern. In this paper, we prove that every hexagon of a fullerene graph is resonant and all leapfrog fullerene graphs are 2-resonant. Further, we show that a 3-resonant fullerene graph has at most 60 vertices and construct all nine 3-resonant fullerene graphs, which are also $k$-resonant for every integer $k>3$. Finally, sextet polynomials of the 3-resonant fullerene graphs are computed.
A fullerene graph is a cubic 3-connected plane graph with (exactly 12) pentagonal faces and hexagonal faces. Let $F_n$ be a fullerene graph with $n$ vertices. A set $\mathcal H$ of mutually disjoint hexagons of $F_n$ is a sextet pattern if $F_n$ has a perfect matching which alternates on and off each hexagon in $\mathcal H$. The maximum cardinality of sextet patterns of $F_n$ is the Clar number of $F_n$. It was shown that the Clar number is no more than $\lfloor\frac {n-12} 6\rfloor$. Many fullerenes with experimental evidence attain the upper bound, for instance, $\text{C}_{60}$ and $\text{C}_{70}$. In this paper, we characterize extremal fullerene graphs whose Clar numbers equal $\frac{n-12} 6$. By the characterization, we show that there are precisely 18 fullerene graphs with 60 vertices, including $\text{C}_{60}$, achieving the maximum Clar number 8 and we construct all these extremal fullerene graphs.