中文
相关论文

相关论文: An example related to the slicing inequality for g…

200 篇论文

Let $C$ and $K$ be centrally symmetric convex bodies of volume $1$ in ${\mathbb R}^n$. We provide upper bounds for the multi-integral expression \begin{equation*}\|{\bf…

度量几何 · 数学 2019-06-11 Giorgos Chasapis , Apostolos Giannopoulos , Nikos Skarmogiannis

Let K be the symmetric convex hull of m independent random vectors uniformly distributed on the unit sphere of R^n. We prove that, for every $\delta>0$, the isotropy constant of K is bounded by a constant $c(\delta)$ with high probability,…

度量几何 · 数学 2007-07-12 David Alonso-Gutierrez

Let $\epsilon_{1},\ldots,\epsilon_{n}$ be a sequence of independent Rademacher random variables. We prove that there is a constant $c>0$ such that for any unit vectors $v_1,\ldots,v_n\in \mathbb{R}^2$, $$\Pr\left[||\epsilon_1…

概率论 · 数学 2024-12-31 Xiaoyu He , Tomas Juskevicius , Bhargav Narayanan , Sam Spiro

We show that for any union-closed family $\mathcal{F} \subseteq 2^{[n]}, \mathcal{F} \neq \{\emptyset\}$, there exists an $i \in [n]$ which is contained in a $0.01$ fraction of the sets in $\mathcal{F}$. This is the first known constant…

组合数学 · 数学 2022-11-29 Justin Gilmer

We generalize the ham sandwich theorem for the case of well separated measures. Given convex bodies $K_1,...,K_d$ in $\mathbb{R_d}$ and numbers $\alpha_1,...,\alpha_d \in [0, 1]$, we give a sufficient condition for existence and uniqueness…

组合数学 · 数学 2010-11-01 Imre Barany , Alfredo Hubard , Jesus Jeronimo

We show the existence of an absolute constant $\alpha>0$ such that, for every $k \geq 3$, $G:=\mathop{\mathrm{Sym}}(k)$, and for every $H \leqslant G$ of index at least $3$, one has $|H/[H,H]| \leq |G:H|^{\alpha/ \log \log |G:H|}$. This…

群论 · 数学 2022-01-11 Luca Sabatini

We prove that if $f(n)$ is a Steinhaus or Rademacher random multiplicative function, there almost surely exist arbitrarily large values of $x$ for which $|\sum_{n \leq x} f(n)| \geq \sqrt{x} (\log\log x)^{1/4+o(1)}$. This is the first such…

数论 · 数学 2021-01-01 Adam J. Harper

In this paper we show the following result: if C is an n-dimensional 0-symmetric convex compact set, $f:C\rightarrow[0,1)$ is concave, and $g:[0,1)\rightarrow[0,1)$ is not identically zero, convex, with g(0)=0, then \[ \frac{1}{|C|}\int_C…

泛函分析 · 数学 2020-04-29 Bernardo González Merino

Let $X:M^n\to \mathbb{R}^{n+1}$ be a complete properly immersed self-shrinker. In this paper, we prove that if the squared norm of the second fundamental form $S$ satisfies $1\leq S< C$ for some constant $C$, then $S=1$. Further we classify…

微分几何 · 数学 2023-07-06 Yayun Chen , Tongzhu Li

Given a compact Riemannian Manifold (M,g) of dimension n > 2, a point x_0 in M and s in (0,2). We let 2*(s) = 2(n-s)/(n-2) be the critical Hardy-Sobolev exponent. The Hardy-Sobolev embedding yields the existence of A,B > 0 such that…

微分几何 · 数学 2016-03-02 Hassan Jaber

Let $X$ be a real normed space with unit sphere S. We prove that $X$ is an inner product space if and only if there exists a real number $\rho=\sqrt{(1+\cos\frac{2k\pi}{2m+1})/2}$, $(k=1,2,\ldots , m ;\:m=1,2,\ldots)$, such that every chord…

泛函分析 · 数学 2017-07-31 Carlos Benítez , Pedro Martín , Diego Yáñez

The Littlewood conjecture, proven by Konyagin and McGehee-Pigno-Smith in the 1980s, states that if $A\subset \mathbb{Z}$ is a finite set of integers with $\lvert A\rvert=N$ then $\| \widehat{1_A}\|_1\geq c\log N$ for some absolute constant…

数论 · 数学 2026-04-21 Thomas F. Bloom , Ben Green

This paper makes two contributions towards determining some well-studied optimal constants in Fourier analysis \newa{of Boolean functions} and high-dimensional geometry. \begin{enumerate} \item It has been known since 1994 \cite{GL:94} that…

计算复杂性 · 计算机科学 2013-05-06 Anindya De , Ilias Diakonikolas , Rocco A. Servedio

The Matrix Spencer Conjecture asks whether given $n$ symmetric matrices in $\mathbb{R}^{n \times n}$ with eigenvalues in $[-1,1]$ one can always find signs so that their signed sum has singular values bounded by $O(\sqrt{n})$. The standard…

数据结构与算法 · 计算机科学 2019-11-01 Victor Reis , Thomas Rothvoss

We resolve a long-standing open question, about the existence of a constant-factor approximation algorithm for the average-case \textsc{Decision Tree} problem with uniform probability distribution over the hypotheses. We answer the question…

数据结构与算法 · 计算机科学 2026-04-29 Michał Szyfelbein

We consider the problem of minimizing a continuous function f over a compact set K. We analyze a hierarchy of upper bounds proposed by Lasserre in [SIAM J. Optim. 21(3) (2011), pp. 864--885], obtained by searching for an optimal probability…

最优化与控制 · 数学 2015-09-09 Etienne de Klerk , Monique Laurent , Zhao Sun

We study multiplicative functions $f$ satisfying $|f(n)|\le 1$ for all $n$, the associated Dirichlet series $F(s):=\sum_{n=1}^{\infty} f(n) n^{-s}$, and the summatory function $S_f(x):=\sum_{n\le x} f(n)$. Up to a possible trivial…

数论 · 数学 2022-10-27 Éric Saïas , Kristian Seip

We find a sharp combinatorial bound for the metric entropy of sets in R^n and general classes of functions. This solves two basic combinatorial conjectures on the empirical processes. 1. A class of functions satisfies the uniform Central…

泛函分析 · 数学 2016-12-23 Mark Rudelson , Roman Vershynin

Let $G$ be an additive finite abelian group with exponent $\exp(G)=m$. For any positive integer $k$, the $k$-th generalized Erd\H{o}s-Ginzburg-Ziv constant $\mathsf s_{km}(G)$ is defined as the smallest positive integer $t$ such that every…

组合数学 · 数学 2018-11-27 Dongchun Han , Hanbin Zhang

We show that there is some absolute constant $c>0$, such that for any union-closed family $\mathcal{F} \subseteq 2^{[n]}$, if \mbox{$|\mathcal{F}| \geq (\frac{1}{2}-c)2^n$}, then there is some element $i \in [n]$ that appears in at least…

组合数学 · 数学 2017-08-07 Ilan Karpas
‹ 上一页 1 8 9 10 下一页 ›