English
Related papers

Related papers: Additive Number Theory via Approximation by Regula…

200 papers

Both topos theory and automata theory are known for their multi-faceted nature and relationship with topology, algebra, logic, and category theory. This paper aims to clarify the topos-theoretic aspects of automata theory, particularly…

Formal Languages and Automata Theory · Computer Science 2024-11-19 Ryuya Hora

Each natural number can be associated with some tree graph. Namely, a natural number $n$ can be factorized as $$ n = p_1^{\alpha_1}\ldots p_k^{\alpha_k},$$ where $p_i$ are distinct prime numbers. Since $\alpha_i$ are naturals, they can be…

Number Theory · Mathematics 2022-10-13 Vitalii V. Iudelevich

We generalize Dirichlet's diophantine approximation theorem to approximating any real number $\alpha$ by a sum of two rational numbers $\frac{a_1}{q_1} + \frac{a_2}{q_2}$ with denominators $1 \leq q_1, q_2 \leq N$. This turns out to be…

Number Theory · Mathematics 2007-05-23 Tsz Ho Chan

For $n \geq 3$, an asymptotic formula is derived for the number of representations of a sufficiently large natural number $N$ as a sum of $r = 2^n + 1$ summands, each of which is an $n$-th power of natural numbers $x_i$, $i = \overline{1,…

Number Theory · Mathematics 2024-11-12 Zarullo Rakhmonov , Firuz Rakhmonov

The theory of finite automata concerns itself with words in a free monoid together with concatenation and without further structure. There are, however, important applications which use alphabets which are structured in some sense. We…

Formal Languages and Automata Theory · Computer Science 2026-02-11 Hugo Bazille , Uli Fahrenberg

A set of integers is $S$-recognizable in an abstract numeration system $S$ if the language made up of the representations of its elements is accepted by a finite automaton. For abstract numeration systems built over bounded languages with…

Discrete Mathematics · Computer Science 2008-09-16 Emilie Charlier , Michel Rigo , Wolfgang Steiner

A well known result of Newman says that upto a limit, multiples of $3$ with even number of 1's in binary representation always exceed multiples of $3$ with odd number of 1's. The phenomenon of preponderance of even number of 1's is now…

Number Theory · Mathematics 2015-11-11 Sai Teja Somu

We consider the question of approximating any real number $\alpha$ by sums of $n$ rational numbers $\frac{a_1}{q_1} + \frac{a_2}{q_2} + ... + \frac{a_n}{q_n}$ with denominators $1 \leq q_1, q_2, ..., q_n \leq N$. This leads to an inquiry on…

Number Theory · Mathematics 2007-05-23 Tsz Ho Chan

For each integer $x$, the $x$-th generalized pentagonal number is denoted by $P_5(x)=(3x^2-x)/2$. Given odd positive integers $a,b,c$ and non-negative integers $r,s$, we employ the theory of ternary quadratic forms to determine when the sum…

Number Theory · Mathematics 2021-02-17 Hai-Liang Wu , Li-Yuan Wang

In the base phi representation any natural number is written uniquely as a sum of powers of the golden mean with coefficients 0 and 1, where it is required that the product of two consecutive digits is always 0. In this self-contained paper…

Number Theory · Mathematics 2020-02-06 F. Michel Dekking

We call an $\alpha \in \mathbb{R}$ regainingly approximable if there exists a computable nondecreasing sequence $(a_n)_n$ of rational numbers converging to $\alpha$ with $\alpha - a_n < 2^{-n}$ for infinitely many $n \in \mathbb{N}$. We…

Logic · Mathematics 2026-02-11 Peter Hertling , Rupert Hölzl , Philip Janicki

Given a real number $0.a_1a_2 a_3\dots$ that is normal to base $b$, we examine increasing sequences $n_i$ so that the number $0.a_{n_1}a_{n_2}a_{n_3}\dots$ are normal to base $b$. Classically it is known that if the $n_i$ form an arithmetic…

Number Theory · Mathematics 2016-07-14 Joseph Vandehey

Abstract numeration systems encode natural numbers using radix ordered words of an infinite regular language and linear recurrence sequences play a key role in their valuation. Sequence automata, which are deterministic finite automata with…

Formal Languages and Automata Theory · Computer Science 2025-05-05 Olivier Carton , Jean-Michel Couvreur , Martin Delacourt , Nicolas Ollinger

We survey facts mostly emerging from the seminal results of Alan Cobham obtained in the late sixties and early seventies. We do not attempt to be exhaustive but try instead to give some personal interpretations and some research directions.…

Formal Languages and Automata Theory · Computer Science 2012-04-27 Michel Rigo

We present a base class of automata that induce a numeration system and we give an algorithm to give the n-th word in the language of the automaton when the expansion of n in the induced numeration system is feeded to the automaton.…

Computation and Language · Computer Science 2007-05-23 J. F. J. Laros

Let $\alpha=0.a_1a_2a_3\ldots$ be an irrational number in base $b>1$, where $0\leq a_i<b$. The number $\alpha \in (0,1)$ is a \textit{normal number} if every block $(a_{n+1}a_{n+2}\ldots a_{n+k})$ of $k$ digits occurs with probability…

General Mathematics · Mathematics 2023-01-26 N. A. Carella

The Operator axioms have produced new real numbers with new operators. New operators naturally produce new equations and thus extend the traditional mathematical models which are selected to describe various scientific rules. So new…

Numerical Analysis · Computer Science 2021-02-08 Pith Peishu Xie

There are numerous ways to represent real numbers. We may use, e.g., Cauchy sequences, Dedekind cuts, numerical base-10 expansions, numerical base-2 expansions and continued fractions. If we work with full Turing computability, all these…

Logic · Mathematics 2020-03-30 Ivan Georgiev , Lars Kristiansen , Frank Stephan

Mathematical theorems are human knowledge able to be accumulated in the form of symbolic representation, and proving theorems has been considered intelligent behavior. Based on the BHK interpretation and the Curry-Howard isomorphism, proof…

Neural and Evolutionary Computing · Computer Science 2016-04-18 Li-An Yang , Jui-Pin Liu , Chao-Hong Chen , Ying-ping Chen

Shnirel'man's inequality and Shnirel'man's basis theorem are fundamental results about sums of sets of positive integers in additive number theory. It is proved that these results are inherently order-theoretic and extend to partially…

Number Theory · Mathematics 2025-05-02 Melvyn B. Nathanson