Chung–Graham Representation

• Chung–Graham representation is a canonical framework that translates complex combinatorial structures into formal algebraic or combinatorial forms with unique admissibility rules.
• It organizes quasirandom properties in graphs and hypergraphs and underpins chromatic polynomial expansions in gain graphs through structured bases.
• The representation extends to permutation statistics and Fibonacci-based numeration, yielding symmetric polynomial encodings and unique integer decompositions.

Searching arXiv for papers explicitly about “Chung-Graham representation” and closely related usages. First, I’ll look for papers with “Chung-Graham” in the title or abstract. The term Chung–Graham representation is used in several technically distinct senses associated with work of Fan Chung and Ronald Graham. In extremal combinatorics, it denotes an organized hierarchy of quasirandomness properties, recording implications, equivalences, and separations among formal pseudorandomness tests. In algebraic and enumerative graph theory, it refers to classical expansions of chromatic polynomials in monomial and falling-factorial bases, together with gain-graph generalizations. In enumerative combinatorics on permutations, it denotes a polynomial representation of bounded-drop descent distributions through the families $P_k(x)$, $Q_k(x)$, and $R_{n,k}(x)$. In additive numeration, it denotes the unique decomposition of integers into even-indexed Fibonacci numbers with digits in $\{0,1,2\}$ subject to a spacing rule for the digit $2$. These usages share a common structural feature: each provides a canonical representation that converts a class of objects into a constrained algebraic, combinatorial, or logical form (Lenz et al., 2012, Chang, 1 Apr 2025, Chen et al., 2013).

1. Quasirandomness hierarchies in graphs and hypergraphs

In the quasirandomness literature, the Chung–Graham representation organizes a family of quasirandom properties into a logically determined hierarchy: each property is a formal test for pseudorandom behavior, and the representation consists of the implications, equivalences, and separations among them (Lenz et al., 2012). For graphs, Chung–Graham–Wilson showed that many natural dense quasirandomness properties are equivalent. If $G$ is a graph on $n$ vertices with edge density $p=e(G)/\binom{n}{2}$, the equivalent properties include discrepancy on all induced subgraphs,

$|E(G[U])| = p \binom{|U|}{2} \pm o(n^2),$

cut or expansion estimates

$E_G(S,T) = p |S| |T| \pm o(n^2),$

small subgraph counts such as

$Q_k(x)$0

and spectral control

$Q_k(x)$1

where $Q_k(x)$2 is the adjacency matrix (Lenz et al., 2012).

For $Q_k(x)$3-uniform hypergraphs with $Q_k(x)$4, the situation fragments. The paper "The Poset of Hypergraph Quasirandomness" determines the full poset of implications among the principal quasirandom properties—expansion, clique discrepancy, and deviation—thereby resolving Chung’s problem on the quasirandom hierarchy for hypergraphs (Lenz et al., 2012). A $Q_k(x)$5-uniform hypergraph $Q_k(x)$6 has edge density $Q_k(x)$7, and the relevant properties include:

• $Q_k(x)$8, indexed by a proper partition $Q_k(x)$9 of $R_{n,k}(x)$0, requiring

$R_{n,k}(x)$1

• $R_{n,k}(x)$2, requiring

$R_{n,k}(x)$3

for every $R_{n,k}(x)$4-uniform $R_{n,k}(x)$5.

• $R_{n,k}(x)$6, defined by signed octahedral parity sums of order $R_{n,k}(x)$7 (Lenz et al., 2012).

The representation theorem establishes the exact logical structure. For proper partitions $R_{n,k}(x)$8 of $R_{n,k}(x)$9,

$\{0,1,2\}$0

Also,

$\{0,1,2\}$1

while every $\{0,1,2\}$2 implies $\{0,1,2\}$3 but no $\{0,1,2\}$4 implies $\{0,1,2\}$5 for $\{0,1,2\}$6. The deviation properties sit above all expansions: $\{0,1,2\}$7 for all $\{0,1,2\}$8, and $\{0,1,2\}$9 is equivalent to $2$0 (Lenz et al., 2012).

A central significance of this representation is the contrast with the graph case. For graphs, one certificate effectively certifies all the others; for hypergraphs, the representation is a genuine poset rather than a single equivalence class. This suggests that hypergraph quasirandomness is intrinsically multi-level rather than unified. The same paper notes consequences for testing and embedding: to certify $2$1, it suffices to count $2$2-linear subhypergraphs asymptotically, while clique-based tests certify expansions only up to the largest block size $2$3 (Lenz et al., 2012).

2. Oriented-graph and tournament analogues

