Zeon and idem-Clifford formulations of hypergraph problems

DOI10.1007/S00006-022-01242-YzbMATH Open1503.05088arXiv2201.05895OpenAlexW4303423374MaRDI QIDQ2095249FDOQ2095249

Authors: Yanyan Li 

Publication date: 9 November 2022

Published in: Advances in Applied Clifford Algebras (Search for Journal in Brave)

Abstract: 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.

Full work available at URL: https://arxiv.org/abs/2201.05895

Recommendations

• Zeros of zeon polynomials and the zeon quadratic formula
• Zeon matrix inverses and the zeon combinatorial Laplacian
• Spectrally simple zeros of zeon polynomials
• Zeon roots
• Zeons, orthozeons, and graph colorings

zbMATH Keywords

transversalcyclehypergraphpathzeon algebras

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Hypergraphs (05C65) Finite-dimensional groups and algebras motivated by physics and their representations (81R05) Clifford algebras, spinors (15A66) Combinatorial aspects of groups and algebras (05E16)

Cites Work

• Clifford Algebras and Zeons
• Identifying the Minimal Transversals of a Hypergraph and Related Problems
• Hypergraph Independent Sets
• The journey of the union-closed sets conjecture
• Independent sets in bounded-degree hypergraphs
• A new adjacency matrix for finite graphs
• Title not available (Why is that?)
• Zeons, orthozeons, and graph colorings
• Complexity of counting cycles using zeons
• Application of hypergraph theory in chemistry
• Hypergraph theory in wireless communication networks
• On adjacency and e-adjacency in general hypergraphs: towards a new e-adjacency tensor
• Zeon matrix inverses and the zeon combinatorial Laplacian
• Zeon and idem-Clifford formulations of Boolean satisfiability
• Generalized zeon algebras: theory and application to multi-constrained path problems

Cited In (3)

• Zeons, orthozeons, and graph colorings
• Zeon matrix inverses and the zeon combinatorial Laplacian
• Binary linear codes via zeon and sym-Clifford algebras

This page was built for publication: Zeon and idem-Clifford formulations of hypergraph problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2095249)