Related papers: Almost sure upper bound for a model problem for mu…
We study the total mass of high points in a random model for the Riemann-Zeta function. We consider the same model as in [8], [2], and build on the convergence to 'Gaussian' multiplicative chaos proved in [14]. We show that the total mass…
The present note is an essential addition to the author's arxiv paper arXiv:2001.01070, concerning general multiplicative systems of random variables. Using some lemmas and the methodology of \cite{Kar4}, we obtain a general extreme…
This paper develops upper and lower bounds for the probability of Boolean functions by treating multiple occurrences of variables as independent and assigning them new individual probabilities. We call this approach dissociation and give an…
The notions of bounded expansion and nowhere denseness not only offer robust and general definitions of uniform sparseness of graphs, they also describe the tractability boundary for several important algorithmic questions. In this paper we…
In this paper, we establish an almost sure central limit theorem for a general random sequence under a strong approximation condition. Additionally, we derive the law of the iterated logarithm for the center of mass corresponding to a…
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…
We propose a framework for model-theoretic stability and simplicity in an approximate first-order setting and generalize some classical results.
In coding and information theory, it is desirable to construct maximal codes that can be either variable length codes or error control codes of fixed length. However deciding code maximality boils down to deciding whether a given NFA is…
A fundamental problem in numerical analysis and approximation theory is approximating smooth functions by polynomials. A much harder version under recent consideration is to enforce bounds constraints on the approximating polynomial. In…
In this work, we study the normal approximation and almost sure central limit theorems for some functionals of an independent sequence of Rademacher random variables. In particular, we provide a new chain rule that improves the one derived…
A novel, non-trivial, probabilistic upper bound on the entropy of an unknown one-dimensional distribution, given the support of the distribution and a sample from that distribution, is presented. No knowledge beyond the support of the…
In this paper, lower bounds on the probability of a finite union of events are considered, i.e. $P\left(\bigcup_{i=1}^N A_i\right)$, in terms of the individual event probabilities $\{P(A_i), i=1,\ldots,N\}$ and the sums of the pairwise…
We prove that when $f$ is a Rademacher random multiplicative function for any $\epsilon>0$, then $\sum_{n \leqslant x}\frac{f(n)}{\sqrt{n}} \ll (\log\log(x))^{3/4+\epsilon}$ for almost all $f$. We also show that there exist arbitrarily…
In a previous article the authors determined the best-known upper bound for the cardinality of the image set for several classes of functions, including planar functions. Here, we show that the upper bound cannot be tight for planar…
Extending our own and others' earlier approaches to reasoning about termination of probabilistic programs, we propose and prove a new rule for termination with probability one, also known as "almost-certain termination". The rule uses both…
This paper settles the sample complexity of single-parameter revenue maximization by showing matching upper and lower bounds, up to a poly-logarithmic factor, for all families of value distributions that have been considered in the…
We consider the Chance Constrained Model Predictive Control problem for polynomial systems subject to disturbances. In this problem, we aim at finding optimal control input for given disturbed dynamical system to minimize a given cost…
Given a multiplicative function f satisfying |f(n)| <= 1 for all n, the authors study the problem of obtaining explicit upper bounds on the mean-value 1/x |sum_{n <= x} f(n)|.
Solving partially observable Markov decision processes (POMDPs) with high dimensional and continuous observations, such as camera images, is required for many real life robotics and planning problems. Recent researches suggested machine…
We establish a normal approximation for the limiting distribution of partial sums of random Rademacher multiplicative functions over function fields, provided the number of irreducible factors of the polynomials is small enough. This…