A closely related use of the Chung–Graham representation occurs for tournaments and oriented graphs. The paper "Quasi-random oriented graphs" extends Chung–Graham’s tournament characterization to orientations of an arbitrary underlying graph $2$4 (Griffiths, 2011). Here the representation is again a system of equivalent quasirandomness conditions, now expressed relative to a fixed undirected host graph.

Let $2$5 be an oriented graph with underlying graph $2$6, and let $2$7 be its skew-adjacency matrix, with entries $2$8 if $2$9, $G$0 if $G$1, and $G$2 otherwise. The main theorem proves equivalence among conditions including:

• correct counts of certain oriented $G$3-cycle types, such as

$G$4

• correct counts of all small oriented patterns,

$G$5

• uniform cut-direction balance,

$G$6

• fourth-moment and spectral conditions on $G$7, including

$G$8

(Griffiths, 2011).

One notable feature is that exactly two of the four orientations of a $G$9-cycle can serve as quasirandomness certificates. Type IV cycles satisfy the lower bound

$n$0

and Type II cycles satisfy the upper bound

$n$1

If either count is close to its random-orientation benchmark, then all the other quasirandom properties follow (Griffiths, 2011).

This oriented-graph representation is not the same object as the hypergraph poset. It is instead an equivalence theorem in the style of Chung–Graham–Wilson, but adapted to orientations and normalized by the underlying graph $n$2. A plausible implication is that “Chung–Graham representation” in quasirandomness should be understood not as a single theorem but as a program: encode pseudorandomness by a family of test properties and determine their exact logical relations.

3. Chromatic-polynomial expansions and gain graphs

In chromatic graph theory, the Chung–Graham representation refers to basis expansions of the chromatic polynomial, especially the monomial basis $n$3 and the falling-factorial basis $n$4. For an ordinary graph $n$5, the classical identities are

$n$6

and

$n$7

where $n$8 denotes the stable partitions of $n$9 (Berthome et al., 2010). The second formula is the Chung–Graham-type falling-factorial representation: coefficients count stable partitions, and the basis terms come from complete graphs on the contracted blocks.

The paper "An elementary chromatic reduction for gain graphs and special hyperplane arrangements" generalizes these expansions to gain graphs through the neutral chromatic group $p=e(G)/\binom{n}{2}$0 (Berthome et al., 2010). A gain graph $p=e(G)/\binom{n}{2}$1 consists of an underlying graph $p=e(G)/\binom{n}{2}$2 together with a gain mapping into a group $p=e(G)/\binom{n}{2}$3, with switching defined by

$p=e(G)/\binom{n}{2}$4

Weak neutral chromatic functions satisfy deletion–contraction on neutral links,

$p=e(G)/\binom{n}{2}$5

and vanish on neutral loops (Berthome et al., 2010).

Two key gain-graph identities generalize the classical Chung–Graham expansions. If $p=e(G)/\binom{n}{2}$6 is the neutral subgraph with neutral edge set $p=e(G)/\binom{n}{2}$7, then

$p=e(G)/\binom{n}{2}$8

which is the monomial-type expansion, and

$p=e(G)/\binom{n}{2}$9

which is the falling-factorial-type expansion (Berthome et al., 2010).

Applying weak neutral chromatic invariants to these group identities produces expansions for the zero-free chromatic polynomial $|E(G[U])| = p \binom{|U|}{2} \pm o(n^2),$0, the total chromatic polynomial

$|E(G[U])| = p \binom{|U|}{2} \pm o(n^2),$1

and integral or modular chromatic functions (Berthome et al., 2010). The same framework yields explicit formulas for gain graphs corresponding to the Catalan, Shi, and Linial arrangements. For example,

$|E(G[U])| = p \binom{|U|}{2} \pm o(n^2),$2

and

$|E(G[U])| = p \binom{|U|}{2} \pm o(n^2),$3

with the Linial polynomial also equal to Athanasiadis’s formula

$|E(G[U])| = p \binom{|U|}{2} \pm o(n^2),$4

(Berthome et al., 2010).

In this setting, the Chung–Graham representation is not a hierarchy of properties but a representational calculus. It expresses a graph or gain graph as a canonical linear combination of contracted minors or neutral completions, thereby transferring combinatorial information into basis expansions of chromatic invariants.

4. Polynomial representations for permutations with bounded drop size

In permutation enumeration, the Chung–Graham representation concerns the descent distribution on permutations with bounded maximum drop size. For $|E(G[U])| = p \binom{|U|}{2} \pm o(n^2),$5, the maximum drop size is

$|E(G[U])| = p \binom{|U|}{2} \pm o(n^2),$6

