Graphic Monomial Arrangements

• Graphic monomial arrangements are frameworks that generalize graphic hyperplane arrangements by substituting linear equations with monomial relations.
• They classify algebraic bipartite graphs through cycle structures (girths 4, 6, or 8) determined by specific parity conditions of the exponents.
• These arrangements bridge combinatorial, algebraic, and geometric methods, impacting extremal graph theory, characteristic polynomials, and spline theory.

A graphic monomial arrangement generalizes classical graphic hyperplane arrangements by replacing linear defining equations with monomial or group‐twisted relations, yielding a flexible bridge between combinatorial, algebraic, and geometric frameworks. The concept encompasses both algebraically defined bipartite monomial graphs classified by cycle structure and the monomial deformation of traditional graphic hyperplane arrangements, with ramifications for freeness, chromatic polynomials, reflection group arrangements, and extremal graph theory.

1. Algebraic Monomial Graphs: Definition and Classification

The core construct in the study of three-dimensional real monomial graphs is the bipartite graph $\Gamma_{\mathbb{R}}(X^sY^t, X^uY^v)$ for positive integers $s,t,u,v$. Each partite set is identified with $\mathbb{R}^3$:

• Left vertices: $(a_1,a_2,a_3)\in\mathbb{R}^3$
• Right vertices: $[x_1,x_2,x_3]\in\mathbb{R}^3$

An edge exists from $(a_1,a_2,a_3)$ to $[x_1,x_2,x_3]$ if and only if: $$a_2 + x_2 = a_1^s x_1^t, \qquad a_3 + x_3 = a_1^u x_1^v$$ Concise notation: $(a_1,a_2,a_3) \sim [x_1,x_2,x_3]$ iff $a_i + x_i = f_i(a_1,x_1)$ for $i=2,3$, with $f_2(X,Y)=X^sY^t$, $f_3(X,Y)=X^uY^v$.

A complete classification of possible girths (the size of the minimal cycle) of these graphs is achieved. The only possible values are $4$, $6$, or $8$, with precise criteria determined by the parities and relative sizes of $s,t,u,v$:

• Girth $4$ if and only if at least one of $s,t$ and at least one of $u,v$ is even.
• Girth $6$ (no $4$-cycles, but a $6$-cycle exists) if one of seven explicit parity/inequality patterns holds.
• Girth $8$ if a single monomial has an even $X$-exponent and the other an odd $Y$-exponent with strict inequality, specifically $\Gamma_{\mathbb{R}}(X Y^{2k+1}, X Y^{2n})$ with $n>k$ (Kodess et al., 2021).

2. Monomial Hyperplane Arrangements

The "graphic monomial arrangement" $\mathcal{M}(G,r)$ combines a graph $G=(V,E)$, an integer $r\geq 1$, and a primitive $r$th root of unity $z$ in a field $\Bbb{K}$. For $V=[\ell]$ and $G$ simple, it is defined in $V=\Bbb{K}^\ell$ by the hyperplanes: $$\mathcal{M}(G,r) = \{x_i=0 : 1\leq i\leq\ell\} \cup \{x_i - z^k x_j = 0 : (i,j)\in E, 0\leq k<r\}$$ The defining polynomial is: $$Q(\mathcal{M}(G,r)) = \prod_{i=1}^\ell x_i \prod_{\{i,j\}\in E} (x_i^r - x_j^r)$$ A simplified version (omitting coordinate hyperplanes) is $\mathcal{M}^0(G,r)$.

Monomial arrangements interpolate between:

• Classical graphic arrangements ($\mathcal{A}_G$ where $r=1$)
• $q$-deformations ($r=q-1$, $\Bbb{K}=\mathbb{F}_q$)
• Reflection arrangements of the monomial group $G(r,1,\ell)$ ($G=K_\ell$, $\Bbb{K}=\mathbb{C}$) (Nian, 10 Jan 2026).

3. Cycle Structure and Parity Criteria

The existence and structure of small cycles in $\Gamma_{\mathbb{R}}(X^sY^t,X^uY^v)$ are governed by the $\Delta$-notation:

