Zeon and Idem-Clifford Formulations of Hypergraph Problems
Fuente:
arXiv
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Preprint |
| Published: |
2022
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866916988373172224 |
|---|---|
| author | Ewing, Samuel Staples, G. Stacey |
| author_facet | Ewing, Samuel Staples, G. Stacey |
| contents | Zeon algebras have proven to be useful for enumerating structures in graphs, such as paths, trails, cycles, matchings, cliques, and independent sets. In contrast to an ordinary graph, in which each edge connects exactly two vertices, an edge (or, "hyperedge") can join any number of vertices in a hypergraph. In game theory, hypergraphs are called simple games. Hypergraphs have been used for problems in biology, chemistry, image processing, wireless networks, and more. In the current work, zeon ("nil-Clifford") and "idem-Clifford" graph-theoretic methods are generalized to hypergraphs. In particular, zeon and idem-Clifford methods are used to enumerate paths, trails, independent sets, cliques, and matchings in hypergraphs. An approach for finding minimum hypergraph transversals is developed, and zeon formulations of some open hypergraph problems are presented. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2201_05895 |
| institution | arXiv |
| publishDate | 2022 |
| record_format | arxiv |
| spellingShingle | Zeon and Idem-Clifford Formulations of Hypergraph Problems Ewing, Samuel Staples, G. Stacey Combinatorics Symbolic Computation Rings and Algebras Zeon algebras have proven to be useful for enumerating structures in graphs, such as paths, trails, cycles, matchings, cliques, and independent sets. In contrast to an ordinary graph, in which each edge connects exactly two vertices, an edge (or, "hyperedge") can join any number of vertices in a hypergraph. In game theory, hypergraphs are called simple games. Hypergraphs have been used for problems in biology, chemistry, image processing, wireless networks, and more. In the current work, zeon ("nil-Clifford") and "idem-Clifford" graph-theoretic methods are generalized to hypergraphs. In particular, zeon and idem-Clifford methods are used to enumerate paths, trails, independent sets, cliques, and matchings in hypergraphs. An approach for finding minimum hypergraph transversals is developed, and zeon formulations of some open hypergraph problems are presented. |
| title | Zeon and Idem-Clifford Formulations of Hypergraph Problems |
| topic | Combinatorics Symbolic Computation Rings and Algebras |
| url | https://arxiv.org/abs/2201.05895 |