Samuelson's Webs
Vladislav V. Goldberg, Valentin V. Lychagin
TL;DR
This paper introduces Samuelson's webs, defines their rank, and proves that their maximum rank is 6, providing conditions for achieving this maximum in general and singular cases.
Contribution
It establishes the concept of Samuelson's webs, defines their rank, and proves the maximum rank is 6 with conditions for attaining this maximum.
Findings
Maximum rank of Samuelson's webs is 6.
Conditions for maximal rank are identified.
The rank does not exceed 6 in general and singular cases.
Abstract
In the present paper we define Samuelson's webs and their rank. The main result of the paper is the proof that the rank of the Samuelson webs does not exceed 6, as well as finding the conditions under which this rank is maximal for the general Samuelson webs as well as for their singular cases.
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
Topicsgraph theory and CDMA systems · Cellular Automata and Applications · Advanced Graph Theory Research