Skip to main content Accessibility help
×
×
Home

Abelian Logic Gates

  • ALEXANDER E. HOLROYD (a1), LIONEL LEVINE (a2) and PETER WINKLER (a3)

Abstract

An abelian processor is an automaton whose output is independent of the order of its inputs. Bond and Levine have proved that a network of abelian processors performs the same computation regardless of processing order (subject only to a halting condition). We prove that any finite abelian processor can be emulated by a network of certain very simple abelian processors, which we call gates. The most fundamental gate is a toppler, which absorbs input particles until their number exceeds some given threshold, at which point it topples, emitting one particle and returning to its initial state. With the exception of an adder gate, which simply combines two streams of particles, each of our gates has only one input wire, which sends letters (‘particles’) from a unary alphabet. Our results can be reformulated in terms of the functions computed by processors, and one consequence is that any increasing function from ℕk to ℕ that is the sum of a linear function and a periodic function can be expressed in terms of (possibly nested) sums of floors of quotients by integers.

Copyright

Footnotes

Hide All

The second author is supported by NSF grant DMS-1455272 and a Sloan Fellowship.

The third author is supported by NSF grant DMS-1162172.

Footnotes

References

Hide All
[1] Bond, B. and Levine, L. (2016) Abelian networks I: Foundations and examples. SIAM J. Discrete Math. 30 856874.
[2] Bond, B. and Levine, L. (2016) Abelian networks II: Halting on all inputs. Selecta Math. 22 319340.
[3] Bond, B. and Levine, L. (2016) Abelian networks III: The critical group. J. Alg. Combin. 43 635663.
[4] Cairns, H. (2018) “Some halting problems for abelian sandpiles are undecidable in dimension three.” SIAM Journal on Discrete Mathematics 32.4 2636–2666.
[5] Chan, M., Church, T. and Grochow, J. A. (2015) Rotor-routing and spanning trees on planar graphs. Int. Math. Res. Not. 2015 32253244.
[6] Cori, R. and Le Borgne, Y. (2013) The Riemann–Roch theorem for graphs and the rank in complete graphs. arXiv:1308.5325
[7] Dhar, D. (1990) Self-organized critical state of sandpile automaton models. Phys. Rev. Lett. 64 16131616.
[8] Dhar, D. (1999) The abelian sandpile and related models. Physica A 263 425.
[9] Dhar, D. (2006) Theoretical studies of self-organized criticality. Physica A 369 2970.
[10] Diaconis, P. and Fulton, W. (1991) A growth model, a game, an algebra, Lagrange inversion, and characteristic classes. Rend. Sem. Mat. Univ. Pol. Torino, 49 95119.
[11] Dickson, L. E. (1913) Finiteness of the odd perfect and primitive abundant numbers with n distinct prime factors. Amer. J. Math 35 413422.
[12] Farrell, M. and Levine, L. (2016) CoEulerian graphs. Proc. Amer. Math. Soc. 144 28472860.
[13] Fey, A., Levine, L. and Peres, Y. (2010) Growth rates and explosions in sandpiles. J. Statist. Phys. 138 143159.
[14] Friedrich, T. and Levine, L. (2013) Fast simulation of large-scale growth models. Random Struct. Alg. 42 185213.
[15] Holroyd, A. E., Levine, L., Mészáros, K., Peres, Y., Propp, J. and Wilson, D. B. (2008) Chip-firing and rotor-routing on directed graphs. In In and Out of Equilibrium 2, Vol. 60 of Progress in Probability, Birkhäuser, pp. 331364.
[16] Holroyd, A. E. and Propp, J. G. (2010) Rotor walks and Markov chains. In Algorithmic Probability and Combinatorics, Vol. 520 of Contemporary Mathematics, American Mathematical Society, pp. 105126.
[17] Hujter, B., Kiss, V. and Tóthmérész, L. (2017) On the complexity of the chip-firing reachability problem. Proc. Amer. Math. Soc. 145 33433356.
[18] Kiss, V. and Tóthmérész, L. (2015) Chip-firing games on Eulerian digraphs and NP-hardness of computing the rank of a divisor on a graph. Discrete Appl. Math. 193 4856.
[19] Levine, L. and Peres, Y. (2009) Strong spherical asymptotics for rotor-router aggregation and the divisible sandpile. Potential Anal. 30 127.
[20] Mejía, C. and Montoya, J. A. (2011) On the complexity of sandpile critical avalanches. Theoret. Comput. Sci. 412 39643974.
[21] Montoya, J. A. and Mejía, C. (2009) On the complexity of sandpile prediction problems. Electron. Notes Theoret. Comput. Sci. 252 229245.
[22] Moore, C. and Nilsson, M. (1999) The computational complexity of sandpiles. J. Statist. Phys. 96 205224.
[23] Ostojic, S. (2003) Patterns formed by addition of grains to only one site of an abelian sandpile. Physica A 318 187199.
[24] Perrot, K. and Van Pham, Trung (2015) Feedback arc set problem and NP-hardness of minimum recurrent configuration problem of chip-firing game on directed graphs. Ann. Combin. 19 373396.
[25] Sadhu, T. and Dhar, D. (2012) Pattern formation in fast-growing sandpiles. Phys. Rev. E 85 021107.
[26] Tardos, G. (1988) Polynomial bound for a chip firing game on graphs. SIAM J. Discrete Math. 1 397398.
Recommend this journal

Email your librarian or administrator to recommend adding this journal to your organisation's collection.

Combinatorics, Probability and Computing
  • ISSN: 0963-5483
  • EISSN: 1469-2163
  • URL: /core/journals/combinatorics-probability-and-computing
Please enter your name
Please enter a valid email address
Who would you like to send this to? *
×

MSC classification

Metrics

Full text views

Total number of HTML views: 0
Total number of PDF views: 0 *
Loading metrics...

Abstract views

Total abstract views: 0 *
Loading metrics...

* Views captured on Cambridge Core between <date>. This data will be updated every 24 hours.

Usage data cannot currently be displayed