English
Related papers

Related papers: Arithmetic Self-Similarity of Infinite Sequences

200 papers

Let L be an infinite regular language on a totally ordered alphabet (A,<). Feeding a finite deterministic automaton (with output) with the words of L enumerated lexicographically with respect to < leads to an infinite sequence over the…

Computational Complexity · Computer Science 2007-05-23 Michel Rigo

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

Let $\gamma$ be an automorphism of a polarized complex projective manifold $(M,L)$. Then $\gamma$ induces an automorphism $\gamma_k$ of the space of global holomorphic sections of the $k$-th tensor power of $L$, for every $k=1,2,...$; for…

Algebraic Geometry · Mathematics 2008-03-14 Roberto Paoletti

Let $X=(V\!X,E\!X)$ be an infinite, locally finite, connected graph without loops or multiple edges. We consider the edges to be oriented, and $E\!X$ is equipped with an involution which inverts the orientation. Each oriented edge is…

Combinatorics · Mathematics 2019-03-07 Christian Lindorfer , Wolfgang Woess

We produce a long exact sequence whose terms are unit groups of associative algebras that behave as inner automorphisms of a given tensor. Our sequence generalizes known sequences for associative and non-associative algebras. In a manner…

Rings and Algebras · Mathematics 2020-11-23 Peter A. Brooksbank , Joshua Maglione , James B. Wilson

A contractive $n$-tuple $A=(A_1,...,A_n)$ has a minimal joint isometric dilation $S=(S_1,...,S_n)$ where the $S_i$'s are isometries with pairwise orthogonal ranges. This determines a representation of the Cuntz-Toeplitz algebra. When $A$…

Operator Algebras · Mathematics 2007-05-23 Kenneth R. Davidson , David W. Kribs , Miron E. Shpigel

For certain sequences $A$ of positive integers with missing $g$-adic digits, the Dirichlet series $F_A(s) = \sum_{a\in A} a^{-s}$ has abscissa of convergence $\sigma_c < 1$. The number $\sigma_c$ is computed. This generalizes and…

Number Theory · Mathematics 2021-11-05 Melvyn B. Nathanson

We consider two quantities that measure complexity of binary strings: $\mathit{KA}(x)$ is defined as the minus logarithm of continuous a priori probability on the binary tree, and $\mathit{KP}(x)$ denotes prefix complexity of a binary…

Information Theory · Computer Science 2014-01-08 Mikhail Andreev , Akim Kumok

A method is developed for calculating effective sums of divergent series. This approach is a variant of the self-similar approximation theory. The novelty here is in using an algebraic transformation with a power providing the maximal…

Statistical Mechanics · Physics 2009-10-30 V. I. Yukalov , S. Gluzman

An automatic sequence is a letter-to-letter coding of a fixed point of a uniform morphism. More generally, we have morphic sequences, which are letter-to-letter codings of fixed points of arbitrary morphisms. There are many examples where…

Number Theory · Mathematics 2020-10-05 J. -P. Allouche , F. M. Dekking , M. Queffélec

A synaptic algebra is a generalization of the Jordan algebra of selfadjoint elements of a von Neumann algebra. We study symmetries in synaptic algebras, i.e., elements whose square is the unit element, and we investigate the equivalence…

Mathematical Physics · Physics 2013-04-17 David J. Foulis , Sylvia Pulmannova

We study those automatic sequences which are produced by an automaton whose underlying graph is the Cayley graph of a finite group. For $2$-automatic sequences, we find a characterization in terms of what we call homogeneity, and among…

Combinatorics · Mathematics 2015-10-29 Pierre Guillot

We study the properties of the uncountable set of Stewart words. These are Toeplitz words specified by infinite sequences of Toeplitz patterns of the form $\alpha\beta\gamma$, where $\alpha,\beta,\gamma$ is any permutation of the symbols…

Formal Languages and Automata Theory · Computer Science 2021-12-23 Gabriele Fici , Jeffrey Shallit

We estimate Gowers uniformity norms for some classical automatic sequences, such as the Thue-Morse and Rudin-Shapiro sequences. The methods can also be extended to other automatic sequences. As an application, we asymptotically count…

Number Theory · Mathematics 2017-03-27 Jakub Konieczny

In this paper we study some additive properties of subsets of the set $\nats$ of positive integers: A subset $A$ of $\nats$ is called {\it $k$-summable} (where $k\in\ben$) if $A$ contains $\textstyle \big{\sum_{n\in F}x_n | \emp\neq…

Combinatorics · Mathematics 2013-03-05 Michelangelo Bucci , Neil Hindman , Svetlana Puzynina , Luca Q. Zamboni

Let $X$ be a proper geodesic metric space. We give a new construction of the Morse Boundary that realizes its points as equivalence classes of functions on $X$ which behave similar to the "distance to a point" function. When $G=\langle S…

Group Theory · Mathematics 2018-11-27 Abdalrazzaq Zalloum

The singular value and spectral distribution of Toeplitz matrix sequences with Lebesgue integrable generating functions is well studied. Early results were provided in the classical Szeg{\H{o}} theorem and the Avram-Parter theorem, in which…

Numerical Analysis · Mathematics 2018-10-08 Sean Hon , Mohammad Ayman Mursaleen , Stefano Serra-Capizzano

Self-similar sequence transformation is an original type of nonlinear sequence transformations allowing for defining effective limits of asymptotic sequences. The method of self-similar factor transformations is shown to be regular. This…

Statistical Mechanics · Physics 2022-01-28 V. I. Yukalov , E. P. Yukalova

This note deals with the relationship between the abscissas of simple, uniform and absolute convergence for the Dirichlet series $f(s) = \sum_{n=1}^\infty a_n n^{-s}$, when the coefficients $a_n$ are either multiplicative or completely…

Number Theory · Mathematics 2018-07-24 Ole Fredrik Brevig , Winston Heap

For each infinite word over a given finite alphabet, we define an increasing sequence of rooted finite graphs, that can be thought as approximations of the famous Sierpinski carpet. These sequences naturally converge to an infinite rooted…

Combinatorics · Mathematics 2018-02-28 Daniele D'Angeli , Alfredo Donno