and $|E(G[U])| = p \binom{|U|}{2} \pm o(n^2),$7 denotes the set of permutations of $|E(G[U])| = p \binom{|U|}{2} \pm o(n^2),$8 with maximum drop size at most $|E(G[U])| = p \binom{|U|}{2} \pm o(n^2),$9. The corresponding descent polynomial is

$E_G(S,T) = p |S| |T| \pm o(n^2),$0

(Chen et al., 2013).

Chung, Claesson, Dukes, and Graham introduced polynomials $E_G(S,T) = p |S| |T| \pm o(n^2),$1 through a recurrence for $E_G(S,T) = p |S| |T| \pm o(n^2),$2, and the paper "On Permutations with Bounded Drop Size" develops their coefficient structure (Chen et al., 2013). The central formulas are

$E_G(S,T) = p |S| |T| \pm o(n^2),$3

The coefficients of $E_G(S,T) = p |S| |T| \pm o(n^2),$4 and $E_G(S,T) = p |S| |T| \pm o(n^2),$5 refine descent statistics jointly with the last value of the permutation: $E_G(S,T) = p |S| |T| \pm o(n^2),$6 and

$E_G(S,T) = p |S| |T| \pm o(n^2),$7

(Chen et al., 2013).

A principal result is the symmetry of $E_G(S,T) = p |S| |T| \pm o(n^2),$8: $E_G(S,T) = p |S| |T| \pm o(n^2),$9 The paper gives a bijective proof by constructing an involution $Q_k(x)$00 on $Q_k(x)$01. For a permutation $Q_k(x)$02, let $Q_k(x)$03 denote the append-and-standardize operation obtained by appending $Q_k(x)$04 and increasing each existing entry at least $Q_k(x)$05 by $Q_k(x)$06. If $Q_k(x)$07, where

$Q_k(x)$08

then $Q_k(x)$09 maps $Q_k(x)$10 bijectively to $Q_k(x)$11, where

$Q_k(x)$12

and

$Q_k(x)$13

(Chen et al., 2013).

This use of “Chung–Graham representation” is therefore a refined polynomial encoding of bounded-drop Eulerian statistics. It is structurally analogous to the chromatic and quasirandom usages in that a complex combinatorial class is encoded by canonical coefficients with strong symmetry or unimodality. The same paper also treats the type $Q_k(x)$14 analogue, introducing $Q_k(x)$15 and proving Hyatt’s unimodality conjecture by embedding its coefficients into a symmetric unimodal auxiliary polynomial $Q_k(x)$16 (Chen et al., 2013).

5. Integer representations using even-indexed Fibonacci numbers

A different and now prominent meaning of the Chung–Graham representation is an additive numeration system based on Fibonacci numbers. The paper "Chung-Graham and Zeckendorf representations" states the Chung–Graham theorem as follows: every non-negative integer $Q_k(x)$17 can be uniquely written as

$Q_k(x)$18

with

$Q_k(x)$19

and with the admissibility rule

$Q_k(x)$20

(Burns, 26 Feb 2025). Thus only even-indexed Fibonacci numbers are used, digits are ternary on those positions, and repeated $Q_k(x)$21's must be separated by an even-position zero.

The same paper gives an automata-theoretic bridge to Zeckendorf representation. If each CG digit is split by

$Q_k(x)$22

then an admissible CG string $Q_k(x)$23 determines two binary strings $Q_k(x)$24, each of which satisfies the Zeckendorf no-consecutive-ones constraint, and

$Q_k(x)$25

Using Walnut, the paper constructs automata $Q_k(x)$26, $Q_k(x)$27, $Q_k(x)$28, $Q_k(x)$29, and $Q_k(x)$30 to recognize valid CG strings, convert between CG and Zeckendorf, perform CG addition, and normalize arbitrary $Q_k(x)$31-strings (Burns, 26 Feb 2025). The relation

$Q_k(x)$32

encodes equality between a CG string and its Zeckendorf image (Burns, 26 Feb 2025).

The paper "The Chung-Graham Expansion" generalizes the original construction from the even subsequence $Q_k(x)$33 to equally spaced even-indexed subsequences

$Q_k(x)$34

for fixed even $Q_k(x)$35 (Chang, 1 Apr 2025). With

$Q_k(x)$36

where $Q_k(x)$37 is the corresponding Lucas value, every $Q_k(x)$38 has a unique expansion

$Q_k(x)$39

subject to the digit bounds

$Q_k(x)$40

together with spacing constraints on maximal digits $Q_k(x)$41 (Chang, 1 Apr 2025). For $Q_k(x)$42, one recovers the original Chung–Graham expansion with digits $Q_k(x)$43.

The same source gives a greedy constructive algorithm and a uniqueness proof based on the recurrence

