Words avoiding a reflexive acyclic relation

zbMATH Open1080.05003MaRDI QIDQ813446FDOQ813446

Authors: John Dollhopf, Curtis Greene, I. P. Goulden 

Publication date: 9 February 2006

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/125511

File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

Recommendations

• Finite automata and pattern avoidance in words
• Algebraic generating functions for languages avoiding Riordan patterns
• The Goulden-Jackson cluster method for cyclic words
• Words restricted by patterns with at most 2 distinct letters
• scientific article; zbMATH DE number 1948509

zbMATH Keywords

generating functionposetscombinatorial encoding of words

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Combinatorics of partially ordered sets (06A07)

Cited In (3)

• Comparability graphs of lattices
• Eulerian quasisymmetric functions
• 𝑞-Eulerian polynomials: Excedance number and major index

This page was built for publication: Words avoiding a reflexive acyclic relation

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