Related papers: Plateau's Problem for intrinsic graphs in the Heis…
We solve the classical Dirichlet problem for a general complex Hessian equation on a small ball in $\bC^n$. Then, we show that there is a continuous solution, in pluripotential theory sense, to the Dirichlet problem on compact Hermitian…
We construct a one-parameter family of properly embedded minimal annuli in the Heisenberg group Nil_3 endowed with a left-invariant Riemannian metric. These annuli are not rotationally invariant. This family gives a vertical half-space…
For an $n$-vertex graph $G$, let $h(G)$ denote the smallest size of a subset of $V(G)$ such that it intersects every maximum independent set of $G$. A conjecture posed by Bollob\'{a}s, Erd\H{o}s and Tuza in early 90s remains widely open,…
We consider submanifolds of sub-Riemannian Carnot groups with intrinsic $C^1$ regularity ($C^1_H$). Our first main result is an area formula for $C^1_H$ intrinsic graphs; as an application, we deduce density properties for Hausdorff…
We generalize Meeks and Yau's embeddedness result on the solutions of the Plateau problem to the constant mean curvature disks. We show that any minimizing H-disk in an H_0-convex domain is embedded for any H in [0,H_0). In particular, for…
Let H be a Tonelli Hamiltonian defined on the cotangent bundle of a compact and connected manifold and let u be a semi-concave function defined on M. If E (u) is the set of all the super-differentials of u and (\phi t) the Hamiltonian flow…
This survey paper deals with upper and lower bounds on the number of $k$-matchings in regular graphs on $N$ vertices. For the upper bounds we recall the upper matching conjecture which is known to hold for perfect matchings. For the lower…
We prove local boundedness for a quasilinear parabolic equation on the Heisenberg group \[ \partial_t u(\xi,t) + \text{p.v.}\int_{\mathbb{H}^N} \frac{|u(\xi,t)-u(\eta,t)|^{p-2}(u(\xi,t)-u(\eta,t))}{|\eta^{-1}\circ \xi|^{Q+sp}} \,d\eta = 0,…
We study some convergence issues for a recent approach to the problem of transparent boundary conditions for the Helmholtz equation in unbounded domains. The approach is based on the minimization on an integral functional which arises from…
We present an approximation scheme for minimizing certain Quadratic Integer Programming problems with positive semidefinite objective functions and global linear constraints. This framework includes well known graph problems such as Minimum…
We prove that the combinatorial optimization problem of determining the hull number of a partial cube is NP-complete. This makes partial cubes the minimal graph class for which NP-completeness of this problem is known and improves some…
Partition problems in graphs are extremely important in applications, as shown in the Data science and Machine learning literature. One approach is spectral partitioning based on a Fiedler vector, i.e., an eigenvector corresponding to the…
Two boundary value problems for the Helmholtz equation in a semi-infinite strip are considered. The main feature of these problems is that, in addition to the function and its normal derivative on the boundary, the functionals of the…
Immersion minor is an important variant of graph minor, defined through an injective mapping from vertices in a smaller graph $H$ to vertices in a larger graph $G$ where adjacent elements of the former are connected in the latter by…
We study a class of semilinear free boundary problems in which admissible functions $u$ have a topological constraint, or spanning condition, on their 1-level set. This constraint forces $\{u=1\}$, which is the free boundary, to behave like…
Let $X$ be a compact connected strongly pseudoconvex $CR$ manifold of real dimension 2n-1 in $\mathbb{C}^{N}$. It has been an interesting question to find an intrinsic smoothness criteria for the complex Plateau problem. For $n\ge 3$ and…
We establish a complete theory of the flag Hardy space on the Heisenberg group $\mathbb H^{n}$ with characterisations via atomic decompositions, area functions, square functions, maximal functions and singular integrals. We introduce…
This paper consists of two halves. In the first half of the paper, we consider real-valued functions $f$ whose domain is the vertex set of a graph $G$ and that are Lipschitz with respect to the graph distance. By placing a uniform…
We present an approximation scheme for optimizing certain Quadratic Integer Programming problems with positive semidefinite objective functions and global linear constraints. This framework includes well known graph problems such as Minimum…
In this article, we extend the framework developed in \cite{unbounded_domain_cadiot} to allow for rigorous proofs of existence of smooth, localized solutions in semi-linear partial differential equations possessing both space and non-space…