Related papers: On the behavior of binary block-counting functions…
We study the statistical properties of the wide binary population in the Galaxy field with projected separations larger than 200 AU by constructing the stellar angular two-point correlation function (2PCF) from a homogeneous sample of…
Let $d,n$ be positive integers and $S$ be an arbitrary set of positive integers. We say that $d$ is an $S$-divisor of $n$ if $d|n$ and gcd $(d,n/d)\in S$. Consider the $S$-convolution of arithmetical functions given by (1.1), where the sum…
The purpose of this note is to introduce a new approach to the study of one of the most basic and seemingly intractable problems in partition theory, namely the conjecture that the partition function $p(n)$ is equidistributed modulo 2. Our…
Let $G=(G_j)_{j\ge 0}$ be a strictly increasing linear recurrent sequence of integers with $G_0=1$ having characteristic polynomial $X^{d}-a_1X^{d-1}-\cdots-a_{d-1}X-a_d$. It is well known that each positive integer $\nu$ can be uniquely…
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...$…
Efficient scalar multiplication in Abelian groups (which is an important operation in public key cryptography) can be performed using digital expansions. Apart from rational integer bases (double-and-add algorithm), imaginary quadratic…
Given a Boolean function f, the (Hamming) weight wt(f) and the nonlinearity N(f) are well known to be important in designing functions that are useful in cryptography. The nonlinearity is expensive to compute, in general, so any shortcuts…
We review some probabilistic properties of the sum-of-digits function of random integers. New asymptotic approximations to the total variation distance and its refinements are also derived. Four different approaches are used: a classical…
Value distribution and uniqueness problems of difference operator of an entire function have been investigated in this article. This research shows that a finite ordered entire function $ f $ when sharing a set $ \mathcal{S}=\{\alpha(z),…
Let $\alpha=0.a_1a_2a_3\ldots$ be an irrational number in base $b>1$, where $0\leq a_i<b$. The number $\alpha \in (0,1)$ is a \textit{normal number} if every block $(a_{n+1}a_{n+2}\ldots a_{n+k})$ of $k$ digits occurs with probability…
Consider $\alpha \in \Q(i)$ satisfying $|\alpha| >1$. Let $\D = \{0,1,\ldots,|a_0|-1\}$, where $a_0$ is the independent coefficient of the minimal primitive polynomial of $\alpha$. We introduce a way of expanding complex numbers in base…
Sudderth, Wainwright, and Willsky have conjectured that the Bethe approximation corresponding to any fixed point of the belief propagation algorithm over an attractive, pairwise binary graphical model provides a lower bound on the true…
A new family of binary linear completely transitive (and, therefore, completely regular) codes is constructed. The covering radius of these codes is growing with the length of the code. In particular, for any integer r > 1, there exist two…
Benford's law states that many data sets have a bias towards lower leading digits (about $30\%$ are 1s). There are numerous applications, from designing efficient computers to detecting tax, voter and image fraud. It's important to know…
Assume that $g(t)\geq 0$, and $$\dot{g}(t)\leq -\gamma(t)g(t)+\alpha(t,g(t))+\beta(t),\ t\geq 0;\quad g(0)=g_0;\quad \dot{g}:=\frac{dg}{dt}, $$ on any interval $[0,T)$ on which $g$ exists and has bounded derivative from the right,…
In this paper, we consider the general divisor functions over Piatetski-Shapiro sequences. We can give some general results which contain some special divisor functions. Precisely, we extend the divisor problem over Piatetski-Shapiro…
The scaled standard Wigner matrix (symmetric with mean zero, variance one i.i.d. entries), and its limiting eigenvalue distribution, namely the semi-circular distribution, has attracted much attention. The $2k$th moment of the limit equals…
We pursue a systematic study of the following problem. Let f:{0,1}^n -> {0,1} be a (usually monotone) Boolean function whose behaviour is well understood when the input bits are identically independently distributed. What can be said about…
The Fourier-Bessel expansion of a function on a circular disc yields a simple series representation for the end-to-end probability distribution function w(R,phi) encountered in a planar persistent random walk, where the direction taken in a…
We analyze a deterministic form of the random walk on the integer line called the {\em liar machine}, similar to the rotor-router model, finding asymptotically tight pointwise and interval discrepancy bounds versus random walk. This…