中文
相关论文

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

200 篇论文

The distant graph $G = G(\mathbb{P}(Z),\triangle)$ of the projective line over the ring of integers is considered. The shortest path problem in this graph is solved by use of Klein's geometric interpretation of Euclidean continued…

组合数学 · 数学 2015-12-02 Andrzej Matraś , Artur Siemaszko

We prove an analogue for a one-phase free boundary problem of the classical gradient bound for solutions to the minimal surface equation. It follows, in particular, that every energy-minimizing free boundary that is a graph is also smooth.…

偏微分方程分析 · 数学 2010-09-24 Daniela De Silva , David Jerison

The spectral radius of a graph is the largest eigenvalue of its adjacency matrix. A minimizer graph is such that minimizes the spectral radius among all connected graphs on $n$ vertices with diameter $d$. The minimizer graphs are known for…

谱理论 · 数学 2014-05-21 Jingfen Lan , Lingsheng Shi

A family of graphs $\mathcal{F}$ is $H$-intersecting if the edge intersection of any two graphs in $\mathcal{F}$ contains a copy of a fixed graph $H$. A fundamental problem is to determine the maximum size of such a family. The trivial…

组合数学 · 数学 2025-11-25 Paul Hamrick , Gary Hu

We consider relations between the size, treewidth, and local crossing number (maximum number of crossings per edge) of graphs embedded on topological surfaces. We show that an $n$-vertex graph embedded on a surface of genus $g$ with at most…

组合数学 · 数学 2017-07-18 Vida Dujmović , David Eppstein , David R. Wood

We consider the family of graphs whose vertex set is Z^k where two vertices are connected by an edge when their l\infty-distance is 1. We prove the optimal vertex isoperimetric inequality for this family of graphs. That is, given a positive…

组合数学 · 数学 2012-02-21 Ellen Veomett , A. J. Radcliffe

We consider the minimal number of points on a regular grid on the plane that generates $n$ line segments of points of exactly length $k$. We illustrate how this is related to the $n$-queens problem on the toroidal chessboard and show that…

组合数学 · 数学 2023-03-31 Chai Wah Wu

We associate curves of isotropic, Lagrangian and coisotropic subspaces to higher order, one parameter variational problems. Minimality and conjugacy properties of extremals are described in terms of these curves.

辛几何 · 数学 2015-10-12 C. Durán , D. Otero

We give a lower bound for the Gaussian curvature of convex level sets of minimal graphs and the solutions to semilinear elliptic equations with the norm of boundary gradient and the Gaussian curvature of the boundary.

偏微分方程分析 · 数学 2010-03-11 Pei-He Wang , Wei Zhang

This paper is the second in a series where we attempt to give a complete description of the space of all embedded minimal surfaces of fixed genus in a fixed (but arbitrary) closed 3-manifold. The key for understanding such surfaces is to…

偏微分方程分析 · 数学 2007-05-23 Tobias H. Colding , William P. Minicozzi

We consider boundary value problems for quasilinear first-order one-dimensional hyperbolic systems in a strip. The boundary conditions are supposed to be of a smoothing type, in the sense that the $L^2$-generalized solutions to the…

偏微分方程分析 · 数学 2025-12-10 I. Kmit , L. Recke , V. Tkachenko

In \cite{CM5}, Colding and Minicozzi describe a type of compactness property possessed by sequences of embedded minimal surfaces in $\Real^3$ with finite genus and with boundaries going to $\infty$. They show that any such sequence either…

微分几何 · 数学 2009-07-06 Jacob Bernstein , Christine Breiner

Here we develop some basic analytic tools to study compactness properties of $J$-curves (i.e. pseudo-holomorphic curves) when regarded as submanifolds. Incorporating techniques from the theory of minimal surfaces, we derive an inhomogeneous…

辛几何 · 数学 2010-05-06 Joel W. Fish

A graph drawn in the plane with straight-line edges is called a geometric graph. If no path of length at most $k$ in a geometric graph $G$ is self-intersecting we call $G$ $k$-locally plane. The main result of this paper is a construction…

组合数学 · 数学 2011-11-01 Gábor Tardos

Let $G$ be a large (simple, unlabeled) dense graph on $n$ vertices. Suppose that we only know, or can estimate, the empirical distribution of the number of subgraphs $F$ that each vertex in $G$ participates in, for some fixed small graph…

信息论 · 计算机科学 2023-08-08 Shahar Stein Ioushua , Ofer Shayevitz

We establish new bounds on the minimum number of distinct eigenvalues among real symmetric matrices with nonzero off-diagonal pattern described by the edges of a graph and apply these to determine the minimum number of distinct eigenvalues…

组合数学 · 数学 2018-11-19 Beth Bjorkman , Leslie Hogben , Scarlitte Ponce , Carolyn Reinhart , Theodore Tranel

This is a very brief report on recent developments on the Dirichlet problem for the minimal surface system and minimal cones in Euclidean spaces. We shall mainly focus on two directions: (1) Further systematic developments after…

微分几何 · 数学 2019-06-20 Yongsheng Zhang

We study the problems of finding a minimum cycle basis (a minimum weight set of cycles that form a basis for the cycle space) and a minimum homology basis (a minimum weight set of cycles that generates the $1$-dimensional…

数据结构与算法 · 计算机科学 2016-07-19 Glencora Borradaile , Erin Wolf Chambers , Kyle Fox , Amir Nayyeri

We classify the distance-regular Cayley graphs with least eigenvalue $-2$ and diameter at most three. Besides sporadic examples, these comprise of the lattice graphs, certain triangular graphs, and line graphs of incidence graphs of certain…

组合数学 · 数学 2016-04-28 Alireza Abdollahi , Edwin van Dam , Mojtaba Jazaeri

We consider the Laplacian in a curved two-dimensional strip of constant width squeezed between two curves, subject to Dirichlet boundary conditions on one of the curves and variable Robin boundary conditions on the other. We prove that, for…

数学物理 · 物理学 2009-11-13 Pedro Freitas , David Krejcirik
‹ 上一页 1 8 9 10 下一页 ›