Related papers: p-th Kazdan-Warner equation on graph

We study a fundamental question from graph drawing: given a pair $(G,C)$ of a graph $G$ and a cycle $C$ in $G$ together with a simple polygon $P$, is there a straight-line drawing of $G$ inside $P$ which maps $C$ to $P$? We say that such a…

Let ${\rm gp}(G)$ be the general position number of a graph $G$. It is proved that ${\rm gp}(G-x)\leq 2{\rm gp}(G)$ holds for any vertex $x$ of a connected graph $G$ and that if $x$ lies in some ${\rm gp}$-set of $G$, then ${\rm gp}(G) - 1…

We establish the global $C^{1, \alpha}$-regularity for functions in solution classes, whenever ellipticity constants are sufficiently close. As an application, we derive the global regularity result concerning the parabolic normalized…

For $p\ge 1$ let $\varphi_p(x)=x^2/2$ if $|x|\le 1$ and $\varphi_p(x)=1/p|x|^p-1/p+1/2$ if $|x|>1$. For a random variable $\xi$ let $\tau_{\varphi_p}(\xi)$ denote $\inf\{a\ge 0:\;\forall_{\lambda\in\mathbb{R}}\;…

We show how to deduce Rellich inequalities from Hardy inequalities on infinite graphs. Specifically, the obtained Rellich inequality gives an upper bound on a function by the Laplacian of the function in terms of weighted norms. These…

Let $G$ be a finite group and $\chi: G \rightarrow \mathbb{C}$ a class function. Let $H = (V,E)$ be a directed graph with for each vertex a cyclic order of the edges incident to it. The cyclic orders give a collection $F$ of faces of $H$.…

A graph $G=(V,E)$ is called $d$-rigid if, for a generic embedding of its vertices in $\mathbb{R}^d$, every edge-length preserving continuous motion of the vertices preserves the distances between all pairs of non-adjacent vertices as well.…

The seminal work of DiPerna and Lions [Invent. Math., 98, 1989] guarantees the existence and uniqueness of regular Lagrangian flows for Sobolev vector fields. The latter is a suitable selection of trajectories of the related ODE satisfying…

We establish uniqueness results for quasilinear elliptic problems through the criterion recently provided in \cite{DFMST}. We apply it to generalized $p$-Laplacian subhomogeneous problems that may admit multiple nontrivial nonnegative…

Let $G=N\rtimes \mathbb{R}$, where $N$ is a Carnot group and $\mathbb{R}$ acts on $N$ via automorphic dilations. Homogeneous left-invariant sub-Laplacians on $N$ and $\mathbb{R}$ can be lifted to $G$, and their sum is a left-invariant…

In this paper, we introduce a novel first-order derivative for functions on a lattice graph, and establish its weak (1, 1) estimate as well as strong (p, p) estimate for p > 1 in weighted spaces. This derivative is designed to reconstruct…

The toughness $t(G)$ of a graph $G=(V,E)$ is defined as $t(G)=\min\{\frac{|S|}{c(G-S)}\}$, in which the minimum is taken over all $S\subset V$ such that $G-S$ is disconnected, where $c(G-S)$ denotes the number of components of $G-S$. We…

For any finite simple graph G=(V,E), the discrete Dirac operator D=d+d* and the Laplace-Beltrami operator L=d d* + d* d on the exterior algebra bundle Omega are finite v times v matrices, where dim(Omega) = v is the sum of the cardinalities…

We show optimal existence, nonexistence and regularity results for nonnegative solutions to Dirichlet problems as $$ \begin{cases} \displaystyle -\Delta_1 u = g(u)|D u|+h(u)f & \text{in}\;\Omega,\\ u=0 & \text{on}\;\partial\Omega,…

We find the fundamental solution to the p-Laplace equation in a class of H\"ormander vector fields that generate neither a Carnot group nor a Grushin-type space. The singularity occurs at the sub-Riemannian points which naturally…

A colouring of a graph $G=(V,E)$ is a mapping $c\colon V\to \{1,2,\ldots\}$ such that $c(u)\neq c(v)$ for every two adjacent vertices $u$ and $v$ of $G$. The {\sc List $k$-Colouring} problem is to decide whether a graph $G=(V,E)$ with a…

Fix $k \geq 3$, and let $G$ be a $k$-uniform hypergraph with maximum degree $\Delta$. Suppose that for each $l = 2, ..., k-1$, every set of l vertices of G is in at most $\Delta^{(k-l)/(k-1)}/f$ edges. Then the chromatic number of $G$ is…

We consider the Cauchy problem for the nonstationary discrete p-Laplacian with inhomogeneous density \r{ho}(x) on an infinite graph which supports the Sobolev inequality. For nonnegative solutions when p > 2, we prove the precise rate of…

The Borodin-Kostochka Conjecture states that for a graph $G$, if $\Delta(G)\geq9$, then $\chi(G)\leq\max\{\Delta(G)-1,\omega(G)\}$. We use $P_t$ and $C_t$ to denote a path and a cycle on $t$ vertices, respectively. Let…

We give a simple proof of a well-known theorem of G\'al and of the recent related results of Aistleitner, Berkes and Seip [1] regarding the size of GCD sums. In fact, our method obtains the asymptotically sharp constant in G\'al's theorem,…