相关论文: On the behavior of binary block-counting functions…

In this paper, we give explicit error bounds for the asymptotic expansion of the shifted distinct partition function $q(n +s)$ for any nonnegative integer $s$. Then based on this refined asymptotic formula, we give the exact thresholds of…

Let $(W,S)$ be a finite Coxeter system with root system $R$ and with set of positive roots $R^+$. For $\alpha\in R$, $v,w\in W$, we denote by $\partial_\alpha$, $\partial_w$ and $\partial_{w/v}$ the divided difference operators and skew…

In this work, binary block-to-block distribution matching is considered. m independent and uniformly distributed bits are mapped to n output bits resembling a target product distribution. A rate R is called achieved by a sequence of…

Donald Knuth introduced in The Art of Computer Programming (Vol 4a) a fast approximation to the addition of integers (given in binary) in terms of bit-wise operations by $a + b \; \approx \; a \oplus b \oplus ((a\land b) \ll 1).$…

Under the Ornstein-Uhlenbeck semigroup $\{U_t\}$, any non-negative measurable $f : \mathbb R^n \to \mathbb R_+$ exhibits a uniform tail bound better than that implied by Markov's inequality and conservation of mass: For every $\alpha \geq…

Let $s_2$ be the sum-of-digits function in base $2$, which returns the number of non-zero binary digits of a nonnegative integer $n$. We study $s_2$ alon g arithmetic subsequences and show that --- up to a shift --- the set of $m$-tuples of…

We consider the sum of digits functions for both base phi, and for the Zeckendorf expansion of the natural numbers. For both sum of digits functions we present morphisms on infinite alphabets such that these functions viewed as infinite…

We consider the following polynomial generalization of Stern's diatomic series: let $s_1(x,y)=1$, and for $n\geq 1$ set $s_{2n}(x,y)=s_n(x,y)$ and $s_{2n+1}(x,y)=x\,s_n(x,y)+y\,s_{n+1}(x,y)$. The coefficient $[x^iy^j]s_n(x,y)$ is the number…

Let $\{s_n\}$ and $\{t_n\}$ be two sequences of positive real numbers. Under some mild conditions on $\{s_n\}$ and $\{t_n\}$, we give the precise formula of the Hausdorff dimension of the set \[ \mathbb{E}(\{s_n\},\{t_n\}):=\Big\{x\in(0,1):…

Let the sequence $\{t_n\}_{n=1}^{\infty}$ of reals satisfy the condition $ \frac{t_{n+1}}{t_n} \ge 1+ \frac{\gamma}{n^\beta},0\le \beta <1, \gamma >0. $ Then the set $ \{\alpha \in [0,1]: \exists \varkappa > 0 \forall n \in \mathbb{N} ||t_n…

We show that rational data of bounded input length are uniformly distributed with respect to condition numbers of numerical analysis. We deal both with condition numbers of Linear Algebra and with condition numbers for systems of…

We study how the order of N independent random walks in one dimension evolves with time. Our focus is statistical properties of the inversion number m, defined as the number of pairs that are out of sort with respect to the initial…

Fix a sequence of integers $Q=\{q_n\}_{n=1}^\infty$ such that $q_n$ is greater than or equal to 2 for all $n$. In this paper, we improve upon results by J. Galambos and F. Schweiger showing that almost every (in the sense of Lebesgue…

Consider a binary-input memoryless output-symmetric channel $W$. Such a channel has a capacity, call it $I(W)$, and for any $R<I(W)$ and strictly positive constant $P_{\rm e}$ we know that we can construct a coding scheme that allows…

Using our recently improved Monte Carlo evolution code, we study the evolution of the binary fraction in globular clusters. In agreement with previous N-body simulations, we find generally that the hard binary fraction in the core tends to…

Let $S_m f$ denote the $m$-th partial sum of the Walsh-Fourier series of $f \in L^1$. For an increasing sequence $a=(a(n))_{n \geq 1}$ of positive integers, consider the arithmetic means $$ \sigma_N f:=\frac{1}{N} \sum_{n=1}^N S_{a(n)} f .…

We establish a central limit theorem for counting large continued fraction digits $(a_n)$, i.e. we count occurrences $\{a_n>b_n\}$, where $(b_n)$ is a sequence of positive integers. Our result improves a similar result by Philipp which…

The sensitivity conjecture of Nisan and Szegedy [CC '94] asks whether for any Boolean function $f$, the maximum sensitivity $s(f)$, is polynomially related to its block sensitivity $bs(f)$, and hence to other major complexity measures.…

We investigate the validity of the "Einstein relations" in the general setting of unimodular random networks. These are equalities relating scaling exponents: $d_w = d_f + \tilde{\zeta}$ and $d_s = 2 d_f/d_w$, where $d_w$ is the walk…

Many mathematical, man-made and natural systems exhibit a leading-digit bias, where a first digit (base 10) of 1 occurs not 11\% of the time, as one would expect if all digits were equally likely, but rather 30\%. This phenomenon is known…