Growth rates of permutation grid classes, tours on graphs, and the spectral radius

Bevan, David

doi:10.1090/S0002-9947-2015-06280-1

Growth rates of permutation grid classes, tours on graphs, and the spectral radius
HTML articles powered by AMS MathViewer

by David Bevan PDF

Trans. Amer. Math. Soc. 367 (2015), 5863-5889 Request permission

Abstract:

Monotone grid classes of permutations have proven very effective in helping to determine structural and enumerative properties of classical permutation pattern classes. Associated with grid class $\mathrm {Grid}(M)$ is a graph, $G(M)$, known as its “row-column” graph. We prove that the exponential growth rate of $\mathrm {Grid}(M)$ is equal to the square of the spectral radius of $G(M)$. Consequently, we utilize spectral graph theoretic results to characterise all slowly growing grid classes and to show that for every $\gamma \geqslant 2+\sqrt {5}$ there is a grid class with growth rate arbitrarily close to $\gamma$. To prove our main result, we establish bounds on the size of certain families of tours on graphs. In the process, we prove that the family of tours of even length on a connected graph grows at the same rate as the family of “balanced” tours on the graph (in which the number of times an edge is traversed in one direction is the same as the number of times it is traversed in the other direction).

References

M. H. Albert, M. D. Atkinson, and Robert Brignall, The enumeration of permutations avoiding $2143$ and $4231$, Pure Math. Appl. (PU.M.A.) 22 (2011), no. 2, 87–98. MR 2924740
M. H. Albert, M. D. Atkinson, and Robert Brignall, The enumeration of three pattern classes using monotone grid classes, Electron. J. Combin. 19 (2012), no. 3, Paper 20, 34. MR 2967225, DOI 10.37236/2442
Michael Albert, Mike Atkinson, and Robert Brignall, Notes on the basis of monotone grid classes, Unpublished, 2010.
Michael H. Albert, M. D. Atkinson, Mathilde Bouvel, Nik Ruškuc, and Vincent Vatter, Geometric grid classes of permutations, Trans. Amer. Math. Soc. 365 (2013), no. 11, 5859–5881. MR 3091268, DOI 10.1090/S0002-9947-2013-05804-7
Michael H. Albert, M. D. Atkinson, and Vincent Vatter, Inflations of geometric grid classes: three case studies, Australas. J. Combin. 58 (2014), 24–47. MR 3211768
M. D. Atkinson, Permutations which are the union of an increasing and a decreasing subsequence, Electron. J. Combin. 5 (1998), Research paper 6, 13. MR 1490467
M. D. Atkinson, Restricted permutations, Discrete Math. 195 (1999), no. 1-3, 27–38. MR 1663866, DOI 10.1016/S0012-365X(98)00162-9
David Bevan, Permutation grid classes, http://demonstrations.wolfram.com/PermutationGridClasses, Wolfram Demonstrations Project, 2012.
David Bevan, Growth rates of geometric grid classes of permutations, Electron. J. Combin. 21 (2014), no. 4, Paper 4.51, 17 pp.
A. E. Brouwer and A. Neumaier, The graphs with spectral radius between $2$ and $\sqrt {2+\sqrt {5}}$, Linear Algebra Appl. 114/115 (1989), 273–276. MR 986880, DOI 10.1016/0024-3795(89)90466-7
Andries E. Brouwer and Willem H. Haemers, Spectra of graphs, Universitext, Springer, New York, 2012. MR 2882891, DOI 10.1007/978-1-4614-1939-6
Dragoš Cvetković, Michael Doob, and Ivan Gutman, On graphs whose spectral radius does not exceed $(2+\sqrt {5})^{1/2}$, Ars Combin. 14 (1982), 225–239. MR 683990
Dragoš Cvetković, Peter Rowlinson, and Slobodan Simić, An introduction to the theory of graph spectra, London Mathematical Society Student Texts, vol. 75, Cambridge University Press, Cambridge, 2010. MR 2571608
Jiří Fiala and Jan Kratochvíl, Locally constrained graph homomorphisms—structure, complexity, and applications, Computer Science Review 2 (2008), no. 2, 97–111.
Pavol Hell and Jaroslav Ne et il, Graphs and homomorphisms, Oxford Lecture Series in Mathematics and its Applications, vol. 28, Oxford University Press, Oxford, 2004. MR 2089014, DOI 10.1093/acprof:oso/9780198528173.001.0001
Alan J. Hoffman, On limit points of spectral radii of non-negative symmetric integral matrices, Graph theory and applications (Proc. Conf., Western Michigan Univ., Kalamazoo, Mich., 1972; dedicated to the memory of J. W. T. Youngs), Lecture Notes in Math., Vol. 303, Springer, Berlin, 1972, pp. 165–172. MR 0347860
Alan J. Hoffman and John Howard Smith, On the spectral radii of topologically equivalent graphs, Recent advances in graph theory (Proc. Second Czechoslovak Sympos., Prague, 1974) Academia, Prague, 1975, pp. 273–281. MR 0404028
Sophie Huczynska and Vincent Vatter, Grid classes and the Fibonacci dichotomy for restricted permutations, Electron. J. Combin. 13 (2006), no. 1, Research Paper 54, 14. MR 2240760
André E. Kézdy, Hunter S. Snevily, and Chi Wang, Partitioning permutations into increasing and decreasing subsequences, J. Combin. Theory Ser. A 73 (1996), no. 2, 353–359. MR 1370138
P. W. H. Lemmens and J. J. Seidel, Equiangular lines, J. Algebra 24 (1973), 494–512. MR 307969, DOI 10.1016/0021-8693(73)90123-3
L. Lovász and J. Pelikán, On the eigenvalues of trees, Period. Math. Hungar. 3 (1973), 175–182. MR 416964, DOI 10.1007/BF02018473
Adam Marcus and Gábor Tardos, Excluded permutation matrices and the Stanley-Wilf conjecture, J. Combin. Theory Ser. A 107 (2004), no. 1, 153–160. MR 2063960, DOI 10.1016/j.jcta.2004.04.002
Maximillian M. Murphy and Vincent R. Vatter, Profile classes and partial well-order for permutations, Electron. J. Combin. 9 (2002/03), no. 2, Research paper 17, 30. Permutation patterns (Otago, 2003). MR 2028286
James B. Shearer, On the distribution of the maximum eigenvalue of graphs, Linear Algebra Appl. 114/115 (1989), 17–20. MR 986863, DOI 10.1016/0024-3795(89)90449-7
Slobodan K. Simić, On the largest eigenvalue of unicyclic graphs, Publ. Inst. Math. (Beograd) (N.S.) 42(56) (1987), 13–19. MR 937447
Slobodan K. Simić, On the largest eigenvalue of bicyclic graphs, Publ. Inst. Math. (Beograd) (N.S.) 46(60) (1989), 1–6. MR 1060049
John H. Smith, Some properties of the spectrum of a graph, Combinatorial Structures and their Applications (Proc. Calgary Internat. Conf., Calgary, Alta., 1969) Gordon and Breach, New York, 1970, pp. 403–406. MR 0266799
Zvezdelina E. Stankova, Forbidden subsequences, Discrete Math. 132 (1994), no. 1-3, 291–316. MR 1297387, DOI 10.1016/0012-365X(94)90242-9
Vincent Vatter, Permutation classes of every growth rate above 2.48188, Mathematika 56 (2010), no. 1, 182–192. MR 2604993, DOI 10.1112/S0025579309000503
Vincent Vatter, Small permutation classes, Proc. Lond. Math. Soc. (3) 103 (2011), no. 5, 879–921. MR 2852292, DOI 10.1112/plms/pdr017
Stephen D. Waton, On permutation classes defined by token passing networks, gridding matrices and pictures: Three flavours of involvement, Ph.D. thesis, University of St Andrews, 2007.
Wikipedia, Enumerations of specific permutation classes, http://en.wikipedia.org/wiki/Enumerations_of_specific_permutation_classes.
Renee Woo and Arnold Neumaier, On graphs whose spectral radius is bounded by $\frac 32\sqrt 2$, Graphs Combin. 23 (2007), no. 6, 713–726. MR 2365422, DOI 10.1007/s00373-007-0745-9
J. Yarkony, C. Fowlkes, and A. Ihler, Covering trees and lower-bounds on quadratic assignment, IEEE Conference on Computer Vision and Pattern Recognition, 2010, pp. 887–894.