Cover Image

q-Parikh Matrices and q-deformed binomial coefficients of words

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Renard, Antoine, Rigo, Michel, Whiteland, Markus A.
Format:	Preprint
Published:	2024
Subjects:	Formal Languages and Automata Theory Discrete Mathematics Combinatorics 05A30, 68R15, 15B36, 11B85
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Introducing q-deformed binomial coefficients of words
by: Renard, Antoine, et al.
Published: (2024)

Computing the k-binomial complexity of generalized Thue--Morse words
by: Golafshan, M., et al.
Published: (2024)

Effective Computation of Generalized Abelian Complexity for Pisot Type Substitutive Sequences
by: Couvreur, Jean-Michel, et al.
Published: (2025)

The reflection complexity of sequences over finite alphabets
by: Allouche, Jean-Paul, et al.
Published: (2024)

Symbols frequencies in the Thue--Morse word in base $3/2$ and related conjectures
by: Cassaigne, Julien, et al.
Published: (2026)

Combinatorics on words and generating Dirichlet series of automatic sequences
by: Allouche, Jean-Paul, et al.
Published: (2024)

Automatic Abelian Complexities of Parikh-Collinear Fixed Points
by: Rigo, Michel, et al.
Published: (2024)

The repetition threshold for ternary rich words
by: Currie, James D., et al.
Published: (2024)

Avoiding abelian and additive powers in rich words
by: Andrade, Jonathan, et al.
Published: (2024)

The speed of convergence in greedy Galois games
by: Shallit, Jeffrey
Published: (2026)

Digital Convexity and Combinatorics on Words
by: De Luca, Alessandro, et al.
Published: (2025)

On gapped repeats in a cyclic Fibonacci word
by: Horiyama, Takashi, et al.
Published: (2026)

Mapping words to powers by morphisms
by: Saarela, Aleksi
Published: (2025)

Low complexity binary words avoiding $(5/2)^+$-powers
by: Currie, James, et al.
Published: (2025)

Restivo Salemi property for $α$-power free languages with $α\geq 5$ and $k\geq 3$ letters
by: Rukavicka, Josef
Published: (2023)

Automaticity of spacetime diagrams generated by cellular automata on commutative monoids
by: Nesme, Vincent
Published: (2022)

Clustering of return words in languages of interval exchanges
by: Dolce, Francesco, et al.
Published: (2025)

Computing Expansions in Infinitely Many Cantor Real Bases via a Single Transducer
by: Charlier, Émilie, et al.
Published: (2025)

Some Results on Digital Segments and Balanced Words
by: De Luca, Alessandro, et al.
Published: (2022)

Positionality of Dumont--Thomas numeration systems for integers
by: Kreczman, Savinien, et al.
Published: (2025)

On the generalization of the study of a letter power substitution on modulo-recurrent words
by: Barro, Moussa, et al.
Published: (2024)

Exploring the Crochemore and Ziv-Lempel factorizations of some automatic sequences with the software Walnut
by: Jahannia, Marieh, et al.
Published: (2024)

From Historical Puzzles to Grammatical Constraints: Circular Partitions, Generalized Run-Length Encodings, and Polynomial-Time Decidability
by: Khormali, Omid, et al.
Published: (2026)

Subword enumeration up to stack-sorting equivalence
by: Campbell, John M., et al.
Published: (2026)

A Connection Between Unbordered Partial Words and Sparse Rulers
by: Saarela, Aleksi, et al.
Published: (2024)

Mapped Exponent and Asymptotic Critical Exponent of Words
by: Foster, Eva, et al.
Published: (2025)

Group Actions and Some Combinatorics on Words with $\mathbf{vtm}$
by: Machacek, John
Published: (2025)

The Shortest Interesting Binary Words
by: Fici, Gabriele
Published: (2024)

Reduced complexities for sequences over finite alphabets
by: Campbell, John M., et al.
Published: (2025)

On the study of cellular automata on modulo-recurrent words
by: Barro, Moussa, et al.
Published: (2022)

A new factorization of the generalized period-doubling sequences through kernel words and gaps sequences
by: Bognini, K. Ernest, et al.
Published: (2025)

Maximizing entropy for power-free languages
by: Climenhaga, Vaughn
Published: (2025)

A Note on the Relation between Recognisable Series and Regular Sequences, and their Minimal Linear Representations
by: Heuberger, Clemens, et al.
Published: (2022)

Runs, Squares, Palindromes, and Unbordered Factors of a Family of Binary Pattern Sequences with the All-One Pattern
by: Hendel, Russell Jay
Published: (2025)

Extended branching Rauzy induction
by: Dolce, Francesco, et al.
Published: (2025)

Universal partial tori
by: Carey, William D., et al.
Published: (2024)

Monochromatic arithmetic progressions in the Fibonacci, Thue-Morse, and Rudin-Shapiro words
by: Joshi, Gandhar, et al.
Published: (2025)

Structure and growth of $\mathbb{R}$-bonacci words
by: Dovgal, Sergey, et al.
Published: (2023)

Words with factor complexity $2n+1$ and minimal critical exponent
by: Currie, James D.
Published: (2025)

Initial nonrepetitive complexity of regular episturmian words and their Diophantine exponents
by: Peltomäki, Jarkko
Published: (2021)