Enumerating anchored permutations with bounded gaps

DOI10.1016/j.disc.2020.111957zbMath1443.05006arXiv1808.03573OpenAlexW3023595252MaRDI QIDQ776276

Kenneth G. Monks, Kenneth M. Monks, Maria Monks Gillespie

Publication date: 8 July 2020

Published in: Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

rational generating functionsalgebraic graph theoryspectral graph theorypermutation patterns

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Permutations, words, matrices (05A05) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Directed graphs (digraphs), tournaments (05C20)

Uses Software

• OEIS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Spectra of digraphs
• On uniquely \(k\)-determined permutations
• On the Generalized Climbing Stairs Problem
• Systematic generation of ordered sequences using recurrence relations

This page was built for publication: Enumerating anchored permutations with bounded gaps