Related papers: On the behavior of binary block-counting functions…
Let $f=\sum_{n=1}^{\infty}a(n)q^{n}\in S_{k+1/2}(N,\chi_{0})$ be a non-zero cuspidal Hecke eigenform of weight $k+\frac{1}{2}$ and the trivial nebentypus $\chi_{0}$ where the Fourier coefficients $a(n)$ are real. Bruinier and Kohnen…
Let $s_{k}(n)$ denote the sum of digits of an integer $n$ in base $k$. Motivated by certain identities of Nieto, and Bateman and Bradley involving sums of the form $\sum_{i=0}^{2^{n}-1}(-1)^{s_{2}(i)}(x+i)^{m}$ for $m=n$ and $m=n+1$, we…
Given integers s and t, define a function phi_{s,t} on the space of all formal complex series expansions by phi_{s,t} (sum a_n x^n) = sum a_{sn+t} x^n. We define an integer r to be distinguished with respect to (s,t) if r and s are…
In the paper, I consider appearance of unit's digits in minor totals of a few integer sequences. The sequences include the sequence of even integers, sequence of odd integers and Faulhaber polynomial at $p = 2$. Application of difference…
Let $t$ be random and uniformly distributed in the interval $[T,2T]$, and consider the quantity $N(t+1/\log T) - N(t)$, a count of zeros of the Riemann zeta function in a box of height $1/\log T$. Conditioned on the Riemann hypothesis, we…
In this report, we show that all n-variable Boolean function can be represented as polynomial threshold functions (PTF) with at most $0.75 \times 2^n$ non-zero integer coefficients and give an upper bound on the absolute value of these…
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…
In this paper, we solve the following tri-additive $s$-functional inequalities \begin{eqnarray}\label{0.1} && \nonumber \| f(x+y, z-w, a+b) + f(x-y, z+w, a-b) \\ && \nonumber\qquad -2 f(x, z, a) + 2 f(x, w, b) -2f(y, z, b) +2 f(y, w, a)\|…
We investigate the $\phi^{2n}$ deformations of the O($N$)-symmetric (generalized) free theories with a flat boundary, where $n\geqslant 2$ is an integer. The generalized free theories refer to the $\Box^k$ free scalar theories with a…
We determine the possible masses and radii of the progenitors of white dwarfs in binaries from fits to detailed stellar evolution models and use these to reconstruct the mass-transfer phase in which the white dwarf was formed. We confirm…
We prove that there exists an absolute constant $\delta>0$ such any binary code $C\subset\{0,1\}^N$ tolerating $(1/2-\delta)N$ adversarial deletions must satisfy $|C|\le 2^{\text{poly}\log N}$ and thus have rate asymptotically approaching…
We consider two population models subject to the evolutionary forces of selection and mutation, the Moran model and the $\Lambda$-Wright-Fisher model. In such models the block counting process traces back the number of potential ancestors…
We prove the existence of functions $f$ in the Bloch space of the unit ball $\mathbb{B}_N$ of $\mathbb{C}^N$ with the property that, given any measurable function $\varphi$ on the unit sphere $\mathbb{S}_N$, there exists a sequence…
We introduce a parametrised family of maps $\{S_{\eta}\}_{\eta \in [1,2]}$, called symmetric doubling maps, defined on $[-1,1]$ by $S_\eta (x)=2x-d\eta$, where $d\in \{-1,0,1 \}$. Each map $S_\eta$ generates binary expansions with digits…
Let $0\leq q\leq1$ and $\mathbb{N}$ denotes the set of all positive integers. In this paper we will deal with it too the family $\mathcal{U}(x^q)$ of all regularly distributed set $X \subset \mathbb{N}$ whose ratio block sequence is…
A numerical semigroup is a sub-semigroup of the natural numbers that has a finite complement. The size of its complement is called the genus and the largest number in the complement is called its Frobenius number. We consider the set of…
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}):…
Error-correcting codes are known to define chiral 2d lattice CFTs where all the $U(1)$ symmetries are enhanced to $SU(2)$. In this paper, we extend this construction to a broader class of length-$n$ codes which define full (non-chiral) CFTs…
This work presents a comprehensive study of the properties of finite (0,1) binary systems from the mathematical viewpoint of quantum theory where a complex wavefunction $\psi_{n}$ is considered as an analogous probability measure. This is a…
Let $(\Omega,\mathcal{F},(\mathcal{F}_t)_{t \geq 0},\mathbb{P})$ be a filtered probability space satisfying the usual assumptions: it is usually not possible to extend to $\mathcal{F}_{\infty}$ (the $\sigma$-algebra generated by…