Apriorics: Information and Graphs in the Description of the Fundamental Particles—A Mathematical Proof

Yakir Shoshani and Asher Yahalom ()
Additional contact information
Yakir Shoshani: Shenkar College of Engineering, Ramat Gan 5252628, Israel
Asher Yahalom: Department of Electrical and Electronic Engineering, Faculty of Engineering, Kiryat Hamada POB 3, Ariel 40700, Israel

Mathematics, 2024, vol. 12, issue 4, 1-20

Abstract: In our earlier work, we suggested an axiomatic framework for deducing the fundamental entities which constitute the building block of the elementary particles in physics. The basic concept of this theory, named apriorics, is the ontological structure (OS)—an undirected simple graph satisfying specified conditions. The vertices of this graph represent the fundamental entities (FEs), its edges are binary compounds of the FEs (which are the fundamental bosons and fermions), and the structures constituting more than two connected vertices are composite particles. The objective of this paper is to focus the attention on several mathematical theorems and ideas associated with such graphs of order n, including their enumeration, showing what is the information content of apriorics.

Keywords: graph theory; fundamental particles (search for similar items in EconPapers)
JEL-codes: C (search for similar items in EconPapers)
Date: 2024
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
https://www.mdpi.com/2227-7390/12/4/579/pdf (application/pdf)
https://www.mdpi.com/2227-7390/12/4/579/ (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:gam:jmathe:v:12:y:2024:i:4:p:579-:d:1339089

Access Statistics for this article

Mathematics is currently edited by Ms. Emma He

More articles in Mathematics from MDPI
Bibliographic data for series maintained by MDPI Indexing Manager ().