Related papers: Factor complexity of infinite words associated wit…
The theorem of factorisation forests shows the existence of nested factorisations -- a la Ramsey -- for finite words. This theorem has important applications in semigroup theory, and beyond. The purpose of this paper is to illustrate the…
We provide upper bounds on the total number of irreducible factors, and in particular irreducibility criteria for some classes of bivariate polynomials $f(x,y)$ over an arbitrary field $\mathbb{K}$. Our results rely on information on the…
We study the notion of sparseness for regular languages over finite trees and infinite words. A language of trees is called sparse if the relative number of $n$-node trees in the language tends to zero, and a language of infinite words is…
We offer multiplication method for factoring big natural numbers which extends the group of the Fermat's and Lehman's factorization algorithms and has run-time complexity $O(n^{1/3})$. This paper is argued the finiteness of proposed…
The non-repetitive complexity $nr\mathcal{C}_{\bf u}$ and the initial non-repetitive complexity $inr\mathcal{C}_{\bf u}$ are functions which reflect the structure of the infinite word ${\bf u}$ with respect to the repetitions of factors of…
In this paper, we extend the notion of Lyndon word to transfinite words. We prove two main results. We first show that, given a transfinite word, there exists a unique factorization in Lyndon words that are densely non-increasing, a…
We introduce the \emph{Parry order} $\mathrm{Ord}_P(\beta)$, defined as the largest integer $n$ for which $\beta^n$ is a Parry number. This leads to a natural partition of the set of Perron numbers as follows: \[ \mathcal{P} = \left(…
While graphs and abstract data structures can be large and complex, practical instances are often regular or highly structured. If the instance has sufficient structure, we might hope to compress the object into a more succinct…
We consider the computability and complexity of decision questions for Probabilistic Finite Automata (PFA) with sub-exponential ambiguity. We show that the emptiness problem for strict and non-strict cut-points of polynomially ambiguous…
Let A be an alphabet and W be a set of words in the free monoid A*. Let S(W) denote the Rees quotient over the ideal of A* consisting of all words that are not subwords of words in W. We call a set of words W finitely based if the monoid…
Given a finite alphabet $\Sigma$ and a right-infinite word $w$ over the alphabet $\Sigma$, we construct a topological space ${\rm Rec}(w)$ consisting of all right-infinite recurrent words whose factors are all factors of $w$, where we work…
We consider representing of natural numbers by arithmetical expressions using ones, addition, multiplication and parentheses. The (integer) complexity of n -- denoted by ||n|| -- is defined as the number of ones in the shortest expressions…
We study partitions of complex numbers as sums of non-negative powers of a fixed algebraic number $\beta$. We prove that if $\beta$ is real quadratic, then the number of partitions is always finite if and only if some conjugate of $\beta$…
We determine the finite groups $G$ in which every subset $A \subseteq G$ of cardinality dividing the order of $G$ is a \emph{factor}, i.e. has a complement $B \subseteq G$ of cardinality $|G|/|A|$ such that $G = A \cdot B$ or $G = B \cdot…
We study two complexity notions of groups - a computable Scott sentence and the index set of a group. Finding the exact complexity of one of them usually involves finding the complexity of the other, but this is not the case sometimes. J.…
We study some properties of restricted and associated Fubini numbers. In particular, they have the natural extensions of the original Fubini numbers in the sense of determinants. We also introduce modified Bernoulli and Cauchy numbers and…
We prove a function field analogue of a conjecture of Schinzel on the factorization of univariate polynomials over the rationals. We derive from it a finiteness theorem for the irreducible factorizations of the bivariate Laurent polynomials…
Word complexity is defined in a number of different ways. Psycholinguistic, morphological and lexical proxies are often used. Human ratings are also used. The problem here is that these proxies do not measure complexity directly, and human…
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…
Classical crystals are solid materials containing arbitrarily long periodic repetitions of a single motif. In this paper, we study the maximal possible repetition of the same motif occurring in beta-integers -- one dimensional models of…