Research Article

Words over a finite alphabet avoiding 1243

Published in: Quaestiones Mathematicae
Volume 47 , issue 9 , 2024 , pages: 1755–1766

DOI: 10.2989/16073606.2024.2334869

Author(s): Toufik Mansour University of Haifa, Israel

Keywords: Primary: 05A15 , Secondary: 05A05 , k-ary words , kernel method , avoiding 1243

Abstract

In this paper, we establish a system of recurrence relations and an algorithm for finding the generating function A_k (x) for the number of words over alphabet [k] of length n that avoid 1243, for arbitrary k. In particular, we present an explicit formula for the generating function A_k (x) for 1 ≤ k ≤ 10.

« Conditional indicators

A fully discrete scheme on piecewise-equidistant mesh for singularly perturbed delay integro-differential equations »