相关论文: Almost isoperimetric subsets of the discrete cube

An n-simplex is called circumscriptible (or edge-incentric) if there is a sphere tangent to all its n(n + 1)/2 edges. We obtain a closed formula for the radius of the circumscribed sphere of the circumscriptible n-simplex, and also prove a…

A cutset is a non-empty finite subset of $\mathbb{Z}^d$ which is both connected and co-connected. A cutset is odd if its vertex boundary lies in the odd bipartition class of $\mathbb{Z}^d$. Peled suggested that the number of odd cutsets…

We prove a Sobolev inequality which holds on submanifolds in Euclidean space of arbitrary dimension and codimension. This inequality is sharp if the codimension is at most 2. As a special case, we obtain a sharp isoperimetric inequality for…

In this paper motivated from subspace coding we introduce subspace-metric codes and subset-metric codes. These are coordinate-position independent pseudometrics and suitable for the folded codes. The half-Singleton upper bounds for linear…

We revisit the hardness of approximating the diameter of a network. In the CONGEST model of distributed computing, $ \tilde \Omega (n) $ rounds are necessary to compute the diameter [Frischknecht et al. SODA'12], where $ \tilde \Omega…

For every $d\ge 3$, we construct a noncompact smooth $d$-dimensional Riemannian manifold with strictly positive sectional curvature without isoperimetric sets for any volume below $1$. We construct a similar example also for the relative…

Let $\epsilon \in (0, 1)$ and $n, \Delta \in \mathbb N$ be such that $\Delta = \Omega\left(\max\left\{\frac{\log n}{\epsilon},\, \left(\frac{1}{\epsilon}\log \frac{1}{\epsilon}\right)^2\right\}\right)$. Given an $n$-vertex $m$-edge simple…

Consider a random hypergraph on a set of N vertices in which, for k between 1 and N, a Poisson(N beta_k) number of hyperedges is scattered randomly over all subsets of size k. We collapse the hypergraph by running the following algorithm to…

We provide the currently fastest randomized (1+epsilon)-approximation algorithm for the closest vector problem in the infinity norm. The running time of our method depends on the dimension n and the approximation guarantee epsilon by 2^O(n)…

We consider a countably generated and uniformly closed algebra of bounded functions. We assume that there is a lower semicontinuous, with respect to the supremum norm, quadratic form and that normal contractions operate in a certain sense.…

Let $f$ be a holomorphic cusp form for $SL_2(\mathbb{Z})$ of weight $k>1$. In these notes, we follow Munshi to prove the Burgess bound $$ L(1/2+it,f)\ll_{f,\varepsilon} (1+|t|)^{1/2-1/8+\varepsilon}. $$

A tree containing exactly two non-pendant vertices is called a double-star. Let $k_1$ and $k_2$ be two positive integers. The double-star with degree sequence $(k_1+1, k_2+1, 1, \ldots, 1)$ is denoted by $S_{k_1, k_2}$. If $G$ is a cubic…

Let $\Delta$ be a $d$-dimensional normal pseudomanifold, $d \ge 3.$ A relative lower bound for the number of edges in $\Delta$ is that $g_2$ of $\Delta$ is at least $g_2$ of the link of any vertex. When this inequality is sharp $\Delta$ has…

Let $p$ be a prime. Let $f$ be a holomorphic modular form of level $p$ with trivial nebentypus. We prove the bound $L\left(\text{sym}^2f, \frac{1}{2} + it\right) \ll_{f,\epsilon} p^{1/2+\epsilon}t^{3/4-1/12 + \epsilon}$. This bound is…

A theorem of W. Derrick ensures that the volume of any Riemannian cube $([0,1]^n,g)$ is bounded below by the product of the distances between opposite codimension-1 faces. In this paper, we establish a discrete analog of Derrick's…

We show that a set of $n$ algebraic plane curves of constant maximum degree can be cut into $O(n^{3/2}\operatorname{polylog} n)$ Jordan arcs, so that each pair of arcs intersect at most once, i.e., they form a collection of pseudo-segments.…

For any constant $C_0>0$, we construct a set $A \subset {\mathbb N}$ such that one has $$ \sum_{n \in A: n \leq x} \frac{1}{n} = \exp\left(\left(\frac{C_0}{2}+o(1)\right) (\log\log x)^{1/2} \log\log\log x \right)$$ and $$ \sum_{n,m \in A:…

In STOC'95 \cite{ADMSS95} Arya et al.\ showed that for any set of $n$ points in $\mathbb R^d$, a $(1+\epsilon)$-spanner with diameter at most 2 (respectively, 3) and $O(n \log n)$ edges (resp., $O(n \log \log n)$ edges) can be built in $O(n…

We prove that there is an absolute constant $ C$ such that for every $ n \geq 2 $ and $ N\geq 10^n, $ there exists a polytope $ P_{n,N} \subset \mathbb{R}^n $ with at most $ N $ facets that satisfies…

An identifying code of a graph is a dominating set which uniquely determines all the vertices by their neighborhood within the code. Whereas graphs with large minimum degree have small domination number, this is not the case for the…