English
Related papers

Related papers: Improving the $\frac{1}{3}-\frac{2}{3}$ Conjecture…

200 papers

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…

Computational Complexity · Computer Science 2013-05-06 Anindya De , Ilias Diakonikolas , Rocco A. Servedio

We prove an inequality related to questions in Approximation Theory, Probability Theory, and to Irregularities of Distribution. Let $h_R$ denote an $L ^{\infty}$ normalized Haar function adapted to a dyadic rectangle $R\subset [0,1] ^{3}$.…

Classical Analysis and ODEs · Mathematics 2007-06-21 Michael T Lacey , Dmitry Bilyk

Let $P$ be a finite poset of width two, i.e., with no three-element antichain. We associate with $P$ a skew Young diagram $\Upsilon(P)$ and discuss some of the properties of the map $\Upsilon$. In particular, if we regard $\Upsilon(P)$ as a…

Combinatorics · Mathematics 2023-05-05 Richard P. Stanley

The \emph{relative projection constant} $\lambda(Y, X)$ of normed spaces $Y \subset X$ is defined as $\lambda(Y, X) = \inf \{ ||P|| : P \in \mathcal{P}(X, Y) \}$, where $\mathcal{P}(X, Y)$ denotes the set of all continuous projections from…

Functional Analysis · Mathematics 2019-02-20 Tomasz Kobos

A simple graph more often than not contains adjacent vertices with equal degrees. This in particular holds for all pairs of neighbours in regular graphs, while a lot such pairs can be expected e.g. in many random models. Is there a…

Combinatorics · Mathematics 2020-03-31 Jakub Przybyło

In this work, we consider the sample complexity required for testing the monotonicity of distributions over partial orders. A distribution $p$ over a poset is monotone if, for any pair of domain elements $x$ and $y$ such that $x \preceq y$,…

Data Structures and Algorithms · Computer Science 2019-07-09 Maryam Aliakbarpour , Themis Gouleakis , John Peebles , Ronitt Rubinfeld , Anak Yodpinyanee

A pair of probability distributions over $\{0,1\}^n$ is said to be $(k,\delta)$-wise indistinguishable if all of the size $k$ marginals are within statistical distance at most $\delta$. Previous works introduced this concept and study when…

Computational Complexity · Computer Science 2026-05-14 Christopher Williamson

For $P$ a poset, the dimension of $P$ is defined to be the least cardinal $\kappa$ such that $P$ is embeddable in a direct product of $\kappa$ totally ordered sets. We study the behavior of this function on finite-dimensional (not…

Combinatorics · Mathematics 2026-04-07 George M. Bergman

In this note, we first try to prove a uniform lower bound of nodal volume in elliptic homogenization setting. This lower bound is far from optimal. But, we can prove a constant lower bound in dimension two. Motivated by the proof, we extend…

Analysis of PDEs · Mathematics 2025-12-23 Jiahuan Li , Zhichen Ying

In this paper, we provide an algorithm to estimate from below the dimension of self-similar measures with overlaps. As an application, we show that for any $ \beta\in(1,2) $, the dimension of the Bernoulli convolution $ \mu_\beta $…

Dynamical Systems · Mathematics 2021-09-06 De-Jun Feng , Zhou Feng

We prove that for any $2<p<\infty$ and for every $n$-dimensional subspace $X$ of $L_p$, represented on $\mathbb R^n$, whose unit ball $B_X$ is in Lewis' position one has the following two-level Gaussian concentration inequality: \[ \mathbb…

Functional Analysis · Mathematics 2017-10-24 Grigoris Paouris , Petros Valettas

We introduce so-called consistent posets which are bounded posets with an antitone involution ' where the lower cones of x,x' and of y,y' coincide provided x,y are different form 0,1 and, moreover, if x,y are different form 0 then their…

Logic · Mathematics 2020-06-30 Ivan Chajda , Helmut Länger

We consider 'supersaturation' problems in partially ordered sets (posets) of the following form. Given a finite poset $P$ and an integer $m$ greater than the cardinality of the largest antichain in $P$, what is the minimum number of…

Combinatorics · Mathematics 2017-08-29 Jonathan A. Noel , Alex Scott , Benny Sudakov

In this paper we consider the problem of uniformity testing with limited memory. We observe a sequence of independent identically distributed random variables drawn from a distribution $p$ over $[n]$, which is either uniform or is…

Information Theory · Computer Science 2022-06-22 Tomer Berg , Or Ordentlich , Ofer Shayevitz

There exists an absolute constant $\delta > 0$ such that for all $q$ and all subsets $A \subseteq \mathbb{F}_q$ of the finite field with $q$ elements, if $|A| > q^{2/3 - \delta}$, then \[ |(A-A)(A-A)| = |\{ (a -b) (c-d) : a,b,c,d \in A\}| >…

Combinatorics · Mathematics 2018-11-15 Brendan Murphy , Giorgis Petridis

In the Two-dimensional Bin Packing (2BP) problem, we are given a set of rectangles of height and width at most one and our goal is to find an axis-aligned nonoverlapping packing of these rectangles into the minimum number of unit square…

Computational Geometry · Computer Science 2021-05-07 Arindam Khan , Eklavya Sharma

We study the gaps $\Delta p_n$ between consecutive rank sizes in $r$-differential posets by introducing a projection operator whose matrix entries can be expressed in terms of the number of certain paths in the Hasse diagram. We strengthen…

Combinatorics · Mathematics 2020-01-06 Christian Gaetz , Praveen Venkataramana

For any convex set $\Omega \subset {\mathbb R} ^N$, we provide a lower bound for the inverse of the Poincar\'e constant in $W ^ {1, 1}(\Omega)$: it refines an inequality in terms of the diameter due to Acosta-Duran, via the addition of an…

Analysis of PDEs · Mathematics 2025-04-10 Dorin Bucur , Ilaria Fragalà

By a modification of the method that was applied in (Korolev and Shevtsova, 2010), here the inequalities $\Delta_n\leq0.3328(\beta_3+0.429)/\sqrt{n}$ and $\Delta_n\leq0.33554(\beta_3+0.415)/\sqrt{n}$ are proved for the uniform distance…

Probability · Mathematics 2011-11-29 Irina Shevtsova

For each positive integer $m$ and each real finite dimensional Banach space $X$, we set $\beta(X,m)$ to be the infimum of $\delta\in (0,1]$ such that each set $A\subset X$ having diameter $1$ can be represented as the union of $m$ subsets…

Functional Analysis · Mathematics 2021-03-30 Yanlu Lian , Senlin Wu