English
Related papers

Related papers: Constructions of normal numbers with infinitely ma…

200 papers

Let $G$ be a countable cancellative amenable semigroup and let $(F_n)$ be a (left) F{\o}lner sequence in $G$. We introduce the notion of an $(F_n)$-normal element of $\{0,1\}^G$. When $G$ = $(\mathbb N,+)$ and $F_n = \{1,2,...,n\}$, the…

Dynamical Systems · Mathematics 2020-04-13 Vitaly Bergelson , Tomasz Downarowicz , Michał Misiurewicz

A Lucas sequence is a sequence of the general form $v_n = (\phi^n - \bar{\phi}^n)/(\phi-\bar{\phi})$, where $\phi$ and $\bar{\phi}$ are real algebraic integers such that $\phi+\bar{\phi}$ and $\phi\bar{\phi}$ are both rational. Famous…

Number Theory · Mathematics 2017-08-30 Clemens Heuberger , Stephan Wagner

We consider compositions of natural numbers when there are different types of each natural number. Several recursions as well as some closed formulas for the number of compositions is derived. We also find its relationships with some known…

Combinatorics · Mathematics 2010-12-17 Milan Janjic

A More Sums Than Differences (MSTD) set is a set of integers A contained in {0, ..., n-1} whose sumset A+A is larger than its difference set A-A. While it is known that as n tends to infinity a positive percentage of subsets of {0, ...,…

Number Theory · Mathematics 2013-03-05 Steven J. Miller , Sean Pegado , Luc Robinson

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

Given two sets of positive integers $A$ and $B$, let $AB := \{ab : a \in A,\, b \in B\}$ be their product set and put $A^k := A \cdots A$ ($k$ times $A$) for any positive integer $k$. Moreover, for every positive integer $n$ and every…

Number Theory · Mathematics 2020-12-15 Carlo Sanna

Let $G$ be a connected undirected graph on $n$ vertices with no loops but possibly multiedges. Given an arithmetical structure $(\textbf{r}, \textbf{d})$ on $G$, we describe a construction which associates to it a graph $G'$ on $n-1$…

Combinatorics · Mathematics 2021-06-10 Christopher Keyes , Tomer Reiter

We describe a theory of finite sets, and investigate the analogue of Dedekind's theory of natural number systems (simply infinite systems) in this theory. Unlike the infinitary case, in our theory, natural number systems come in differing…

Logic · Mathematics 2008-08-08 J. P. Mayberry , Richard Pettigrew

We derive some new finite sums involving the sequence $s_{2}\left(n\right),$ the sum of digits of the expansion of $n$ in base $2.$ These functions allow us to generalize some classical results obtained by Allouche, Shallit and others.

Number Theory · Mathematics 2017-10-20 C. Vignat , T. Wakhare

A new family of binary linear completely transitive (and, therefore, completely regular) codes is constructed. The covering radius of these codes is growing with the length of the code. In particular, for any integer r > 1, there exist two…

Information Theory · Computer Science 2013-03-12 J. Rifa , V. Zinoviev

A graph $G$ is $\textit{universal}$ for a (finite) family $\mathcal{H}$ of graphs if every $H \in \mathcal{H}$ is a subgraph of $G$. For a given family $\mathcal{H}$, the goal is to determine the smallest number of edges an…

Combinatorics · Mathematics 2024-01-12 Noga Alon , Natalie Dodson , Carmen Jackson , Rose McCarty , Rajko Nenadov , Lani Southern

Regular sequences generalize the extensively studied automatic sequences. Let $S$ be an abstract numeration system. When the numeration language $L$ is prefix-closed and regular, a sequence is said to be $S$-regular if the module generated…

Formal Languages and Automata Theory · Computer Science 2021-04-01 Michel Rigo , Manon Stipulanti

There are several standard procedures used to create new sequences from a given sequence or from a given pair of sequences. In this paper I discuss the most popular of these procedures. For each procedure, I give a definition and provide…

Combinatorics · Mathematics 2007-12-17 Tanya Khovanova

After a short review of the historical milestones on normal numbers, we introduce the Borel numbers as the reals admitting a probability function on their different bases representations. In this setting, we provide two probabilistic…

Number Theory · Mathematics 2022-01-14 Nicolò Cangiotti , Daniele Taufer

We introduce a class of stochastic integer sequences. In these sequences, every element is a sum of two previous elements, at least one of which is chosen randomly. The interplay between randomness and memory underlying these sequences…

Statistical Mechanics · Physics 2007-05-23 E. Ben-Naim , P. L. Krapivsky

In this paper we give constructions for infinite sequences of finite non-linear locally recoverable codes $\mathcal C\subseteq \prod\limits^N_{i=1}\mathbb F_{q_i}$ over a product of finite fields arising from basis expansions in algebraic…

Information Theory · Computer Science 2023-04-19 Andrea Ferraguti , Dorian Goldfeld , Giacomo Micheli

For every countable ordinal number $\alpha$ we construct an entire function $f=f_\alpha$ such that the family $\left\{f(nz):n\in\mathbb{N}\right\}$ is exactly $Q_\alpha$-normal in the unit disk.

Complex Variables · Mathematics 2010-10-25 Shai Gul , Shahar Nevo

This paper surveys and illustrates geometric methods for constructing normal bases allowing efficient finite field arithmetic. These bases are constructed using the additive group, the multiplicative group and the Lucas torus. We describe…

Algebraic Geometry · Mathematics 2018-09-27 Tony Ezome , Mohamadou Sall

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

Let $\mathbf{S}$ be the set of all finite or infinite increasing sequences of positive integers. For a sequence $S=\{s(n)\}, n\geq1,$ from $\mathbf{S},$ let us call a positive number $N$ an exponentially $S$-number $(N\in E(S)),$ if all…

Number Theory · Mathematics 2016-01-21 Vladimir Shevelev