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)

Review text

\[\N2 \cdot 1176470588235294 = 2352941176470588\N\]\NThe digits of the multiplicand and the product are the same. The above example is also cyclic. If any permutation is allowed, then these types of numbers are so-called ``permutiples.\N\NFinding them using exhaustive brute-force verification may require more computational power than one can afford. So, the author of the paper under review suggested a different approach. For each base \(b\) and factor \(n\), one can find the directed graph with vertices \(0, 1, 2, \dots, b-1\) and edges \(x \to y\) if digit \(x\) becomes \(y\) in long multiplication by \(n\). This also includes the results obtained by carries from the lower-order place values.\N\NEvery permutiple is interpreted as a part of this ``mother graph. Then, the Hoey-Sloane multigraph, with vertices as carries and edges as \(x \to y\), is constructed. This finite-state-machine interpretation is used to give sufficient conditions for the existence of permutiples. The condition is expressed using Eulerian circuits starting and ending with a zero carry.

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)