Saved in:
| Main Author: | |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2403.09581 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866912559106359296 |
|---|---|
| author | Liponis, Leonidas |
| author_facet | Liponis, Leonidas |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2403_09581 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Universal Definitions of the Roman Factorial: Introduction to Foundational Functions and the Generalization Process Liponis, Leonidas Combinatorics 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. |
| title | Universal Definitions of the Roman Factorial: Introduction to Foundational Functions and the Generalization Process |
| topic | Combinatorics |
| url | https://arxiv.org/abs/2403.09581 |