Combinatorics

Enumerative Combinatorics

05Axx

  1. Alin Bostan, Manuel Kauers, and Mark van Hoeij, The complete generating function for Gessel walks is algebraic, Proc. Amer. Math. Soc. 138 (2010), no. 9, 3063–3078.
  2. Peter J. Cameron, Partitions and permutations, Discrete Math. 291 (2005), no. 1-3, 45–54.[MR]
  3. Philippe Cara, Serge Lehman, and Dmitrii V. Pasechnik, On the number of inductively minimal geometries, Theoret. Comput. Sci. 263 (2001), no. 1-2, 31–35.[MR]
  4. Stephen P. Humphries and Zane Kun Li, Counting powers of words in monoids, European J. Combin. 30 (2009), no. 5, 1297–1308.[MR]
  5. Byungchan Kim, On inequalities and linear relations for 7-core partitions, Discrete Math. 310 (2010), no. 4, 861–868.[doi]
  6. Ken Ono, The Web of Modularity: Arithmetic of the Coefficients of Modular Forms and q-series, CBMS Regional Conference Series in Mathematics, vol. 102, Published for the Conference Board of the Mathematical Sciences, Washington, DC, 2004, pp. viii+216.[MR]
  7. Kevin T. Phelps, An enumeration of 1-perfect binary codes, Australas. J. Combin. 21 (2000), 287–298.[MR]
  8. Wilhelm Plesken, Counting with groups and rings, J. Reine Angew. Math. 334 (1982), 40–68.[MR]
  9. A. Stoimenow, Generating functions, Fibonacci numbers and rational knots, J. Algebra 310 (2007), no. 2, 491–525.[MR]
  10. H. A. Verrill, Sums of squares of binomial coefficients, with applications to Picard-Fuchs equations, preprint (2004), 20 pages.[arXiv]
  11. Paul van Wamelen, Enumerating Motzkin-Rabin geometries, J. Combin. Des. 15 (2007), no. 3, 179–194.[MR]