English
Related papers

Related papers: A Normality Conjecture on Rational Base Number Sys…

200 papers

By applying inter-universal Teichm\"uller theory and its slight modification over the rational number field, we prove new Diophantine results towards effective abc inequalities and the generalized Fermat equations. For coprime integers $a,…

Number Theory · Mathematics 2025-03-20 Zhong-Peng Zhou

Zaremba's conjecture (1971) states that every positive integer number can be represented as a denominator (continuant) of a finit continued fraction with all partial quotients being bounded by an absolute constant A. Recently (in 2011)…

Number Theory · Mathematics 2015-06-22 I. D. Kan

The theory of normality for base $g$ expansions of real numbers in $[0,1)$ is rich and well developed. Similar theories have been developed for many other numeration systems, such as the regular continued fraction expansion,…

Dynamical Systems · Mathematics 2025-12-02 Sohail Farhangi , Bill Mance

Given a finitely generated multiplicative subgroup of rational numbers $\Gamma$, assuming the Generalized Riemann Hypothesis, we determine an asymptotic formula for average over prime numbers, powers of the order of the reduction group…

Number Theory · Mathematics 2016-02-04 Cihan Pehlivan

An ideal $I$ in a Noetherian ring is called \textit{normal} if $I^n$ is integrally closed for all $n \geq 1$. Zariski proved that in two-dimensional regular local rings, every integrally closed ideal is normal. However, in dimension three…

Commutative Algebra · Mathematics 2026-02-03 Maki Ataka , Naoyuki Matsuoka

Sequences of numbers (either natural integers, or integers or rational) of level $k \in \mathbb{N}$ have been defined in \cite{Fra05,Fra-Sen06} as the sequences which can be computed by deterministic pushdown automata of level $k$. This…

Formal Languages and Automata Theory · Computer Science 2023-10-12 G. Sénizergues

The $1/3$-$2/3$ Conjecture, originally formulated in 1968, is one of the best-known open problems in the theory of posets, stating that the balance constant (a quantity determined by the linear extensions) of any non-total order is at least…

Combinatorics · Mathematics 2024-09-17 Christian Gaetz , Yibo Gao

In this short note, we give a proof, conditional on the Generalized Riemann Hypothesis, that there exist numbers x which are normal with respect to the continued fraction expansion but not to any base b expansion. This partially answers a…

Number Theory · Mathematics 2015-12-02 Joseph Vandehey

The geometric and algebraic theory of monomial ideals and multigraded modules is initiated over real-exponent polynomial rings and, more generally, monoid algebras for real polyhedral cones. The main results include the generalization of…

Commutative Algebra · Mathematics 2025-11-11 Ezra Miller

Consider the recursive relation generating a new positive integer $n_{\ell +1}$ from the positive integer $n_{\ell }$ according to the following simple rules: if the integer $n_{\ell }$ is odd, $n_{\ell +1}=3n_{\ell }+1$; if the integer…

General Mathematics · Mathematics 2023-03-16 Mario Bruschi , Francesco Calogero

Recently, Cilleruelo, Luca, & Baxter proved, for all bases b >= 5, that every natural number is the sum of at most 3 natural numbers whose base-b representation is a palindrome. However, the cases b = 2, 3, 4 were left unresolved. We prove,…

Formal Languages and Automata Theory · Computer Science 2017-09-01 Aayush Rajasekaran , Jeffrey Shallit , Tim Smith

A prefix normal word is a binary word with the property that no substring has more 1s than the prefix of the same length. This class of words is important in the context of binary jumbled pattern matching. In this paper we present results…

Formal Languages and Automata Theory · Computer Science 2014-06-23 Péter Burcsi , Gabriele Fici , Zsuzsanna Lipták , Frank Ruskey , Joe Sawada

In this paper we recall a non-standard construction of the Borel sigma-algebra B in [0,1] and construct a family of measures (in particular, Lebesgue measure) in B by a completely non-topological method. This approach, that goes back to…

Number Theory · Mathematics 2015-10-02 Daniel Pellegrino

We prove lower bounds on the length of regular expressions for finite languages by methods from arithmetic circuit complexity. First, we show a reduction: the length of a regular expression for a language $L\subseteq \{0,1\}^n$ is bounded…

Formal Languages and Automata Theory · Computer Science 2021-01-01 Ehud Cseresnyes , Hannes Seiwert

A word is called $\beta$-free if it has no factors of exponent greater than or equal to $\beta$. The repetition threshold $\mathrm{RT}(k)$ is the infimum of the set of all $\beta$ such that there are arbitrarily long $k$-ary $\beta$-free…

Combinatorics · Mathematics 2018-10-05 James D. Currie , Lucas Mol , Narad Rampersad

In this work, it is proved that a set of numbers closed under addition and whose representations in a rational base numeration system is a rational language is not a finitely generated additive monoid. A key to the proof is the definition…

Formal Languages and Automata Theory · Computer Science 2013-10-04 Victor Marsault , Jacques Sakarovitch

We give a construction of a real number that is normal to all integer bases and continued fraction normal. The computation of the first n digits of its continued fraction expansion performs in the order of n^4 mathematical operations. The…

Number Theory · Mathematics 2017-04-13 Verónica Becher , Sergio A. Yuhjtman

This paper studies a formalisation of intuitionistic logic by Negri and von Plato which has general introduction and elimination rules. The philosophical importance of the system is expounded. Definitions of `maximal formula', `segment' and…

Logic · Mathematics 2021-10-20 Nils Kürbis

A real number $x$ is absolutely normal if, for every base $b\ge 2$, every two equally long strings of digits appear with equal asymptotic frequency in the base-$b$ expansion of $x$. This paper presents an explicit algorithm that generates…

Data Structures and Algorithms · Computer Science 2020-07-17 Jack H. Lutz , Elvira Mayordomo

A semantics is given to possibilistic logic, a logic that handles weighted classical logic formulae, and where weights are interpreted as lower bounds on degrees of certainty or possibility, in the sense of Zadeh's possibility theory. The…

Artificial Intelligence · Computer Science 2013-03-26 Jerome Lang , Didier Dubois , Henri Prade