Matthias Beck ; Yvonne Kemper - Flows on Simplicial Complexes

dmtcs:3085 - Discrete Mathematics & Theoretical Computer Science, January 1, 2012, DMTCS Proceedings vol. AR, 24th International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2012) - https://doi.org/10.46298/dmtcs.3085
Flows on Simplicial ComplexesConference paper

Authors: Matthias Beck 1; Yvonne Kemper 2

  • 1 Department of Mathematics [San Francisco]
  • 2 Department of Mathematics [Univ California Davis]

[en]
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 $\phi_{\Delta}(q)$ for certain $q$ and certain subclasses of simplicial complexes.

[fr]
Etant donné un graphe $G$, on est connu que le nombre de $\mathbb{Z}_q$-flots non-nuls $\phi _G(q)$ est un polynôme dans $q$. Nous étendons la définition de $\mathbb{Z} _q$-flots non-nuls pour inclure des complexes simpliciaux de dimension plus grande qu'un, et on montre que le nombre est aussi un polynôme de la fonction correspondante pour certain valeurs de $q$ et de certaines sous-classes de complexes simpliciaux.


Volume: DMTCS Proceedings vol. AR, 24th International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2012)
Section: Proceedings
Published on: January 1, 2012
Imported on: January 31, 2017
Keywords: [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM], [en] Nowhere-zero flows, simplicial complexes, matroids, Tutte polynomial
Funding:
    Source : OpenAIRE Graph
  • EMSW21-VIGRE: Focus on Mathematics; Funder: National Science Foundation; Code: 0636297
  • RUI: Computations in Ehrhart Theory; Funder: National Science Foundation; Code: 0810105
  • Algebraic and Geometric Computation with Applications; Funder: National Science Foundation; Code: 0914107

Consultation statistics

This page has been seen 360 times.
This article's PDF has been downloaded 1069 times.