English
Related papers

Related papers: Strong approximation in h-mass of rectifiable curr…

200 papers

Based on Smirnov's decomposition theorem we prove that every rectifiable $1$-current $T$ with finite mass $\mathbb{M}(T)$ and finite mass $\mathbb{M}(\partial T)$ of its boundary $\partial T$ can be approximated in mass by a sequence of…

Functional Analysis · Mathematics 2018-10-22 Andrea Marchese , Benedikt Wirth

In this note we prove an explicit formula for the lower semicontinuous envelope of some functionals defined on real polyhedral chains. More precisely, denoting by $H \colon \mathbb{R} \to \left[ 0,\infty \right)$ an even, subadditive, and…

Analysis of PDEs · Mathematics 2017-09-05 Maria Colombo , Antonio De Rosa , Andrea Marchese , Salvatore Stuvard

We show that a $2k$-current $T$ on a complex manifold is a real holomorphic $k$-chain if and only if $T$ is locally real rectifiable, $d$-closed and has $\mathcal{H}^{2k}$-locally finite support. This result is applied to study homology…

Differential Geometry · Mathematics 2020-02-13 Jyh-Haur Teh , Chin-Jui Yang

A comprehensive study of one-dimensional metric currents and their relationship to the geometry of metric spaces is presented. We resolve the one-dimensional flat chain conjecture in this general setting, by proving that its validity is…

Analysis of PDEs · Mathematics 2025-08-12 Adolfo Arroyo-Rabasa , Guy Bouchitté

In the present paper, we prove that the convergence of rectifiable chains in flat norm implies the weak convergence of associated rectifiable varifolds if the limit flat chain is rectifiable and the mass converges also to the mass of limit…

Classical Analysis and ODEs · Mathematics 2021-05-24 Chunyan Liu , Yangqin Fang , Ning Zhang

We prove (without using Federer's structure theorem) that a finite-mass flat chain over any coefficient group is rectifiable if and only if almost all of its 0-dimensional slices are rectifiable. This implies that every flat chain of finite…

Classical Analysis and ODEs · Mathematics 2016-09-07 Brian White

Let $H$ be a fixed graph. The $H$-Transversal problem, given a graph $G$, asks to remove the smallest number of vertices from $G$ so that $G$ does not contain $H$ as a subgraph. While a simple $|V(H)|$-approximation algorithm exists and is…

Computational Complexity · Computer Science 2021-12-06 Euiwoong Lee , Pengxiang Wang

The persistent homology transform (PHT) of a subset $M \subset \mathbb{R}^d$ is a map $\text{PHT}(M):\mathbb{S}^{d-1} \to \mathbf{Dgm}$ from the unit sphere to the space of persistence diagrams. This map assigns to each direction $v\in…

Algebraic Topology · Mathematics 2025-07-31 Shreya Arya , Justin Curry

We study some fundamental properties of real rectifiable currents and give a generalization of King's theorem in characterizing currents defined by positive real holomorphic chains. Our proof uses Siu's semicontinuity theorem and largely…

Differential Geometry · Mathematics 2021-01-01 Jyh-Haur Teh , Chin-Jui Yang

We consider a class of Hermitian Hamiltonians with position-dependent mass $H=((m^alpha)p(m^beta)p(m^alpha))/2+\V$ with $2(alpha)+\beta=-1$. We apply these Hamiltonians to different piecewise flat potentials and masses (step, barrier, well…

Quantum Physics · Physics 2008-04-24 Liès Dekar

We consider the convergence of a continuous-time Markov chain approximation X^h, h>0, to an R^d-valued Levy process X. The state space of X^h is an equidistant lattice and its Q-matrix is chosen to approximate the generator of X. In…

Probability · Mathematics 2014-07-02 Aleksandar Mijatović , Matija Vidmar , Saul Jacka

Let M be an almost Hermitian manifold of dimension greater or equal to 6. The following theorems are proved: Theorem 1. If M is of pointwise constant {\theta}-holomorphic sectional curvature for a number {\theta} in (0,{\pi}/2) then M is of…

Differential Geometry · Mathematics 2010-09-15 Ognian Kassabov

Let $X$ be a compact K\"ahler manifold and $\theta$ a smooth closed $(1,1)$-real form representing a big cohomology class $\alpha \in H^{1,1}(X,\R)$. The purpose of this note is to show, using pluripotential and viscosity techniques, that…

Complex Variables · Mathematics 2013-11-13 Philippe Eyssidieux , Vincent Guedj , Ahmed Zeriahi

In this paper we start a detailed study of a new notion of rectifiability in Carnot groups: we say that a Radon measure is $\mathscr{P}_h$-rectifiable, for $h\in\mathbb N$, if it has positive $h$-lower density and finite $h$-upper density…

Metric Geometry · Mathematics 2022-02-28 Gioacchino Antonelli , Andrea Merlo

Let $P$ be a finite simplicial comple with underlying space (union of simplices in $P$) $|P|$. Let $Q$ be a subcomplex of $P$. Let $a \geq 0$. Then there exists $K < \infty$, \emph{depending only on $a$ and $Q$,} with the following…

General Topology · Mathematics 2015-03-17 Steven P. Ellis

We adapt to an infinite dimensional ambient space E.R. Reifenberg's epiperimetric inequality and a quantitative version of D. Preiss' second moments computations to establish that the set of regular points of an almost mass minimizing…

Differential Geometry · Mathematics 2020-01-23 Thierry De Pauw , Roger Züst

Parameterized Inapproximability Hypothesis (PIH) is a central question in the field of parameterized complexity. PIH asserts that given as input a 2-CSP on $k$ variables and alphabet size $n$, it is W[1]-hard parameterized by $k$ to…

Computational Complexity · Computer Science 2024-07-15 Karthik C. S. , Euiwoong Lee , Pasin Manurangsi

Consider a semiclassical Hamiltonian \begin{equation*} H_{V, h} := h^{2} \Delta + V - E \end{equation*} where $h > 0$ is a semiclassical parameter, $\Delta$ is the positive Laplacian on $\mathbb{R}^{d}$, $V$ is a smooth, compactly supported…

Analysis of PDEs · Mathematics 2015-02-25 Kiril Datchev , Jesse Gell-Redman , Andrew Hassell , Peter Humphries

We consider finite element approximations to the optimal constant for the Hardy inequality with exponent $p=2$ in bounded domains of dimension $n=1$ or $n \geq 3$. For finite element spaces of piecewise linear and continuous functions on a…

We study two computational problems, parameterised by a fixed tree H. #HomsTo(H) is the problem of counting homomorphisms from an input graph G to H. #WHomsTo(H) is the problem of counting weighted homomorphisms to H, given an input graph G…

Computational Complexity · Computer Science 2014-06-16 Leslie Ann Goldberg , Mark Jerrum
‹ Prev 1 2 3 10 Next ›