中文
相关论文

相关论文: Improving the $\frac{1}{3}-\frac{2}{3}$ Conjecture…

200 篇论文

It was recently proved that for $p>2m^{3}-4m^{2}+2m$ the constants of the Hardy--Littlewood inequality for $m$-linear forms on $\ell_{p}$-spaces are less than or equal to the best known estimates of respective constants of the…

数论 · 数学 2015-10-02 Daniel Pellegrino

We present new sharper lower and upper bounds for the non-zero Bernoulli numbers using Euler's formula for the Riemann zeta function. In particular, we determine the best possible constants $ \alpha $ and $ \beta $ such that the double…

综合数学 · 数学 2025-01-20 Yogesh J. Bagul

Uniform and nonuniform Berry--Esseen (BE) bounds of optimal orders on the closeness to normality for general abstract nonlinear statistics are given, which are then used to obtain optimal bounds on the rate of convergence in the delta…

统计理论 · 数学 2017-01-17 Iosif Pinelis , Raymond Molzon

We prove a sharp stability result for the Brunn-Minkowski inequality for $A,B\subset\mathbb{R}^2$. Assuming that the Brunn-Minkowski deficit $\delta=|A+B|^{\frac{1}{2}}/(|A|^\frac12+|B|^\frac12)-1$ is sufficiently small in terms of…

泛函分析 · 数学 2019-11-28 Peter van Hintum , Hunter Spink , Marius Tiba

This paper discusses a general and useful stability principle which, roughly speaking, says that given a uniformly continuous function defined on an arbitrary metric space, if the function is bounded on the constraint set and we slightly…

最优化与控制 · 数学 2020-09-04 Daniel Reem , Simeon Reich , Alvaro De Pierro

A linear extension of a poset $P$ is a permutation of the elements of the set that respects the partial order. Let $L(P)$ denote the number of linear extensions. It is a #P complete problem to determine $L(P)$ exactly for an arbitrary…

概率论 · 数学 2017-07-03 Jacqueline Banks , Scott Garrabrant , Mark L. Huber , Anne Perizzolo

We study the problem of testing discrete distributions with a focus on the high probability regime. Specifically, given samples from one or more discrete distributions, a property $\mathcal{P}$, and parameters $0< \epsilon, \delta <1$, we…

数据结构与算法 · 计算机科学 2020-09-15 Ilias Diakonikolas , Themis Gouleakis , Daniel M. Kane , John Peebles , Eric Price

The dimension is a key measure of complexity of partially ordered sets. Small dimension allows succinct encoding. Indeed if $P$ has dimension $d$, then to know whether $x \leq y$ in $P$ it is enough to check whether $x\leq y$ in each of the…

组合数学 · 数学 2019-12-12 Stefan Felsner , Tamás Mészáros , Piotr Micek

Motivated by constructions from applied topology, there has been recent interest in the homological algebra of linear representations of posets, particularly in the context of homological algebra relative to non-standard exact structures. A…

表示论 · 数学 2025-07-18 Benjamin Blanchette , Justin Desrochers , Eric J. Hanson , Luis Scoccola

Given a Banach space $X$, for $n\in \mathbb N$ and $p\in (1,\infty)$ we investigate the smallest constant $\mathfrak P\in (0,\infty)$ for which every $f_1,...,f_n:{-1,1}^n\to X$ satisfy \int_{{-1,1}^n}\Bigg|\sum_{j=1}^n…

泛函分析 · 数学 2013-05-15 Tuomas Hytönen , Assaf Naor

W.M.Schmit[11] conjectured that for any$\;\theta$ with deg$\;\theta\geq 3,$ there is no constant$\;C=C(\theta)$ so that$\;|p-q\theta|>Cq^{-1}$ for every rationa$\;p/q.$ [12,p26] states that the computations of the first several thousand…

数论 · 数学 2023-11-29 Jinxiang Li

A family of sets is called union-closed if whenever $A$ and $B$ are sets of the family, so is $A\cup B$. The long-standing union-closed conjecture states that if a family of subsets of $[n]$ is union-closed, some element appears in at least…

组合数学 · 数学 2019-02-20 Tom Eccles

In 1989, Ne\v{s}et\v{r}il and Pudl\'ak posed the following challenging question: Do planar posets have bounded Boolean dimension? We show that every poset with a planar cover graph and a unique minimal element has Boolean dimension at most…

组合数学 · 数学 2022-12-20 Heather Smith Blake , Piotr Micek , William T. Trotter

The union-closed sets conjecture states that in any nonempty union-closed family $\mathcal{F}$ of subsets of a finite set, there exists an element contained in at least a proportion $1/2$ of the sets of $\mathcal{F}$. Using the…

组合数学 · 数学 2023-05-24 Lei Yu

We provide new upper and lower bounds on the minimum possible ratio of the spectral and Frobenius norms of a (partially) symmetric tensor. In the particular case of general tensors our result recovers a known upper bound. For symmetric…

泛函分析 · 数学 2024-03-05 Khazhgali Kozhasov , Josué Tonelli-Cueto

Helfgott proved that there exists a $\delta>0$ such that if $S$ is a symmetric generating subset of $SL(2,p)$ containing 1 then either $S^3=SL(2,p)$ or $|S^3|\geq |S|^{1+\delta}$. It is known that $\delta\geq 1/3024$. Here we show that…

群论 · 数学 2014-11-24 Jack Button , Colva Roney-Dougal

Spanners, emulators, and approximate distance oracles can be viewed as lossy compression schemes that represent an unweighted graph metric in small space, say $\tilde{O}(n^{1+\delta})$ bits. There is an inherent tradeoff between the…

数据结构与算法 · 计算机科学 2017-01-11 Amir Abboud , Greg Bodwin , Seth Pettie

Heisenberg's uncertainty principle states that the position and momentum of a particle cannot be sharply determined simultaneously. Standard-deviation and entropic formulations capture the spread of the probability distribution but say…

量子物理 · 物理学 2026-05-07 Jia-Yi Lin , Xin-Yu Li , Wei Wang , Shengjun Wu

We are interested to bound from below the number of distinct dot products determined by a finite set of points $P$ in the Euclidean plane. In this paper, we build on the work of B. Hanson, O. Roche-Newton, and S. Senger, to obtain the…

组合数学 · 数学 2025-02-19 Michalis Kokkinos

In 1974, Witsenhausen asked for the maximum possible density $\alpha_n$ of a measurable subset $A$ of the unit sphere $\mathbb{S}^{n-1}\subset \mathbb{R}^n$ such that $A$ contains no pair of orthogonal vectors. For $n=3$, the best known…

组合数学 · 数学 2026-05-28 Domonkos Czifra , Ákos Dúcz , Máté Matolcsi , Dániel Varga , Pál Zsámboki