English
Related papers

Related papers: Geometric criteria for $C^{1,\alpha}$ rectifiabili…

200 papers

Given a family of subsets $\mathcal S$ over a set of elements~$X$ and two integers~$p$ and~$k$, Max k-Set Cover consists of finding a subfamily~$\mathcal T \subseteq \mathcal S$ of cardinality at most~$k$, covering at least~$p$ elements…

Computational Complexity · Computer Science 2016-09-28 Edouard Bonnet , Vangelis Th. Paschos , Florian Sikora

We show that for any sufficiently large integer $Q$ and a real $0\leq\lambda\leq\frac34$ there exists a value $c(n,f,J)>0$ such that all strips $L(Q,\lambda)=\{(x,y):|y-f(x)|<Q^{-\lambda}, x\in J=[a,b]\}$ contain at least $c(n, f,…

Number Theory · Mathematics 2017-11-30 V. Bernik , F. Götze , A. Gusakova

Let $\{v_{\alpha}\}$ be a system of polynomial solutions of the parabolic equation $a_{hk}\partial_{x_{h}x_{k}}u - \partial_t u =0$ in a bounded $C^1$-cylinder $\Omega_{T}$ contained in $\mathbb{R}^{n+1}$. Here $a_{hk}\partial_{x_{h}x_{k}}$…

Analysis of PDEs · Mathematics 2026-02-18 Alberto Cialdea , Carmine Sebastiano Mare

We adapt the method of Simon [JDG '93] to prove a $C^{1,\alpha}$-regularity theorem for minimal varifolds which resemble a cone $\bf{C}_0^2$ over an equiangular geodesic net. For varifold classes admitting a "no-hole" condition on the…

Differential Geometry · Mathematics 2017-09-29 Maria Colombo , Nick Edelen , Luca Spolaor

Let $K$ be an imaginary quadratic field and let $\mathcal{O}_K$ be the ring of algebraic integers of $K$. For $\alpha \in \mathcal{O}_K$ with $|\alpha| > 1$, define \[ \mathcal{D}_\alpha = \bigcup_{n=0}^\infty…

Number Theory · Mathematics 2025-12-09 Wenxia Li , Zhiqiang Wang , Jiuzhou Zhao

We prove local $C^{1,\alpha}$ estimates of solutions for the parallel refractor and reflector problems under local assumptions on the target set $\Sigma$, and no assumptions are made on the smoothness of the densities.

Analysis of PDEs · Mathematics 2014-04-16 Cristian E. Gutierrez , Federico Tournier

We consider the classical $k$-means clustering problem in the setting bi-criteria approximation, in which an algoithm is allowed to output $\beta k > k$ clusters, and must produce a clustering with cost at most $\alpha$ times the to the…

Data Structures and Algorithms · Computer Science 2015-08-04 Konstantin Makarychev , Yury Makarychev , Maxim Sviridenko , Justin Ward

We prove $C^{2,\alpha}$ regularity of sufficiently flat free boundaries, for the thin one-phase problem in which the free boundary occurs on a lower dimensional subspace. This problem appears also as a model of a one-phase free boundary…

Analysis of PDEs · Mathematics 2011-11-11 Daniela De Silva , Ovidiu Savin

Criteria for approximability of functions by solutions of homogeneous second order elliptic equations (with constant complex coefficients) in the norms of the Whitney $C^1$-spaces on compact sets in $\mathbb R^2$ are obtained in terms of…

Classical Analysis and ODEs · Mathematics 2018-11-16 Petr V. Paramonov , Xavier Tolsa

We introduce a notion of rectifiability modeled on Carnot groups. Precisely, we say that a subset E of a Carnot group M and N is a subgroup of M, we say E is N-rectifiable if it is the Lipschitz image of a positive measure subset of N.…

Classical Analysis and ODEs · Mathematics 2007-05-23 Scott D. Pauls

Let $(G,\alpha)$ and $(H,\beta)$ be locally compact Hausdorff groupoids with Haar systems, and let $(X,\lambda)$ be a topological correspondence from $(G,\alpha)$ to $(H,\beta)$ which induce the ${C}^*$-correspondence $\mathcal{H}(X)\colon…

Operator Algebras · Mathematics 2017-09-27 Rohit Dilip Holkar

We identify necessary and sufficient conditions on $k$th order differential operators $\mathbb{A}$ in terms of a fixed halfspace $H^+\subset\mathbb{R}^n$ such that the Gagliardo--Nirenberg--Sobolev inequality $$…

Analysis of PDEs · Mathematics 2024-01-25 Franz Gmeineder , Bogdan Raiţă , Jean Van Schaftingen

By virtue of barrier arguments we prove $C^\alpha$-regularity up to the boundary for the weak solutions of a non-local nonlinear problem driven by the fractional $p$-Laplacian operator. The equation is boundedly inhomogeneous and the…

Analysis of PDEs · Mathematics 2015-10-28 Antonio Iannizzotto , Sunra Mosconi , Marco Squassina

We prove that a metric measure space $(X,d,m)$ satisfying finite dimensional lower Ricci curvature bounds and whose Sobolev space $W^{1,2}$ is Hilbert is rectifiable. That is, a $RCD^*(K,N)$-space is rectifiable, and in particular for…

Differential Geometry · Mathematics 2019-05-08 Andrea Mondino , Aaron Naber

Necessary and sufficient conditions for convexity and strong convexity, respectively, of sublevel sets that are defined by finitely many real-valued $C^{1,1}$-maps are presented. A novel characterization of strongly convex sets in terms of…

Optimization and Control · Mathematics 2017-01-03 Alexander Weber , Gunther Reissig

We provide a sufficient geometric condition for $\mathbb{R}^n$ to be countably $(\mu,m)$ rectifiable of class $\mathscr{C}^{1,\alpha}$ (using the terminology of Federer), where $\mu$ is a Radon measure having positive lower density and…

Classical Analysis and ODEs · Mathematics 2018-04-26 Sławomir Kolasiński

We study a family of hypergeometric motives $H(\alpha,\beta|t)$ attached to a pair of tuples $\alpha=(1/4,1/2,3/4)$, $\beta=(0,0,0)$. To each such motive we can attach a system of $\ell$--adic realisations with the trace of geometric…

Number Theory · Mathematics 2017-05-19 Bartosz Naskrecki

For a hyperplane $H$ supporting a convex body $C$ in the hyperbolic space $\mathbb{H}^d$ we define the width of $C$ determined by $H$ as the distance between $H$ and a most distant ultraparallel hyperplane supporting $C$. The minimum width…

Metric Geometry · Mathematics 2024-06-07 Marek Lassak

We study parameterized and approximation algorithms for a variant of Set Cover, where the universe of elements to be covered consists of points in the plane and the sets with which the points should be covered are segments. We call this…

Computational Geometry · Computer Science 2024-02-27 Katarzyna Kowalska , Michał Pilipczuk

Determining the size of a maximum independent set of a graph $G$, denoted by $\alpha(G)$, is an NP-hard problem. Therefore, many attempts are made to find upper and lower bounds, or exact values of $\alpha (G)$ for special classes of…

Combinatorics · Mathematics 2011-03-01 Nazli Besharati , J. Ebrahimi B , A. Azadi