Related papers: $\alpha$-$\beta$-Factorization and the Binary Case…
Fermat's well-known factorization algorithm is based on finding a representation of natural numbers $N$ as the difference of squares. In 1895, Lawrence generalized this idea and applied it to multiples $kN$ of the original number. A…
In this paper, we explore applications of combinatorics on words across various domains, including data compression, error detection, cryptographic protocols, and pseudorandom number generation. The examination of the theoretical…
For rings R with identity, we define a class of nonlinear higher order recurrences on unitary left R-modules that include linear recurrences as special cases. We obtain conditions under which a recurrence of order k+1 in this class is…
Factorization models express a statistical object of interest in terms of a collection of simpler objects. For example, a matrix or tensor can be expressed as a sum of rank-one components. However, in practice, it can be challenging to…
Two words are $k$-binomially equivalent whenever they share the same subwords, i.e., subsequences, of length at most $k$ with the same multiplicities. This is a refinement of both abelian equivalence and the Simon congruence. The…
The aim of this note is to survey the factorizations of the Fibonacci infinite word that make use of the Fibonacci words and other related words, and to show that all these factorizations can be easily derived in sequence starting from…
In this paper we will give a similar factorization as in \cite{4}, \cite{5}, where the autors Svrtan and Meljanac examined certain matrix factorizations on Fock-like representation of a multiparametric quon algebra on the free associative…
An algebraic formalism, developped with V. Glaser and R. Stora for the study of the generalized retarded functions of quantum field theory, is used to prove a factorization theorem which provides a complete description of the generalized…
We introduce the notion of $k$-regular factorizations for contractions into $k$ factors, generalizing the classical notion of regular factorization due to Sz.-Nagy and Foia\c{s}, and develop a systematic framework for their analysis. Using…
We consider the classical $k$-means clustering problem in the setting bi-criteria approximation, in which an algoithm is allowed to output $\beta k > k$ clusters, and must produce a clustering with cost at most $\alpha$ times the to the…
We establish two general theorems on the local properties of the absolute summability of factored Fourier series by applying a recently defined absolute summability, $\left\vert A,\alpha_{n}\right\vert _{k}$ summability, and the class…
We give partial results on the factorization conjecture on codes proposed by Schutzenberger. We consider finite maximal codes C over the alphabet A = {a, b} with C \cap a^* = a^p, for a prime number p. Let P, S in Z <A>, with S = S_0 + S_1,…
We generalize the perfectly clustering words of Simpson and Puglisi and relate them to band bricks over certain gentle algebras. This allows us to prove a generalization of a conjecture by the second author on perfectly clustering words.
In this note we consider the concept of alphabet ordering in the context of string factoring. We propose a greedy-type algorithm which produces Lyndon factorizations with small numbers of factors along with a modification for large numbers…
In 2011, Fici and Lipt\'ak introduced prefix normal words. A binary word is prefix normal if it has no factor (substring) that contains more occurrences of the letter 1 than the prefix of the same length. Among the open problems regarding…
In (B-Gran, 2004), was given a categorical formulation of the Shifting Lemma which is a characterization of the Congruence Modular Varieties among all the variety of Universal Algebra, introduced in (Gumm, 1983). Starting from a…
The paper explores combinatorial properties of Fibonacci words and their generalizations within the framework of combinatorics on words. These infinite sequences, measures the diversity of subwords in Fibonacci words, showing non-decreasing…
Various feature descriptions are being employed in logic programming languages and constrained-based grammar formalisms. The common notational primitive of these descriptions are functional attributes called features. The descriptions…
We introduce a variation of the Ziv-Lempel and Crochemore factorizations of words by requiring each factor to be a palindrome. We compute these factorizations for the Fibonacci word, and more generally, for all $m$-bonacci words.
We study the validity of congruence inclusions of the form $ \alpha ( \beta \circ \alpha \gamma \circ \beta \circ \dotsc \circ \alpha \gamma \circ \beta ) \subseteq \alpha \beta \circ \alpha \gamma \circ \alpha \beta \circ \dots$ in…