• A $4$-cycle of type $(a,b;x,y)$ exists if, for $i=2,3$, $\Delta_2(f_i)(a,b;x,y) = 0$, where $$\Delta_2(f)(a,b;x,y) = f(a,x) - f(b,x) + f(b,y) - f(a,y)$$.
• A $6$-cycle of type $(a,b,c;x,y,z)$ exists if $\Delta_3(f_i)(a,b,c;x,y,z) = 0$ for $i=2,3$, with a corresponding alternating sum.

Parity constraints ensure:

• No $4$-cycles when both exponents in a monomial are odd.
• Cycles of larger length (e.g., $6$ or $8$) can exist, with their exact minimal length determined by explicit root-finding (real solutions) and monotonicity arguments.

Concrete examples:

• $(s,t,u,v)=(1,1,1,1)$: all odd exponents, girth $6$.
• $(s,t,u,v)=(2,3,1,2)$: both monomials admit an even exponent, girth $4$ (Kodess et al., 2021).

4. Characteristic Polynomials and Freeness

For monomial hyperplane arrangements, the chromatic and characteristic polynomials admit a precise formula: $$\chi(\mathcal{M}(G,r), t) = r^\ell \chi\left(G, \frac{t-1}{r}\right)$$ where $\chi(G, t)$ is the chromatic polynomial of $G$. This relation is established inductively via the deletion-contraction principle. The formula encapsulates the interplay between graph colorings and geometric properties of the arrangement (Nian, 10 Jan 2026).

Freeness in this context denotes that the module of logarithmic derivations is free: $$D(\mathcal{A}) = \{\theta \in \mathrm{Der}_{\Bbb{K}}[x_1,\ldots,x_\ell] : \theta(Q(\mathcal{A})) \in (Q(\mathcal{A}))\}$$ Saito’s criterion applies, and explicit bases generalizing the Vandermonde or Moore matrix constructions are provided when $G$ admits a perfect-elimination ordering (i.e., $G$ is chordal). For such graphs, one obtains

$$\exp(\mathcal{M}(G,r)) = (r e_1 + 1, \ldots, r e_\ell + 1),$$

where $(e_1,\ldots,e_\ell)$ are the exponents of the ordinary graphic arrangement (Nian, 10 Jan 2026).

5. Homological Methods and Applications to Splines

Generalized splines are modules $R_{G,m}$ over a ring $R$ associated to a graph $G$ and edge-labeling by ideals $m(e)$. They are realized as the zeroth cohomology of a chain complex $C_*(G;m)$ constructed from the clique complex $\Delta(G)$. The hyperhomology of $C_*$ yields upper bounds on the projective dimension of $R_{G,m}$, with sharpened criteria for freeness in terms of the vanishing of higher cohomology and Cohen–Macaulayness on associated rings (DiPasquale, 2016).

For graphic multi-arrangements, analysis via these tools provides criteria:

• The module $D(\mathcal{A}_G, m)$ is free if and only if all higher $H^i(R/J[G])=0$.
• The arrangement $\mathcal{A}_G^{(k)}$ with constant multiplicity $k\geq 2$ is free if and only if $G$ decomposes as a product of braid (Coxeter type $A$) arrangements, i.e., every block is a complete graph.

6. Broader Implications and Connections

The study of graphic monomial arrangements has several significant consequences:

• Extremal graph theory: High-girth, dense algebraically-defined bipartite graphs serve as extremal examples for problems such as the Zarankiewicz problem.
• Incidence geometry: Graphs with girth $8$ can analogously model generalized quadrangles; over finite fields, they provide explicit algebraic constructions, while over $\mathbb{R}$, they inform analytic theories of incidence (Kodess et al., 2021).
• Algebraic combinatorics: The monomial arrangement framework unifies classical graphic arrangements, $q$-deformed arrangements, and complex reflection group arrangements, systematically organizing isomorphism classes and automorphism groups.

Plausible implications are the potential extension to arrangements associated with higher-dimensional simplicial complexes, and connections to $q$-Stirling numbers and the topology of zonotopes and hyperplane complements. An open conjecture is that there exists an analogously explicit characteristic polynomial theory for such higher-dimensional generalizations, recovering the chromatic polynomial in suitable limits (Nian, 10 Jan 2026).