English
Related papers

Related papers: Direct definition of a ternary infinite square-fre…

200 papers

Infinite sequences are considered in the framework of classical logic from a new point of view.

General Mathematics · Mathematics 2008-04-30 V. V. Ivanov

We consider infinite sequences of symbols, also known as streams, and the decidability question for equality of streams defined in a restricted format. This restricted format consists of prefixing a symbol at the head of a stream, of the…

Logic in Computer Science · Computer Science 2012-04-17 Clemens Grabmayer , Joerg Endrullis , Dimitri Hendriks , Jan Willem Klop , Lawrence S. Moss

Motivated by examples in infinite group theory, we classify the finite groups whose subgroups can never be decomposed as direct products.

Group Theory · Mathematics 2007-05-23 Ivan Marin

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

For each integer n > 1, we present an element in $Q((T^-1))$, having a power series expansion based on an infinite word W(n), over the alphabet ${+1;-1}g and whose continued fraction expansion has a particular pattern which is explicitly…

Number Theory · Mathematics 2025-05-27 Bill Allombert , Alain Lasjaunias

Following Inoue et al., we define a word to be a repetition if it is a (fractional) power of exponent at least 2. A word has a repetition factorization if it is the product of repetitions. We study repetition factorizations in several…

Formal Languages and Automata Theory · Computer Science 2023-11-30 Jeffrey Shallit , Xinhao Xu

A word is square-free if it does not contain nonempty factors of the form $XX$. In 1906 Thue proved that there exist arbitrarily long square-free words over a $3$-letter alphabet. It was proved recently [7] that among these words there are…

Combinatorics · Mathematics 2021-05-04 Jarosław Grytczuk , Hubert Kordulewski , Bartłomiej Pawlik

We generalize the definition of an exact sequence of tensor categories due to Brugui\`eres and Natale, and introduce a new notion of an exact sequence of (finite) tensor categories with respect to a module category. We give three…

Quantum Algebra · Mathematics 2015-04-07 Pavel Etingof , Shlomo Gelaki

Let $S$ be one of $\{aba,bcb\}$ and $\{aba, aca\}$, and let $w$ be an infinite square-free word over $\Sigma=\{a,b,c\}$ with no factor in $S$. Suppose that $f:\Sigma\rightarrow T^*$ is a non-erasing morphism. Word $f(w)$ is square-free if…

Formal Languages and Automata Theory · Computer Science 2019-02-18 James D. Currie

A dual approach to defining the triangle sequence (a type of multidimensional continued fraction algorithm, initially developed in NT/9906016) for a pair of real numbers is presented, providing a new, clean geometric interpretation of the…

Number Theory · Mathematics 2007-05-23 S. Assaf , L. Chen , T. Cheslack-Postava , B. Cooper , A. Diesl , T. Garrity , M. Lepinski , A. Schuyler

We determine all perfect powers that can be written as the sum of at most 10 consecutive squares.

Number Theory · Mathematics 2017-07-24 Vandita Patel

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 sequence in the additive group ${\mathbb Z}_n$ of integers modulo $n$ is called $n$-zero-free if it does not contain subsequences with length $n$ and sum zero. The article characterizes the $n$-zero-free sequences in ${\mathbb Z}_n$ of…

Combinatorics · Mathematics 2007-05-23 Svetoslav Savchev , Fang Chen

Streams are infinite sequences over a given data type. A stream specification is a set of equations intended to define a stream. We propose a transformation from such a stream specification to a term rewriting system (TRS) in such a way…

Logic in Computer Science · Computer Science 2015-07-01 Hans H Zantema

An infinite continued composition is an expression of the form \begin{equation*} \lim_{n\to\infty}t_0\circ t_1 \circ t_2 \circ \cdots \circ t_n(c)\;, \end{equation*} where the $t_i$ are maps from a set $D$ to itself, the initial value $c$…

History and Overview · Mathematics 2025-12-11 Dixon J. Jones

In this article it is proven the existence of integration of indefinite integrals as infinite derivative's series expansion. This also opens a new way to integrate a definite integral.

Classical Analysis and ODEs · Mathematics 2012-10-30 Voloshyn Victor

An infinite permutation is a linear ordering of the set of non-negative integers. Generally, the properties of infinite permutations analogous to those of infinite words show some resemblances and some differences between permutations and…

Combinatorics · Mathematics 2009-11-09 S. V. Avgustinovich , A. E. Frid , T. Kamae , P. V. Salimov

We illustrate a general technique for enumerating factors of k-automatic sequences by proving a conjecture on the number f(n) of unbordered factors of the Thue-Morse sequence. We show that f(n) <= n for n >= 4 and that f(n) = n infinitely…

Formal Languages and Automata Theory · Computer Science 2012-11-07 Daniel Goc , Hamoon Mousavi , Jeffrey Shallit

In this article we consider alternative definitions-descriptions of a set being Infinite within the primitive Axiomatic System of Zermelo.

Logic · Mathematics 2015-09-03 George Chailos

It is well-known that there exist infinite sequences that are the fixed point of non-uniform morphisms, but not $k$-automatic for any $k$. In this note we show that every $k$-automatic sequence is the image of a fixed point of a {\it…

Number Theory · Mathematics 2021-03-23 Jean-Paul Allouche , Jeffrey Shallit