QR-Code

Flows on Simplicial Complexes

Given a graph $G$, the number of nowhere-zero $\mathbb{Z}_q$-flows $\phi _G(q)$ is known to be a polynomial in $q$. We extend the definition of nowhere-zero $\mathbb{Z} _q$-flows to simplicial complexes $\Delta$ of dimension greater than one, and prove the polynomiality of the corresponding function...

Ausführliche Beschreibung

Gespeichert in:
Bibliografische Detailangaben
Hauptverfasser: Matthias Beck, Yvonne Kemper
Format: Artigo
Sprache:Inglês
Veröffentlicht: Discrete Mathematics & Theoretical Computer Science 2012-01-01
Schriftenreihe:Discrete Mathematics & Theoretical Computer Science
Schlagworte:
Online-Zugang:https://dmtcs.episciences.org/3085/pdf
Tags: Tag hinzufügen
Keine Tags, Fügen Sie das erste Tag hinzu!