Related papers: The Frobenius problem for the shuffle operation
The initial non-repetitive complexity function of an infinite word x (first defined by Moothathu) is the function of n that counts the number of distinct factors of length n that appear at the beginning of x prior to the first repetition of…
The notion of Frobenius Betti numbers generalizes the Hilbert-Kunz multiplicity theory and serves as an invariant that measures singularity. However, the explicit computation of the Frobenius Betti numbers of rings has been limited to very…
We consider the nonlinear Schrodinger equation, with mass-critical nonlinearity, focusing or defocusing. For any given angle, we establish the existence of infinitely many functions on which the scattering operator acts as a rotation of…
A {\em square} is a word of the form $uu$. In this paper we prove that for a given finite word $w$, the number of distinct square factors of $w$ is bounded by $|w|-|\Alphabet(w)|+1$, where $|w|$ denotes the length of $w$ and…
Viewing Dehn's algorithm as a rewriting system, we generalise to allow an alphabet containing letters which do not necessarily represent group elements. This extends the class of groups for which the algorithm solves the word problem to…
Motivated by computing duplication patterns in sequences, a new fundamental problem called the longest subsequence-repeated subsequence (LSRS) is proposed. Given a sequence $S$ of length $n$, a letter-repeated subsequence is a subsequence…
This work investigates the inverse drift problem in the one-dimensional parabolic equation with the final time data. The authors construct an operator first, whose fixed points are the unknown drift, and then apply it to prove the…
This paper analyses stable commutator length in groups Z^r * Z^s. We bound scl from above in terms of the reduced wordlength (sharply in the limit) and from below in terms of the answer to an associated subset-sum type problem. Combining…
In this paper we study random orderings of the integers with a certain invariance property. We describe all such orders in a simple way. We define and represent random shuffles of a countable set of labels and then give an interpretation of…
We introduce a new notion of a relational word as a finite totally ordered set of positions endowed with three binary relations that describe which positions are labeled by equal data, by unequal data and those having an undefined relation…
The so-called "supOU" processes, namely the superpositions of Ornstein-Uhlenbeck type processes are stationary processes for which one can specify separately the marginal distribution and the dependence structure. They can have finite or…
We solve some decision problems for timed automata which were recently raised by S. Tripakis in [ Folk Theorems on the Determinization and Minimization of Timed Automata, in the Proceedings of the International Workshop FORMATS'2003, LNCS,…
The method of Frobenius is a standard technique to construct series solutions of an ordinary linear differential equation around a regular singular point. In the classical case, when the roots of the indicial polynomial are separated by an…
We introduce the notion of unavoidable (complete) sets of word patterns, which is a refinement for that of words, and study certain numerical characteristics for unavoidable sets of patterns. In some cases we employ the graph of pattern…
Building an infinite square-free word by appending one letter at a time while simultaneously avoiding the creation of squares is most likely to fail. When the alphabet has two letters this approach is impossible. When the alphabet has three…
We study Frobenius algebras of operator fields and introduce a novel notion of duality for them. We show that, under the assumption that the operator fields forming the Frobenius algebra are mutual symmetries, the operator fields in the…
This paper presents a new approach to determine the number of solutions of three variable Frobenius related problems and to find their solutions by using order reducing methods. Here, the order of a Frobenius related problem means the…
The square-free word problem relative to a system of two defining relations is decidable.
The present paper presents and proves a proposition concerning the time complexity of finite languages. It is shown herein, that for any finite language (a language for which the set of words composing it is finite) there is a Turing…
A braided Frobenius algebra is a Frobenius algebra with braiding that commutes with the operations, that are related to diagrams of compact surfaces with boundary expressed as ribbon graphs. A heap is a ternary operation exemplified by a…