相关论文: The $L^1$-relaxed area of the graph of the vortex …
In this paper, we study the semilinear elliptic equation of the form \begin{eqnarray*} -\Delta u+a(x)|u|^{p-2}u-b(x)|u|^{q-2}u=0 \end{eqnarray*} on lattice graphs $\mathbb{Z}^{N}$, where $N\geq 2$ and $2\leq p<q<+\infty$. By the…
The Borsuk problem asks for the smallest number of subsets with strictly smaller diameters into which any bounded set in the $d$-dimensional space can be decomposed. It is a classical problem in combinatorial geometry that has been subject…
Suppose that $G=(V, E)$ be a locally finite and connected graph with symmetric weight and uniformly positive measure, where $V$ denotes the vertex set and $E$ denotes the edge set. We are concered with the following problem $$…
In this paper, we consider three typical problems on a locally finite connected graph. The first one is to study the Bochner formula for the Laplacian operator on a locally finite connected graph. We use the Bochner formula to derive the…
We explore the following problem: given a collection of creases on a piece of paper, each assigned a folding direction of mountain or valley, is there a flat folding by a sequence of simple folds? There are several models of simple folds;…
The graph partition problem is the problem of partitioning the vertex set of a graph into a fixed number of sets of given sizes such that the sum of weights of edges joining different sets is optimized. In this paper we simplify a known…
In this paper we describe a mathematically interesting but relatively minor improvement to the Gott-Goldberg-Vanderbei (GGV) map projection. This new projection can be described as what one would get by making a spherical rubber ball…
We consider concentrated vorticities for the Euler equation on a smooth domain $\Omega \subset \mathbf{R}^2$ in the form of \[ \omega = \sum_{j=1}^N \omega_j \chi_{\Omega_j}, \quad |\Omega_j| = \pi r_j^2, \quad \int_{\Omega_j} \omega_j d\mu…
The blow-up of a graph is obtained by replacing every vertex with a finite collection of copies so that the copies of two vertices are adjacent if and only if the originals are. If every vertex is replaced with the same number of copies,…
This paper investigates fractional torsional rigidity on compact, connected metric graphs, a novel extension of the classical concept to nonlocal operators. The fractional torsional rigidity is defined as the $L^1$-norm of the fractional…
For a finite planar graph, it associates with some metric spaces, called (regular) spherical polyhedral surfaces, by replacing faces with regular spherical polygons in the unit sphere and gluing them edge-to-edge. We consider the class of…
The motion of incompressible and ideal fluids is studied in the plane. The stability in $L^1$ of circular vortex patches is established among the class of all bounded vortex patches of equal strength without any restriction on the size of…
We consider immersions admitting uniform representations as an L-Lipschitz graph. In codimension 1, we show compactness for such immersions for arbitrary fixed finite L and uniformly bounded volume. The same result is shown in arbitrary…
In this paper, we study a nonlocal variational problem which consists of minimizing in $L^2$ the sum of a quadratic data fidelity and a regularization term corresponding to the $L^p$-norm of the nonlocal gradient. In particular, we study…
Let $Z(\cal L)$ be the center of a Lie algebra $\cal L$ with Lie bracket $[\cdot, \cdot]$. %We then define The commuting graph of $\cal L$ is then defined by the simple undirected graph $\Gamma({\cal L})=(V_{\cal L},E_{\cal L})$ in which…
The minimal vertex-cover (or maximal independent-set) problem is studied on random graphs of finite connectivity. Analytical results are obtained by a mapping to a lattice gas of hard spheres of (chemical) radius one, and they are found to…
We show that a problem of deleting a minimum number of vertices from a graph to obtain a graph embeddable on a surface of a given Euler genus is solvable in time $2^{C_g \cdot k^2 \log k} n^{O(1)}$, where $k$ is the size of the deletion…
A polyhedral norm is a norm N on R^n for which the set N(x)\leq 1 is a polytope. This covers the case of the L^1 and L^{\infty} norms. We consider here effective algorithms for determining the Voronoi polytope for such norms with a point…
We derive an upper bound on the size of a ball such that the image of the ball under quadratic map is strongly convex and smooth. Our result is the best possible improvement of the analogous result by Polyak in the case of quadratic map. We…
We propose here the use of the variational level set methodology to capture Lagrangian vortex boundaries in 2D unsteady velocity fields. This method reformulates earlier approaches that seek material vortex boundaries as extremum solutions…