Related papers: Approximate Gaussian isoperimetry for k sets

Motivated by the relative differential geometry, where the Euclidean normal vector of hypersurfaces is generalized by a relative normalization, we introduce anisotropic area measures of convex bodies, constructed with respect to a gauge…

Three intersection theorems are proved. First, we determine the size of the largest set system, where the system of the pairwise unions is l-intersecting. Then we investigate set systems where the union of any s sets intersect the union of…

Let S_{n,k} denote the random geometric graph obtained by placing points inside a square of area n according to a Poisson point process of intensity 1 and joining each such point to the k=k(n) points of the process nearest to it. In this…

Let $E\subset \mathbb{R}^{n+1}$, $n\ge 2$, be a uniformly rectifiable set of dimension $n$. Then bounded harmonic functions in $\Omega:= \mathbb{R}^{n+1}\setminus E$ satisfy Carleson measure estimates, and are "$\varepsilon$-approximable".…

We consider the Gaussian correlation inequality for nonsymmetric convex sets. More precisely, if $A\subset\mathbb{R}^d$ is convex and the origin $0\in A$, then for any ball $B$ centered at the origin, it holds $\gamma_d(A\cap B)\geq…

A geometric graph is a simple graph G together with a straight line drawing of G in the plane with the vertices in general position. Two geometric realizations of a simple graph are geo-isomorphic if there is a vertex bijection between them…

We present the whole class of Gaussian coordinate systems for the Kerr metric. This is achieved through the uses of the relationship between Gaussian observers and the relativistic Hamilton-Jacobi equation. We analyze the completeness of…

Let $K$ be a non-polar compact subset of $\mathbb{R}$ and $\mu_K$ denote the equilibrium measure of $K$. Furthermore, let $P_n\left(\cdot, \mu_K\right)$ be the $n$-th monic orthogonal polynomial for $\mu_K$. It is shown that…

The volume of a k-dimensional foliation $\mathcal{F}$ in a Riemannian manifold $M^{n}$ is defined as the mass of image of the Gauss map, which is a map from M to the Grassmann bundle of k-planes in the tangent bundle. Generalizing a…

We introduce a new notion of a harmonic measure for a $d$-dimensional set in $\R^n$ with $d<n-1$, that is, when the codimension is strictly bigger than 1. Our measure is associated to a degenerate elliptic PDE, it gives rise to a…

We prove the first robust dimension free isoperimetric result for the standard Gaussian measure $\gamma_n$ and the corresponding boundary measure $\gamma_n^+$ in $\mathbb {R}^n$. The main result in the theory of Gaussian isoperimetry…

Let $E\subset \mathbb{R}^{n+1}$, $n\ge 1$, be a uniformly rectifiable set of dimension $n$. We show $E$ that has big pieces of boundaries of a class of domains which satisfy a 2-sided corkscrew condition, and whose connected components are…

A subset $S$ of vertices of a connected graph $G$ is a distance-equalizer set if for every two distinct vertices $x, y \in V (G) \setminus S$ there is a vertex $w \in S$ such that the distances from $x$ and $y$ to $w$ are the same. The…

A classic theorem of Uchimura states that the difference between the sum of the smallest parts of the partitions of $n$ into an odd number of distinct parts and the corresponding sum for an even number of distinct parts is equal to the…

The k-distance strong shortest path union cover of a graph is the minimum cardinality among all strong shortest path union cover at distance k of G. In this paper we determine the 2-strong shortest path union cover for certain graphs, also…

A unit cube in $k$ dimensional space (or \emph{$k$-cube} in short) is defined as the Cartesian product $R_1\times R_2\times...\times R_k$ where $R_i$(for $1\leq i\leq k$) is a closed interval of the form $[a_i,a_i+1]$ on the real line. A…

A subset S of vertices of a graph G is called a k-path vertex cover if every path of order k in G contains at least one vertex from S. Denote by \psi_k(G) the minimum cardinality of a k-path vertex cover in G. It is shown that the problem…

A geometric graph \G is a simple graph drawn in the plane, on points in general position, with straight-line edges. We call \G a geometric realization of the underlying abstract graph G. A geometric homomorphism from \G to \H is a vertex…

In this paper, we investigate two questions on Kneser graphs $KG_{n,k}$. First, we prove that the union of $s$ intersecting families in ${[n]\choose k}$ has size at most ${n\choose k}-{n-s\choose k}$ for all sufficiently large $n$ that…

For an $r$-tuple $(\gamma_1,\ldots,\gamma_r)$ of special orthogonal $d\times d$ matrices, we say that the Euclidean $(d-1)$-dimensional sphere $S^{d-1}$ is $(\gamma_1,\ldots,\gamma_r)$-divisible if there is a subset $A\subseteq S^{d-1}$…