The paper proves Rademacher's theorem for Heisenberg groups.
problem Proving Rademacher's theorem for Heisenberg groups.
method New definition of intrinsic Lipschitz graphs, extension and approximation theorems, use of Heisenberg currents and Rumin's complex.
result Rademacher's theorem for intrinsic Lipschitz graphs in Heisenberg groups.
Study shows singular set of certain graphs has codimension 1.
problem Understanding the singular set of specific graph structures.
method Proved using the area stationarity condition.
result Singular set has codimension 1.
The study shows that certain graphs are regular at boundary points.
problem Boundary regularity of anisotropic minimal Lipschitz graphs.
method Proves regularity for graphs with bounded anisotropic mean curvature and atomic energy condition.
result Regularity at boundary points with density bounded above by 1/2 + σ.
The paper proves Lipschitz regularity of graph Laplacian eigenvectors on random data clouds.
problem Analyzing the regularity of solutions to graph Laplacian equations on random data points.
method Probabilistic coupling of random walks and interpolation method for point clouds to continuum.
result Graph Laplacian eigenvectors are essentially Lipschitz with constants depending on eigenvalues.
We focus our attention on the notion of intrinsic Lipschitz graphs, inside a special class of metric spaces i.e. the Carnot groups. More precisely, we provide a characterization of locally intrinsic Lipschitz functions in Carnot groups of step 2 in terms of their intrinsic distributional gradients.
Square inscribed in a curve made of two graph functions.
problem Finding inscribed squares in curves formed by graph functions.
method Analysis of spectral invariants of Jordan Floer homology under curve perturbations.
result Existence of inscribed squares in curves with specific Lipschitz constants.
Introduces intrinsically Lipschitz graphs in metric spaces.
problem Graphs in metric spaces with Lipschitz conditions.
method Focuses on quotient maps and intrinsically Lipschitz sections.
result Compactness, Ahlfors regularity, and extension theorems.
We prove that Lipschitz intrinsic graphs in the Heisenberg groups Hn, with n>1, which are vanishing viscosity solutions of the minimal surface equation are smooth.
Lipschitz normalization boosts deep attention models, especially for graph neural networks.
problem Gradient explosion in deep graph attention networks leads to poor performance.
method Enforcing Lipschitz continuity by normalizing attention scores.
result Deep GAT models with LipschitzNorm achieve state-of-the-art results for tasks with long-range dependencies.
We show that the arc graph of Sg1 is a coarse Lipschitz retract of the free splitting complex of F2g. We also show that the arc and curve graph of Sg1 is a coarse Lipschitz retract of both the cyclic splitting graph of F2g and the maximally cyclic splitting graph of F2g.
Proves continuum limits of Lipschitz learning using Γ-convergence.
problem Semi-supervised learning with graph-based methods and continuum limits of p-Laplacian learning. method Proves continuum limits of Lipschitz learning using Γ-convergence.
result Proves Γ-convergence in the L∞-topology to the supremum norm of the gradient. Criterion for surfaces in Heisenberg group to be graphs using flat cones.
problem Characterizing surfaces in Heisenberg group as graphs.
method Using planar cones to define intrinsic rectifiability.
result Criterion for topological surfaces to be intrinsic Lipschitz graphs.
We consider the mean curvature flow of entire Lagrangian graphs with Lipschitz continuous initial data. Assuming only a certain bound on the Lipschitz norm of an initial entire Lagrangian graph in R2n, we show that the parabolic equation \eqref{PMA} for the Lagrangian potential has a longtime solution which is sm…
The paper studies maps in the Heisenberg group and their images, called Rickman rugs.
problem Understanding maps and their images in the Heisenberg group.
method Analyzes maps f:WoH, where H is the first Heisenberg group and W is a vertical subgroup. result Rickman rugs in the Heisenberg group admit a corona decomposition by intrinsic bilipschitz graphs.
The paper studies properties of intrinsically Lipschitz constants in metric spaces.
problem Investigating properties of intrinsically Lipschitz constants.
method Introduced Leibniz and product formulas for intrinsic slope.
result Formulated Leibniz and product formulas for intrinsic slope.
Almost perimeter-minimizing boundaries in plentiful groups can be approximated by Lipschitz graphs.
problem Regularity of boundaries in plentiful groups.
method Lipschitz approximation of boundaries.
result Boundary of almost minimizers can be approximated by intrinsic Lipschitz graphs.
Study maps in semidirect products of groups, proving Lipschitz properties without intrinsic dilations.
problem Proving Lipschitz conditions in semidirect products of groups without intrinsic dilations.
method Using equivalent conditions and properties of projection maps in metric spaces.
result Proves the same Lipschitz results as in Carnot groups, without intrinsic dilations.
In this paper we provide a characterization of intrinsic Lipschitz graphs in the sub-Riemannian Heisenberg groups in terms of their distributional gradients. Moreover, we prove the equivalence of different notions of continuous weak solutions to the equation φ_y+ [φ^{2}/2]_t=w, where w is a bounded function depending o…
We prove that, in the first Heisenberg group H, an entire locally Lipschitz intrinsic graph admitting vanishing first variation of its sub-Riemannian area and non-negative second variation must be an intrinsic plane, i.e., a coset of a two dimensional subgroup of H. Moreover two examples are given…
Unified framework for analyzing graph neural operators converging to graph limits.
problem Analyzing convergence of graph neural operators to graph limits.
method Develops a unified spectral framework for graph neural operators under various graphon assumptions.
result Unified framework enables direct comparison of convergence rates and tradeoffs.
Graph-based framework for provably robust adversarial training.
problem Adversarial robustness of machine learning models.
method Formulates adversarial robustness as loss minimization with a Lipschitz constraint, using graph-based discretization and primal-dual algorithms.
result Establishes a connection between elliptic operators and adversarial learning, and proves fundamental lower bounds on adversarial sensitivity.
We study continuous maps between differential manifolds from a microlocal point of view. In particular, we characterize the Lipschitz continuity of these maps in terms of the microsupport of the constant sheaf on their graph. Furthermore, we give lower and upper bounds on the microsupport of the graph of a continuous m…
A Lipschitz hypersurface is a hypersurface which locally is the graph of a Lipschitz function. A Lipschitz (or C^1) hypersurface is said to be Levi-flat if it is locally foliated by complex manifolds of complex dimension (n-1). We shall prove that there exist no Lipschitz Levi-flat hypersurfaces in CP^n with n >= 3. Ou…
Study 2D spaces with curvature, finding a graph structure.
problem Understanding the geometry of 2D spaces with curvature constraints.
method Analyzing spaces as unions of disks, identifying singular points.
result Obtained a graph structure of topological singular points.
The study proves surfaces in a specific Heisenberg group must be simple planes.
problem Characterizing surfaces in a sub-Finsler Heisenberg group.
method Analyzes (X,Y)-Lipschitz surfaces in H1 with a sub-Finsler structure. result Complete, oriented, stable (X,Y)-Lipschitz surfaces are vertical planes. Method approximates Lipschitz domains with smoother shapes.
problem Approximating bounded Lipschitz domains.
method Sequence of smooth, bounded domains with weak curvatures.
result Uniform isocapacitary estimates for approximating sets.
The paper studies harmonic graphs in the Heisenberg group and their properties.
problem No analogous theorem exists for H-minimal surfaces in the Heisenberg group. method Introduced intrinsic Dirichlet energy and studied its critical points (contact harmonic graphs).
result Calibration condition and construction of energy-minimizing graphs with various singularities.
Complex analytic sets' Lipschitz geometry at infinity characterized.
problem Characterize entire complex analytic sets based on their Lipschitz geometry at infinity.
method Proved a complex non-parametric version of Moser's Bernstein Theorem and characterized algebraicity.
result Entire complex analytic sets at infinity are affine linear subspaces if and only if they are bi-Lipschitz homeomorphic to algebraic sets.
We consider immersions admitting uniform representations as an L-Lipschitz graph. In codimension 1, we show compactness for such immersions for arbitrary fixed finite L and uniformly bounded volume. The same result is shown in arbitrary codimension for L less than or equal to 1/4.
Paper introduces a new metric to select optimal Graph Shift Operator for GNNs.
problem Empirical selection of Graph Shift Operator remains challenging.
method Introduces a novel alignment gain metric connecting geometric distortion to generalization bounds via spectral proxy.
result Provides a principled, computation-efficient criterion to rank and select optimal GSO.
The paper classifies capillary graphs on manifolds with Ricci lower bounds.
problem Understanding capillary graphs on manifolds with Ricci lower bounds.
method Gradient estimate for positive CMC graphs on manifolds with Ricci lower bounds.
result Classification of capillary graphs over specific domains.
Generative model controls heterophily in graph signals.
problem Controlling heterophily in graph signals for better model effectiveness.
method Combines graphon-based generator with spectral filtering of Gaussian node features.
result Establishes theoretical guarantees for heterophily control and convergence.
We introduce a topological invariant, it a type of a graph-manifold, which takes natural values. For a 4-dimensional graph-manifold, whose type does not exceed two, it is proved that its universal cover is bi-Lipschitz equivalent to a universal cover of an orthogonal graph-manifold (for any Riemannian metrics on graph-…
Given an iterated function system (IFS) of contractive similitudes, the theory of Gromov hyperbolic graph on the IFS has been established recently. In the paper, we introduce a notion of simple augmented tree which is a Gromov hyperbolic graph. By generalizing a combinatorial device of rearrangeable matrix, we show tha…
Maps in Carnot groups are equivalent to solutions of a PDE system.
problem Understanding maps in Carnot groups of step 2.
method Equivalence between intrinsic Lipschitz maps and solutions to a PDE system.
result Intrinsic Lipschitz maps are equivalent to weak solutions of a PDE system.
We present sufficient conditions for the cohomology of a closed aspherical manifold to be proper Lipschitz in sense of Connes-Gromov-Moscovici [CGM]. The conditions are stated in terms of the Stone-Čech compactification of the universal cover of a manifold. We show that these conditions are formally weaker than the suf…
We prove that the linearly controlled asymptotic dimension of the fundamental group of any 3-dimensional graph-manifold does not exceed 7. As applications we obtain that the universal cover of such a graph-manifold is an absolute Lipschitz retract and it admits a quasisymmetric embedding into the product of 8 metric tr…
The paper examines vertical curves and fibers in the Heisenberg group, proving properties and constructing counterexamples.
problem Characterizing and measuring vertical curves and fibers in the Heisenberg group.
method Metric analysis of vertical curves and fibers of maps from the Heisenberg group to the plane.
result Vertical curves in the Heisenberg group can have Hausdorff dimensions strictly larger or smaller than 2, unlike intrinsic Lipschitz graphs.
Study on curvature equation in Heisenberg group with convex boundary.
problem Existence of solutions to prescribed mean curvature equation in sub-Finsler Heisenberg group.
method Finsler approximation scheme to prove existence of Lipschitz solutions.
result Existence of a Lipschitz solution for the Dirichlet problem.
Let S be a compact surface, and M be the double of a handlebody. Given a homotopy class of maps from S to M inducing an isomorphism of fundamental groups, we describe a canonical uniformly lipschitz retraction of the sphere graph of M to the arc graph of S. We also show that this retraction is a uniformly bounded dista…
The study examines stationary integral varifolds near multiplicity 2 planes, proving regularity under specific conditions.
problem Understanding the structure of stationary integral varifolds near multiplicity 2 planes.
method Investigates the structure of varifolds close to planes with multiplicity 2, proving an ε-regularity theorem under certain conditions.
result In B1/2(0), V is represented by the graph of a Lipschitz 2-valued function over P0 with small Lipschitz constant; all tangent cones at singular points are unique and comprised of stationary unions of 4 half-planes. Study shows stable graphs in Heisenberg group are essentially planes.
problem Characterizing stable graphs in the Heisenberg group.
method Analyzes Sobolev intrinsic graphs in the Heisenberg group with sub-Riemannian area stability.
result Stable graphs are cosets of two-dimensional subgroups.
In this paper we consider a set E⊂Ω with prescribed mean curvature f∈C(Ω) and Euclidean Lipschitz boundary ∂E=Σ inside a three-dimensional contact sub-Riemannian manifold M. We prove that if Σ is locally a regular intrinsic graph, the characteristic curves are of class C2. The result is sh…
New estimates for nodal and singular sets of parabolic inequalities.
problem Understanding the structure of nodal and singular sets in parabolic inequalities.
method Establishing new estimates for the size and structure of nodal and singular sets using parabolic Lipschitz coefficients.
result Almost all nodal and singular sets are covered by regular parabolic Lipschitz graphs with estimates.
Graphs with bounded anisotropic mean curvature are regular almost everywhere.
problem Understanding the regularity of graphs with anisotropic mean curvature.
method Proving regularity for m-dimensional Lipschitz graphs with anisotropic mean curvature bounded in Lp. result Graphs with bounded anisotropic mean curvature are regular almost everywhere.
In this paper we show that two Lagrangian graphs over the torus in Cn with large Lagrangian phase can be connected via Lipschitz continuous geodesic with respect to the L2 metric on the space of Lagrangian submanifolds. In particular, the geodesic for Lagrangian graphs over the torus in Cn ca…
We show the existence of a global unique and analytic solution for the mean curvature flow, the surface diffusion flow and the Willmore flow of entire graphs for Lipschitz initial data with small Lipschitz norm. We also show the existence of a global unique and analytic solution to the Ricci-DeTurck flow on euclidean s…
Develops new strategy for Hessian estimates in Lagrangian mean curvature equation.
problem Interior Hessian estimates for solutions with prescribed Lipschitz phases.
method Allard-type regularity theorem, geometric measure theory, geometry of Lagrangian graphs, De Giorgi-Nash-Moser iteration.
result Sharp interior Hessian estimates for solutions with critical and supercritical phases.