相关论文: A Jenkins-Serrin problem on the strip

We derive a new lower bound for the bandwidth of a graph that is based on a new lower bound for the minimum cut problem. Our new semidefinite programming relaxation of the minimum cut problem is obtained by strengthening the known…

Initial-boundary value problems for the 2D Zakharov-Kuznetsov equation posed on bounded rectangles and on a strip are considered. Spectral properties of a linearized operator and critical sizes of domains are studied. Exponential decay of…

In this paper we study some geometric properties of surfaces in the Heisenberg group, $\mathcal{H}_{3}.$ We obtain, using the Gauss map for Lie groups, a partial classification of minimal graphs in $\mathcal{H}_{3}.$ We also proof the non…

The minimal infinitesimal rigidity of bar-joint frameworks in the non-Euclidean spaces (R^2, ||.||_q) are characterised in terms of (2,2)-tight graphs. Specifically, a generically placed bar-joint framework (G,p) in the plane is minimally…

Lawson and Osserman proved that the Dirichlet problem for the minimal surface system is not always solvable in the class of Lipschitz maps. However, it is known that minimizing sequences (for area) of Lipschitz graphs converge to objects…

A rigidity theory is developed for frameworks in a metric space with two types of distance constraints. Mixed sparsity graph characterisations are obtained for the infinitesimal and continuous rigidity of completely regular bar-joint…

We study the problem of finding a minimal graph with prescribed boundary data in arbitrary dimension and codimension. Existence, uniqueness, stability and regularity are treated. We first present the well-known results for codimension one:…

An initial-boundary value in a strip with homogeneous Dirichlet boundary conditions for two-dimensional Zakharov-Kuznetsov-Burgers equation is considered. Results on global well-posedness and long-time decay of solutions in Sobolev spaces…

In the Heisenberg group $\mathbb{H}^1$, equipped with a left-invariant and not necessarily symmetric norm in the horizontal distribution, we provide examples of entire area-minimizing horizontal graphs which are locally Lipschitz in…

We investigate the problem of drawing graphs in 2D and 3D such that their edges (or only their vertices) can be covered by few lines or planes. We insist on straight-line edges and crossing-free drawings. This problem has many connections…

In the distributed subgraph-freeness problem, we are given a graph $H$, and asked to determine whether the network graph contains $H$ as a subgraph or not. Subgraph-freeness is an extremely local problem: if the network had no bandwidth…

Let $G$ be an undirected, bounded degree graph with $n$ vertices. Fix a finite graph $H$, and suppose one must remove $\varepsilon n$ edges from $G$ to make it $H$-minor free (for some small constant $\varepsilon > 0$). We give an…

With applications in distribution systems and communication networks, the minimum stretch spanning tree problem is to find a spanning tree T of a graph G such that the maximum distance in T between two adjacent vertices is minimized. The…

Enneper's wire, the image of the circle of radius $R$ under Enneper's surface, bounds exactly three minimal surfaces for $R$ between 1 and $\sqrt 3$, and these three surfaces depend continuously on $R$. The other two surfaces (besides…

A sum graph is a finite simple graph whose vertex set is labeled with distinct positive integers such that two vertices are adjacent if and only if the sum of their labels is itself another label. The spum of a graph $G$ is the minimum…

In this paper we deal with the Bin Packing Problem with Conflicts on interval graphs: given an interval graph, a nonnegative integer weight for each vertex, and a nonnegative integer B, find a partition of the vertex set of the graph into k…

We introduce a general, analytical framework to express and to approximate partial differential equations (PDEs) numerically on graphs and networks of surfaces---generalized by the term hypergraphs. To this end, we consider PDEs on…

A \emph{locally irregular graph} is a graph whose adjacent vertices have distinct degrees. We say that a graph $G$ can be decomposed into $k$ locally irregular subgraphs if its edge set may be partitioned into $k$ subsets each of which…

We prove that for any weakly convergent sequence of finite graphs with bounded vertex degrees, there exists a topological limit graphing.

One of the main problems of the theory of dynamical systems is the determination of the existence of periodic orbits of a self-map and more generally, the structure of the set of periods. Define the minimum period of a class os self-maps of…