A080690 -id:A080690 - cp's OEIS frontend

A182368 Triangle T(n,k), n>=1, 0<=k<=n^2, read by rows: row n gives the coefficients of the chromatic polynomial of the square grid graph G_(n,n), highest powers first.

1, 0, 1, -4, 6, -3, 0, 1, -12, 66, -216, 459, -648, 594, -323, 79, 0, 1, -24, 276, -2015, 10437, -40614, 122662, -292883, 557782, -848056, 1022204, -960627, 682349, -346274, 112275, -17493, 0, 1, -40, 780, -9864, 90798, -647352, 3714180, -17590911, 69997383

Offset: 1

Alois P. Heinz, Apr 26 2012

The square grid graph G_(n,n) has n^2 = A000290(n) vertices and 2*n*(n-1) = A046092(n-1) edges. The chromatic polynomial of G_(n,n) has n^2+1 = A002522(n) coefficients.

			3 example graphs:                          o---o---o
.                                          |   |   |
.                             o---o        o---o---o
.                             |   |        |   |   |
.                o            o---o        o---o---o
Graph:        G_(1,1)        G_(2,2)        G_(3,3)
Vertices:        1              4              9
Edges:           0              4             12
The square grid graph G_(2,2) is the cycle graph C_4 with chromatic polynomial q^4 -4*q^3 +6*q^2 -3*q => row 2 = [1, -4, 6, -3, 0].
Triangle T(n,k) begins:
  1,    0;
  1,   -4,     6,      -3,        0;
  1,  -12,    66,    -216,      459,       -648,         594, ...
  1,  -24,   276,   -2015,    10437,     -40614,      122662, ...
  1,  -40,   780,   -9864,    90798,    -647352,     3714180, ...
  1,  -60,  1770,  -34195,   486210,   -5421612,    49332660, ...
  1,  -84,  3486,  -95248,  1926585,  -30755376,   403410654, ...
  1, -112,  6216, -227871,  6205479, -133865298,  2382122274, ...
  1, -144, 10296, -487280, 17169852, -480376848, 11114098408, ...
  ...

Alois P. Heinz, Rows n = 1..9, flattened
Eric Weisstein's World of Mathematics, Chromatic Polynomial
Eric Weisstein's World of Mathematics, Grid Graph
Wikipedia, Chromatic Polynomial

Columns 0, 1 give: A000012, (-1)*A046092(n-1).
Sums of absolute values of row elements give: A080690(n).
Cf. A000290, A002522, A182406, A185442, A193233, A193277, A193283.

Reverse /@ CoefficientList[Table[ChromaticPolynomial[GridGraph[{n, n}], x], {n, 5}], x] // Flatten (* Eric W. Weisstein, May 01 2017 *)

A007341 Number of spanning trees in n X n grid.

Original entry on oeis.org

1, 4, 192, 100352, 557568000, 32565539635200, 19872369301840986112, 126231322912498539682594816, 8326627661691818545121844900397056, 5694319004079097795957215725765328371712000, 40325021721404118513276859513497679249183623593590784, 2954540993952788006228764987084443226815814190099484786032640000

Offset: 1

N. J. A. Sloane

