Related papers: Infinite permutations vs. infinite words
This work starts from definition of randomness, the results of algorithmic randomness are analyzed from the perspective of application. Then, the source and nature of randomness is explored, and the relationship between infinity and…
These lecture notes provide an introduction to combinatorics on words and its interactions with dynamics, algebra, and arithmetic. The central theme is the notion of low factor complexity for infinite words. We investigate the following…
We study the equality problem for infinite words obtained by iterating morphisms. In particular, we give a practical algorithm to decide whether or not two words generated by primitive morphisms are equal.
We construct the infinite sequence of invariants for curves in surfaces by using word theory that V. Turaev introduced. For plane closed curves, we add some extra terms, e.g. the rotation number. From these modified invariants, we get the…
We survey the Kolmogorov's approach to the notion of randomness through the Kolmogorov complexity theory. The original motivation of Kolmogorov was to give up a quantitative definition of information. In this theory, an object is randomness…
This is a transcript of a lecture course on Infinite Permutation Groups given by Peter M. Neumann (1940-2020) in Oxford during the academic year 1988-1989. The field of Infinite Permutation Groups only emerged as an independent field of…
The idea of measuring distance between languages seems to have its roots in the work of the French explorer Dumont D'Urville (D'Urville 1832). He collected comparative words lists of various languages during his voyages aboard the Astrolabe…
The complexity of an infinite word can be measured in several ways, the two most common measures being the subword complexity and the abelian complexity. In 2015, Rigo and Salimov introduced a family of intermediate complexities indexed by…
Infinitesimals are natural products of the human imagination. Their history goes back to the Greek antiquity. Their role in the calculus and analysis has seen dramatic ups and downs. They have stimulated strong opinions and even vitriol.…
The random permutation is the Fra\"iss\'e limit of the class of finite structures with two linear orders. Answering a problem stated by Peter Cameron in 2002, we use a recent Ramsey-theoretic technique to show that there exist precisely 39…
Given a countable set X (usually taken to be the natural numbers or the integers), an infinite permutation \pi of X is a linear ordering of X. This paper investigates the combinatorial complexity of the infinite permutation on the natural…
Originally introduced and studied by the third and fourth authors together with J. Justin and S. Widmer in arXiv:0801.1656, rich words constitute a new class of finite and infinite words characterized by containing the maximal number of…
We present an impossibility result, called a theorem about facts and words, which pertains to a general communication system. The theorem states that the number of distinct words used in a finite text is roughly greater than the number of…
The study of the structure of infinite words having bounded abelian complexity was initiated by G. Richomme, K. Saari, and L. Q. Zamboni. In this note we define bounded additive complexity for infinite words over a finite subset of Z^m. We…
We study the cycle structure of words in several random permutations. We assume that the permutations are independent and that their distribution is conjugation invariant, with a good control on their short cycles. If, after successive…
This article introduces three invariance principles under which P is different from NP. In the second part a theorem of convergence is proven. This theorem states that for any language L there exists an infinite sequence of languages from…
In this article, we count the number of return words in some infinite words with complexity 2n+1. We also consider some infinite words given by codings of rotation and interval exchange transformations on k intervals. We prove that the…
V. Turaev introduced the theory of topology of words and phrases in 2005. This is a combinatorialy extension of the theory of virtual knots and links. In this paper we generalize the notion of homotopy of words and phrases and we give…
In the course of classifying the homogeneous permutations, Cameron introduced the viewpoint of permutations as structures in a language of two linear orders, and this structural viewpoint is taken up here. The majority of this thesis is…
Various kinds of infinitary operations satisfying forms of associativity have been considered in the literature by various authors, including A. Tarski, C. Karp, J. H. Conway, D. Krob, N. Bedon, and C. Rispal. Applications include the…