An application of the Goulden-Jackson cluster theorem

From MaRDI portal
Publication:2109221

DOI10.5802/ALCO.210zbMATH Open1504.05012arXiv2011.03171OpenAlexW3105950866MaRDI QIDQ2109221FDOQ2109221


Authors: Ira M. Gessel Edit this on Wikidata


Publication date: 20 December 2022

Published in: Algebraic Combinatorics (Search for Journal in Brave)

Abstract: Let A be an alphabet and let F be a set of words with letters in A. We show that the sum of all words with letters in A with no consecutive subwords in F, as a formal power series in noncommuting variables, is the reciprocal of a series with all coefficients 0, 1 or -1. We also explain how this result is related to a result of Curtis Greene on lattices with M"obius function 0, 1, or -1.


Full work available at URL: https://arxiv.org/abs/2011.03171




Recommendations




Cites Work


Cited In (3)

Uses Software





This page was built for publication: An application of the Goulden-Jackson cluster theorem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2109221)