Minimal graphs over non-compact domains in 3-manifolds with a Killing vector field

Abstract Let $${\mathbb {E}}$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mi>E</mml:mi> </mml:math> be a connected and orientable Riemannian 3-manifold with a non-singular Killing vector field whose associated one-parameter group of isometries of $${\mathbb {E}}$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mi>E</mml:mi> </mml:math> acts freely and properly on $${\mathbb {E}}$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mi>E</mml:mi> </mml:math> . Then, there exists a Killing submersion from $${\mathbb {E}}$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mi>E</mml:mi> </mml:math> onto a connected and orientable surface M whose fibers are the integral curves of the Killing vector field. In this setting, assuming that M is non-compact and the fibers have infinite length, we solve the Dirichlet problem for minimal Killing graphs over certain unbounded domains of M , prescribing piecewise continuous boundary values. We obtain general Collin-Krust type estimates. In the particular case of the Heisenberg group, we prove a uniqueness result for minimal Killing graphs with bounded boundary values over a strip. We also prove that isolated singularities of Killing graphs with prescribed mean curvature are removable.

Authors

Institutions

Publication Details

Journal
Results in Mathematics
Published
2025-08-31
DOI
https://doi.org/10.1007/s00025-025-02500-8
Primary Topic
Geometric Analysis and Curvature Flows
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Minimal graphs over non-compact domains in 3-manifolds with a Killing vector field

Andrea Del Prete
Results in Mathematics
Geometric Analysis and Curvature Flows
article

Minimal graphs over non-compact domains in 3-manifolds with a Killing vector field

Andrea Del Prete
article en

Abstract

Abstract Let $${\mathbb {E}}$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mi>E</mml:mi> </mml:math> be a connected and orientable Riemannian 3-manifold with a non-singular Killing vector field whose associated one-parameter group of isometries of $${\mathbb {E}}$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mi>E</mml:mi> </mml:math> acts freely and properly on $${\mathbb {E}}$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mi>E</mml:mi> </mml:math> . Then, there exists a Killing submersion from $${\mathbb {E}}$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mi>E</mml:mi> </mml:math> onto a connected and orientable surface M whose fibers are the integral curves of the Killing vector field. In this setting, assuming that M is non-compact and the fibers have infinite length, we solve the Dirichlet problem for minimal Killing graphs over certain unbounded domains of M , prescribing piecewise continuous boundary values. We obtain general Collin-Krust type estimates. In the particular case of the Heisenberg group, we prove a uniqueness result for minimal Killing graphs with bounded boundary values over a strip. We also prove that isolated singularities of Killing graphs with prescribed mean curvature are removable.

Results in MathematicsVol. 80(6)
University of Pavia (IT)
Istituto Nazionale di Alta Matematica "Francesco Severi", Università degli Studi di Pavia, Gruppo Nazionale per le Strutture Algebriche, Geometriche e le loro Applicazioni, Agencia Estatal de Investigación
Openalex Percentile: Top 67%
Geometric Analysis and Curvature Flows
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.