{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,19]],"date-time":"2026-09-19T11:52:51Z","timestamp":1789818771329,"version":"4.0.1"},"reference-count":51,"publisher":"Society for Industrial & Applied Mathematics (SIAM)","issue":"4","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["SIAM J. Discrete Math."],"published-print":{"date-parts":[[2015,1]]},"abstract":"<jats:p>In this paper, we are interested in the number of fixed points of functions $f:A^n\\to A^n$ over a finite alphabet $A$ defined on a given signed digraph $D$. We first use techniques from network coding to derive some lower bounds on the number of fixed points that only depends on $D$. We then discover relationships between the number of fixed points of $f$ and problems in coding theory, especially the design of codes for the asymmetric channel. Using these relationships, we derive upper and lower bounds on the number of fixed points, which significantly improve those given in the literature. We also unveil some interesting behavior of the number of fixed points of functions with a given signed digraph when the alphabet varies. We finally prove that signed digraphs with more (disjoint) positive cycles actually do not necessarily have functions with more fixed points.<\/jats:p>","DOI":"10.1137\/140988358","type":"journal-article","created":{"date-parts":[[2015,12,2]],"date-time":"2015-12-02T14:16:47Z","timestamp":1449065807000},"page":"2312-2335","source":"Crossref","is-referenced-by-count":20,"title":["Fixed Points of Boolean Networks, Guessing Graphs, and Coding Theory"],"prefix":"10.1137","volume":"29","author":[{"given":"Maximilien","family":"Gadouleau","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Adrien","family":"Richard","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"S\u00f8ren","family":"Riis","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"351","published-online":{"date-parts":[[2015,11,24]]},"reference":[{"key":"atypb1","doi-asserted-by":"publisher","DOI":"10.1109\/18.887851"},{"key":"atypb2","doi-asserted-by":"publisher","DOI":"10.1109\/18.850663"},{"key":"atypb3","first-page":"823","author":"Alon N.","year":"2008","journal-title":"NJ"},{"key":"atypb4","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2014.04.025"},{"key":"atypb5","doi-asserted-by":"publisher","DOI":"10.1007\/s11538-008-9304-7"},{"key":"atypb6","doi-asserted-by":"publisher","DOI":"10.1016\/S0166-218X(03)00461-X"},{"key":"atypb7","doi-asserted-by":"publisher","DOI":"10.1109\/TNN.2003.821555"},{"key":"atypb8","first-page":"197","author":"Bar-Yossef Z.","year":"2006","journal-title":"NJ"},{"key":"atypb9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2103753"},{"key":"atypb10","doi-asserted-by":"publisher","DOI":"10.1016\/S0096-3003(01)00277-6"},{"key":"atypb11","first-page":"32","volume":"1","author":"Bassalygo L. A.","year":"1965","journal-title":"Prob. Inf. Transm."},{"key":"atypb12","first-page":"47","author":"Bernot G.","year":"2013","journal-title":"Berlin"},{"key":"atypb13","first-page":"94","author":"Borden J. M.","year":"1981","journal-title":"Proceedings of the IEEE International Symposium on Information Theory, IEEE, New York"},{"key":"atypb14","doi-asserted-by":"publisher","DOI":"10.1109\/18.59932"},{"key":"atypb17","first-page":"191","volume":"23","author":"de Bruijn N. G.","year":"1951","journal-title":"Nieuw Arch. Wiskd. (2)"},{"key":"atypb18","first-page":"967","author":"Effros M.","year":"2013","journal-title":"NJ"},{"key":"atypb19","doi-asserted-by":"crossref","unstructured":"M. Gadouleau,\n                      Closure solvability for network coding and secret sharing\n                      , IEEE Trans. Inform. Theory, (2013), pp. 7858-7869.","DOI":"10.1109\/TIT.2013.2282293"},{"key":"atypb20","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2155618"},{"key":"atypb21","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(85)90057-X"},{"key":"atypb22","doi-asserted-by":"crossref","unstructured":"E. Goles and S. Marti\u0301nez,\n                      Neural and Automata Networks: Dynamical Behavior and Applications\n                      , Kluwer Academic, Norwell, MA, 1990.","DOI":"10.1007\/978-94-009-0529-0_2"},{"key":"atypb23","doi-asserted-by":"publisher","DOI":"10.1016\/0165-4896(83)90023-9"},{"key":"atypb24","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1980.1056141"},{"key":"atypb25","doi-asserted-by":"crossref","unstructured":"K. Gurney,\n                      An Introduction to Neural Newworks\n                      , CRC Press, London, 1997.","DOI":"10.4324\/9780203451519"},{"key":"atypb26","doi-asserted-by":"publisher","DOI":"10.1080\/01621459.1963.10500830"},{"key":"atypb27","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.79.8.2554"},{"key":"atypb28","doi-asserted-by":"publisher","DOI":"10.1089\/10665270252833208"},{"key":"atypb29","first-page":"770","volume":"9","author":"Karlebach G.","year":"2008","journal-title":"Nature"},{"key":"atypb30","doi-asserted-by":"publisher","DOI":"10.1016\/0022-5193(69)90015-0"},{"key":"atypb31","unstructured":"T. Kl\u00f8ve,\n                      Error Correcting Codes for the Asymmetric Channel\n                      , http:\/\/www.ii.uib.no\/\\string torleiv\/rap95.pdf(1995)."},{"key":"atypb32","first-page":"113","volume":"5","author":"Mac Culloch W. S.","year":"1943","journal-title":"Bull. Math. Bio. Phys."},{"key":"atypb33","unstructured":"F. J. MacWilliams and N. J. A. Sloane,\n                      The Theory of Error-Correcting Codes\n                      , North-Holland, Amsterdam, 1977."},{"key":"atypb34","first-page":"1977","author":"Mazumdar A.","year":"2014","journal-title":"NJ"},{"key":"atypb35","unstructured":"H. S. Mortveit and C. M. Reidys,\n                      An Introduction to Sequential Dynamical Systems\n                      , Springer, New York, 2008."},{"key":"atypb36","doi-asserted-by":"publisher","DOI":"10.1007\/BF02579347"},{"key":"atypb37","doi-asserted-by":"publisher","DOI":"10.1016\/j.aam.2007.11.003"},{"key":"atypb38","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2009.06.017"},{"key":"atypb39","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2007.04.019"},{"key":"atypb40","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2015.03.038"},{"key":"atypb41","first-page":"866","author":"Riis S.","year":"2006","journal-title":"Berlin"},{"key":"atypb42","unstructured":"S. Riis,\n                      Graph entropy, network coding and guessing games\n                      , preprint, arXiv:0711.4175, 2007."},{"key":"atypb43","doi-asserted-by":"crossref","first-page":"R44","DOI":"10.37236\/962","volume":"14","author":"Riis S.","year":"2007","journal-title":"Electron. J. Combin."},{"key":"atypb44","doi-asserted-by":"crossref","unstructured":"F. Robert,\n                      Discrete Iterations: A Metric Study\n                      , Springer Ser. Comput. Mat. 6, Springer, 1986.","DOI":"10.1007\/978-3-642-61607-5"},{"key":"atypb45","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2048502"},{"key":"atypb46","doi-asserted-by":"publisher","DOI":"10.1016\/j.aam.2004.06.002"},{"key":"atypb47","doi-asserted-by":"publisher","DOI":"10.1016\/0022-5193(73)90247-6"},{"key":"atypb48","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-81703-8_24"},{"key":"atypb49","doi-asserted-by":"publisher","DOI":"10.1063\/1.1349893"},{"key":"atypb50","unstructured":"R. Thomas and R. D'Ari,\n                      Biological Feedback\n                      , CRC Press, 1990."},{"key":"atypb51","doi-asserted-by":"publisher","DOI":"10.1109\/18.623158"},{"key":"atypb52","first-page":"538","volume":"9","author":"Varshamov R. R.","year":"1965","journal-title":"Soviet Physics-Doklady"},{"key":"atypb53","doi-asserted-by":"crossref","unstructured":"R. W. Yeung, S.Y. R. Li, N. Cai, and Z. Zhang,\n                      Network coding theory\n                      , Vol. 2, Foundation and Trends in Communications and Information Theory, no. 4-5, Publishers, Hanover, MA, 2006.","DOI":"10.1561\/0100000007II"}],"container-title":["SIAM Journal on Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/epubs.siam.org\/doi\/pdf\/10.1137\/140988358","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T13:47:48Z","timestamp":1787320068000},"score":1,"resource":{"primary":{"URL":"https:\/\/epubs.siam.org\/doi\/10.1137\/140988358"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,1]]},"references-count":51,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2015,1]]}},"alternative-id":["10.1137\/140988358"],"URL":"https:\/\/doi.org\/10.1137\/140988358","relation":{},"ISSN":["0895-4801","1095-7146"],"issn-type":[{"value":"0895-4801","type":"print"},{"value":"1095-7146","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,1]]}}}