Search arXivSearch

arXiv · 1408.7093

A monotonicity formula for minimal sets with a sliding boundary condition

Abstract

We prove a monotonicity formula for minimal or almost minimal sets for the Hausdorff measure $\cal{H}^d$, subject to a sliding boundary constraint where competitors for $E$ are obtained by deforming $E$ by a one-parameter family of functions $φ_t$ such that $φ_t(x) \in L$ when $x\in E$ lies on the boundary $L$. In the simple case when $L$ is an affine subspace of dimension $d-1$, the monotone or almost monotone functional is given by $F(r) = r^{-d} \cal{H}^d(E \cap B(x,r)) + r^{-d} \cal{H}^d(S \cap B(x,r))$, where $x$ is any point of $E$ (not necessarily on $L$) and $S$ is the shade of $L$ with a light at $x$. We then use this, the description of the case when $F$ is constant, and a limiting argument, to give a rough description of $E$ near $L$ in two simple cases. ----- On donne une formule de monotonie pour des ensembles minimaux ou presque minimaux pour la mesure de Hausdorff $\cal{H}^d$, avec une condition de bord où les compétiteurs de $E$ sont obtenus en déformant $E$ par une famille à un paramètre de fonctions $φ_t$ telles que $φ_t(x)\in L$ quand $x\in E$ se trouve sur la frontière $L$. Dans le cas simple où $L$ est un sous-espace affine de dimension $d-1$, la fonctionelle monotone ou presque monotone est donnée par $F(r) = r^{-d} \cal{H}^d(E \cap B(x,r)) + r^{-d} \cal{H}^d(S \cap B(x,r))$, où $x$ est un point de $E$, pas forcément dans $L$, et $S$ est l'ombre de $L$, éclairée depuis $x$. On utilise ceci, la description des cas où $F$ est constante, et un argument de limite, pour donner une description de $E$ près de $L$ dans deux cas simples.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Guy David. 2014-08-29. A monotonicity formula for minimal sets with a sliding boundary condition. https://arxiv.org/abs/1408.7093

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Fragment-wise differentiable structures

The $p$-modulus of curves, test plans, upper gradients, charts, differentials, approximations in energy and density of directions are all concepts associated to the theory of Sobolev functions in metric measure spaces. The purpose of this paper is to give an analogous geometric and ``fragment-wise'' theory for Lipschitz functions and Weaver derivations, where $\infty$-modulus of curve fragments, $\ast$-upper gradients and Alberti representations play a central role. We give a new definition of fragment-wise charts and prove that they exists for spaces with finite Hausdorff dimension. We give a replacement for $p$-duality in terms of Alberti representations and $\infty$-modulus and present the theory of $\ast$-upper gradients. Further, we give new and sharper results for approximations of Lipschitz functions, which yields the density of directions. Our results are applicable to all complete and separable metric measure spaces. In the process, we show that there are strong parallels between the Sobolev and Lipschitz worlds.

math.CA

Tensor Derivatives, Unified Tensor-Form Differential Equations, and Model Reduction via Partial Tucker Decomposition

This paper develops a unified tensor calculus for matrix-valued functions and their derivatives, and leverages this framework to construct efficient model reduction techniques for high-dimensional tensor differential equations. We first establish a systematic theory of tensor differentiation, wherein the derivative of a matrix with respect to another matrix is represented as a fourth-order tensor. Building on this calculus, we recast linear ordinary differential equations (ODEs) and partial differential equations(PDEs) into a compact tensor-matrix form $\frac{dX}{dt} = \A\ast X$. The general solution is expressed as $X = \exp(t\A)\ast C$, extending the matrix exponential to the tensor setting. Conditions under which the solution admits this exponential form are characterized in terms of the commutativity of the associated matrix slices. We introduce the partial Tucker decomposition (parTuckerD) to address the computational challenges posed by high-order tensor systems. On a synthetic electronic health record (EHR) tensor, parTuckerD achieves a relative reconstruction error of $0.0992$ with a $136.3\times$ compression ratio, matching the accuracy of the full TuckerD while preserving patient-level similarity structure. The results demonstrate that the proposed tensor calculus and parTuckerD framework provide a principle and computationally efficient approach for analyzing and solving high-dimensional tensor differential equations arising in data-intensive applications.

math.CA

Distance preservers for Lobachevsky space

We obtain a complete description of the class of entrywise preservers of Lorentz-Gram matrices. This resolves, for the case of constant negative curvature, the classification of entrywise preservers obtained by Schoenberg in the zero-curvature (Euclidean) and constant-positive-curvature (spherical) settings. These preservers admit a Lévy--Khintchine-type representation and their asymptotic characteristics are related to Krein's classification of screw lines in Lobachevsky space. Connections with complete Nevanlinna--Pick kernels and Bochner subordination are also obtained.

math.CA