Dynamically generated Networks
Oliver Knill

TL;DR
This paper explores a class of complex networks generated by algebraic rules involving monoids and rings, linking them to dynamical systems and number theory, and illustrating their properties through various mathematical concepts.
Contribution
It introduces a novel class of networks generated by algebraic rules and connects them to multiple areas of mathematics, including dynamical systems and number theory.
Findings
Networks exhibit rich structures and complex patterns.
Connections to classical number theory problems like Fermat primes.
Elementary results related to the Chinese remainder theorem and Collatz problem.
Abstract
Simple algebraic rules can produce complex networks with rich structures. These graphs are obtained when looking at a monoid operating on a ring. There are relations to dynamical systems theory and number theory. This document illustrates this class of networks introduced together with Montasser Ghachem. Besides showing off pictures, we look at elementary results related to the Chinese remainder theorem, the Collatz problem, the Artin constant, Fermat primes and Pierpont primes.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsBenford’s Law and Fraud Detection · Computability, Logic, AI Algorithms · Complex Systems and Time Series Analysis
