Enumeration of Graphs and the Characteristic Polynomial of the Hyperplane Arrangements \mathcal{J}_n

DOI10.4134/JKMS.J160586zbMATH Open1388.32024arXiv1701.07313OpenAlexW3199424936MaRDI QIDQ4609969FDOQ4609969

Authors: Joung Min Song 

Publication date: 27 March 2018

Abstract: We give a complete formula for the characteristic polynomial of hyperplane arrangements $mathcal{J}_n$ consisting of the hyperplanes $x_i+x_j=1$, $x_k=0$, $x_l=1$, $1leqi,j,k,lleqn$. The formula is obtained by associating hyperplane arrangements with graphs, and then enumerating central graphs via generating functions for the number of bipartite graphs of given order, size and number of connected components.

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

Recommendations

• On the enumeration of a certain type of hyperplane arrangements
• The characteristic polynomials of the graphical arrangements corresponding to simply-connected polygons
• Characteristic polynomial of the hyperplane arrangements \(\mathcal{J}_n\) via finite field method
• Characteristic polynomials of graphical arrangements corresponding to wheel graphs and join graphs
• On the enumeration of a class of plane multigraphs
• An identity for the coefficients of characteristic polynomials of hyperplane arrangements
• Chordal graphs and the characteristic polynomial
• On the characteristic polynomial of \(n\)-Cayley digraphs
• scientific article; zbMATH DE number 4051682

zbMATH Keywords

characteristic polynomialhyperplane arrangements

Mathematics Subject Classification ID

Relations with arrangements of hyperplanes (32S22)

Cited In (10)

• On the enumeration of a certain type of hyperplane arrangements
• Counting regions of the boxed threshold arrangement
• Characteristic polynomial of the hyperplane arrangements \(\mathcal{J}_n\) via finite field method
• The characteristic polynomials of the graphical arrangements corresponding to simply-connected polygons
• Matroids of gain signed graphs
• Characteristic polynomials of graphical arrangements corresponding to wheel graphs and join graphs
• On the matching arrangement of a graph and properties of its characteristic polynomial
• Ferrers graphs, D-permutations, and surjective staircases
• On certain hyperplane arrangements and colored graphs
• Poincaré polynomial of a class of signed complete graphic arrangements

This page was built for publication: Enumeration of Graphs and the Characteristic Polynomial of the Hyperplane Arrangements $\mathcal{J}_n$

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