English
Related papers

Related papers: Ternary expansions of powers of 2

200 papers

Motivated by works on extension sets in standard domains we introduce a notion of the Carath\'eodory set that seems better suited for the methods used in proofs of results on characterization of extension sets. A special stress is put on a…

Complex Variables · Mathematics 2020-02-19 Lukasz Kosinski , Wlodzimierz Zwonek

We introduce a family of maps generating continued fractions where the digit $1$ in the numerator is replaced cyclically by some given non-negative integers $(N_1,\ldots,N_m)$. We prove the convergence of the given algorithm, and study the…

Dynamical Systems · Mathematics 2021-12-09 Karma Dajani , Niels Langeveld

The one-dimensional Dirac operator \begin{equation*} L = i \begin{pmatrix} 1 & 0 \\ 0 & -1 \end{pmatrix} \frac{d}{dx} +\begin{pmatrix} 0 & P(x) \\ Q(x) & 0 \end{pmatrix}, \quad P,Q \in L^2 ([0,\pi]), \end{equation*} considered on $[0,\pi]$…

Spectral Theory · Mathematics 2013-12-10 Berkay Anahtarci , Plamen Djakov

In this paper, we study linear forms \[\lambda = \beta_1\mathrm{e}^{\alpha_1}+\cdots+\beta_m\mathrm{e}^{\alpha_m},\] where $\alpha_i$ and $\beta_i$ are algebraic numbers. An explicit lower bound for the absolute value of $\lambda$ is…

Number Theory · Mathematics 2022-05-17 Cheng-Chao Huang

We consider equally-weighted Cantor measures $\mu_{q,b}$ arising from iterated function systems of the form ${b^{-1}(x+i)}$, $i=0,1,...,q-1$, where $q<b$. We classify the $(q,b)$ so that they have infinitely many mutually orthogonal…

Functional Analysis · Mathematics 2013-09-26 Xin-Rong Dai , Xing-Gang He , Chun-Kit Lai

We obtain the following results about the avoidance of ternary formulas. Up to renaming of the letters, the only infinite ternary words avoiding the formula $ABCAB.ABCBA.ACB.BAC$ (resp. $ABCA.BCAB.BCB.CBA$) have the same set of recurrent…

Discrete Mathematics · Computer Science 2018-09-26 Pascal Ochem , Matthieu Rosenfeld

Let $$\lambda(s)=\sum_{n=0}^\infty\frac1{(2n+1)^s},$$ $$\beta(s)=\sum_{n=0}^\infty\frac{(-1)^{n}}{(2n+1)^s},$$ and $$\eta(s)=\sum_{n=1}^\infty\frac{(-1)^{n-1}}{n^s}$$ be the Dirichlet lambda function, its alternating form, and the Dirichlet…

Number Theory · Mathematics 2019-06-28 Su Hu , Min-Soo Kim

Berry and Tabor conjectured in 1977 that spectra of generic integrable quantum systems have the same local statistics as a Poisson point process. We verify their conjecture in the case of the two-point spectral density for a quantum…

Number Theory · Mathematics 2026-01-07 Wooyeon Kim , Jens Marklof , Matthew Welsh

We have primarily obtained three results on numbers of the form $p + 2^k$. Firstly, we have constructed many arithmetic progressions, each of which does not contain numbers of the form $p + 2^k$, disproving a conjecture by Erd\H{o}s as Chen…

Number Theory · Mathematics 2024-02-13 Yuda Chen , Xiangjun Dai , Huixi Li

The authors have recently obtained a lower bound of the Hausdorff dimension of the sets of vectors $(x_1, \ldots, x_d)\in [0,1)^d$ with large Weyl sums, namely of vectors for which $$ \left| \sum_{n=1}^{N}\exp(2\pi i (x_1 n+\ldots +x_d…

Classical Analysis and ODEs · Mathematics 2019-07-10 Changhao Chen , Igor E. Shparlinski

For $q>1$ we consider expansions in base $q$ over the alphabet $\{0,1,q\}$. Let $\mathcal{U}_q$ be the set of $x$ which have a unique $q$-expansions. For $k=2, 3,\cdots,\aleph_0$ let $\mathcal{B}_k$ be the set of bases $q$ for which there…

Number Theory · Mathematics 2018-07-23 Karma Dajani , Kan Jiang , Derong Kong , Wenxia Li

Deterministic and probabilistic communication protocols are introduced in which parties can exchange the values of polynomials (rather than bits in the usual setting). It is established a sharp lower bound $2n$ on the communication…

Computational Complexity · Computer Science 2007-10-16 Dima Grigoriev

In a paper entitled Binary lambda calculus and combinatory logic, John Tromp presents a simple way of encoding lambda calculus terms as binary sequences. In what follows, we study the numbers of binary strings of a given size that represent…

Logic in Computer Science · Computer Science 2014-01-03 Katarzyna Grygiel , Pierre Lescanne

Let $\theta(n)$ denote the number of permutations of $\{1,2,\ldots,n\}$ that do not contain a 3-term arithmetic progression as a subsequence. Such permutations are known as 3-free permutations. We present a dynamic programming algorithm to…

Combinatorics · Mathematics 2017-12-04 Bill Correll, , Randy W. Ho

We consider a couple of versions of classical Kurosh problem (whether there is an infinite-dimensional algebraic algebra?) for varieties of linear multioperator algebras over a field. We show that, given an arbitrary signature, there is a…

Rings and Algebras · Mathematics 2009-06-01 Dmitri Piontkovski

Using discretized orthogonal systems (curvature line systems) with periodicity, created using Darboux transformations and their permutability, we have discrete and semi-discrete k-dimensional isothermic tori which are full in n-dimensional…

Differential Geometry · Mathematics 2026-03-27 K. Leschke , F. Pedit , W. Rossman

The recently confirmed Dejean's conjecture about the threshold between avoidable and unavoidable powers of words gave rise to interesting and challenging problems on the structure and growth of threshold words. Over any finite alphabet with…

Formal Languages and Automata Theory · Computer Science 2011-08-19 Irina A. Gorbunova , Arseny M. Shur

The upper bound for asymptotic behavior of the coefficients of expansion of the evolution operator kernel in powers of the time interval $\Dt$ was obtained. It is found that for the nonpolynomial potentials the coefficients may increase as…

High Energy Physics - Theory · Physics 2009-10-28 V. A. Slobodenyuk

In this paper analyzes \textit{The Erd\H{o}s-Straus conjecture} asserts that $f$$(n)$ $>$ 0 for every $n$ $\geq$ 2, where $f(n)$ indicates the number of solutions to the Diophantine Equation…

General Mathematics · Mathematics 2016-09-02 Elias Rios

Motivated by algorithmic problems from combinatorial group theory we study computational properties of integers equipped with binary operations +, -, z = x 2^y, z = x 2^{-y} (the former two are partial) and predicates < and =. Notice that…

Group Theory · Mathematics 2010-06-15 Alexei G. Myasnikov , Alexander Ushakov , Dong Wook Won