$Q_k(x)$44

for even $Q_k(x)$45 (Chang, 1 Apr 2025). It also records explicit small examples for $Q_k(x)$46, such as

$Q_k(x)$47

corresponding to the coefficient pattern $Q_k(x)$48, where the zero between the two coefficients $Q_k(x)$49 is exactly the admissibility constraint (Chang, 1 Apr 2025).

6. Shift operators, intersections with Zeckendorf, and current developments

Recent work studies the Chung–Graham representation through shift operators and its interaction with Zeckendorf decompositions. The paper "Shifting Zeckendorf and Chung-Graham representations" defines the least-significant-digit shift $Q_k(x)$50 for Zeckendorf words and a valid double shift $Q_k(x)$51 for Chung–Graham words (Burns, 8 Jul 2025). For Zeckendorf,

$Q_k(x)$52

while for Chung–Graham,

$Q_k(x)$53

where $Q_k(x)$54 and $Q_k(x)$55 classify integers by the parity of the smallest Fibonacci term in their Zeckendorf expansion (Burns, 8 Jul 2025).

The same paper re-proves formulas for the sets $Q_k(x)$56 of integers whose Chung–Graham representation has smallest even Fibonacci $Q_k(x)$57: $Q_k(x)$58 and it refines $Q_k(x)$59 into $Q_k(x)$60 and $Q_k(x)$61 according to whether the least significant nonzero CG digit is $Q_k(x)$62 or $Q_k(x)$63 (Burns, 8 Jul 2025). It also records a decomposition of $Q_k(x)$64 as the disjoint union of $Q_k(x)$65 and OEIS A276885, where

$Q_k(x)$66

(Burns, 8 Jul 2025).

A more specialized development concerns integers that contain the same even Fibonacci term in both their Zeckendorf and Chung–Graham decompositions. The paper "Integers Having $Q_k(x)$67 in Both Zeckendorf and Chung-Graham Decompositions" proves that, for each $Q_k(x)$68, the set of positive integers having $Q_k(x)$69 in both decompositions is

$Q_k(x)$70

(Bustos et al., 28 Apr 2025). The proof uses the golden string $Q_k(x)$71, a Sturmian word with the property that the number of $Q_k(x)$72's in its first $Q_k(x)$73 letters is $Q_k(x)$74, and links the increments of the relevant integer sequences to whether specific letters of $Q_k(x)$75 are $Q_k(x)$76 or $Q_k(x)$77 (Bustos et al., 28 Apr 2025).

These papers are computational and structural rather than foundational. They do not redefine the Chung–Graham representation; instead, they analyze its regular-language structure, its compatibility with automata such as Walnut, and its interaction with Zeckendorf combinatorics. This suggests that the numeration-theoretic meaning of the term has evolved into an active subfield joining automata theory, Beatty sequences, and Fibonacci-based canonical forms (Burns, 26 Feb 2025, Burns, 8 Jul 2025, Bustos et al., 28 Apr 2025).

7. Common structure and terminological scope

Across its different meanings, the Chung–Graham representation is best understood as a family of canonical encoding principles rather than a single mathematical object. In quasirandomness, it is a hierarchy or equivalence system for pseudorandomness properties (Lenz et al., 2012, Griffiths, 2011). In chromatic theory, it is an expansion of graph or gain-graph invariants into natural bases determined by contraction and completion operations (Berthome et al., 2010). In permutation enumeration, it is a polynomial representation whose coefficients record refined Eulerian data and admit symmetry through an explicit involution (Chen et al., 2013). In numeration, it is a unique Fibonacci-based decomposition with digits constrained by local admissibility rules (Burns, 26 Feb 2025, Chang, 1 Apr 2025).

A common misconception is to treat the phrase as if it named only the Fibonacci decomposition. The literature shows a broader usage. The hypergraph paper explicitly uses the phrase for the full poset of quasirandom implications (Lenz et al., 2012), while the gain-graph paper presents exact analogues of Chung–Graham-style monomial and falling-factorial expansions of chromatic polynomials (Berthome et al., 2010). Conversely, papers on Zeckendorf and Chung–Graham representations use the phrase in a strictly numeration-theoretic sense (Burns, 26 Feb 2025, Burns, 8 Jul 2025).

A plausible unifying interpretation is that a Chung–Graham representation canonically translates a complex discrete structure into a constrained formal object whose admissibility conditions exactly capture the intended behavior: quasirandomness relations, chromatic reductions, descent statistics, or Fibonacci decompositions. The technical details vary substantially from one domain to another, but the recurrent theme is the same—uniqueness or exact logical organization replaces heuristic structure with a formal representation.