相关论文: Optimal Regularity for H\"older continuous Hamilto…

We establish the optimal $C_{H}^{1,1}$ interior regularity of solutions to \[ \Delta_{H}u=f\chi_{\{u\ne0\}}, \] where $\Delta_{H}$ denotes the sub-Laplacian operator in a stratified group. We assume the weakest regularity condition on $f$,…

In this note, we study the emergence of Hamiltonian Berge cycles in random $r$-uniform hypergraphs. For $r\geq 3$, we prove an optimal stopping-time result that if edges are sequently added to an initially empty $r$-graph, then as soon as…

We revisit the classical theory of linear second-order uniformly elliptic equations in divergence form whose solutions have H\"older continuous gradients, and prove versions of the generalized maximum principle, the $C^{1,\alpha}$-estimate,…

In this work, we tackle the higher regularity estimates of solutions to inhomogeneous $\infty-$Laplacian equations at interior critical points. Our estimates provide smoothness properties better than the corresponding available regularity…

We develop an optimal regularity theory for $L^p$-viscosity solutions of fully nonlinear uniformly elliptic equations in nondivergence form whose gradient growth is described through a Hamiltonian function with measurable and possibly…

Let $(X,\alpha)$ be a K\"ahler manifold of dimension n, and let $[\omega] \in H^{1,1}(X,\mathbb{R})$. We study the problem of specifying the Lagrangian phase of $\omega$ with respect to $\alpha$, which is described by the nonlinear elliptic…

In 1999, Katona and Kierstead conjectured that if a $k$-uniform hypergraph $\cal H$ on $n$ vertices has minimum co-degree $\lfloor \frac{n-k+3}{2}\rfloor$, i.e., each set of $k-1$ vertices is contained in at least $\lfloor…

In this paper we shall establish some regularity results of solutions of a class of fully nonlinear equations, with a first order term which is sub-linear. We prove local H\"older regularity of the gradient both in the interior and up to…

We prove the H\"older continuity of the solution to complex Hessian equation with the right hand side in $L^p$, $p>\frac{n}{m}$, $1< m< n$, in a $m$-strongly pseudoconvex domain in $\mathbb{C}^n$ under some additional conditions on the…

According to the Arnold conjectures and Floer's proofs, there are non-trivial lower bounds for the number of periodic solutions of Hamiltonian differential equations on a closed symplectic manifold whose symplectic form vanishes on spheres.…

Let $H\subset \R^{d+1}$ be a compact, convex, analytic hypersurface of finite type with a smooth measure $\sigma $ on $H$. Let $\kappa$ denote the Gaussian curvature on $H$. We consider the oscillatory integral $(\kappa^{1/2}…

A graph $G$ is $k$-edge-Hamiltonian if any collection of vertex-disjoint paths with at most $k$ edges altogether belong to a Hamiltonian cycle in $G$. A graph $G$ is $k$-Hamiltonian if for all $S\subseteq V(G)$ with $|S|\le k$, the subgraph…

Frankl and F\"uredi conjectured in 1989 that the maximum Lagrangian of all $r$-uniform hypergraphs of fixed size $m$ is realised by the initial segment of the colexicographic order. In particular, in the principal case $m=\binom{t}{r}$…

An oriented graph is an orientation of a simple graph. In 2009, Keevash, K\"{u}hn and Osthus proved that every sufficiently large oriented graph $D$ of order $n$ with $(3n-4)/8$ is Hamiltonian. Later, Kelly, K\"{u}hn and Osthus showed that…

In a sequence of four papers, we prove the following results (via a unified approach) for all sufficiently large $n$: (i) [1-factorization conjecture] Suppose that $n$ is even and $D \geq 2\lceil n/4\rceil -1$. Then every $D$-regular graph…

We present a new approach to showing that random graphs are nearly optimal expanders. This approach is based on recent deep results in combinatorial group theory. It applies to both regular and irregular random graphs. Let G be a random…

We develop a method for proving sup-norm and H\"older estimates for $\overline{\partial}$ on wide class of finite type pseudoconvex domains in $\mathbb{C}^n$. A fundamental obstruction to proving sup-norm estimates is the possibility of…

The toughness of a noncomplete graph $G$ is the maximum real number $t$ such that the ratio of $|S|$ to the number of components of $G-S$ is at least $t$ for every cutset $S$ of $G$, and the toughness of a complete graph is defined to be…

This paper is the third of a series on Hamiltonian stationary Lagrangian surfaces. We present here the most general theory, valid for any Hermitian symmetric target space. Using well-chosen moving frame formalism, we show that the equations…

Is detecting a $k$-clique in $k$-partite regular (hyper-)graphs as hard as in the general case? Intuition suggests yes, but proving this -- especially for hypergraphs -- poses notable challenges. Concretely, we consider a strong notion of…