Related papers: A generalized palindromization map in free monoids
We extend the classical Ostrowski numeration systems, closely related to Sturmian words, by allowing a wider range of coefficients, so that possible representations of a number $n$ better reflect the structure of the associated Sturmian…
Regular word grammars are restricted context-free grammars that define all the recognizable languages of words. This paper generalizes regular grammars from words to certain classes of graphs, by defining regular grammars for unordered…
It is confirmed in this work that the graph isomorphism can be tested in polynomial time, which resolves a longstanding problem in the theory of computation. The contributions are in three phases as follows. 1. A description graph…
Let A be a finite alphabet and f: A^* --> A^* be a morphism with an iterative fixed point f^\omega(\alpha), where \alpha{} is in A. Consider the subshift (X, T), where X is the shift orbit closure of f^\omega(\alpha) and T: X --> X is the…
We investigate the Moore-Penrose pseudoinverse and generalized inverse of a matrix product $A=CR$ to establish a unifying framework for generalized and randomized matrix inverses. This analysis is rooted in first principles, focusing on the…
In this work, we introduce a new notion for representing graph classes with formal languages. In contrast to the seminal work by Kitaev and Pyatkin to represent graphs by words, we use formal binary languages in order to have a set of…
Bilinear maps and their classifying tensor products are well-known in the theory of linear algebra, and their generalization to algebras of commutative monads is a classical result of monad theory. Motivated by constructions needed in…
Given a finite coloring (or finite partition) of the free semigroup $A^+$ over a set $A$, we consider various types of monochromatic factorizations of right sided infinite words $x\in A^\omega$. Some stronger versions of the usual notion of…
After reviewing recent results on symplectic Lefschetz pencils and symplectic branched covers of CP^2, we describe a new construction of maps from symplectic manifolds of any dimension to CP^2 and the associated monodromy invariants. We…
We study fibers of word maps in finite, profinite, and residually finite groups. Our main result is that, for any word w in the free group on d generators, there exists $\epsilon > 0$ such that if G is a residually finite group with…
It is proved that the periodic point submonoid of a free inverse monoid endomorphism is always finitely generated. Using Chomsky's hierarchy of languages, we prove that the fixed point submonoid of an endomorphism of a free inverse monoid…
Rich words are characterized by containing the maximum possible number of distinct palindromes. Several characteristic properties of rich words have been studied; yet the analysis of repetitions in rich words still involves some interesting…
We show that every language in NP has a PCP verifier that tosses $O(\log n)$ random coins, has perfect completeness, and a soundness error of at most $1/\text{poly}(n)$, while making at most $O(\text{poly}\log\log n)$ queries into a proof…
In this paper we consider the palindromes that can be formed by taking unordered sets of $n$ elements from an alphabet of $b$ letters. In particular, we seek to find the probability that given a random member of this space we are able to…
In this paper, we study continuity and Lipschitzian properties of set-valued mappings, focusing on inner-type conditions. We introduce new notions of inner calmness* and, its relaxation, fuzzy inner calmness*. We show that polyhedral maps…
We provide a geometric model for the free $X$-generated $F$-restriction semigroup in the extended signature $(\cdot\,, ^+, ^m,\lambda)$, where the unary operation $^m$ maps an element $a$ to the maximum element $a^m$ of its $\sigma$-class,…
Let $M(A,I)$ be a free partially commutative monoid with involution and $G(A,I)$ be its quotient group, e.g. a right-angled Artin or Coxeter group. Given a system of word equations over $M(A,I)$ with recognizable constraints with input size…
We consider a broad class of Approximate Message Passing (AMP) algorithms defined as a Lipschitzian functional iteration in terms of an $n\times n$ random symmetric matrix $A$. We establish universality in noise for this AMP in the…
Partially ordered nondeterminsitic finite automata (poNFAs) are NFAs whose transition relation induces a partial order on states, that is, for which cycles occur only in the form of self-loops on a single state. A poNFA is universal if it…
A foundational result in the theory of Lyndon words (words that are strictly earlier in lexicographic order than their cyclic permutations) is the Chen-Fox-Lyndon theorem which states that every word has a unique non-increasing…