A combinatorial method for computing characteristic polynomials of starlike hypergraphs

Using the Poisson formula for resultants, and variants of the chip-firing game on graphs, we provide a combinatorial method for computing a class of resultants corresponding to the characteristic polynomials of the adjacency tensors of starlike hypergraphs including hyperpaths and hyperstars, which...

Full description

Saved in:
Bibliographic Details
Published inJournal of algebraic combinatorics Vol. 51; no. 4; pp. 589 - 616
Main Authors Bao, Yan-Hong, Fan, Yi-Zheng, Wang, Yi, Zhu, Ming
Format Journal Article
LanguageEnglish
Published New York Springer US 01.06.2020
Springer Nature B.V
Subjects
Combinatorial analysis
Combinatorics
Computation
Computer Science
Convex and Discrete Geometry
Graph theory
Group Theory and Generalizations
Lattices
Mathematics
Mathematics and Statistics
Order
Ordered Algebraic Structures
Polynomials
Resultants
Tensors
Hypergraph
05C65
Resultant
Adjacency tensor
Characteristic polynomial
13P15
Chip firing
15A18
Online AccessGet full text

Cover

More Information
Summary:Using the Poisson formula for resultants, and variants of the chip-firing game on graphs, we provide a combinatorial method for computing a class of resultants corresponding to the characteristic polynomials of the adjacency tensors of starlike hypergraphs including hyperpaths and hyperstars, which are given recursively and explicitly.
ISSN:0925-9899
1572-9192
DOI:10.1007/s10801-019-00886-7