Two parallel dynamic lexicographic algorithms for factorization sets in numerical semigroups
<|reference_start|>Two parallel dynamic lexicographic algorithms for factorization sets in numerical semigroups: To the existing dynamic algorithm FactorizationsUpToElement for factorization sets of elements in a numerical semigroup, we add lexicographic and parallel behavior. To the existing parallel lexicographic algorithm for the same, we add dynamic behavior. The (dimensionwise) dynamic algorithm is parallelized either elementwise or factorizationwise, while the parallel lexicographic algorithm is made dynamic with low-dimension tabulation. The tabulation for the parallel lexicographic algorithm can itself be performed using the dynamic algorithm. We provide reference CUDA implementations with measured runtimes.<|reference_end|>
@article{barron2024two,
    title={Two parallel dynamic lexicographic algorithms for factorization sets in
  numerical semigroups},
    author={Thomas Barron},
    journal={arXiv preprint arXiv:2407.20474},
    year={2024},
    archivePrefix={arXiv},
    eprint={2407.20474},
    primaryClass={math.AC cs.DC math.CO}
}