Employing concepts from additive number theory, together with results on binary evaluations and partial series, we establish bounds on the density of 1’s in the binary expansions of real algebraic numbers. A central result is that if a real $y$ has algebraic degree $D\>1$, then the number $\#\left(\right|y|,N)$ of 1-bits in the expansion of $\left|y\right|$ through bit position $N$ satisfies $$\#\left(\right|y|,N)\>C{N}^{1/D}$$ for a positive number $C$ (depending on $y$) and sufficiently large $N$. This in itself establishes the transcendency...

Let $p$ and $q$ be two different prime integers such that $p\equiv q\equiv 3(mod8)$ with $(p/q)=1$, and $l$ a positive odd square-free integer relatively prime to $p$ and $q$. In this paper we investigate the unit groups of number fields $𝕃=\mathbb{Q}(\sqrt{2},\sqrt{p},\sqrt{q},\sqrt{-l})$.

We study the function $M_{\theta }\left(n\right)=\lfloor 1/{\theta }^{1/n}\rfloor$, where θ is a positive real number, ⌊·⌋ and · are the floor and fractional part functions, respectively. Nathanson proved, among other properties of $M_{\theta }$, that if log θ is rational, then for all but finitely many positive integers n, $M_{\theta }\left(n\right)=\lfloor n/log\theta -1/2\rfloor$. We extend this by showing that, without any condition on θ, all but a zero-density set of integers n satisfy $M_{\theta }\left(n\right)=\lfloor n/log\theta -1/2\rfloor$. Using a metric result of Schmidt, we show that almost all θ have asymptotically (log θ log x)/12 exceptional n ≤ x. Using...

Let λ denote Carmichael’s function, so λ(n) is the universal exponent for the multiplicative group modulo n. It is closely related to Euler’s φ-function, but we show here that the image of λ is much denser than the image of φ. In particular the number of λ-values to x exceeds $x/{\left(logx\right)}^{.36}$ for all large x, while for φ it is equal to $x/{\left(logx\right)}^{1+o\left(1\right)}$, an old result of Erdős. We also improve on an earlier result of the first author and Friedlander giving an upper bound for the distribution of λ-values.

We present a method that in certain sense stores the inverse of the stiffness matrix in $O(NlogN)$ memory places, where $N$ is the number of degrees of freedom and hence the matrix size. The setup of this storage format requires $O\left(N^{3/2}\right)$ arithmetic operations. However, once the setup is done, the multiplication of the inverse matrix and a vector can be performed with $O(NlogN)$ operations. This approach applies to the first order finite element discretization of linear elliptic and parabolic problems in triangular...

Assume $f_1,...,f_N$ a finite set of functions in $H^{\infty }\left(D\right)$, the space of bounded analytic functions on the open unit disc. We give a sufficient condition on a function $f$ in $H^{\infty }\left(D\right)$ to belong to the norm-closure of the ideal $I(f_1,...,f_N)$ generated by $f_1,...,f_N$, namely the property $$\left|f\right(z\left)\right|\le \alpha \left(\right|f_1\left(z\right)|+...+|f_N\left(z\right)\left|\right)\text{for}z\in D$$ for some function $\alpha$ : ${\mathbf{R}}_{+}\to {\mathbf{R}}_{+}$ satisfying ${lim}_{t\to 0}\alpha \left(t\right)/t=0.$ The main feature in the proof is an improvement in the contour-construction appearing in L. Carleson’s solution of the corona-problem. It is also shown that the property $$\left|f\left(z\right)\right|\le C\underset{1\le j\le N}{max}\left|f_j\left(z\right)\right|\text{for}z\in D$$ ...

By iterating the Bolyai-Rényi transformation $T\left(x\right)={(x+1)}^2(mod1)$, almost every real number $x\in [0,1)$ can be expanded as a continued radical expression $$x=-1+\sqrt{x_1+\sqrt{x_2+\cdots +\sqrt{x_n+\cdots }}}$$ with digits $x_n\in \{0,1,2\}$ for all $n\in \mathbb{N}$. For any real number $x\in [0,1)$ and digit $i\in \{0,1,2\}$, let $r_n(x,i)$ be the maximal length of consecutive $i$’s in the first $n$ digits of the Bolyai-Rényi expansion of $x$. We study the asymptotic behavior of the run-length function $r_n(x,i)$. We prove that for any digit $i\in \{0,1,2\}$, the Lebesgue measure of the set $$D\left(i\right)=\left\{x\in [0,1):\underset{n\to \infty }{lim}\frac{r_n(x,i)}{logn}=\frac{1}{log{\theta }_i}\right\}$$ is $1$, where ${\theta }_i=1+\sqrt{4i+1}$. We also obtain that the level set $$E_{\alpha }\left(i\right)=\left\{x\in [0,1):\underset{n\to \infty }{lim}\frac{r_n(x,i)}{logn}=\alpha \right\}$$ is of full Hausdorff...

We prove: If $A\left(n\right)$ and $G\left(n\right)$ denote the arithmetic and geometric means of the first $n$ positive integers, then the sequence $n\mapsto nA\left(n\right)/G\left(n\right)-(n-1)A(n-1)/G(n-1)$ $(n\ge 2)$ is strictly increasing and converges to $e/2$, as $n$ tends to $\infty$.