Related papers: On a problem of countable expansions
Each $x\in (0,1]$ can be uniquely expanded as a power-2-decaying Gauss-like expansion, in the form of \begin{equation*} x=\sum_{i=1}^{\infty}2^{-(d_1(x)+d_2(x)+\cdots+d_i(x))},\qquad d_i(x)\in \mathbb{N}. \end{equation*} Let…
We construct a sieve that enumerates rational ``imbalances'' of the form $(p-q)/(p+q)$ for integers $p\ge2$ and $1\le q<p$, ordered lexicographically by $(p,q)$. Each imbalance is reduced to lowest terms, and we record the sequence of…
A set is primitive if no element of the set divides another. We consider primitive sets of monic polynomials over a finite field and find natural generalizations of many of the results known for primitive sets of integers. In particular we…
Usually when solving differential or difference equations via series solutions one encounters divergent series in which the coefficients grow like a factorial. Surprisingly, in the $q$-world the $n$th coefficient is often of the size…
In this work we proof the following theorem which is, in addition to someother lemmas, our main result:\noindent \textbf{theorem}. Let$\ X=\{ ( x\_{1}\text{, }%t\_{1}) \text{, }( x\_{2}\text{, }t\_{2}) \text{, ..., }(x\_{n}\text{,…
Let $n$ be a positive integer. Denote by $\mathrm{PG}(n,q)$ the $n$-dimensional projective space over the finite field $\mathbb{F}_q$ of order $q$. A blocking set in $\mathrm{PG}(n,q)$ is a set of points that has non-empty intersection with…
Minimal codes are linear codes where all non-zero codewords are minimal, i.e., whose support is not properly contained in the support of another codeword. The minimum possible length of such a $k$-dimensional linear code over $\mathbb{F}_q$…
For a real number $q>1$ and a positive integer $m$, let $Y_m(q):={\sum_{i=0}^n\epsilon_i q^i:\; \epsilon_i\in \{0, \pm 1,..., \pm m\}, n=0, 1,...}.$ In this paper, we show that $Y_m(q)$ is dense in ${\Bbb R}$ if and only if $q<m+1$ and $q$…
A. Boudaoud asked whether every unlimited integer is a sum of a limited integer and a product of two unlimited integers. Assuming Dickson's Conjecture, the answer is negative. The erroneous proof of claim (2) on page 5 of the published…
Infinite exponential sequences of distinct prime numbers of the form $\lfloor a c^{n^d}+b\rfloor$, $n\geq 0$, are proved to exist for well chosen real constants $a>0$, $b$, $c>1$, $d>1$, assuming Cramer's conjecture on prime gaps. There is…
For $q \in (0, 1)$, the deformed exponential function $f(x) = \sum_{n \geq 1} x^n q^{n(n-1)/2}/n!$ is known to have infinitely many simple and negative zeros $\{x_k(q)\}_{k \geq 1}$. In this paper, we analyze the series expansions of…
Let $b \ge 2$ be an integer and $\xi$ an irrational real number. We prove that, if the irrationality exponent of $\xi$ is equal to $2$ or slightly greater than $2$, then the $b$-ary expansion of $\xi$ cannot be `too simple', in a suitable…
Let $1\leq a<q$ be a pair of small integers such that $\gcd(a,q)=1$ and let $x>1$ be a large number. This note discusses the existence of a short sequence of primes $p\equiv a\bmod q$ between two squares $x^2$ and $(x+1)^2$.
We consider series of the form $$ \frac{p}{q} +\sum_{j=2}^\infty \frac{1}{x_j}, $$ where $x_1=q$ and the integer sequence $(x_n)$ satisfies a certain non-autonomous recurrence of second order, which entails that $x_n|x_{n+1}$ for $n\geq 1$.…
In this paper we study the problem of counting Salem numbers of fixed degree. Given a set of disjoint intervals $I_1,\ldots, I_{k}\subset \left[0;\pi\right]$, $1\leq k\leq m$ let $Sal_{m,k}(Q,I_1,\ldots,I_{k})$ denote the set of ordered…
Let $K$ be an imaginary quadratic field, and let $\mathcal{O}_{K,f}$ be an order in $K$ of conductor $f\geq 1$. Let $E$ be an elliptic curve with CM by $\mathcal{O}_{K,f}$, such that $E$ is defined by a model over $\mathbb{Q}(j_{K,f})$,…
We give a necessary and sufficient condition for two Hopf algebras presented as central extensions to be isomorphic, in a suitable setting. We then study the question of isomorphism between the Hopf algebras constructed in 0707.0070v1 as…
Given a positive rational number $n/d$ with $d$ odd, its odd greedy expansion starts with the largest odd denominator unit fraction at most $n/d$, adds the largest odd denominator unit fraction so the sum is at most $n/d$, and continues as…
We use entropy rates and Schur concavity to prove that, for every integer k >= 2, every nonzero rational number q, and every real number alpha, the base-k expansions of alpha, q+alpha, and q*alpha all have the same finite-state dimension…
We study M-separability as well as some other combinatorial versions of separability. In particular, we show that the set-theoretic hypothesis b=d implies that the class of selectively separable spaces is not closed under finite products,…