Related papers: Lower bounds on Bourgain's constant for harmonic m…

A theorem of Bourgain states that the harmonic measure for a domain in $\R^d$ is supported on a set of Hausdorff dimension strictly less than $d$ \cite{Bourgain}. We apply Bourgain's method to the discrete case, i.e., to the distribution of…

We examine caloric measures $\omega$ on general domains in $\mathbb{R}^{n+1} = \mathbb{R}^n\times\mathbb{R}$ (space $\times$ time) from the perspective of geometric measure theory. On one hand, we give a direct proof of a consequence of a…

This paper focuses on a relation between the growth of harmonic functions and the Hausdorff measure of their zero sets. Let $u$ be a real-valued harmonic function in $\mathbb{R}^n$ with $u(0)=0$ and $n\geq 3$. We prove…

This note is to study Bourgain's slicing problem following the routes investigated in the last decade. We show that the slicing constant $L_n$ is bounded by $C\log(\log n) $, $n\geq 3$, for some universal constant $C$.

Let $B_n$ be the $n$-th balancing number. In this paper, we give some explicit expressions of $\sum_{l=0}^{2 r-3}(-1)^l\binom{2 r-3}{l}\sum_{j_1+\cdots+j_r=n-2 l\atop j_1,\dots,j_r\ge 1}B_{j_1}\cdots B_{j_r}$ and…

Using the notion of higher-order Fourier dimension introduced in \cite{M2} (which was a sort of psuedorandomness condition stemming from the Gowers norms of Additive Combinatorics), we prove a maximal theorem and corresponding…

Let $u$ be a harmonic function in the unit ball $B_1 \subset \mathbb R^n$, normalized so that its gradient has magnitude at most 1 on the unit ball. We show that if the gradient of $u$ is $\epsilon$-small in size on a set $E\subset B_{1/2}$…

I. J. Good (1941) showed that the set of irrational numbers in $(0,1)$ whose partial quotients $a_n$ tend to infinity is of Hausdorff dimension $1/2$. A number of related results impose restrictions of the type $a_n\in B$ or $a_n\geq f(n)$,…

We compute two invariants of topological conjugacy, the upper and lower limits of the inverse of Boshernitzan's ne_n, where e_n is the smallest measure of a cylinder of length n, for three families of symbolic systems, the natural codings…

We prove upper and lower bounds on the local dimension of any pair of layers of the Boolean lattice, and show that the local dimension of the first and middle layers of the $n$-dimensional Boolean lattice is asymptotically $\frac{n}{\log_2…

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…

The Bohr phenomenon for analytic functions of the form $f(z)=\sum_{n=0}^{\infty} a_{n}z^{n}$, first introduced by Harald Bohr in 1914, deals with finding the largest radius $r_{f}$, $0<r_{f}<1$, such that the inequality $\sum_{n=0}^{\infty}…

For any natural number $n\in\mathbb{N}$, $ \frac{1}{2n+\frac1{1-\gamma}-2}\le \sum_{i=1}^n\frac1i-\ln n-\gamma<\frac{1}{2n+\frac13}, $ where $\gamma=0.57721566490153286...m$ denotes Euler's constant. The constants $\frac{1}{1-\gamma}-2$ and…

Bourgain's discretization theorem asserts that there exists a universal constant $C\in (0,\infty)$ with the following property. Let $X,Y$ be Banach spaces with $\dim X=n$. Fix $D\in (1,\infty)$ and set $\delta= e^{-n^{Cn}}$. Assume that…

We prove a structure theorem for any $n$-rectifiable set $E\subset \mathbb{R}^{n+1}$, $n\ge 1$, satisfying a weak version of the lower ADR condition, and having locally finite $H^n$ ($n$-dimensional Hausdorff) measure. Namely, that…

The largest Hamming distance between a Boolean function in $n$ variables and the set of all affine Boolean functions in $n$ variables is known as the covering radius $\rho_n$ of the $[2^n,n+1]$ Reed-Muller code. This number determines how…

The Johnson-type upper bound on the maximum size of a code of length $n$, distance $d=2w-1$ and constant composition ${\overline{w}}$ is $\lfloor\dfrac{n}{w_1}\rfloor$, where $w$ is the total weight and $w_1$ is the largest component of…

It is shown that the counting function of n Boolean variables can be implemented with the formulae of size O(n^3.06) over the basis of all 2-input Boolean functions and of size O(n^4.54) over the standard basis. The same bounds follow for…

Let $A, B$, be finite subsets of an abelian group, and let $G \subset A \times B$ be such that $# A, # B, # \{a+b: (a,b) \in G \} \leq N$. We consider the question of estimating the quantity $# \{a-b: (a,b) \in G \}$. Recently Bourgain…

Generalizing the classical result of Bohr, we show that if an n-variable power series converges in an n-circular bounded complete domain D and its sum has modulus less than 1, then the sum of the maximum of the moduli of the terms is less…