English
Related papers

Related papers: The Maximal Graph Dirichlet Problem in Semi-Euclid…

200 papers

A bipartite graph $G$ is semi-algebraic in $\mathbb{R}^d$ if its vertices are represented by point sets $P,Q \subset \mathbb{R}^d$ and its edges are defined as pairs of points $(p,q) \in P\times Q$ that satisfy a Boolean combination of a…

Combinatorics · Mathematics 2015-11-24 Jacob Fox , János Pach , Adam Sheffer , Andrew Suk , Joshua Zahl

Let $G$ be a graph, and $H$ be a finite subgraph of $G$. We say that $H$ is a (semi) $S$-Eulerian subgraph if there exists a closed (open) trail $T$ in $G$ such that each edge of $H$ appears in $T$. We show that the problem of determining…

Combinatorics · Mathematics 2026-02-18 Marcin Stawiski

Packing problems in discrete geometry can be modeled as finding independent sets in infinite graphs where one is interested in independent sets which are as large as possible. For finite graphs one popular way to compute upper bounds for…

Optimization and Control · Mathematics 2021-08-26 David de Laat , Frank Vallentin

A set of vertices $S$ \emph{resolves} a connected graph $G$ if every vertex is uniquely determined by its vector of distances to the vertices in $S$. The \emph{metric dimension} of $G$ is the minimum cardinality of a resolving set of $G$.…

Combinatorics · Mathematics 2012-05-21 Carmen Hernando , Merce Mora , Ignacio M. Pelayo , Carlos Seara , David R. Wood

We study linear and algebraic structures in sets of Dirichlet series with maximal Bohr's strip. More precisely, we consider a set $\mathscr M$ of Dirichlet series which are uniformly continuous on the right half plane and whose strip of…

Functional Analysis · Mathematics 2021-09-30 Thiago R. Alves , Leonardo Brito , Daniel Carando

We are concerned with the Dirichlet problem for a class of Hessian type equations. Applying some new methods we are able to establish the $C^2$ estimates for an approximating problem under essentially optimal structure conditions. Based on…

Analysis of PDEs · Mathematics 2016-05-06 Heming Jiao , Tingting Wang

Let $\mathcal{F}$ denote a set of graphs. A graph $G$ is said to be $\mathcal{F}$-free if it does not contain any element of $\mathcal{F}$ as a subgraph. The Tur\'an number is the maximum possible number of edges in an $\mathcal{F}$-free…

Combinatorics · Mathematics 2023-02-01 Shuchao Li , Wanting Sun , Wei Wei

In this paper, we obtain an Ecker-Huisken type result for entire graphs with parallel mean curvature.

Differential Geometry · Mathematics 2009-11-13 Yuxin Dong

We study the Dirichlet problem of the following discrete infinity Laplace equation on a subgraph with finite width $$\Delta_{\infty} u(x) = \inf_{y \sim x}u(y)+\sup_{y \sim x}u(y)-2u(x) = f(x).$$ We say that a subgraph has finite width if…

Analysis of PDEs · Mathematics 2023-11-06 Fengwen Han , Tao Wang

We establish uniform a-priori estimates for solutions of the semilinear Dirichlet problem \begin{equation} \begin{cases} (-\Delta)^m u=h(x,u)\quad&\mbox{in }\Omega,\\ u=\partial_nu=\cdots=\partial_n^{m-1}u=0\quad&\mbox{on }\partial\Omega,…

Analysis of PDEs · Mathematics 2025-07-23 Gabriele Mancini , Giulio Romani

We prove that any piece of a rotational hypersurface with prescribed mean curvature function in a Euclidean space can be uniquely extended infinitely, which generalizes the results by Euler and Delaunay for surfaces of revolution with…

Differential Geometry · Mathematics 2013-07-12 Katsuei Kenmotsu , Takeyuki Nagasawa

For arbitrary semimetric space $(X, d)$ and disjoint proximinal subsets $A$, $B$ of $X$ we define the proximinal graph as a bipartite graph with parts $A$ and $B$ whose edges $\{a, b\}$ satisfy the equality $d(a, b) = \operatorname{dist}(A,…

General Topology · Mathematics 2022-04-05 Oleksiy Dovgoshey , Ruslan Shanin

For any $\Lambda>0$, let $\mathcal{M}_{n,\Lambda}$ denote the space containing all locally Lipschitz minimal graphs of dimension $n$ and of arbitrary codimension $m$ in Euclidean space $\mathbb{R}^{n+m}$ with uniformly bounded 2-dilation…

Differential Geometry · Mathematics 2021-09-21 Qi Ding , J. Jost , Y. L. Xin

In this paper, we establish a couple of results on extremal problems in bipartite graphs. Firstly, we show that every sufficiently large bipartite graph with average degree $D$ and with $n$ vertices on each side has a balanced independent…

Combinatorics · Mathematics 2023-06-19 Debsoumya Chakraborti

We study whether the solutions of a fully nonlinear, uniformly parabolic equation with superquadratic growth in the gradient satisfy initial and homogeneous boundary conditions in the classical sense, a problem we refer to as the classical…

Analysis of PDEs · Mathematics 2017-10-31 Alexander Quaas , Andrei Rodríguez

Teichm\"uller's classical mapping problem for plane domains concerns finding a lower bound for the maximal dilatation of a quasiconformal homeomorphism which holds the boundary pointwise fixed, maps the domain onto itself, and maps a given…

Complex Variables · Mathematics 2013-04-15 Matti Vuorinen , Xiaohui Zhang

We generalize the Fenchel theorem for strong spacelike closed curves of index $1$ in the 3-dimensional Minkowski space, showing that the total curvature must be less than or equal to $2\pi$. Here strong spacelike means that the tangent…

Differential Geometry · Mathematics 2016-03-28 Nan Ye , Xiang Ma

We prove that a hemisphere in the Euclidean space $R^{n+1}$, viewed as the graph of a function, admits no smooth perturbations as graphs with mean curvature $H\ge 1$ whose boundary equator is fixed up to $C^2$. This is an extension of the…

Differential Geometry · Mathematics 2022-02-22 Shibing Chen , Xiang Ma , Shengyang Wang

We investigate the validity of the Liouville property for a class of elliptic equations with a potential, posed on infinite graphs. Under suitable assumptions on the graph and on the potential, we prove that the unique bounded solution is…

Analysis of PDEs · Mathematics 2023-04-04 Stefano Biagi , Giulia Meglioli , Fabio Punzo

Spectral graph bisections are a popular heuristic aimed at approximating the solution of the NP-complete graph bisection problem. This technique, however, does not always provide a robust tool for graph partitioning. Using a special class…

Numerical Analysis · Mathematics 2015-12-22 John C. Urschel , Ludmil T. Zikatanov
‹ Prev 1 8 9 10 Next ›