Kreweras calls this the complexity of the n X n grid.
a(n) is the number of perfect mazes made from a grid of n X n cells. - Leroy Quet, Sep 08 2007
Also number of domino tilings of the (2n-1) X (2n-1) square with upper left corner removed.  For n=2 the 4 domino tilings of the 3 X 3 square with upper left corner removed are:
. ._. . ._. . ._. . ._.
.|__| .|__| .| | | .|___|
| |_| | | | | | ||| |_| |
||__| |||_| ||__| |_|_| - Alois P. Heinz, Apr 15 2011
Indeed, more is true. Let L denote the (2*n - 1) X (2*n - 1) square lattice graph with vertices (i,j), 1 <= i,j <= 2*n-1. Call a vertex (i,j) odd if both coordinates i and j are odd. Then there is a bijection between the set of spanning trees on the square n X n grid and the set of domino tilings of L with an odd boundary point removed. See Tzeng and Wu, 2002. This is a divisibility sequence, i.e., if n divides m then a(n) divides a(m). - Peter Bala, Apr 29 2014
Also, a(n) is the order of the sandpile group of the (n-1)X(n-1) grid graph. This is because the n X n grid is dual to (n-1)X(n-1) grid + sink vertex, and the latter is related to the sandpiles by the burning bijection. See Járai, Sec. 4.1, or Redig, Sec. 2.2. In M. F. Hasler's comment below, index n refers to the size of the grid underlying the sandpile. - Andrey Zabolotskiy, Mar 27 2018
From M. F. Hasler, Mar 07 2018: (Start)
The sandpile addition (+) of two n X n matrices is defined as the ordinary addition, followed by the topple-process in which each element larger than 3 is decreased by 4 and each of its von Neumann neighbors is increased by 1.
For any n, there is a neutral element e_n such that the set S(n) = { A in M_n({0..3}) | A (+) e_n = A } of matrices invariant under sandpile addition of e_n, forms a group, i.e., each element A in S(n) has an inverse A' in S(n) such that A (+) A' = e_n. (For n > 1, e_n cannot be the zero matrix O_n, because for this choice S(n) would include, e.g., the all 1's matrix 1_n which cannot have an inverse X such that 1_n (+) X = O_n. The element e_n is the unique nonzero matrix such that e_n (+) e_n = e_n.)
The present sequence lists the size of the abelian group (S(n), (+), e_n). See the example section for the e_n. The elements of S(2) are listed as A300006 and their inverses are listed as A300007. (End)

			From _M. F. Hasler_, Mar 07 2018: (Start)
For n = 1, there exists only one 0 X 0 matrix, e_0 = []; it is the neutral element of the singleton group S(0) = {[]}.
For n = 2, the sandpile addition is isomorphic to addition in Z/4Z, the neutral element is e_1 = [0] and we get the group S(1) isomorphic to (Z/4Z, +).
For n = 3, one finds that e_2 = [2,2;2,2] is the neutral element of the sandpile addition restricted to S(2), having 192 elements, listed in A300006.
For n = 4, one finds that e_3 = [2,1,2;1,0,1;2,1,2] is the neutral element of the sandpile addition restricted to S(3), having 100352 elements.
For n = 5, the neutral element is e_4 = [2,3,3,2; 3,2,2,3; 3,2,2,3; 2,3,3,2]. (End)

N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

Alois P. Heinz, Table of n, a(n) for n = 1..45
Anakin Dey, Sam Ruggerio, and Melkior Ornik, Optimizing a Model-Agnostic Measure of Graph Counterdeceptiveness via Reattachment, arXiv:2311.15093 [math.OC], 2023. See p. 10.
Noah Doman, The Identity of the Abelian Sandpile Group, Bachelor Thesis, University of Groningen (Netherlands 2020).
Laura Florescu, Daniela Morar, David Perkinson, Nick Salter and Tianyuan Xu, Sandpiles and Dominos, Electronic Journal of Combinatorics, Volume 22, Issue 1 (2015), Paper #P1.66
Luis David Garcia-Puente and Brady Haran, Sandpiles, Numberphile video, on YouTube.com, Jan. 13, 2017
Antal A. Járai, Sandpile models, arXiv:1401.0354 [math.PR], 2014.
Germain Kreweras, Complexite et circuits Euleriens dans les sommes tensorielles de graphes, J. Combin. Theory, B 24 (1978), 202-212.
Lionel Levine and James Propp, What is... a sandpile?, Notices of the AMS, Volume 57 (2010), Number 8, 976-979.
F. Redig, Mathematical aspects of the abelian sandpile model (2005)
W.-J. Tzeng, F. Y. Wu, Spanning Trees on Hypercubic Lattices and Non-orientable Surfaces. arXiv:cond-mat/0001408v1 [cond-mat.stat-mech], Jan 2000.
W.-J. Tzeng and F. Y. Wu, Dimers on a simple-quartic net with a vacancy, arXiv:cond-mat/0203149v2 [cond-mat.stat-mech], Mar 2002.
Eric Weisstein's World of Mathematics, Grid Graph
Eric Weisstein's World of Mathematics, Spanning Tree
David B. Wilson, Local statistics of the abelian sandpile model (2014)
F. Y. Wu, Number of spanning trees on a lattice, J. Phys. A: Math. Gen., 10 (1977) no. 6, L113-L115.
Index to divisibility sequences

Main diagonal of A116469.
Cf. A300006, A300007, A300008, A300009; A256043, A256045.
Cf. A080690 (number of acyclic orientations), A080691 (number of spanning forests), A349718 (number of spanning trees, reduced for symmetry).

a:= n-> round(evalf(2^(n^2-1) /n^2 *mul(mul(`if`(j<>0 or k<>0, 2 -cos(Pi*j/n) -cos(Pi*k/n), 1), k=0..n-1), j=0..n-1), 15 +n*(n+1)/2)): seq(a(n), n=1..20);  # Alois P. Heinz, Apr 15 2011
# uses expression as a resultant
seq(resultant(simplify(ChebyshevU(n-1, x/2)), simplify(ChebyshevU(n-1, (4-x)/2)), x), n = 1 .. 24); # Peter Bala, Apr 29 2014

Table[2^((n-1)^2) Product[(2 - Cos[Pi i/n] - Cos[Pi j/n]), {i, 1, n-1}, {j, 1, n-1}], {n, 12}] // Round
Table[Resultant[ChebyshevU[n-1, x/2], ChebyshevU[n-1, (4-x)/2], x], {n, 1, 12}] (* Vaclav Kotesovec, Apr 15 2020 *)

{a(n) = polresultant( polchebyshev(n-1, 2, x/2), polchebyshev(n-1, 2, (4-x)/2) )}; /* Michael Somos, Aug 12 2017 */

a(n) = 2^(n^2-1) / n^2 * product_{n1=0..n-1, n2=0..n-1, n1 and n2 not both 0} (2 - cos(Pi*n1/n) - cos(Pi*n2/n) ). - Sharon Sela (sharonsela(AT)hotmail.com), Jun 04 2002
Equivalently, a(n) = Resultant( U(n-1,x/2), U(n-1,(4-x)/2) ), where U(n,x) is a Chebyshev polynomial of the second kind. - Peter Bala, Apr 29 2014
From Vaclav Kotesovec, Dec 30 2020: (Start)
a(n) ~ 2^(1/4) * Gamma(1/4) * exp(4*G*n^2/Pi) / (Pi^(3/4)*sqrt(n)*(1+sqrt(2))^(2*n)), where G is Catalan's constant A006752.
a(n) = n * 2^(n-1) * A007726(n)^2. (End)

More terms and better description from Roberto E. Martinez II, Jan 07 2002

cp's OEIS Frontend

A182368 Triangle T(n,k), n>=1, 0<=k<=n^2, read by rows: row n gives the coefficients of the chromatic polynomial of the square grid graph G_(n,n), highest powers first.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

A007341 Number of spanning trees in n X n grid.

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

Maple

Mathematica

PARI

Formula

Extensions

A080691 Number of spanning forests of the n X n grid graph.

Views

Author

Keywords

Links

Crossrefs

Extensions

A360922 Array read by antidiagonals: T(m,n) is the number of acyclic orientations in the grid graph P_m X P_n.

Views

Author

Keywords

Examples

Links

Crossrefs

Formula