Related papers: The first 128 digits of an autoconvolution inequal…
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 prove an exponential deviation inequality for the convex hull of a finite sample of i.i.d. random points with a density supported on an arbitrary convex body in $\R^d$, $d\geq 2$. When the density is uniform, our result yields rate…
Suppose that A is a subset of F_2^n of density as close to 1/3 as possible. We show that the A(F_2^n)-norm (that is the sum of the absolute values of the Fourier transform) of the characterstic function of A is bounded below by an absolute…
We derive explicit upper bounds for the number of nondegenerate critical points of a $k$-component Gaussian mixture density in $\mathbb{R}^d$, and the number of modes when the modal set is finite, together with lower bounds. By normalizing…
This paper considers the problem of channel coding with a given (possibly suboptimal) maximum-metric decoding rule. A cost-constrained random-coding ensemble with multiple auxiliary costs is introduced, and is shown to achieve error…
The number of distinct symbols appearing in digit expansions generated by full-branch affine countable iterated function systems is studied whose branch weights are regularly varying. The Hausdorff dimensions of the exceptional sets in…
We provide tools to help automate the error analysis of algorithms that evaluate simple functions over the floating-point numbers. The aim is to obtain tight relative error bounds for these algorithms, expressed as a function of the unit…
We consider infinite iterated function systems $\{f_i\}_{i=1}^{\infty}$ on $[0,1]$ with a polynomially increasing contraction rate. We look at subsets of such systems where we only allow iterates $f_{i_1}\circ f_{i_2}\circ f_{i_3}\circ...$…
Synchronous Counting is the task of reaching agreement on a common round counter in a synchronous system of $n$ nodes with up to $t$ Byzantine faults in a self-stabilizing manner. That is, after transient faults may have arbitrarily…
A well-known discovery of Feige's is the following: Let $X_1, \ldots, X_n$ be nonnegative independent random variables, with $\mathbb{E}[X_i] \leq 1 \;\forall i$, and let $X = \sum_{i=1}^n X_i$. Then for any $n$, \[\Pr[X < \mathbb{E}[X] +…
We study the individual digits for the absolute value of the characteristic polynomial for the Circular $\beta$-Ensemble. We show that, in the large $N$ limit, the first digits obey Benford's Law and the further digits become uniformly…
We obtain an upper bound for the dimension of the cuspidal automorphic forms for $\mathrm{GL}_2$ over a number field, whose archimedean local representations are not tempered. More precisely, we prove the following result. Let $F$ be a…
Steinerberger introduced the Buffon discrepancy problem, asking how accurately a one-dimensional set of length $L$ in a convex body can match the Crofton-predicted line-intersection counts, and proved an $O\left(L^{1/3}\right)$ upper bound…
In this paper, we investigate the functional central limit theorem and the Marcinkiewicz strong law of large numbers for U-statistics having absolutely regular data and taking value in a separable Hilbert space. The novelty of our approach…
For an infinite iterated function system $\mathbf{f}$ on $[0,1]$ with an attractor $\Lambda(\mathbf{f})$ and for an infinite subset $D\subseteq \mathbb{N}$, consider the set \[ \mathbb E(\mathbf{f},D)= \{ x \in \Lambda(\mathbf{f}):…
Finite precision computations using digital computers involve the following inherent errors: (1) Round-off error of finite precision computations (2) Binary computer arithmetic precludes exact number representation of traditional decimal…
We derive a new criterion for a real-valued function $u$ to be in the Sobolev space $W^{1,2}(\R^n)$. This criterion consists of comparing the value of a functional $\int f(u)$ with the values of the same functional applied to convolutions…
In this work we define a numerical invariant called $F$-volume. This number extends the definition of $F$-threshold of a pair of ideals $I$ and $J$, $c^J(I)$ to a sequence of ideals $J$, $I_1, \ldots, I_t$. We obtain several properties that…
The study of Fourier transforms of probability measures on fractal sets plays an important role in recent research. Faster decay rates are known to yield enhanced results in areas such as metric number theory. This paper focuses on…
We deal with the problem of estimating the volume of inclusions using a finite number of boundary measurements in electrical impedance tomography. We derive upper and lower bounds on the volume fractions of inclusions, or more generally two…