English

Universal Definitions of the Roman Factorial: Introduction to Foundational Functions and the Generalization Process

Combinatorics 2025-09-03 v8

Abstract

This paper introduces a new method for redefining the Roman factorial using universally applicable functions that are not expressed in closed form. We present a set of foundational functions, similar to Boolean operations, to simplify the factorial expression. Through a systematic process of generalization, termed generalization process, we aim to use these foundational functions to create recursive and non-recursive, global definitions of the Roman factorial.

Keywords

Cite

@article{arxiv.2403.09581,
  title  = {Universal Definitions of the Roman Factorial: Introduction to Foundational Functions and the Generalization Process},
  author = {Leonidas Liponis},
  journal= {arXiv preprint arXiv:2403.09581},
  year   = {2025}
}

Comments

24 pages, 16 figures (v2: submission date now shows correctly) (v3: fixed typo, added contact email, added footnote to explain citations) (v4: various latex optimizations) (v5: fixed domain mislabeling in introduction) (v6: adjusted phrasing for clarity) (v7: minor latex modifications in preparation for the follow-up paper) (v8: further latex and formatting improvements)