q-Parikh Matrices and q-deformed binomial coefficients of words
Antoine Renard, Michel Rigo, Markus A. Whiteland

TL;DR
This paper introduces a q-deformation of Parikh matrices and binomial coefficients of words, generalizing classical results, exploring their properties, and linking to number theory, recurrence relations, and growth behaviors.
Contribution
It extends Parikh matrices to a q-deformed framework, revealing new identities, convergence properties, and connections to various mathematical areas.
Findings
Elements are q-deformations of binomial coefficients of words
Sequences satisfy linear recurrence relations in periodic cases
Minors of q-Parikh matrices are polynomials with natural coefficients
Abstract
We have introduced a q-deformation, i.e., a polynomial in q with natural coefficients, of the binomial coefficient of two finite words u and v counting the number of occurrences of v as a subword of u. In this paper, we examine the q-deformation of Parikh matrices as introduced by E\u{g}ecio\u{g}lu in 2004. Many classical results concerning Parikh matrices generalize to this new framework: Our first important observation is that the elements of such a matrix are in fact q-deformations of binomial coefficients of words. We also study their inverses and as an application, we obtain new identities about q-binomials. For a finite word z and for the sequence of prefixes of an infinite word, we show that the polynomial sequence converges to a formal series. We present links with additive number theory and k-regular sequences. In the case of a periodic…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCoding theory and cryptography · semigroups and automata theory · Fractal and DNA sequence analysis
