English
Related papers

Related papers: Critical bases for ternary alphabets

200 papers

Let $w$ be any word over the alphabet $\{0,1,\ldots, q-1\}$, and denote by $h$ either a polynomial of degree $d\geq 1$ or $h: n\mapsto m^n$ for a fixed $m$. Furthermore, denote by $e_q(w;h(n))$ the number of occurrences of $w$ as a subword…

Number Theory · Mathematics 2017-07-06 Hajime Kaneko , Thomas Stoll

The \textit{ternary digits of $2^n$} are a finite sequence of 0s, 1s, and 2s. It is a natural question to ask whether the frequency of any string of 0s, 1s, and 2s in this sequence approaches the same limit for all strings of the same…

Number Theory · Mathematics 2025-11-07 Christian Roettger , Xuyi Ren

Let $Q=(q_n)_{n=1}^\infty$ be a sequence of bases with $q_i\ge 2$. In the case when the $q_i$ are slowly growing and satisfy some additional weak conditions, we provide a construction of a number whose $Q$-Cantor series expansion is both…

Number Theory · Mathematics 2014-09-19 Dylan Airey , Bill Mance , Joseph Vandehey

It is known that in the lattice of normal extensions of the logic KTB there are unique logics of codimensions 1 and 2, namely, the logic of a single reflexive point, and the logic of the total relation on two points. A natural question…

Logic · Mathematics 2021-10-19 James Koussas , Tomasz Kowalski , Yutaka Miyazaki , Michael Stevens

We prove that the `connective constant' for ternary square-free words is at least $2^{1/17} = 1.0416 ... $, improving on Brinkhuis and Brandenburg's lower bounds of $2^{1/24}=1.0293 ...$ and $2^{1/22}=1.032 ...$ respectively. This is the…

Combinatorics · Mathematics 2007-05-23 Doron Zeilberger

Paul Erdos asked how frequently the ternary expansion of 2^n omits the digit 2. He conjectured this happens only for finitely many values of n. We generalize this question to consider iterates of two discrete dynamical systems. The first is…

Dynamical Systems · Mathematics 2014-02-26 Jeffrey C. Lagarias

We compute the Chekanov-Eliashberg contact homology of what we call the Legendrian closure of a positive braid. We also construct an augmentation for each such link diagram. Then we apply the monodromy techniques established in an earlier…

Geometric Topology · Mathematics 2007-05-23 Tamás Kálmán

Any finite word $w$ of length $n$ contains at most $n+1$ distinct palindromic factors. If the bound $n+1$ is reached, the word $w$ is called rich. The number of rich words of length $n$ over an alphabet of cardinality $q$ is denoted…

Combinatorics · Mathematics 2019-03-26 Josef Rukavicka

In this paper, our main focus is expressing real numbers on the non-integer bases. We denote those bases as $\beta$'s, which is also a real number and $\beta \in (1,2)$. This project has 3 main parts. The study of expansions of real numbers…

General Mathematics · Mathematics 2024-12-17 Vorashil Farzaliyev

Let $\UT_n(q)$ denote the group of unipotent $n\times n$ upper triangular matrices over a field with $q$ elements. The degrees of the complex irreducible characters of $\UT_n(q)$ are precisely the integers $q^e$ with $0\leq e\leq \lfloor…

Representation Theory · Mathematics 2011-09-13 Eric Marberg

Let $q\in(1,2)$ and $x\in[0,\frac1{q-1}]$. We say that a sequence $(\varepsilon_i)_{i=1}^{\infty}\in\{0,1\}^{\mathbb{N}}$ is an expansion of $x$ in base $q$ (or a $q$-expansion) if \[ x=\sum_{i=1}^{\infty}\varepsilon_iq^{-i}. \] For any…

Number Theory · Mathematics 2014-10-27 Simon Baker , Nikita Sidorov

In a landmark paper on arithmetical properties of Lambert series, Erd\H{o}s proved that $\sum_{n=1}^{\infty} \frac{1}{2^{n} - 1}$ is irrational. This value $E$ is now referred to as the Erd\H{o}s-Borwein constant. Crandall, in 2012, studied…

Number Theory · Mathematics 2026-05-26 John M. Campbell

Motivated by Erd\H{o}s' ternary conjecture and by recent work of Cui--Ma--Jiang [``Geometric progressions meet Cantor sets'', \textit{Chaos Solitons Fractals} \textbf{163} (2022), 112567.] on intersections between geometric progressions and…

Number Theory · Mathematics 2025-12-23 Diego Marques , Pavel Trojovsky

The Jacobi-Trudi formula implies some interesting quadratic identities for characters of representations of $gl_n$. Earlier work of Kirillov and Reshetikhin proposed a generalization of these identities to the other classical Lie algebras,…

Quantum Algebra · Mathematics 2016-09-07 Michael Kleber

In this paper, we investigate cylindrical extensions of critical Sobolev type (improved Hardy) inequalities and identities in the style of Badiale-Tarantello [BT02], which in a special case give a critical Hardy inequality and its stability…

Analysis of PDEs · Mathematics 2025-07-22 Michael Ruzhansky , Yerkin Shaimerdenov , Nurgissa Yessirkegenov

Given a positive integer $M$ and $q \in (1, M+1]$ we consider expansions in base $q$ for real numbers $x \in \left[0, {M}/{q-1}\right]$ over the alphabet $\{0, \ldots, M\}$. In particular, we study some dynamical properties of the natural…

Dynamical Systems · Mathematics 2020-10-01 Rafael Alcaraz Barrera

Quasi-characters are vector-valued modular functions having an integral, but not necessarily positive, q-expansion. Using modular differential equations, a complete classification has been provided in arXiv:1810.09472 for the case of two…

High Energy Physics - Theory · Physics 2020-05-20 Sunil Mukhi , Rahul Poddar , Palash Singh

We establish asymptotic formulae for the number of biquadratic number fields of bounded discriminant that can be embedded into a quaternionic or a dihedral extension. To prove these results, we express the solvability of these inverse…

Number Theory · Mathematics 2025-06-27 Louis M. Gaudet , Siman Wong

We study the Cantor real base numeration system which is a common generalization of two positional systems, namely the Cantor system with a sequence of integer bases and the R\'enyi system with one real base. We focus on the so-called…

Number Theory · Mathematics 2024-02-05 Zuzana Masáková , Edita Pelantová

We study the properties of the ternary infinite word p = 012102101021012101021012 ... , that is, the fixed point of the map h:0->01, 1->21, 2->0. We determine its factor complexity, critical exponent, and prove that it is 2-balanced. We…

Discrete Mathematics · Computer Science 2022-06-07 James Currie , Pascal Ochem , Narad Rampersad , Jeffrey Shallit