Arithmetical structures on bidents

DOI10.1016/J.DISC.2020.111850MaRDI QIDQ2182185zbMATH OpenOpenAlexFDO

Authors Kassie Archer, Abigail C. Bishop, Alexander Diaz-Lopez, Darren B. Glass, Joel Louwsma, Luis David Garcia Puente

Publication date 21 May 2020

Published in Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

Catalan numberLaplacian matrixcritical groupsandpile grouparithmetical structure

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Abstract: An arithmetical structure on a finite, connected graph $G$ is a pair of vectors $(mathbfd,mathbfr)$ with positive integer entries for which $(operatornamediag(mathbfd)-A)mathbfr=mathbf0$, where $A$ is the adjacency matrix of $G$ and where the entries of $mathbfr$ have no common factor. The critical group of an arithmetical structure is the torsion part of the cokernel of $(operatornamediag(mathbfd)-A)$. In this paper, we study arithmetical structures and their critical groups on bidents, which are graphs consisting of a path with two "prongs" at one end. We give a process for determining the number of arithmetical structures on the bident with $n$ vertices and show that this number grows at the same rate as the Catalan numbers as $n$ increases. We also completely characterize the groups that occur as critical groups of arithmetical structures on bidents.

Recommendations

• Counting arithmetical structures on paths and cycles
• Critical groups of arithmetical structures under a generalized star-clique operation
• Arithmetical structures on graphs
• Arithmetical structures on graphs with connectivity one
• Arithmetical structures on paths with a doubled edge

Cites work

• scientific article; zbMATH DE number 3405946 (Why is no real title available?)
• scientific article; zbMATH DE number 2231186 (Why is no real title available?)
• Arithmetical graphs
• Arithmetical structures on graphs
• Arithmetical structures on graphs with connectivity one
• Chip-firing and Riemann-Roch theory for directed graphs
• Counting arithmetical structures on paths and cycles
• Divisors and sandpiles. An introduction to chip-firing
• Sharper Bounds for the Chebyshev Functions θ(x) and ψ(x)
• Smith normal form in combinatorics

Cited in

(9)

• Critical groups of arithmetical structures under a generalized star-clique operation
• The extremal spectral radii of the arithmetical structures on paths
• Bounding the number of arithmetical structures on graphs
• Critical groups of arithmetical structures on star graphs and complete graphs
• Counting arithmetical structures on paths and cycles
• Chip-firing games and critical groups
• Arithmetical structures on paths with a doubled edge
• Arithmetical structures on dominated polynomials
• The critical polynomial of a graph

Describes a project that uses

Uses Software

• SageMath
• OEIS

This page was built for publication: Arithmetical structures on bidents

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