English
Related papers

Related papers: A note on univoque self-Sturmian numbers

200 papers

A strictly increasing sequence (n_k) of positive integers is said to be a Hilbertian Jamison sequence if for any bounded operator T on a separable Hilbert space such that the supremum over k of the norms ||T^{n_k}|| is finite, the set of…

Functional Analysis · Mathematics 2011-06-14 Tanja Eisner , Sophie Grivaux

On the twisted Fermat cubic, an elliptic divisibility sequence arises as the sequence of denominators of the multiples of a single rational point. We prove that the number of prime terms in the sequence is uniformly bounded. When the…

Number Theory · Mathematics 2010-04-14 Graham Everest , Ouamporn Phuksuwan , Shaun Stevens

For $b>1$ and $\alpha\beta$ a string of two digits in base $b$, let $K_1$ be the subsum of the harmonic series with only those integers having exactly one occurrence of $\alpha\beta$. We obtain a theoretical representation of such $K_1$…

Number Theory · Mathematics 2024-09-23 Jean-François Burnol

We define C sequential optimization numbers, where C is a k+1-tuple vector. We prove that the unsigned Stirling numbers of first kind are (0,1) sequential optimization numbers. Many achievements of the Stirling numbers of first kind can be…

Combinatorics · Mathematics 2023-01-06 Zile Hui

We consider sequences of finitely generated discrete subgroups Gamma_i=rho_i(Gamma) of a rank 1 Lie group G, where the representations rho_i are not necessarily faithful. We show that, for algebraically convergent sequences (Gamma_i),…

Group Theory · Mathematics 2007-08-21 Michael Kapovich

We study the properties of the sequence of words $(B_i)$, where $B_1 = 101$ and $B_{i+1} = B_i C_i$ for $i \geq 1$, where $C_i$ is $B_i$ with the first $i$ symbols removed, and the infinite binary sequence ${\bf b} = 10101101011011101…

Combinatorics · Mathematics 2026-05-11 Jeffrey Shallit

We introduce and study a new complexity function in combinatorics on words, which takes into account the smallest second occurrence time of a factor of an infinite word. We characterize the eventually periodic words and the Sturmian words…

Number Theory · Mathematics 2017-08-24 Yann Bugeaud , Dong Han Kim

We consider the sequential composite binary hypothesis testing problem in which one of the hypotheses is governed by a single distribution while the other is governed by a family of distributions whose parameters belong to a known set…

Information Theory · Computer Science 2022-03-30 Jiachun Pan , Yonglong Li , Vincent Y. F. Tan

Let $b\ge 2$ be an integer. Using Sturmian words we describe all irrational real numbers $\xi$ such that the image in $\mathbb{R}/\mathbb{Z}$ of the sequence $(\xi (-b)^n)_{n\ge 0}$ is contained in an interval of length…

Number Theory · Mathematics 2026-04-03 Qing Lu , Weizhe Zheng

For $\beta > 1$, a sequence $(c_n)_{n \geq 1} \in \mathbb{Z}^{\mathbb{N}^+}$ with $0 \leq c_n < \beta$ is the \emph{beta expansion} of $x$ with respect to $\beta$ if $x = \sum_{n = 1}^\infty c_n\beta^{-n}$. Defining $d_\beta(x)$ to be the…

Number Theory · Mathematics 2019-12-24 Jacob J. Stockton

We study the singular series associated to a cubic form with integer coefficients. If the number of variables is at least $10$, we prove the absolute convergence (and hence positivity) under the assumption of Davenport's Geometric…

Number Theory · Mathematics 2023-10-04 Christian Bernert

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

Given a positive integer $M$ and a real number $x\in(0,1]$, we call $q\in(1,M+1]$ a univoque simply normal base of $x$ if there exists a unique simply normal sequence $(d_i)\in\{0,1,\ldots,M\}^\mathbb N$ such that $x=\sum_{i=1}^\infty d_i…

Dynamical Systems · Mathematics 2022-07-18 Yu Hu , Yan Huang , Derong Kong

Let $n \in \mathbb{Z}_{>0}$. We prove that there exist a finite set $V$ and finitely many algebraic curves $T_1, \ldots, T_k$ with the following property: if $(x_1, \ldots, x_n, y)$ is an $(n+1)$-tuple of pairwise distinct singular moduli…

Number Theory · Mathematics 2025-02-26 Vahagn Aslanyan , Sebastian Eterović , Guy Fowler

In this work we attempt to generalize our result in [6] [7] for real rings (not just von Neumann regular real rings). In other words we attempt to characterize and construct real closure * of commutative unitary rings that are real. We also…

Rings and Algebras · Mathematics 2009-12-07 Jose Capco

We show that if $A=\{a_1,a_2,..., a_k\}$ is a monotone increasing set of numbers, and the differences of the consecutive elements are all distinct, then $|A+B|\geq c|A|^{1/2}|B|$ for any finite set of numbers $B$. The bound is tight up to…

Combinatorics · Mathematics 2007-05-23 J. Solymosi

The bijection between composition structures and random closed subsets of the unit interval implies that the composition structures associated with $S \cap [0,1]$ for a self-similar random set $S\subset {\mathbb R}_+$ are those which are…

Probability · Mathematics 2007-05-23 Alexander Gnedin , Jim Pitman

A differentiable function is pseudoconvex if and only if its restrictions over straight lines are pseudoconvex. A differentiable function depending on one variable, defined on some closed interval $[a,b]$ is pseudoconvex if and only if…

Optimization and Control · Mathematics 2019-11-19 Vsevolod Ivanov Ivanov

For a positive integer $n$, a graph with at least $n$ vertices is $n$-existentially closed or simply $n$-e.c. if for any set of vertices $S$ of size $n$ and any set $T\subseteq S$, there is a vertex $x\not\in S$ adjacent to each vertex of…

Combinatorics · Mathematics 2024-07-09 Andrea C. Burgess , Robert D. Luther , David A. Pike

We present several enumeration results holding in sets of words called neutral and which satisfy restrictive conditions on the set of possible extensions of nonempty words. These formulae concern return words and bifix codes. They…

Discrete Mathematics · Computer Science 2015-03-23 Francesco Dolce , Dominique Perrin
‹ Prev 1 4 5 6 7 8 10 Next ›