Cover Image

On the number of words of $N=3 \,n$ letters with a three-letter alphabet

Fuente: arXiv

Saved in:

Bibliographic Details
Main Author:	Serra, Pablo
Format:	Preprint
Published:	2025
Subjects:	Combinatorics
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Bounds on the lettericity of graphs
by: Mandrick, Sean, et al.
Published: (2023)

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

Frequencies of letters in infinite $k$-balanced sequences
by: Dvořáková, Lubomíra, et al.
Published: (2025)

There exist infinite cube-free words over any sequence of binary alphabets
by: Bui, Vuong, et al.
Published: (2025)

Difference sets in Quadratic Density Hales Jewett conjecture with 2 letters
by: Pathak, Aritro
Published: (2020)

The complexity of finite smooth words over binary alphabets
by: Cassaigne, Julien, et al.
Published: (2026)

A formula for the number of up-down words
by: Fried, Sela
Published: (2025)

Maximal number of subword occurrences in a word
by: Fang, Wenjie
Published: (2024)

Optimizing alphabet reduction pairs of arrays
by: Culus, Jean-François, et al.
Published: (2024)

On the word-representability of $K_m$-$K_n$ graphs
by: Chen, Herman Z. Q., et al.
Published: (2025)

Toward a statistical mechanics of four letter words
by: Stephens, Greg J., et al.
Published: (2007)

Representation number of word-representable co-bipartite graph
by: Das, Biswajit, et al.
Published: (2025)

$α$-numbers, diophantine exponent and factorisations of sturmian words
by: Wojcik, Caius
Published: (2025)

Orientable sequences over non-binary alphabets
by: Alhakim, Abbas, et al.
Published: (2024)

On two-toned tilings and $(m,n)$-words
by: Mühle, Henri
Published: (2025)

Finance and economics. Why risk is a four-letter word
Published: (1998)

Subexponential upper bound on the number of rich words
by: Rukavicka, Josef
Published: (2025)

Planar Turán numbers of three configurations
by: Bai, Xuqing, et al.
Published: (2025)

Intersecting families with covering number three
by: Frankl, Peter, et al.
Published: (2022)

Asymptotic bounds for the number of closed and privileged words
by: Gabric, Daniel
Published: (2022)

Intersecting families with covering number three II
by: Frankl, Peter, et al.
Published: (2026)

Finance and economics. Why risk is no longer a four-letter word
Published: (1997)

Partitioning a 2-edge-coloured graph of minimum degree $2n/3 + o(n)$ into three monochromatic cycles
by: Allen, Peter, et al.
Published: (2022)

The Turan number of the balanced double star S_{n-1,n-1} in the hypercube Q_n
by: Xu, Shoujun, et al.
Published: (2025)

The generalized Ramsey number $f(n, 5, 8) = \frac 67 n + o(n)$
by: Bennett, Patrick, et al.
Published: (2024)

On the number of antichains in $\{0,1,2\}^n$
by: Jenssen, Matthew, et al.
Published: (2026)

Even-up words and their variants
by: Fried, Sela
Published: (2025)

More characterizations of morphic words
by: Badkobeh, Golnaz, et al.
Published: (2023)

On fractal patterns in Ulam words
by: Mandelshtam, Andrei
Published: (2022)

An isoperimetric inequality for word overlap
by: Zakharov, Dmitrii
Published: (2026)

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

A Short Proof that the number of $(a,b)$-parking functions of length n $a(a+bn)^{n-1}$
by: Bu, AJ, et al.
Published: (2024)

A simple proof on the number of $(3 \times n)$-Latin rectangles based on a set of $λ$ elements
by: Thengarnanchai, Pantaree, et al.
Published: (2024)

Further results on staircase (cyclic) words
by: Fried, Sela
Published: (2025)

Further results on staircase graph words
by: Fried, Sela
Published: (2024)

Shifted insertion algorithms for primed words
by: Marberg, Eric
Published: (2021)

Counting k-ary words by number of adjacency differences of a prescribed size
by: Fried, Sela, et al.
Published: (2025)

Proof of Brouwers Conjecture (BC) for all graphs with number of vertices n > n_0 assuming that BC holds for n< n_0 for some n_0
by: Blinovsky, Vladimir, et al.
Published: (2019)

The generalized Tur'{a}n number of long cycles in graphs and bipartite graphs
by: Dong, Changchang, et al.
Published: (2024)

Member's letters