Related papers: On arch factorization and subword universality for…
We compare the performance of different clustering algorithms applied to the task of unsupervised text categorization. We consider agglomerative clustering algorithms, principal direction divisive partitioning and (for the first time)…
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…
We introduce the notion of general prints of a word, which is substantialized by certain canonical decompositions, to study repetition in words. These associated decompositions, when applied recursively on a word, result in what we term as…
A set of valuable universal similarity factorization equalities are established over complex Clifford algebras $\Cn.$ Through them matrix representations of complex Clifford algebras $\Cn$ can directly be derived, and their properties can…
We consider several novel aspects of unique factorization in formal languages. We reprove the familiar fact that the set uf(L) of words having unique factorization into elements of L is regular if L is regular, and from this deduce an…
In this survey paper we study parametric versions of writing a matrix in $SL_n (\mathbb{C})$ as a product of lower and upper unitriangular matrices in interchanging order as well as generalizations to other classical groups. We give an…
Sparse matrix factorization is a popular tool to obtain interpretable data decompositions, which are also effective to perform data completion or denoising. Its applicability to large datasets has been addressed with online and randomized…
The downward closure of a language $L$ of words is the set of all (not necessarily contiguous) subwords of members of $L$. It is well known that the downward closure of any language is regular. Although the downward closure seems to be a…
Grammar-based compression is a popular and powerful approach to compressing repetitive texts but until recently its relatively poor time-space trade-offs during real-life construction made it impractical for truly massive datasets such as…
A new method for the construction of classical integrable systems, that we call loop coproduct formulation, is presented. We show that the linear r-matrix formulation, the Sklyanin algebras and the reflection algebras can be obtained as…
Pattern-matching-based document-compression systems (e.g. for faxing) rely on finding a small set of patterns that can be used to represent all of the ink in the document. Finding an optimal set of patterns is NP-hard; previous compression…
We give an algorithmic-bijective proof of Macdonald's reduced word identity in the theory of Schubert polynomials, in the special case where the permutation is dominant. Our bijection uses a novel application of David Little's generalized…
This work combines algorithms based on word embeddings, dimensionality reduction, and clustering. The objective is to obtain topics from a set of unclassified texts. The algorithm to obtain the word embeddings is the BERT model, a neural…
The braid group has recently attracted much attention. This is primarily based upon the discovery of its usage in various cryptosystems [AAG],[KLCHKP]. One major focus of current research has been in solving decision problems in braid…
In this document we achieve exact and asymptotic enumeration of words, compositions over a finite group, and/or integer compositions characterized by local restrictions and, separately, subsequence pattern avoidance. We also count…
We present a linear time and space algorithm computing the leftmost critical factorization of a given string on an unordered alphabet.
Universal Cycles, or U-cycles, as originally defined by de Bruijn, are an efficient method to exhibit a large class of combinatorial objects in a compressed fashion, and with no repeats. de Bruijn's theorem states that U-cycles for $n$…
We introduce a new combinatorial object called tower diagrams and prove fundamental properties of these objects. We also introduce an algorithm that allows us to slide words to tower diagrams. We show that the algorithm is well-defined only…
Infinite words, also known as streams, hold significant interest in computer science and mathematics, raising the natural question of how their complexity should be measured. We introduce cellular automaton reducibility as a measure of…
In the author's PhD thesis (2019) universal envelopes were introduced as a tool for studying the continuously obtainable information on discontinuous functions. To any function $f \colon X \to Y$ between $\operatorname{qcb}_0$-spaces one…