Multigraph characterization of permutiple strings

DOI10.5281/ZENODO.17711714MaRDI QIDQ6861660zbMATH OpenFDO

Authors Benjamin V. Holt

Publication date 10 February 2026

Published in Integers (Search for Journal in Brave)

Full work available at URL https://doi.org/10.5281/ZENODO.17711714

zbMATH Keywords

digitsdirected graphfinite-state-machinemultigraphpermutiples

Mathematics Subject Classification ID

Applications of graph theory (05C90) Radix representation; digital problems (11A63) Formal languages and automata (68Q45)

Cites work

• 2178 and all that
• A method for finding all permutiples with a fixed set of digits from a single known example
• An unexpected digit permutation from multiplying in any number base
• Derived palintiple families and their palinomials
• Digraphs
• Finding permutiples of a known base and multiplier
• scientific article; zbMATH DE number 58837 (Why is no real title available?)
• scientific article; zbMATH DE number 58845 (Why is no real title available?)
• scientific article; zbMATH DE number 3068971 (Why is no real title available?)
• scientific article; zbMATH DE number 7674021 (Why is no real title available?)
• Multi-Eulerian tours of directed graphs
• On cyclic numbers.
• On permutiples having a fixed set of digits
• Some general results and open questions on palintiple numbers
• Young graphs: 1089 et al.

This page was built for publication: Multigraph characterization of permutiple strings

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