Computational aspects of sturdy and flimsy numbers

DOI10.1016/j.tcs.2022.05.029OpenAlexW3004837115MaRDI QIDQ2163377

Leon Witzman, Antonio Molina Lovett, Trevor Clokie, Jeffrey O. Shallit, Thomas F. Lidbetter

Publication date: 10 August 2022

Published in: Theoretical Computer Science (Search for Journal in Brave)

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

zbMATH Keywords

enumerationfinite automatoncontext-free grammarflimsy numbersturdy number

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Uses Software

• Algolib
• OEIS
• gdev

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Distribution of the sum-of-digits function of random integers: a survey
• On digit sums of multiples of an integer
• A conjecture of Krishnamurthy on decimal periods and some allied problems
• Cyclic self-dual \(\mathbb Z_4\)-codes.
• Analytic combinatorics of lattice paths with forbidden patterns: enumerative aspects
• The existence of \(n\)-flimsy numbers in a given base
• Minimal DFA for testing divisibility
• Additive number theory via automata theory
• Analytic combinatorics of lattice paths with forbidden patterns, the vectorial kernel method, and generating functions for pushdown automata
• Über die Dichte der Primzahlen \(p\), für die eine vorgegebene ganzrationale Zahl \(a\neq 0\) von gerader bzw. ungerader Ordnung \(\mod p\) ist
• ALMOST ALL PRIMES HAVE A MULTIPLE OF SMALL HAMMING WEIGHT
• Integers whose multiples have anomalous digital frequencies
• The joint distribution of the binary digits of integer multiples
• When is an automatic set an additive basis?
• Formulae and Asymptotics for Coefficients of Algebraic Functions

This page was built for publication: Computational aspects of sturdy and flimsy numbers