Table of Contents
ISRN Combinatorics
Volume 2013 (2013), Article ID 615703, 7 pages
http://dx.doi.org/10.1155/2013/615703
Research Article

Sand Piles Models of Signed Partitions with Piles

1Dipartimento di Matematica e Informatica, Universitá di Ferrara, Via Machiavelli 35, 44121 Ferrara, Italy
2Dipartimento di Matematica, Universitá della Calabria, Via Pietro Bucci, Cubo 30B, 87036 Arcavacata di Rende, Italy

Received 3 October 2012; Accepted 4 November 2012

Academic Editors: J. F. Fang, N. A. Gordon, and M.-J. Jou

Copyright © 2013 C. Bisi et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. T. Brylawski, “The lattice of integer partitions,” Discrete Mathematics, vol. 6, no. 3, pp. 201–219, 1973. View at Google Scholar · View at MathSciNet · View at Scopus
  2. E. Goles, “Sand pile automata,” Annales de l'Institut Henri Poincaré, vol. 56, no. 115, pp. 75–90, 1992. View at Google Scholar · View at MathSciNet
  3. E. Goles and M. A. Kiwi, “Games on line graphs and sand piles,” Theoretical Computer Science, vol. 115, no. 2, pp. 321–349, 1993. View at Google Scholar · View at MathSciNet · View at Scopus
  4. J. Spencer, “Balancing vectors in the max norm,” Combinatorica, vol. 6, no. 1, pp. 55–65, 1986. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  5. P. Bak, C. Tang, and K. Wiesenfeld, “Self-organized criticality,” Physical Review A, vol. 38, no. 1, pp. 364–374, 1988. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  6. D. Dhar, “The Abelian sandpile and related models,” Physica A, vol. 263, no. 1–4, pp. 4–25, 1999. View at Google Scholar · View at Scopus
  7. E. Goles and M. Margenstern, “Universality of the chip-firing game,” Theoretical Computer Science, vol. 172, no. 1-2, pp. 121–134, 1997. View at Google Scholar · View at MathSciNet · View at Scopus
  8. E. Goles, M. Morvan, and H. Phan, “Lattice structure and convergence of a game of cards,” Annals of Combinatorics, vol. 6, pp. 327–335, 2002. View at Google Scholar · View at MathSciNet
  9. J. Cervelle, E. Formenti, and B. Masson, “From sandpiles to sand automata,” Theoretical Computer Science, vol. 381, no. 1–3, pp. 1–28, 2007. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  10. E. Goles and M. A. Kiwi, One-Dimensional Sand Piles, Cellular Automata and Related Models, Nonlinear Phenomena in Uids, Solids and Other Complex Systems, 1990. View at MathSciNet
  11. E. Formenti, B. Masson, and T. Pisokas, “On symmetric sandpiles,” Lecture Notes in Computer Science, vol. 4173, pp. 676–685, 2006. View at Google Scholar · View at MathSciNet · View at Scopus
  12. E. Formenti, B. Masson, and T. Pisokas, “Advances in symmetric sandpiles,” Fundamenta Informaticae, vol. 76, no. 1-2, pp. 91–112, 2007. View at Google Scholar · View at MathSciNet · View at Scopus
  13. E. Goles, M. Morvan, and H. D. Phan, “Sandpiles and order structure of integer partitions,” Discrete Applied Mathematics, vol. 117, no. 1–3, pp. 51–64, 2002. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  14. M. H. Le and T. H. D. Phan, “Strict partitions and discrete dynamical systems,” Theoretical Computer Science, vol. 389, no. 1-2, pp. 82–90, 2007. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  15. M. Latapy, “Partitions of an integer into powers,” in Proceedings of the conference Discrete Models: Combinatorics, Computation, and Geometry, Discrete Mathematics and Theoretical Computer Science, pp. 215–228, 2001. View at MathSciNet
  16. M. Latapy, “Integer partitions, tilings of 2D-gons and lattices,” Theoretical Informatics and Applications, vol. 36, no. 4, pp. 389–399, 2002. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  17. M. Latapy, R. Mantaci, M. Morvan, and H. D. Phan, “Structure of some sand piles model,” Theoretical Computer Science, vol. 262, no. 1-2, pp. 525–556, 2001. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  18. M. Latapy and H. D. Phan, “The lattice structure of chip firing games and related models,” Physica D, vol. 155, no. 1-2, pp. 69–82, 2001. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  19. M. Latapy and T. H. D. Phan, “The lattice of integer partitions and its infinite extension,” Discrete Mathematics, vol. 309, no. 6, pp. 1357–1367, 2009. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  20. P. T. H. Duong and T. T. T. Huong, “On the stability of sand piles model,” Theoretical Computer Science, vol. 411, no. 3, pp. 594–601, 2010. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  21. E. Goles, M. Latapy, C. Magnien, M. Morvan, and H. D. Phan, “Sandpile models and lattices: a comprehensive survey,” Theoretical Computer Science, vol. 322, no. 2, pp. 383–407, 2004. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  22. C. Bisi and G. Chiaselotti, “A class of lattices and boolean functions related to the Manickam-Miklös-Singhi conjecture,” Advances in Geometry, vol. 13, no. 1, pp. 1–27, 2013. View at Google Scholar
  23. G. Chiaselotti, “On a problem concerning the weight functions,” European Journal of Combinatorics, vol. 23, no. 1, pp. 15–22, 2002. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  24. G. Chiaselotti, G. Infante, and G. Marino, “New results related to a conjecture of Manickam and Singhi,” European Journal of Combinatorics, vol. 29, no. 2, pp. 361–368, 2008. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  25. G. Chiaselotti, G. Marino, and C. Nardi, “A minimum problem for chcnite sets of real numbers with nonnegative sum,” Journal of Applied Mathematics, vol. 2012, Article ID 847958, 15 pages, 2012. View at Google Scholar · View at MathSciNet
  26. G. Marino and G. Chiaselotti, “A method to count the positive 3-subsets in a set of real numbers with non-negative sum,” European Journal of Combinatorics, vol. 23, no. 5, pp. 619–629, 2002. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  27. K. Engel and C. Nardi, “Solution of a problem on non-negative subset sums,” European Journal of Combinatorics, vol. 33, pp. 1253–1256, 2012. View at Google Scholar · View at MathSciNet
  28. R. P. Stanley, “Weyl groups, the hard Lefschetz theorem, and the Sperner property,” SIAM Journal on Algebraic and Discrete Methods, vol. 1, pp. 168–184, 1980. View at Google Scholar · View at MathSciNet
  29. S. Bezrukov and K. Engel, Properties of Graded Posets Preseved by Some Operations, Algorithms and Combinatorics, vol. 14 of The mathematics of Paul Erdos, Springer, Berlin, Germany, 1997. View at MathSciNet
  30. G. E. Andrews, “Euler's “de partitio numerorum”,” Bulletin of the American Mathematical Society, vol. 44, no. 4, pp. 561–573, 2007. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  31. W. J. Keith, “A bijective toolkit for signed partitions,” Annals of Combinatorics, vol. 15, no. 1, pp. 95–117, 2011. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  32. K. J. Al-Agha and R. J. Greechie, “The involutory dimension of involution posets,” Order, vol. 18, no. 4, pp. 323–337, 2001. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  33. K. Brenneman, R. Haas, and A. G. Helminck, “Implementing an algorithm for the twisted involution poset for Weyl groups,” in Proceedings of the Thirty-Seventh Southeastern International Conference on Combinatorics, Graph Theory and 7-Computing, vol. 182, pp. 137–144, 2006. View at MathSciNet